Distributed switching system

• US 4,858,232 A
• Filed: 05/20/1988
• Issued: 08/15/1989
• Est. Priority Date: 05/20/1988
• Status: Expired due to Term

• Current Assignee: Alcatel-Lucent USA, Inc. (Nokia Corporation)
• Original Assignee: DSC Communications Corp. (Nokia Corporation)
• Inventors: Diaz, Felix V., Stanley, Jack H.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Scutch, III, Frank M.
• Application Number:
  US07/197,104
• Time in Patent Office: 452 Days
• Field of Search: 370/86, 370/88, 370/89, 370/85, 370/108, 370/95, 370/94, 370/110.1, 370/104, 340/825.05
• US Class Current: 370/465
• CPC Class Codes: H04J 3/0626 plesiochronous multiplexing systems, e.g. plesiochronous digital hierarchy [PDH], jitter attenuators
• CPC Class Codes: H04L 12/43 with synchronous transmission, e.g. time division multiplex [TDM], slotted rings
• CPC Class Codes: H04L 12/64 Hybrid switching systems

Abstract

A switching system (10) configured in a ring topology (14) is disclosed. The system (10) causes one or more 125 microsecond isochronous frames (20) to circulate in the ring (14) at any given instant in time. A delay circuit (22) temporarily saves an oldest one of the isochronous frames (20) until a youngest one of the isochronous frames (20) has completed its transmission. Consequently, an integral number of isochronous frames (20) circulate in ring (14). The isochronous frame (20) is partitioned to support a random access tunnel channel (26) and a plurality of independently controlled cells (28), which provide a variety of deterministic access services. Each cell (28) contains a control field (30) that contains sufficient information to specify the type of switching service provided by the cell (28) and various service parameters. A time multiplexer (42) separates the tunnel channel (26) from the cells (28). A cell handler (46) separates individual ones of the cells (28) into individual service-specified channels. Other physical layer sections (44, 48-54) adapt these channels to a media access control layer'"'"'s (56) requirements.

Claims

1. A distributed switching system comprising:

a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives incoming data from a first adjacent one of said nodes and transmits outgoing data to a second adjacent one of said nodes, one of said nodes designated as a ring master node;

means, coupled to said physical medium dependent sublayer at said ring master node, for delaying outgoing data transmitted from said ring master node relative to incoming data received at said ring master node;

means for controlling said delaying means to maintain a constant quantity of data circulating in said ring wherein said constant quantity of data is an integral number of frames;

means, coupled to said physical medium dependent sublayer within each of said nodes, for dedicating a first portion of each of said frames to a random access service; and

means, coupled to said physical medium dependent sublayer within each of said nodes, for dedicating a second portion of each of said frames to a deterministic access service.

2. A system as claimed in claim 1 wherein said controlling means is configured to maintain the quantity of data circulating in said ring at approximately at an integral multiple of 125 microseconds.

3. A system as claimed in claim 1 additionally comprising means, coupled to said physical medium dependent sublayer within each of said nodes, for identifying a predetermined instant within every one of said frames in a period of time which is not greater than the duration of a single one of said frames.

4. A system as claimed in claim 1 wherein said means for dedicating comprises means for maintaining a constant bandwidth of said first portion of each of said frames.

5. A system as claimed in claim 1 additionally comprising:

means, coupled to said dedicating means in a first one of said nodes, for receiving a circulating message transmitted from said first adjacent node for said first one of said nodes using said random access service; and

means, coupled to said dedicating means in said first one of said nodes, for transmitting one of said circulating message and a new message to said second adjacent node for said first one of said nodes using said random access service.

6. A system as claimed in claim 5 wherein said transmitting means comprises means for initiating a transmission of said new message upon the receipt of a transmission request signal except when a reception of said circulating message is in progress.

7. A system as claimed in claim 5 wherein said receiving means comprises means for determining if said circulating message is destined for said first one of said nodes.

8. A system as claimed in claim 7 wherein said transmitting means comprises means, coupled to said receiving means, for transmitting said circulating message received at said receiving means when said circulating message is not destined for said first one of said nodes.

9. A system as claimed in claim 8 wherein said transmitting means comprises means for transmitting said new message and not transmitting said circulating message when said transmission of said new message begins prior to said reception of said circulating message.

49. The method of claim 1 wherein said means for dedicating a second portion comprises means for selectively dedicating a second portion of each of said frames to either a guaranteed-bandwidth or non-guaranteed-bandwidth access service.

10. A distributed switching system comprising:

a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives incoming data from a first adjacent one of said nodes and transmits outgoing data to a second adjacent one of said nodes, one of said nodes being designated as a ring master node;

means, coupled to said physical medium dependent sublayer at said ring master node, for delaying outgoing data transmitted from said ring master node relative to incoming data received at said ring master node;

means for controlling said delaying means to maintain a constant quantity of data circulating in said ring wherein said constant quantity of data is an integral number of frames;

means, coupled to said physical medium dependent sublayer within each of said nodes, for dedicating a first portion of each of said frames to a random access service;

means, coupled to said physical medium dependent sublayer within each of said nodes, for dedicating a second portion of each of said frames to a deterministic access service;

means, coupled to said physical medium dependent sublayer within a first one of said nodes, for receiving a circulating message transmitted from said first adjacent node for said first one of said nodes using a random access service and for determining if said circulating message is destined for said first one of said nodes; and

means, coupled to said physical medium dependent sublayer in said first one of said nodes, for transmitting one of said circulating message and a new message to said second adjacent node from said first one of said nodes using said random access service;

said transmitting means comprising means, coupled to said receiving means, for transmitting said circulating message received at said receiving means when said circulating message is not destined for said first one of said nodes and for transmitting said new message and not transmitting said circulating message when said transmission of said new message begins prior to reception of said circulating message.

11. A distributed switching system comprising:

a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives incoming data from a first adjacent one of said nodes and transmits outgoing data to a second adjacent one of said nodes, one of said nodes being designated as a ring master node;

means, coupled to said physical medium dependent sublayer at said ring master node, for delaying said outgoing data transmitted from said ring master node relative to said incoming data received at said ring master node;

means for controlling said delaying means to maintain a constant quantity of said incoming and outgoing data circulating in said ring wherein said constant quantity of data forms an integral number of frames; and

means, coupled to said physical medium dependent sublayer within each of said nodes, for dividing each of said frames into a first portion thereof which includes a plurality of independent cells wherein each of said cells contains control information to specify one of a plurality of distinct deterministic access services to which said cells are dedicated.

12. A system as claimed in claim 11 additionally comprising means, coupled to said physical medium dependent sublayer within each of said nodes, for dividing each of said frames into a second portion thereof which is dedicated to a random access service.

13. A system as claimed in claim 11 wherein said dividing means comprises means for maintaining a constant bandwidth for each of said cells throughout said frames.

14. A system as claimed in claim 11 additionally comprising:

means, coupled to said physical medium dependent sublayer within each of said nodes, for identifying a predetermined instant within each of said frames; and

means, coupled to said identifying means, for counting the occurrence of said incoming data from said predetermined instant to distinguish one cell from another cell within said frames.

15. A system as claimed in claim 14 additionally comprising means, coupled to said physical medium dependent sublayer within at least one of said nodes, for decoding a control field of each cell to determine if cells are marked for future removal from service.

16. A system as claimed in claim 14 additionally comprising means, coupled to said physical medium dependent sublayer within at least one of said nodes, for decoding a control field of each cell to determine if cells provide one of circuit switching, cell switching, and packet switching access services.

17. A system as claimed in claim 16 additionally comprising second means, coupled to said physical medium dependent sublayer within said at least one of said nodes, for decoding said control field of each cell to determine if cells provide one of a connection-oriented cell switching service and a connectionless cell switching service.

18. A system as claimed in claim 17 additionally comprising means, coupled to said decoding means, for detecting if a destination address field included within cells that provides one of said connectionless cell switching service and said packet switching service specifies said at least one of said nodes.

19. A system as claimed in claim 18 additionally comprising means, coupled to said second decoding means, for associating a source node address field included within each cell that provides said connectionless cell switching and packet switching services with a corresponding message to distinguish said corresponding message from other concurrently received messages.

20. A system as claimed in claim 19 additionally comprising means, coupled to said second decoding means, for associating a source sequence number included within each cell that provides said connectionless cell switching and packet switching services with said corresponding message to distinguish said corresponding message from said other concurrently received messages.

21. A system as claimed in claim 20 additionally comprising:

means, coupled to said decoding means, for segmenting first packets of data into portions of said first packets which are smaller than the size of said cells; and

means, coupled to said decoding means, for reassembling second packets of data from portions of said second packets which are smaller than the size of said cells.

22. A system as claimed in claim 14 additionally comprising:

means, coupled to said physical medium dependent sublayer within one of said nodes, for monitoring the number of cycles each cell experiences around said ring; and

means, coupled to said monitoring means, for marking cells that experience greater than a predetermined number of cycles as being idle.

23. A system as claimed in claim 14 additionally comprising means, coupled to said physical medium dependent sublayer within at least one of said nodes, for decoding a control field of each cell to determine if cells are incompletely filled with active data.

24. A system as claimed in claim 23 additionally comprising means, coupled to said decoding means, for examining an octet of data within each cell that is incompletely filled with active data to obtain a count value that represents the number of active octets of data in each cell that is incompletely filled with active data.

25. A distributed switching system comprising:

a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives incoming data from a first adjacent one of said nodes and transmits outgoing data to a second adjacent one of said nodes, one of said nodes being designated as a ring master node;

means, coupled to said physical medium dependent sublayer at said ring master node, for delaying said outgoing data transmitted from said ring master node relative to said incoming data received at said ring master node;

means for controlling said delaying means to maintain a constant quantity of said incoming and outgoing data circulating in said ring wherein said constant quantity of data forms an integral number of frames;

means, coupled to said physical medium dependent sublayer within each of said nodes, for dividing each of said frames into a first portion thereof which includes a plurality of independent cells wherein each of said cells contains control information to specify one of a plurality of distinct deterministic access services to which said cells are dedicated and into a second portion thereof which is dedicated to a random access service;

means, coupled to said physical medium dependent sublayer within each of said nodes, for identifying a predetermined instant within each of said frames;

means, coupled to said identifying means, for counting the occurrence of said incoming data from said predetermined instant to distinguish one cell from another cell within said frames; and

means, coupled to said counting means within at least one of said nodes, for decoding a control field of each cell to determine if cells are marked for removal from service and for decoding said control field to determine if cells provide one of circuit switching, cell switching, and packet switching deterministic access services.

26. A method of switching data in a distributed switching system having a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives data from a first adjacent one of said nodes and transmits data to a second adjacent one of said nodes, said method comprising the steps of:

delaying outgoing data transmitted from a ring master one of said nodes relative to incoming data received at said ring master node;

controlling the duration of delay in said delaying step to maintain a constant quantity of incoming and outgoing data circulating in said ring wherein said constant quantity of data forms an integral number of frames;

dividing each of said frames into first and second portions wherein said first portions are dedicated to a random access service; and

dedicating said second portions to a deterministic access service.

27. A method as claimed in claim 26 wherein said controlling step maintains the quantity of data circulating in said ring at substantially an integral multiple of 125 microseconds.

28. A method as claimed in claim 26 additionally comprising the step of identifying a common predetermined instant of every one of said frames in a period of time which is not greater than the duration of a single one of said frames.

29. A method as claimed in claim 26 wherein said dividing step further comprises the step of maintaining a constant bandwidth of said first portion of each of said frames.

30. A method as claimed in claim 26 additionally comprising the steps of:

receiving, at a first one of said nodes, a circulating message transmitted from said first adjacent node for said first one of said nodes using said random access service; and

transmitting, from said first one of said nodes, one of said circulating message and a new message to said second adjacent node for said first one of said nodes using said random access service.

31. A method as claimed in claim 30 wherein said transmitting step comprises the step of initiating a transmission of said new message upon the receipt of a transmission request signal except when said receiving step is in the process of receiving said circulating message.

32. A method as claimed in claim 30 wherein said receiving step comprises the step of determining if said circulating message is destined for said first node.

33. A method as claimed in claim 32 wherein said transmitting step transmits said circulating message received in said receiving step when said circulating message is not destined for said first node.

34. A method as claimed in claim 33 wherein said transmitting step transmits said new message and not said circulating message when said transmission of said new message begins prior to receipt of said circulating message.

51. The method of claim 26 wherein said step of dedicating said second portions comprises the step of selectively dedicating said second portions to either a guaranteed-bandwidth or non-guaranteed-bandwidth access service.

35. A method of switching data in a switching system having a plurality of nodes coupled together to form a ring wherein each of said nodes receives incoming data from a first adjacent one of said nodes and transmits outgoing data to a second adjacent one of said nodes, said method comprising the steps of:

delaying said outgoing data transmitted from one of said nodes relative to said incoming data received at said one node;

controlling the duration of delay in said delaying step to maintain a constant quantity of said incoming and outgoing data circulating in said ring wherein said constant quantity of data is an integral number of frames; and

dedicating a first portion of each of said frames to having a plurality of independent cells wherein each of said cells specifies one of a plurality of distinct deterministic access services to which said cell is dedicated.

36. A method as claimed in claim 35 additionally comprising the step of dedicating a second portion of each of said frames to a random access service.

37. A method as claimed in claim 35 additionally comprising the steps of:

identifying a predetermined instant within each of said frames; and

counting the occurrence of said incoming data from said predetermined instant to distinguish one cell from another cell within said frames.

38. A method as claimed in claim 37 additionally comprising the step of decoding a control field of each cell to determine if cells are marked for removal from service.

39. A method as claimed in claim 37 additionally comprising the step of decoding a control field of each cell to determine if cells provide one of circuit switching, cell switching, and packet switching access services.

40. A method as claimed in claim 39 additionally comprising the step of decoding said control field of each cell to determine if cells provide one of a connection-oriented cell switching service and a connectionless cell switching service.

41. A method as claimed in claim 40 additionally comprising the step of including a destination address within cells that provides one of said connectionless cell switching service and said packet switching service.

42. A method as claimed in claim 41 additionally comprising the step of including a source node address within each cell that provides said connectionless cell switching service so that concurrently received messages are distinguishable from one another.

43. A method as claimed in claim 42 additionally comprising the step of including a source sequence number within each cell that provides said connectionless cell switching service so that concurrently received messages are distinguishable from one another.

44. A method as claimed in claim 40 additionally comprising the step of including a logical channel number within cells that provide said connection-oriented cell switching service to uniquely identify a connection.

45. A method as claimed in claim 37 additionally comprising the steps of:

monitoring, within a first one of said nodes, the number of cycles each cell experiences around said ring; and

forcing, at said first one of said nodes, cells that experience greater than a predetermined number of cycles to be idle.

46. A method as claimed in claim 37 additionally comprising the step of encoding a control field of each cell to specify when cells are incompletely filled with active data.

47. A method as claimed in claim 46 additionally comprising the step of generating, for inclusion within each cell that is incompletely filled with active data, a count value that represents the number of active octets of data in each cell that is incompletely filled with active data.

48. A distributed switching system comprising:

a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives incoming data from a first adjacent one of said nodes and transmits outgoing data to a second adjacent one of said nodes, one of said nodes designated as a ring master node;

means, coupled to said physical medium dependent sublayer at said ring master node, for delaying outgoing data transmitted from said ring master node relative to incoming data received at said ring master node;

means for controlling said delaying means to maintain a constant quantity of data circulating in said ring wherein said constant quantity of data is an integral number of frames;

means, coupled to said physical medium dependent sublayer within each of said nodes, for dedicating a first portion of each of said frames to a random access service;

means, coupled to said dedicating means in a first one of said nodes, for receiving a circulating message transmitted from said first adjacent node for said first one of said nodes using said random access service and for determining if said circulating message is destined for said first one of said nodes; and

means, coupled to said dedicating means in said first one of said nodes, for transmitting one of said circulating message and a new message to said second adjacent node for said first one of said nodes using said random access service;

said transmitting means comprising means coupled to said receiving means, for transmitting said circulating message received at said receiving means when said circulating message is not destined for said first one of said nodes and for transmitting said new message and not transmitting said circulating message when said transmission of said new message begins prior to reception of said circulating message.

50. A method of switching data in a distributed switching system having a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives data from a first adjacent one of said nodes and transmits data to a second adjacent one of said nodes, said method comprising the steps of:

delaying outgoing data transmitted from a ring master one of said nodes relative to incoming data received at said ring master node;

controlling the duration of delay in said delaying step to maintain a constant quantity of incoming and outgoing data circulating in said ring wherein said constant quantity of data forms an integral number of frames;

dividing each of said frames into first and second portions wherein said first portions are dedicated to a random access service;

receiving, at a first one of said nodes, a circulating message transmitted from said first adjacent node for said first one of said nodes using said random access service; and

transmitting, from said first one of said nodes, one of said circulating message and a new message to said second adjacent node for said first one of said nodes using said random access service, wherein said circulating message received in said receiving step is transmitted when said circulating message is not destined for said first node and wherein said new message and not said circulating message is transmitted when said new message begins prior to receipt of said circulating message.

52. A method of switching data in a distributed switching system having a plurality of nodes coupled together at physical medium dependent sublayers thereof to form a ring wherein each of said nodes receives data from a first adjacent one of said nodes and transmits data to a second adjacent one of said nodes, said method comprising the steps of:

delaying outgoing data transmitted from a ring master one of said nodes relative to incoming data received at said ring master node;

controlling the duration of delay in said delaying step to maintain a constant quantity of incoming and outgoing data circulating in said ring wherein said constant quantity of data forms an integral number of frames;

dividing each of said frames into first and second portions wherein said first portions are dedicated to a random access service; and

dedicating said second portions to a deterministic access service.