US 6,330,236 B1Grant
Packet switching method with time-based routing
Issue Date:2001-12-11
•54 Claims
•24 Drawing Sheets
Abstract
This invention describes a method for transmitting and forwarding packets over a switching network using time information. The network switches maintain a common time reference, which is obtained either from an external source (such as GPS—Global Positioning System) or is generated and distributed internally. The time intervals are arranged in simple periodicity and complex periodicity (like seconds and minutes of a clock). A data packet that arrives to an input port is switched to an output port based on its order or time position in the time interval in which it arrives at the switch. The time interval duration can be longer than the time duration required for transmitting a data packet, in which case the exact position of a data packet in its forwarding time interval is predetermined.
This invention provides congestion-free data packet switching for data packets for which capacity in their corresponding forwarding links and time intervals is reserved in advance. Furthermore, such data packets reach their destination, which can be one or more (i.e., multicast) in predefined time intervals, which guarantees that the delay jitter is smaller than or equal to one time interval
Metadata
Assignee
- Synchrodyne Networks, Inc.
Inventors
- Yoram Ofek
- Nachum Shacham
Application Information
Application Number:US 09/120,529
Filing Date:1998-07-22
Priority Date:1998-06-11
Art Unit:7
Classifications
IPC:
H04L 1250
Field of Search:
370360370369370372370375370389370376370377370378370379370428370429370458370498370392
Patent Drawings (24 sheets)
Description
RELATED APPLICATIONS
[0003] This application is a continuation of provisional application serial number 60/088,914 filed Jun. 11, 1998.
BACKGROUND OF THE INVENTION
[0004] This invention relates generally to a method and apparatus for transmitting of data on a communications network. More specifically, this invention provides timely forwarding and delivery of data over the network and to their destination nodes. Consequently, the end-to-end performance parameters, such as, loss, delay and jitter, have either deterministic or probabilistic guarantees.
[0005] This invention facilitates the routing of data packets using only time information that is globally available from the global positioning system (GPS). Consequently, over this novel communications network it is possible to transport wide variety of data packets, such as, IP (Internet protocol) and ATM (asynchronous transfer mode). Furthermore, since routing decisions are done in the time domain and there is no need to decode the address in the packet header, it is feasible to encrypt the entire data packet (including the header) as it is transferred through a public backbone network, which is an important security feature.
[0006] The proliferation of high-speed communications links, fast processors, and affordable, multimedia-ready personal computers brings about the need for wide area networks that can carry real time data, like telephony and video. However, the end-to-end transport requirements of real-time multimedia applications present a major challenge that cannot be solved satisfactorily by current networking technologies. Such applications as video teleconferencing, and audio and video multicasting generate data at a wide range of bit rates and require predictable, stable performance and strict limits on loss rates, average delay, and delay variations (“jitter”). These characteristics and performance requirements are incompatible with the services that current circuit and packet switching networks can offer.
[0007] Circuit-switching networks, which are still the main carrier for real-time traffic, are designed for telephony service and cannot be easily enhanced to support multiple services or carry multimedia traffic. Its synchronous byte switching enables circuit-switching networks to transport data streams at constant rates with little delay or jitter. However, since circuit-switching networks allocate resources exclusively for individual connections, they suffer from low utilization under bursty traffic. Moreover, it is difficult to dynamically allocate circuits of widely different capacities, which makes it a challenge to support multimedia traffic. Finally, the synchronous byte switching of SONET, which embodies the Synchronous Digital Hierarchy (SDH), requires increasingly more precise clock synchronization as the lines speed increases [Ballart et al., “SONET: Now It's The Standard Optical Network”, IEEE Communications Magazine, Vol. 29 No. 3, March 1989, pages 8-15] [M. Schwartz, “Telecommunication Networks: Protocols, Modeling, and Analysis”, Addison Wesley, Reading Mass., 1987].
[0008] Packet switching networks like IP (Internet Protocol)-based Internet and Intranets [see, for example, A. Tannebaum, “Computer Networks” (3rd Ed) Prentice Hall, 1996] and ATM (Asynchronous Transfer Mode) [see, for example, Handel et al., “ATM Networks: Concepts, Protocols, and Applications”, (2nd Ed.) Addison-Wesley, 1994] handle bursty data more efficiently than circuit switching, due to their statistical multiplexing of the packet streams. However, current packet switches and routers operate asynchronously and provide best effort service only, in which end-to-end delay and jitter are neither guaranteed nor bounded. Furthermore, statistical variations of traffic intensity often lead to congestion that results in excessive delays and loss of packets, thereby significantly reducing the fidelity of real-time streams at their points of reception. In fact, under best effort service, the performance characteristics of a given connection are not even predictable at the time of connection establishment.
[0009] Efforts to define advanced services for both IP and ATM have been conducted in two levels: (1) definition of service, and (2) specification of methods for providing different services to different packet streams. The former defines interfaces, data formats, and performance objectives. The latter specifies procedures for processing packets by hosts and switches/routers. The types of services that defined for ATM include constant bit rate (CBR), variable bit rate (VBR) and available bit rate (ABR). For IP, the defined services include guaranteed performance (bit rate, delay), controlled flow, and best effort [J. Wroclawski, “Specification of the Controlled-Load Network Element Service”, IETF RFC 2211, September 1997] [Shenker et. al., “Specification of Guaranteed Quality of Service”, IETF RFC 2212. September 1997]. Signaling protocols, e.g., RSVP and UNI3.1, which carry control information to facilitate the establishment of the desired services, are specified for IP and ATM, respectively [R. Braden, “Resource ReSerVation Protocol (RSVP)—Version 1 Functional Specification, IETF Request for Comment RFC2205”, September 1997] [Handel et al., “ATM Networks: Concepts, Protocols, and Applications”, (2nd Ed.) Addison-Wesley, 1994]. These protocols address the transport of data to one destination known as unicast or multiple destinations multicast [S.Deering, “Multicast Routing In Datagram Internet”, Ph.D. Thesis, Stanford University, December 1991]. In addition, SIP, a higher level protocol for facilitating the establishment of sessions that use the underlying services, is currently under definition under IETF auspices [Handley et al., “SIP-Session Initiation Protocol”, <draft-draft-ietf-mmusic-sip-04.ps>, November 1997].
[0010] The methods for providing different services under packet switching fall under the general title of Quality of Service (QoS). Prior art in QoS can be divided into two parts: (1) traffic shaping with local timing without deadline scheduling, for example [M.G.H. Katevenis, “Fast Switching And Fair Control Of Congested Flow In Broadband Networks”, IEEE Journal on Selected Areas in Communications, SAC-5(8):1315-1326, October 1987; Demers et al., “Analysis and Simulation Of A Fair Queuing Algorithm”, ACM Computer Communication Review (SIGCOMM'89), pages 3-12, 1989; S. J. Golestani, “Congestion-Free Communication In High-Speed Packet Networks”, IEEE Transcripts on Communications, COM-39(12):1802-1812, December 1991; Parekh et al., “A Generalized Processor Sharing Approach To Flow Control—The Multiple Node Case”, IEEE/ACM T. on Networking, 2(2):137-150, 1994], and (2) traffic shaping with deadline scheduling, for example [Ferrari et al., “A Scheme For Real-Time Channel Establishment In Wide-Area Networks”, IEEE Journal on Selected Areas in Communication, SAC-8(4):368-379, April 1990; Kandlur et al., “Real Time Communication In Multi-Hop Networks”, IEEE Trans. on Parallel and Distributed Systems, Vol. 5, No. 10, pp. 1044-1056, 1994]. Both of these approaches rely on manipulation of local queues by each router with little coordination with other routers. The Weighted Fair Queuing (WFQ), which typifies these approaches, is based on cyclical servicing of the output port queues where the service level of a specific class of packets is determined by the amount of time its queue is served each cycle [Demers et al., “Analysis and Simulation Of A Fair Queuing Algorithm,” ACM Computer Communication Review (SIGCOMM'89), pages 3-12, 1989]. These approaches have inherent limitations when used to transport real-time streams. When traffic shaping without deadline scheduling is configured to operate at high utilization with no loss, the delay and jitter are inversely proportional to the connection bandwidth, which means that low rate connections may experience large delay and jitter inside the network. In traffic shaping with deadline scheduling the delay and jitter are controlled at the expense of possible congestion and loss.
[0011] The recognition that the processing of packets by switches and routers constitutes a performance bottleneck resulted in the development of methods for enhancing performance by simplifying the processing of packets. Multi-protocol Label Switching (MPLS) converts the destination address in the packet header into a short tag, which defines the routing of the packet inside the network [Callon et al., “A Proposed Architecture For MPLS” <draft-ietf-mpls-arch-00.txt> INTERNET DRAFT, August 1997].
[0012] The real-time transport protocol (RTP) [H. Schultzrinne et al, RTP: A Transport Protocol for Real-Time Applications, IETF Request for Comment RFC1889, January 1996] is a method for encapsulating time-sensitive data packets and attaching to the data time related information like time stamps and packet sequence number. RTP is currently the accepted method for transporting real-time streams over IP internetworks and packet audio/video telephony based on ITU-T H.323.
[0013] Synchronous methods are found mostly in circuit switching, as compared to packet switching that uses mostly asynchronous methods. However, some packet switching synchronous methods have been proposed. IsoEthernet or IEEE 802.9a [IEEE 802.9a Editor. Integrated service(s): IEEE 802.9a “Isochronous Services With CSMA/CD MAC Service”, IEEE Draft, March 1995] combines CSMA/CD (IEEE 802.3), which is an asynchronous packet switching, with N-ISDN and H.320, which is circuit switching, over existing Ethernet infrastructure (10Base-T). This is a hybrid solution with two distinct switching methods: N-ISDN circuit switching and Ethernet packet switching. The two methods are separated in the time domain by time division multiplexing (TDM). The IsoEthemet TDM uses fixed allocation of bandwidth for the two methods—regardless of their utilization levels. This approach to resource partitioning results in undesirable side effect like under-utilization of the circuit switching part while the asynchronous packet switching is over loaded but cannot use the idle resources in the circuit switching part
[0014] One approach to an optical network that uses synchronization was introduced in the synchronous optical hypergraph [Y. Ofek, “The Topology, Algorithms And Analysis Of A Synchronous Optical Hypergraph Architectire”, Ph.D. Dissertation, Electrical Engineering Department, University of Illinois at Urbana, Report No. UIUCDCS-R-87-1343, May 1987], which also relates to how to integrate packet telephony using synchronization [Y. Ofek, “Integration Of Voice Communication On A Synchronous Optical Hypergraph”, INFOCOM'88, 1988]. In the synchronous optical hypergraph, the forwarding is performed over hyper-edges, which are passive optical stars. In [Li et al., “Pseudo-Isochronous Cell Switching In ATM Networks”, IEEE INFOCOM'94, pages 428-437, 1994; Li et al., “Time-Driven Priority: Flow Control For Real-Time Heterogeneous Internetworking”, IEEE INFOCOM'96, 1996] the synchronous optical hypergraph idea was applied to networks with an arbitrary topology and with point-to-point links. The two papers [Li et al., “Pseudo-Isochronous Cell Switching In ATM Networks”, IEEE INFOCOM'94, pages 428-437, 1994; Li et al., “Time-Driven Priority: Flow Control For Real-Time Heterogeneous Intenetworking”, IEEE INFOCOM'96, 1996] provide an abstract (high level) description of what is called “RISC-like forwarding”, in which a packet is forwarded, with little if any details, one hop every time frame in a manner similar to the execution of instructions in a Reduced Instruction Set Computer (RISC) machine [Patterson et al., “Computer Architecture: A Quantitative Approach”, Morgan Kaufman Publishers, San Francisco, 1990]. In U.S. Pat. No. 5,455,701, Eng et al. discloses an apparatus for controlling a high-speed optical switching system with pipeline controller for switch control. In U.S. Pat. No. 5,418,779 Yemini et al. disclose a switched network architecture with common time reference. The time reference is used in order to determine the time in which multiplicity of nodes can transmit simultaneously over one predefined routing tree to one destination. At every time instance the multiplicity of nodes are transmitting to different single destination node.
SUMMARY OF THE INVENTION
[0015] This invention provides a method for transmitting and forwarding packets over a switching network using time information. The network switches maintain a common time reference, which is obtained either from an external source (such as GPS—Global Positioning System) or is generated and distributed internally. The time intervals are arranged in simple periodicity and complex periodicity (like seconds and minutes of a clock). A data packet that arrives to an input port is switched to an output port based on its order or time position in the time interval in which it arrives at the switch. The time interval duration can be longer than the time duration required for transmitting a data packet, in which case the exact position of a data packet in its forwarding time interval is predetermined.
[0016] This invention provides congestion-free data packet switching for data packets for which capacity in their corresponding forwarding links and time intervals is reserved in advance. Furthermore, such data packets reach their destination, which can be one or more (i.e., multicast) in predefined time intervals, which guarantees that the delay jitter is smaller than or equal to one time interval.
[0017] The method combines the advantages of both circuit and packet switching. It provides for allocation for the exclusive use of predefined connections and for those connections it guarantees loss free transport with low delay and jitter. When predefined connections do not use their allocated resources, other non-reserved data packets can use them without affecting the performance of the predefined connections. On the Internet the non-reserved data packet traffic is called “best effort” traffic. In accordance with the present invention, the bandwidth allocated to a connection and the delay and jitter inside the network are independent. The packet time-stamp that is carried in the RTP [H. Schultzrinne et. al, RTP: A Transport Protocol for Real-Time Applications, IETF Request for Comment RFC1889, January 1996]header can be used in accordance with the present invention to facilitate time-based transport
[0018] Under the aforementioned prior art methods for providing packet switching services, switches and routers operate asynchronously. The present invention provides real-time services by synchronous methods that utilize a time reference that is common to the switches and end stations comprising a wide area network The common time reference can be realized by using UTC (Coordinated Universal Time), which is globally available via, for example, GPS (Global Positioning System—see, for example: http://www.utexas.edu/depts/grg/gcraft/notes/gps/gps.html). By international agreement, UTC is the same all over the world. UTC is the scientific name for what is commonly called GMT (Greenwich Mean Time), the time at the 0 (root) line of longitude at Greenwich, England. In 1967, an international agreement established the length of a second as the duration of 9,192,631,770 oscillations of the cesium atom. The adoption of the atomic second led to the coordination of clocks around the world and the establishment of UTC in 1972. The Time and Frequency Division of the National Institute of Standards and Technologies (NIST) (see htpp:\\www.boulder.nist.gov/timefreq) is responsible for coordinating with the International Bureau of Weights and Measures (BIPM) in Paris in maintaining UTC.
[0019] UTC timing is readily available to individual PCs through GPS cards. For example, TrueTime, Inc.'s (Santa Rosa, Calif.) PCI-SG provides precise time, with zero latency, to computers that have PCI extension slots. Another way by which UTC can be provided over a network is by using the Network Time Protocol (NTP) [D. Mills, “Network Time Protocol” (version 3) IETF RFC 1305]. However, the clock accuracy of NTP is not adequate for inter-switch coordination, on which this invention is based. In accordance with the present invention, the use of reserved resources is allowed by all packet traffic whenever the reserved resources are not in use.
[0020] Although the present invention relies on time to control the flow of packets inside the network in a similar fashion as in circuit switching, there are major differences between the two approaches. In circuit switching, for each data unit (e.g., a byte) at the time it has been transmitted from its source, it is possible to predict deterministically the future times it will be transmitted from any switch along its route [Ballart et al., “SONET: Now It's The Standard Optical Network”, IEEE Communications Magazine, Vol. 29 No. 3, March 1989, pages 8-15]. The time resolution of this advanced knowledge is much shorter than the data unit transmission time. On the other hand, in accordance with the present invention, for each data unit (e.g., a cell) at the time it has been transmitted from its source, it is possible to know the future time frames that this data unit will be forwarded along its route. However, the time frame, which constitutes the accuracy of this advance timing knowledge, is much larger than one data unit transmission time. For example, the transmission time of an ATM cell (53 bytes) over a gigabit per second link is 424 nanoseconds, which is 294 times smaller than a typical time frame of 125 micro-second—used in one embodiment of the present invention. There are several consequences that further distinguish the present invention from circuit switching:
[0021] In accordance with the present invention, the synchronization requirements are independent of the physical link transmission speed, while in circuit switching the synchronization becomes more and more difficult as the link speed increases.
[0022] In accordance with the present invention, timing information is not used for routing, and therefore, in the Internet, for example, the routing is done using IP addresses or a tag/label.
[0023] In accordance with the present invention, the Internet “best effort” packet forwarding strategy can be integrated into the system.
[0024] These and other aspects and attributes of the present invention will be discussed with reference to the following drawings and accompanying specification.
[0025] Routing—the selection of an output port for an information segment (i.e. data packets) that arrives at an input port of a switch—is a fundamental function of communication networks. In circuit switching networks, the unit of switching is a byte, and the switching is made based on the location of the byte in a time frame. Establishing a connection in a circuit switching network requires the network to reserve a slot for the connection in every frame. The position of the byte in the frame is different from link to link, so each switch maintains a translation table from incoming frame positions on each input port to respective output ports and frame positions therein. The sequence of frame positions on the links of the route constitute a circuit that is assigned for the exclusive use of a specific connection, which results in significant inflexibility: the connection is limited in traffic intensity by the capacity of the circuit and when the connection does not use the circuit no other is allowed to use it. This feature is useful for CBR traffic, like PCM telephony, but it results in low utilization of the network when the traffic is bursty [C. Huitema, Routing in the Internet, Prentice Hall, 1995, and A. Tannebaum Computer Networks (3rd Ed) Prentice Hall 1996].
[0026] In packet switching networks the unit of switching is a packet, which carries a bit pattern that provides the switch/router with sufficient information to route the packet all the way to its destination. In IP networks, the packet carries the destination's IP address, which is compared at each switch that the packet visits to the entries in a routing table local to the switch, and is routed accordingly [A. Tannebaum Computer Networks (3rd Ed) Prentice Hall 1996]. The recognition that the processing of packet by switches and routers constitutes a performance bottleneck resulted in the development of methods for enhancing performance by simplifying the processing of packets. Multi-protocol Label Switching (MPLS) converts the destination address in the packet header into a short tag, which defines the routing of the packet inside the network [R. Callon et al., A proposed architecture for MPLS <draft-ietf-mpls-arch-00.txt> INTERNET DRAFT, August 1997]. MPLS can be used by this invention to identify virtual pipes. ATM networks rely on virtual connection identifier (VCI), which is a short bit sequence that each cell carries and which determines the routing in a single switch A cell is carried over a complete route through a sequence of VCI translations, from input VCI to output VCI, which is done by every switch on the route [R. Handel et al. ATM Networks: Concepts, Protocols, and Applications (2nd Ed.). Addison-Wesley, 1994].
[0027] The routing method that is disclosed in this invention is designed to operate with virtual pipe forwarding that carry real-time traffic over packet switching networks while guaranteeing end-to-end performance. This approach combines the advantages of both circuit and packet switching. It provides for allocation for the exclusive use of predefined connections and for those connections it guarantees loss free transport with low delay and jitter. When predefined connections do not use their allocated resources, other packets can use them without affecting the performance of the predefined connections.
[0028] In this invention the synchronization requirements are independent of the physical link transmission speed, while in circuit switching the synchronization becomes more and more difficult as the link speed increases.
[0029] In this invention timing information is not used for routing, and therefore, in the Internet, for example, the routing is done using IP addresses or a tag/label.
[0030] In this invention “best effort” strategy can be integrated into the system.
[0031] These and other aspects and attributes of the present invention will be discussed with reference to the following drawings and accompanying specification.
BRIEF DESCRIPTION OF THE DRAWINGS
[0032] FIG. 1 is a schematic description of a switch with a common time reference partition into time-frames with predefined positions such that the input port can unambiguously identify the positions;
[0033] FIG. 2 is a diagram of how time is divided into time frames of a predefined duration, and the relationship among the local common time reference (CTR) on the switches, and how the multiplicity of local times is projected on the real-time axis;
[0034] FIG. 3 is a schematic illustration of how the common time reference is organized into contiguous time-cycles of k time-frames each and contiguous super-cycle of time-cycles each;
[0035] FIG. 4 is a schematic illustration of the relationship of the network common time reference and UTC (Coordinated Universal Time), such that, each time-cycle has 100 time-frames, of 125 μsec each, and 80 time-cycles are grouped into one super-cycle of one second;
[0036] FIG. 5 is a description of the timing partition of the common time reference into cycle with k time frames in each, while each time frame is further partitioned into four predefined parts: a, b, c and d;
[0037] FIG. 6 is a schematic illustration of a virtual pipe and its timing relationship with a common time reference (CTR). Delay is determined by the number of time frames between the forward time out at Node A and the forward time out at Node D;
[0038] FIG. 7 is an illustration of a serial transmitter and a serial receiver,
[0039] FIG. 8 is a table of the 4B/5B encoding scheme for data—used by the AM7968-TAXI chip set;
[0040] FIG. 9 is a table of the 4B/5B encoding scheme for control signals, such as, the time frame delimiter (TFD)—used by the AM7968;
[0041] FIG. 10 is a schematic illustration of an input port with a routing controller;
[0042] FIG. 11 is a schematic diagram of the time-based routing controller. This unit determines to which output port a data packet should be switched and attaches the time in and position information to the data packet header;
[0043] FIG. 12 is an example of a routing and scheduling table on one of the incoming input ports using the incoming time or time-frame of arrival (ToA) and the position counter value for determining: (i) the output port, (ii) the out-going time-frame, and (iii) the position of the out-going data packet within the out-going time-frame;
[0044] FIG. 13 is a schematic illustration of a data packet which is sent across the fabric to the output port;
[0045] FIG. 14 is a description of the real-time protocol (RTP) data packet header with time-stamp field of 32 bits;
[0046] FIG. 15 is an example of a routing and scheduling table on one of the incoming input ports using the time stamp and position information for determining: (i) the output port, (ii) the out-going time-frame, and (iii) the position of the out-going data packet within the out-going time-frame;
[0047] FIG. 16 is a description of the routing controller operation;
[0048] FIG. 17 is a schematic illustration of an output port with a scheduling controller and a serial transmitter;
[0049] FIG. 18 is a functional description of the scheduling controller with its transmit buffer and select buffer controller;
[0050] FIG. 19 is a specification of the data packet scheduling controller 45A operation;
[0051] FIG. 20 is a specification of the Select Buffer Controller 45D;
[0052] FIG. 21 is a schematic illustration of a virtual pipe and its timing relationship with a common time reference (CTR). Delay is determined by the number of time frames between the forward time out at Node A and the forward time out at Node D;
[0053] FIG. 22 is a schematic illustration of multiple virtual pipes;
[0054] FIG. 23 is a schematic illustration of a data packet pipeline forwarding over a virtual pipe with common time reference (CTR); and
[0055] FIG. 24 is an illustrative example of the mapping of the time frames into and the time frames out of a node on a virtual pipe. The mapping repeats itself in every time cycle.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
[0056] While this invention is susceptible of embodiment in many different forms, there is shown in the drawing, and will be described herein in detail, specific embodiments thereof with the understanding that the present disclosure is to be considered as an exemplification of the principles of the invention and is not intended to limit the invention to the specific embodiments illustrated.
[0057] The present invention relates to a system and method for transmitting and forwarding packets over a packet switching network. The switches of the network maintain a common time reference, which is obtained either from an external source (such as GPS—Global Positioning System) or is generated and distributed internally. The time intervals are arranged in simple periodicity and complex periodicity (like seconds and minutes of a clock). A packet that arrives to an input port of a switch, is switched to an output port based on (i) its position within the predefined time interval and (ii) the unique address of the incoming input port. Each switch along a route from a source to a destination forwards packets in periodic time intervals that are predefined using the common time reference. The time interval duration can be longer than the time duration required for transmitting a packet.
[0058] The system is designed for transferring data packets across a data network while using only time information and position information within predefined time intervals or time frames for routing, and maintaining for reserved data traffic constant bounded jitter (or delay uncertainty) and no congestion-induced loss of data packets. Such properties are essential for many multimedia applications, such as, telephony and video tele-conferencing.
[0059] FIG. 1 depicts a schematic description of a switch 10. The switch is constructed of four components: plurality of uniquely addressable input ports 30, in FIG. 1 there is N such ports, plurality of uniquely addressable output ports 40, in FIG. 1 there is N such ports, switching fabric 50, and global positioning system (GPS) time receiver with a GPS antenna 001. The GPS time receiver provides a common time reference (CTR) 002 to all input and output ports. The common time reference is partitioned into time frames. Each of the time frames is further comprised of predefined positions such that the input port can unambiguously identify the positions. The time and position that a data packet arrives into the input port are used by the time-based routing controller 35 for determining the output port that incoming data packet should be switched to, as it will be described in the detailed description of the input port.
[0060] In FIG. 1, each of the time frames, t=i and t=i+1, has four predefined positions: a, b, c and d. In each of the positions one data packet can be stored. The positions can be marked explicitly with position delimiters (PDs) between the variable size data packets, as it will be explained below, or implicitly. Implicit position within a time frame can be achieved by either measuring time delays—this is suitable for sending a fixed size ATM (asynchronous transfer mode) cells, or by placing data packets of variable size in the predefined positions within each of the time frames—if the output port 40 does not have a data packet to transmit in a predefine position an empty or null data packet should be sent.
The Common Time Reference (CTR)
[0061] As shown in FIG. 2, the common time reference 002 that is coupled to the switches provides the following property: the local clock ticks 004, shown in FIG. 4, at all the pipeline switches (e.g., switches A, B, C, and D in FIGS. 21 and 22) when projected on the real-time axis 005 will all occur within predefined synchronization envelopes 003. In other words, the local clock ticks 004 occur within the synchronization envelopes 003, and therefore, outside to the synchronization envelopes all local clocks have the same clock value.
[0062] The common time reference is divided in a predefined manner into time frames, Tf, of equal duration, as shown in FIG. 2, typically Tf=125 microseconds. The time frames are grouped into time cycles. Each time cycle has predefined number of time frames.
[0063] Referring to FIG. 3, there are k time frames in each time cycle. Contiguous time cycles are grouped together into contiguous super cycles, and as shown in FIG. 6, there are l time cycles in each super cycle.
[0064] FIG. 4 illustrates how the common time reference can be aligned with the UTC (Coordinated Universal Time) standard. In this illustrated example, every duration of every super cycle is exactly one second as measured by UTC. Moreover, the beginning of each super cycle coincides with the beginning of a UTC second, as shown in FIG. 4. Consequently, when leap seconds are inserted or deleted for UTC corrections (due to changes in the earth rotation period) the cycle and super cycle periodic scheduling will not be affected.
[0065] The time frames, time cycles, and super cycles are associated in the same manner with all respective switches within the virtual pipe, FIG. 21 and FIG. 22 at all times.
[0066] FIG. 5 depicts a common time reference (CTR) 002 axis that is divided into time cycles. Each time cycle is divided into predefined frames. Each of the time frame has predefined positions: a, b, c, and d of either fixed size (in time duration) or variable size (in time duration), consequently, the predefined position can have ether fixed size data packets or variable size data packets, respectively.
A Switch
[0067] In the following, a switch structure, shown in FIG. 6, is overviewed then in the following subsections the various parts are described in detail. Each switch 10 is comprised of a plurality of addressable input ports 30 and output ports 40. The input port further comprised of a time-based routing controller 35, shown in FIG. 10, for mapping each of the data packets that arrives at each one of the input ports to a respective one of the output ports. The output port further comprised of a scheduling controller and transmit buffer 45. An output port is connected to an input port via a communication link 41, as shown in FIG. 7. The communication link can be realized using various technologies without affecting this invention.
[0068] The common time reference 002, shown in FIG. 6, is provided to the input ports and output ports 40 from the GPS time receiver 20, which receives its timing signal from the GPS antenna 001. GPS time receivers are available from variety of manufacturers, such as, TrueTime, Inc. With such equipment it is possible to maintain a local clock with accuracy of ±1 microsecond from the UTC (Coordinated Universal Time) standard every where around the globe.
The Communication Link and Time Frame Delimiter Encoding
[0069] The communication links 41 used for the system disclosed is in this invention can be of various types: fiber optic, wireless, etc. The wireless links can be between at least one of a ground station and a satellite, between two satellites orbiting the earth, or between two ground stations, as examples.
[0070] Referring to FIG. 7, a serial transmitter 49 and serial receiver 31 are illustrated as coupled to each link 41. A variety of encoding schemes can be used for a serial line link 41 in the context of this invention, such as, SONET/SDH, 8B/10B Fiber Channel, 4B/5B FDDI. In addition to the encoding and decoding of the data transmitted over the serial link, the serial transmitter/receiver (49/31) sends/receives control words for a variety of control purposes, mostly unrelated to the present invention description. However, one control word, time frame delimiter (TFD), is used in accordance with the present invention. The TFD marks the boundary between two successive time frames and is sent by a serial transmitter 49 when a CTR 002 clock tick occurs in a way that is described hereafter as part of the output port operation. It is necessary to distinguish in an unambiguous manner between the data words, which carry the information, and the control signal or words (e.g., the TFD is a control signal) over the serial link 41. There are many ways to do this. One way is to use the known 4B/5B encoding scheme (used FDDI). In this scheme, every 8-bit character is divided into two 4-bit parts and then each part is encoded into a 5-bit codeword that is transmitted over the serial link 41.
[0071] FIG. 8 illustrates an encoding table from 4-bit data to 5-bit serial codewords. The 4B/5B is a redundant encoding scheme, which means that there are more codewords than data words. Consequently, some of the unused or redundant serial codewords can be used to convey control information.
[0072] FIG. 9 is a table with possible encoded control codewords, which can be used for transferring the time frame delimiter (TFD) over the serial link The TFD transfer is completely transparent to the data transfer, and therefore, it can be sent in the middle of the data packet transmission in a non-destructive manner.
[0073] When the communication links 41 are SONET/SDH, the time frame delimiter cannot be embedded as redundant serial codewords, since SONET/SDH serial encoding is based on scrambling with no redundancy. Consequently, the TFD is implemented using the SONET/SDH frame control fields: transport overhead (TOH) and path overhead (POH). Note that although SONET/SDH uses a 125 microseconds frame, it cannot be used directly in accordance with the present invention, at the moment, since SONET/SDH frames are not globally aligned and are also not aligned to UTC. However, if SONET/SDH frames are globally aligned, SONET/SDH can be used compatibly with the present invention.
The Input Port
[0074] The input port 30, shown in FIG. 10, has three parts: serial receiver 31, time-based routing controller 35 and separate queues 36 to the plurality of output ports 40. The serial receiver 31 transfers to the time-based routing controller 35 data packets, time frame delimiters (TFD) and position delimiters (PD).
[0075] The routing controller is constructed of a central processing unit (CPU), a random access memory (RAM) for storing the data packets, read only memory (ROM) for storing the time-based routing controller processing program, and a time-based routing table is used for determining the following parameters (see 35D in FIGS. 11, 12 and 15):
[0076] 1. Parameter 35-1 in table 35D (FIGS. 12, 15)—the output port 40 that the incoming data packet should be switched to—this parameter is used for switching the data packet to the queue 36 that is leading to the corresponding output port;
[0077] 2. Parameter 35-2 in table 35D (FIGS. 12, 15)—the out-going time frame in which the data packet will be forwarded out of the output port—this parameter is attached to the data packet header in FIG. 13, and
[0078] 3. Parameter 35-3 in table 35D (FIGS. 12, 15)—the position within the out-going time frame in which the data packet will be forwarded out of the output port—this parameter is attached to the data packet header in FIG. 13.
[0079] The time-based routing controller 35B determines the entry to the time-based routing table 35D, in FIGS. 12 and 15, in various ways, such as:
[0080] Local time and position by using (1) the time-frame of arrival (TOA) 35T—the time frame using the common time reference 002, and (2) the position value 35P within that time frame as measured by the position counter 35PC. This is depicted in FIG. 12.
[0081] Time stamp 35TS and position 35PC by using (1) the time stamp 35TS in the data packet header in FIG. 13B, and (2) the position value 35P within that time frame as measured by the position counter 35PC.
[0082] Time stamp, PID (shown in the packet headers in FIG. 13) and position 35PC by (1) the time stamp 35TS in the data packet header in FIG. 13B, (2) the virtual pipe ID (PID) 35C in the data packet header in FIG. 13B (the virtual pipe is discussed in details at the end of this description), and (3) the position value 35P within that time frame as measured by the position counter 35PC. This is depicted in FIG. 15.
[0083] The data packets, see for example FIG. 13, can have various formats, such as, Internet protocol version 4 (IPv4), Internet protocol version 6 (IPv6), asynchronous transfer mode (ATM) cells. The data packets PID 35C can be determined by one of the following: an Internet protocol (IP) address, an asynchronous transfer mode (ATM), a virtual circuit identifier, and a virtual path identifier (VCI/VPI), Internet protocol version 6 (IPv6) addresses, Internet MPLS (multi protocol label swapping or tag switching) labels, and IEEE 802 MAC (media access control) address.
[0084] The time stamp 35TS in the packet header in FIG. 13B can be generated by an application using Internet real-time protocol (RTP) and is used also in the ITU-T H.323 standard. Such data packets the format depicted in FIG. 14. Alternatively the time-stamp can be generated by a predefined one of the switches in the system, or alternatively the time stamp is generated at the respective end node for inclusion in the respective originated data packet.
[0085] FIG. 16 is a detailed description of the program executed by the time-based routing controller 35B. The program is responsive to three events from the serial receiver 31 and the position value 35P within that time frame as measured by the position counter 35PC. The time-based routing controller program FIG. 16 using the three parameters in table 35D in FIGS. 12 and that is associated with this incoming packet operates as follows:
[0086] 1. Receive time frame delimiter TFD 35-01—responsive to this event the routing controller resets the position counter (35P:=0 in 35-04 of FIG. 16) and computes the time-frame of arrival (TOA) 35T value as specified in 35-04 of FIG. 16. For this computation it uses a constant, Dconst, which is the time difference between the common time reference (CTR) 002 tick and the reception of the TFD at time t2 (note that the TFD was generated on an adjacent switch by the CTR 002 on that node). This time difference is caused by the fact that the delay from the serial transmitter 49 to the serial receiver 31 is not an integer number of time frames.
[0087] 2. Receive position delimiter PD 35-02—responsive to this event it increments the position counter, 35P:=35P+1, 35-05 of FIG. 16.
[0088] 3. Receive data packet 35-03—responsive to this event three operations are performed as shown in 35-06 of FIG. 16: (1) the out-going time frame parameter 35-2 is attached to the packet header, (2) the position within the out-going time frame parameter 35-3 is attached to the packet header, and (3) the data packet is stored in the queue 36 using the output port parameter 35-1 in table 35D in FIGS. 12 and 15.
The Switching Fabric
[0089] There are numerous ways to implement a switching fabric, however, since the switching fabric is not the subject of this invention it will be described only briefly. The main property that the switching fabric should ensure is that packets for which the priority bit P (35P in FIG. 13) is set to high priority (i.e., reserved traffic) will be switched into the output port in a constant bounded delay—measured in time frames.
[0090] This is possible when the packets in the input ports are already separated into queues to their respective output ports, then by using the Clos theorem in the time domain (see J. Y. Hui “Switching and Traffic Theory for Integrated Broadband Networks, ” page 65) the delay can be bounded by two time frames—one time frame at the input port and one time frame to get across the switching fabric. Other implementation can be based on shared bus with round robin service of the high priority data packets or on a crossbar switch.
[0091] Another possible switch design is shared memory, which ensures a deterministic delay bound from an input port to an output port. Shared memory packet switches are commercially available from various vendors, for example, MMC Networks Inc. (Santa Clara, Calif.).
The Output Port
[0092] The output is depicted in FIG. 17, it has two parts a scheduling controller with a transmit buffer 45, and serial transmitter 49, which was described before. The data packet scheduling controller 45A, in FIG. 18, transfers the data packet the transmit buffer which is a random access memory (RAM) 45C, as described below.
[0093] The data packet scheduling controller 45 operation is described in FIGS. 18-20 which includes a transmit buffer 45C and a select buffer controller 45D. The scheduling controller 45A together with the select buffer controller 45D perform the mapping, using the two parameters, 35-2 and 35-3, that were attached to the data packet by the time-based routing controller 35B. Both controllers are constructed of a central processing unit (CPU), a random access memory (RAM) for storing the data, and read only memory (ROM) for storing the controller processing program.
[0094] Data packets that arrive from the switching fabric 50 via link 51 in which their priority bit 3SP is asserted (i.e., reserved traffic) will be switched by the data packet scheduling controller 45A to one of the k transmit buffers 45C: B-1, B-2, . . . , B-k. Each of the k buffers is designated to store packet that will be forwarded in each of the k time frames in every time cycle, as shown in FIGS. 3 and 4. The actual program executed by the data packet scheduling controller is described in FIG. 19. When data packet is received from the fabric 45-01 (in FIG. 19) the two parameters, 35-2 and 35-3, in the data packet header are used to determine in which of the transmit buffer, between B-1 and B-k, to store that data packet and in what position, as specified in 45-02 in FIG. 19.
[0095] Incoming data packets in which their priority bit 35P, see FIG. 13, is not asserted (i.e., non-reserved traffic) will be switched by the data packet scheduling controller to the transmit “best effort” buffer B-E via link 45-be.
[0096] FIG. 20 depicts the select buffer controller 45D operation, which is responsive to the common time reference (CTR) tick 002, as specified in 45-11 (FIG. 20). Consequently, the select buffer controller increments the transmit buffer index i 45-12 (i.e., i:=i+1 mod k, where k is the time cycle size in time frames), sends a time frame delimiter TFD 47A to the serial transmitter 45-12, and reset the position pointer to one, p:=145-12. Then while the transmit buffer B- i is not empty 45-13, it will send a data packets from transmit buffer B- i, as specified in 45-14, 45-15 and 45-16, else if the transmit buffer B- i is empty, it will send “best effort” data packets from the “best effort” buffer B-be, as specified in 45-17, until the end of the time frame (the next CTR 002 tick) or until buffer B-E becomes empty.
[0097] When the transmit buffer B- i is not empty 45-13, the select buffer controller sends data packets from all of the non-empty predefined positions in that buffer, as specified in 45-14. After sending a data packet or if position p in buffer B- i is empty 45-15, the select buffer controller sends a position delimiter (PD) 47B to the serial transmitter and increments the position pointer p:=p+1, as specified in 45-16.
Virtual Pipes
[0098] The switches described in this invention can be used to construct plurality of virtual pipes 25, shown in FIG. 21 and FIG. 22, over a data network with general topology. Such data network can span the globe. Each virtual pipe is constructed over one or more switches 10, shown in FIGS. 1 and 6, which are interconnected via communication links 41 in a path. FIG. 21 depicts a virtual pipe from the output port 40 of switch A, through switches B and C, and this virtual pipe ends at the output port 40 of node D. The virtual pipe transfers data packets from at least one source to at least one destination. FIG. 22 depicts three virtual pipes: virtual pipe 1 from the output of switch A to the output of switch D, virtual pipe 2 from the output of switch B to the output of switch D, and virtual pipe 3 from the output of switch A to the output of switch C. The data packet transfers over the virtual pipe switches are designed to occur during a plurality of predefined time intervals, wherein each of the predefined time intervals is comprised of a plurality of predefined time frames. The timely transfers of data packets are achieved by coupling a common time reference 002 (CTR) signal to each of the switches 10.
Pipeline Forwarding
[0099] Pipeline forwarding relates to data packets being forwarded across a virtual pipe with a predefined delay in every stage (either across a communication link 41 or across a switch from input port to output port 40). Data packets enter a virtual pipe 25 from one or more sources and forwarded to one or more destinations.
[0100] This sort of pipeline forwarding used in accordance with the present invention is illustrated in FIG. 23. Data packet 41A is forwarded out of switch A during time frame t-1. This data packet 41A will reach switch B after a delay of T-ab. This data packet 41A will be forwarded out of switch B as data packet 41B during time frame t+1 and will reach switch C after a delay of T-bc. This data packet 41B will be forwarded out of switch C as data packet 41C during time frame t+5. Data packet 41C will reach switch D after a delay of T-cd. Consequently, the delay from the output of switch A to the output of switch C is 6=t+5-(t−1) time frames. As illustrated in FIG. 23, all data packets that are forwarded over that virtal pipe will have a delay of six time frames from the output of switch A to the output of switch C.
[0101] Referring again to FIG. 21, the timely pipeline forwarding of data packets over the virtual pipe is illustrated. A data packet is received by one of the input ports of switch A at timeframe 1, and is forwarded along this virtual pipe in the following manner: (i) the data packet 41A is forwarded from the output port 40 of switch A at time frame 2 of time cycle 1, (ii) the data packet 41B is forwarded from the output port 40 of switch B, after 18 time frames, at time frame of time cycle 2, (iii) the data packet 41C is forwarded from the output port 40 of switch C, after 42 time frames, at time frame 2 of time cycle 7, and (iv) the data packet 41D is forwarded from the output port 40 of switch D, after 19 time frames, at time frame 1 of time cycle 9.
[0102] As illustrated in FIG. 21,
[0103] All data packets enter the virtual pipe (i.e., forwarded out of the output port 40 of switch A) periodically at the second time frame of a time cycle, are output from this virtual pipe (i.e., are forwarded out of the output port 40 of switch D) after 79 time frames.
[0104] The data packets that enter the virtual pipe (i.e., forwarded out of the output port 40 of switch A) can come from one or more sources and can reach switch A over one or more input links 41.
[0105] The data packets that exit the virtual pipe 25 (i.e., forwarded out of the output port 40 of switch D) can be forwarded over plurality of output links 41 to one of plurality of destinations.
[0106] The data packets that exit the virtual pipe (i.e., forwarded out of the output port 40 of switch D) can be forwarded simultaneously to multiple destinations, (i.e., multicast (one-to-many) data packet forwarding).
[0107] The communication link 41 between two adjacent ones of the switches 10 can be used simultaneously by at least two of the virtual pipes.
[0108] In FIG. 22, where there are three virtual pipes:
[0109] The three virtual pipes can multiplex (i.e., mix their traffic) over the same communication links.
[0110] The three virtual pipes can multiplex (i.e., mix their traffic) during the same time frames and in an arbitrary manner.
[0111] The same time frame can be used by multiple data packets from one or more virtual pipes.
Virtual Pipe Capacity Assignment
[0112] For each virtual pipe there are predefined time frames within which respective data packets are transferred into its respective switches, and separate predefined time frames within which the respective data packets are transferred out of its respective switches. Though the time frames of each virtual pipe on each of its switches can be assigned in an arbitrary manner along the common time reference, it is convenient and practical to assign time frames in a periodic manner in time cycles and super cycles.
[0113] FIG. 24 illustrates the timing of a switch of a virtual pipe wherein there are a predefined subset of time frames (i, 75, and 80) of every time cycle, during which data packets are transferred into that switch, and wherein for that virtual pipe there are a predefined subset time frames (i+3, 1, and 3) of every time cycle, during which the data packets are transferred out of that switch. If each of the three data packets has 125 bytes or 1000 bits, and there are 80 time frames of 125 microseconds in each time cycle (i.e., time cycle duration of 10 μsec), then the bandwidth allocated to this virtual pipe is 300,000 bits per second.
[0114] In general, the bandwidth or capacity allocated for a virtual pipe is computed by dividing the number of bits transferred during each of the time cycles by the time cycle duration. In the case of a super cycle, the bandwidth allocated to a virtual pipe is computed by dividing the number of bits transferred during each of the super cycles by the super cycle duration.
[0115] The switch 10 structure, as shown in FIG. 6, can also be referred to as a pipeline switch, since it enables a network comprised of such switches to operate as a large distributed pipeline architecture, as it is commonly found inside digital systems and computer architectures.
[0116] Each pipeline switch 10 is comprised of a plurality of addressable input ports and output ports 40. As illustrated in FIG. 10, the input port 30 is further comprised of a routing controller 35 for mapping each of the data packets that arrives at each one of the input ports to a respective one of the output ports. As illustrated in FIG. 17, the output port 40 is further comprised of a scheduling controller and transmit buffer 45. An output port 40 is connected to an input port 30 via a communication link 41, as shown in FIG. 7. The communication link can be realized using various technologies compatible with the present invention.
[0117] As shown in FIG. 6, the common time reference 002 is provided to the input ports 30 and output ports 40 from the GPS time receiver 20, which receives its timing signal from the GPS antenna 001. GPS time receivers are available from variety of manufacturers, such as, TrueTime, Inc. (Santa Rosa, Calif.). With such equipment it is possible to maintain a local clock with accuracy of ±1 microsecond from the UTC (Coordinated Universal Time) standard everywhere around the globe.
[0118] From the foregoing, it will be observed that numerous variations and modifications may be effected without departing from the spirit and scope of the invention. It is to be understood that no limitation with respect to the specific apparatus illustrated herein is intended or should be inferred. It is, of course, intended to cover by the appended claims all such modifications as fall within the scope of the claims.
Claims
What is claimed is:
1. A switching system coupled for receiving a common time reference signal, and for receiving incoming data packets and transmitting outgoing data packets at relative positions within time intervals comprised of predefined time frames, wherein one or more packets can be communicated within each of the time frames, the system comprising:
a plurality of input ports each having a unique address;
a plurality of output ports each having a unique address;
a timing subsystem for determining a defined time in for each of the incoming data packets, for associating each said respective data packets with a particular one of the predefined time frames;
position logic for determining a relative position for each of said respective incoming data packet within the respective particular time frame; and
a time-based routing controller responsive to (1) the unique address of the input port associated with each one of the incoming data packets; (2) the associated time-frame of arrival; and (3) the associated relative position for each said respective incoming data packet within said time-frame of arrival, to provide a routing to an associated particular one of the output ports at an associated particular position and within an associated second particular time frame.
2. The system as in claim 1, wherein the time-based routing controller provides routing of each of the incoming data packets to a plurality of the output ports, each of the plurality of the incoming data packets having a respective unique associated particular position within an associated one of the predefined time frames.
3. The system as in claim 1, wherein each of the frames has a defined duration from start to end, wherein each of the input ports is comprised of a serial receiver that provides position delimiters associated with each of the incoming data packets coupled thereto, wherein the position logic is a position counter, wherein said position counter counts the position delimiters that have occurred since the start of the respective one of the time frames.
4. The system as in claim 3, wherein the time frames are cyclically recurring, wherein a sequence of position delimiters within the cyclically recurring time frames is implicitly defined by a predefined sequence of time units of equal duration.
5. The system as in claim 3, wherein the time frames are cyclically recurring, wherein the sequence of position delimiters within the cyclically recurring time frames is defined by a predefined sequence of time intervals of arbitrarily different duration.
6. The system as in claim 3, wherein the start of the time frame is marked by a time frame delimiter.
7. The system as in claim 3, wherein the position logic is incremented at predefined time intervals relative to the start of the time frame.
8. The system as in claim 7, wherein each of the positions is of predefined time duration.
9. The system as in claim 1, wherein the time interval is comprised of a predefined number of contiguous time frames comprising a time cycle.
10. The system as in claim 9, wherein the time frames are in a time cycle are of equal time duration.
11. The system as in claim 9, wherein the time frames are in a time cycle are of arbitrary time duration.
12. The system as in claim 9, wherein the time cycles are contiguous.
13. The system as in claim 9, wherein each time cycle consists of arbitrary number of time frames.
14. The system as in claim 9, wherein the switching system is comprised of a plurality of switches interconnected via communication links, wherein the time frames associated with a particular one of the switches are associated with the same respective switch for all the time cycles.
15. The system as in claim 14, wherein the time frames associated with the particular ones of the switches are associated with one of input into and output from that respective switch.
16. The system as in claim 15, wherein there is a constant predefined fixed delay measured in time frames between the input into the input port and output from the output port of the switch for each of the time frames within each of the time cycles.
17. The system as in claim 15, wherein there is an arbitrary predefined delay measured in time frames between the input into the input port and output from the output port of the switch for each of the time frames within each of the time cycles.
18. The system as in claim 12, wherein a fixed number of a plurality of the contiguous ones of the time cycles comprise a super cycle;
wherein the super cycle is periodic.
19. The system as in claim 1, wherein the common time reference signal is derived from a GPS (Global Positioning System) signal.
20. The system as in claim 1, wherein the common time reference signal conforms to the UTC (Coordinated Universal Time) standard.
21. The system as in claim 20, wherein the super cycle duration is equal to one second as measured using the UTC (Coordinated Universal Time) standard.
22. The system as in claim 20, wherein the super cycle duration is equal to a predefined number of seconds as measured using the UTC (Coordinated Universal Time) standard.
23. The system as in claim 20, wherein the super cycle duration is equal to a predefined fraction of a second measured using the UTC (Coordinated Universal Time) standard.
24. The system as in claim 1, wherein a fixed plurality of the time frames comprises a time cycle, wherein the time frames have positions within the time cycles, wherein the position of the time frame within the time cycle and the position of the incoming data packets within the time frame determines the routing to a respective one of the output ports independent of which one of the time cycles the time frame is in.
25. The system as in claim 1, wherein a fixed plurality of the time frames comprise a time cycle, wherein a fixed number of a plurality of the time cycles comprises a super cycle, wherein routing is determined uniquely within a super cycle and is the same for all the time cycles within all the super cycles.
26. The system as in claim 25, wherein the routing is determined responsive to the respective time cycle within the super cycle associated an input to a respective one of the input ports, and the position within each of the time frame.
27. The system as in claim 1, wherein there are a plurality of synchronization envelopes, each defining acceptable plus and minus deviations associated with the common time reference;
wherein two adjacent ones of the synchronization envelopes of two of the adjacent time frames are non-overlapping;
wherein each of the synchronization envelopes has one of the common time references uniquely associated with the respective synchronization envelope.
28. The system as in claim 27, wherein between every two successive time frames the select buffer controller sends a time frame delimiter (TFD) signal via the serial transmitter.
29. The system as in claim 27, wherein the time frame delimiter can be sent as an encoded control codeword in the middle of a data packet without adversely affecting the transmission of said data packet.
30. The system as in claim 29, wherein all data packets received between two successive time frame delimiters (TFDs), which were received by the routing controller, are uniquely associated with the time frame as measured by the common time reference.
31. A system for switching of a plurality of incoming data packets comprised of position delimiter signals and a packet header through a switch comprised of a plurality of uniquely addressable input ports and plurality of uniquely addressable output ports, wherein the transfer of the data packets is provided during respective ones of a plurality of predefined time intervals, wherein each of the predefined time intervals is comprised of a plurality of predefined time frames, said system comprising:
a common time reference signal coupled to each of the switches;
wherein the common time reference is partitioned into time frames;
wherein a predefined number of contiguous k time frames are grouped into a time cycle, wherein k is at least 1;
wherein a predefined number of contiguous l time cycles are grouped into a super cycle, wherein l is at least 1;
a position counter for providing an instant position counter value responsive to counting the position delimiter signals in incoming time frames associated with the incoming data packets;
a routing controller with a time-based routing table for selecting at least one output port that said data packets will be forwarded to;
wherein the routing controller is coupled to the input port and attaches to the packet header a time-frame of arrival (TOA) and the instant position counter value prior to coupling of the respective data packets to the output port;
wherein the time-frame of arrival is representative of the common time reference and is represented as a time frame number within a time cycle and as time cycle number within a super cycle;
a switching fabric; and
an output data packet scheduling controller for scheduling predefined time frames associated with prospective output of each of the incoming data packets.
32. The system as in claim 31, wherein the data packet scheduling controller is responsive to the reception of a data packet from the switching fabric for selectively assigning a predefined time frame and a position within said time frame for transferring said respective data packet out from the said switch responsive to (i) the time-frame of arrival, and (ii) the instant position counter value that were attached to the data packet by the time-based routing controller, and (iii) the unique address of the input port.
33. The system as in claim 31, further comprising a random access memory partitioned into plurality of buffers;
wherein the random access memory is partitioned into k+1 buffers;
wherein first k buffers are for storing data packets to be forwarded from said switch during respective associated ones of the k time frames in each of said time cycles;
wherein the k+1 buffer provides for storing “best effort” data packets not associated uniquely with any predefined time frame.
34. The system as in claim 33, further comprising a select buffer controller;
wherein in each of the k time frames of the time cycle, the select buffer controller forwards the respective data packets from the corresponding one of the k buffers;
wherein when said k buffers are empty, said select buffer controller forwards out of said k+1 buffer the “best effort” data packets.
35. The system as in claim 34, wherein the random access memory is partitioned into (l times k)+1 buffers;
wherein the first (l times k) buffers provides for storing data packets to be forwarded from said switch during a uniquely associated one of the (l times k) time frames in each of said super cycle;
wherein the (l times k)+1 buffer provides for storing “best effort” data packets.
36. The system as in claim 35, wherein in each of the (l times k) time frames of the super cycle, the select buffer controller forwards the data packets from the corresponding one of the (l times k) buffers;
wherein when said (l times k) buffer is empty, said select buffer controller forwards the “best efforts” data packets out of said (l times k)+1 buffer.
37. The system as in claim 34, wherein between every two successive time frames the select buffer controller sends a time frame delimiter (TFD) signal via the serial transmitter.
38. The system as in claim 34, wherein between every two successive data packets the select buffer controller sends a position delimiter (TFD) signal via the serial transmitter.
39. The system as in claim 37, wherein the time frame delimiter can be sent as an encoded control codeword within a respective one of the data packets.
40. A switching method responsive to a common time reference signal for receiving incoming data packets and transmitting outgoing data packets at relative positions within time intervals comprised of predefined time frames, wherein one or more packets can be communicated within each of the time frames, the method comprising:
providing a plurality of input ports each having a unique address;
providing a plurality of output ports each having a unique address;
determining a defined time in for each of the incoming data packets, for associating each said respective data packets with a particular one of the predefined time frames;
determining a relative position for each of said respective incoming data packet within the respective particular time frame; and
providing a routing to an associated particular one of the output ports at an associated particular position and within an associated second particular time frame, responsive to (1) the unique address of the input port associated with each one of the incoming data packets; (2) the associated time-frame of arrival; and (3) the associated relative position for each said respective incoming data packet within said time-frame of arrival.
41. The method as in claim 40, wherein the time-based routing controller provides routing of each of the incoming data packets to a plurality of the output ports, each of the plurality of the incoming data packets having a respective unique associated particular position within an associated one of the predefined time frames.
42. The method as in claim 40, wherein each of the time frames has a defined duration from start to end, wherein each of the input ports is comprised of a serial receiver that provides position delimiters associated with each of the incoming data packets coupled thereto, wherein the position logic is a position counter, wherein said position counter counts the position delimiters that have occurred since the start of the respective one of the time frames.
43. The method as in claim 42, wherein the time frames are cyclically recurring, wherein a sequence of position delimiters within the cyclically recurring time frames is implicitly defined by a predefined sequence of time units of equal duration.
44. The method as in claim 42, wherein the time frames are cyclically recurring, wherein the sequence of position delimiters within the cyclically recurring time frames is defined by a predefined sequence of time intervals of arbitrarily different duration.
45. The method as in claim 42, wherein the start of the time frame is marked by a time frame delimiter.
46. The method as in claim 42, wherein the position logic is incremented at predefined time intervals relative to the start of the time frame.
47. The method as in claim 46, wherein each of the positions is of predefined time duration.
48. The method as in claim 40, wherein a fixed plurality of the time frames comprises a time cycle, wherein the time frames have positions within the time cycles, wherein the position of the time frame within the time cycle and the position of the incoming data packets within the time frame determines the routing to a respective one of the output ports independent of which one of the time cycles the time frame is in.
49. The method as in claim 40, wherein a fixed plurality of the time frames comprise a time cycle, wherein a fixed number of a plurality of the time cycles comprises a super cycle, wherein routing is determined uniquely within a super cycle and is the same for all the time cycles within all the super cycles.
50. The method as in claim 49, wherein the routing is determined responsive to the respective time cycle within the super cycle associated an input to a respective one of the input ports, and the position within each of the time frame.
51. The method as in claim 40, wherein there are a plurality of synchronization envelopes, each defining acceptable plus and minus deviations associated with the common time reference;
wherein two adjacent ones of the synchronization envelopes of two of the adjacent time frames are non-overlapping;
wherein each of the synchronization envelopes has one of the common time references uniquely associated with the respective synchronization envelope.
52. The method as in claim 51, further comprising:
sending a time frame delimiter (TFD) signal via the serial transmitter between every two successive time frames.
53. The method as in claim 51, further comprising:
encoding the time frame delimiter to be sent as an encoded control codeword in the middle of a data packet.
54. The method as in claim 53, wherein all data packets received between two successive time frame delimiters (TFDs), which were received by the routing controller, are uniquely associated with the time frame as measured by the common time reference.
Patent Citations (10)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4821259 | 1989-04-01 | DeBruler et al. | Applicant |
| US5418779 | 1995-05-01 | Yemini et al. | Applicant |
| US5442636 | 1995-08-01 | Bontekoe | Applicant |
| US5455701 | 1995-10-01 | Eng et al. | Applicant |
| US5623483 | 1997-04-01 | Agrawal et al. | Applicant |
| US5910955 | 1999-06-01 | Nishimura et al. | Examiner |
| US5926626 | 1999-07-01 | Takeuchi et al. | Examiner |
| US6006258 | 1999-12-01 | Kalajan | Examiner |
| US6061349 | 2000-05-01 | Coile et al. | Examiner |
| US6185213 | 2001-02-01 | Katsube et al. | Examiner |
Non-Patent Literature (45)
- Ballart et al., “SONET: Now It's The Standard Optical Network”, IEEE Communications Magazine, vol. 29, No. 3, Mar. 1989, pp. 8-15.Applicant
- Boyle et al., “The COPS (Common Open Policy Service) Protocol”, Internet Draft. <draft-ietf-rapcops.01txt>. Mar. 1998.Applicant
- R. Braden, “Resources ReSerVation Protocol (RSVP)—Version 1 Functional Specification”, IETF Request for Comment RFC2205, Sep. 1997.Applicant
- P.Dana, “Global Positioning System (GPS) Time Dissemination for Real-Time Application”, Real Time Systems, Kluwar Academic Publishers, Boston, 1997, pp 9-40.Applicant
- M. Decina, “TMN Today: Challenges and Opportunities”, Telecommunications Network Management Into The 21st Century, IEEE Press, New York, 1994, pp. xv-xvii.Applicant
- S. Deering, “Multicast Routing In Datagram Internetwork”, Ph.D. Thesis, Stanford University, Dec. 1991, pp. 1-36.Applicant
- S. Deering, “Host Extension For IP Multicasting”, IETF Request for Comment RFC1112, Aug 1989.Applicant
- Demers et al., “Analysis and Simulation Of A Fair Queuing Algorithm”, ACM Computer Communication Review (SIGCOMM'89), pp 1-12, 1989.Applicant
- T.Earnest, “GPS Times Isochronous ATM Cells”, Electronic Engineering Times, Feb. 13, 1995, p. 54.Applicant
- Ferrari et al., “A Scheme For Real-Time Channel Establishment In Wide-Area Networks”, IEEE Journal on Selected Areas in Communication, vol. 8, No. 3, Apr. 1990, pp. 368-379.Applicant
- S.J. Golestani, “Congestion-Free Communication in High-Speed Packet Networks”, IEEE Transactions on Communications, vol. 39, No. 12, Dec. 1991, pp. 1802-1812.Applicant
- Handley et. al, “SIP-Session Initiation Protocol”, <draft-draft-ietf-mmusic-sip-04.ps>, Nov. 1997.Applicant
- Händel et al., “Signalling”, ATM Networks: Concepts, Protocols, and Applications, (2nd Ed.) Addison-Wesley Publishing Co., 1994, Chapter 6, pp. 141-158.Applicant
- Hennessy et al., “Enhancing Performance with Pipelining”, Computer Organization & Design: The Hardware/Software Interface, Morgan Kaufman Publishers, San Mateo, CA, 1994, Chapter 6, pp. 364-389.Applicant
- C. Huitema, “Why is RIP So Simple?”, Routing In The Internet, Prentice Hall, 1995, chapter 4, pp. 65-98.Applicant
- IEEE 802.9a Editor. Integrated service (is): IEEE 802.9a “Isochronous Services With CSMA/CD MAC Service”, IEEE Draft, Mar. 1995.Applicant
- ITU-T, “Visual Telephone Systems and Equipment For Local Area Networks Which Provide A Non-Guaranteed Quality Of Service”, ITU-T Recommendation H.323, 1996.Applicant
- ITU-T “Line Transmisson Of Non-Telephone Signals: Control Protocol For Multimedia Communication”, ITU-T Recommendation H.245, 1994.Applicant
- Kandlur et al., “Real Time Communication In Multi-Hop Networks”, IEEE Transactions On Parallel and Distributed Systems, vol. 5, No. 10, Oct 1991, pp. 1044-1055.Applicant
- M.G.H. Katevenis, “Fast Switching And Fair Control Of Congested Flow In Broadband Networks”, IEEE Journal on Selected Areas in Communications, vol. SAC-5, No. 8, Oct. 1987, pp. 1315-1326.Applicant
- J.Levine, “An Algorithm to Synchronize the Time of a Computer to Universal Time”, IEEE/ACM Transactions on Networking, vol. 3, No. 1, Feb. 1995, pp 42-50.Applicant
- Li et al., “Pseudo-Isochronous Cell Switching In ATM Networks”, IEEE INFOCOM'94, pp. 428-437, 1994.Applicant
- D.Mills, “Improved Algorithms for Synchronizing Computer Network Clocks”, Computer Comm. Rev. (USA), vol. 24, No. 4, Oct. 1994, pp 317-327.Applicant
- D. Mills, “Internet Time synchronization: The Network Time Protocol”, IEEE Transactions on Communications, vol. 39, No. 10, Oct. 1981, pp. 1482-1493.Applicant
- Y. Ofek, “The Topology, Algorithms And Analysis Of A Synchronous Optical Hypergraph Architecture”, Ph.D. Dissertation, Electrical Engineering Department, University of Illinois at Urbana, Report No. UIUCDCS-R-87-1343, May 1987.Applicant
- Y. Ofek, “Integration Of Voice Communication On A Synchronous Optical Hypergraph”, INFOCOM'88, 1988.Applicant
- Y. Ofek, “Generating A Fault Tolerant Global Clock Using High-Speed Control Signals For The MetaNet Architecture”, IEEE Transactions on Communications, pp. 2179-2188, May 1994.Applicant
- Y.Ofek, “The Conservation Code for Bit Synchronization”, IEEE Transactions on Communications, vol. 38, No. 7, Jul. 1990, pp. 1107-1113.Applicant
- Ofek et al., “‘Time-Driven Priority’ Flow Control For Real-Time Heterogeneous Internetworking”, IEEE INFOCOM'96, 1996.Applicant
- Parekh et al., “A Generalized Processor Sharing Approach To Flow Control In Integrated Services Network: The Multiple Node Case”, IEEE Transactions on Networking, vol. 2, No. 2, Apr. 1994, pp. 137-150.Applicant
- Patterson et al., “Pipelining”, Computer Architecture: A Quantitative Approach, Morgan Kaufman Publishers, San Mateo, CA, 1990, Chapter 6, pp. 251-278.Applicant
- T. Piotrowski, “Synchronization Of Telecommunication Network Using A Global Positioning Satellite”, Abstract, IEEE PLANS'92, Mar. 1992.Applicant
- D.Robinson, “Internet Stratum One GPS Network Time Server: A Commercial Embodiment”, Datum Corporation.Applicant
- Rosen et al., “A Proposed Architecture For MPLS” <draft-ietf-mpls-arch-00-txt> Internet Draft, Aug. 1997.Applicant
- Schultzrinne et. al, “RTP: A Transport Protocol for Real-Time Applications, IETF Request for Comment RFC1889”, Jan. 1996.Applicant
- M. Schwartz, “Networking Layer: Routing Function”, Telecommunication Networks: Protocols, Modeling, and Analysis, Addison Wesley, Reading MA, 1987, Chapter 6, pp. 259-330.Applicant
- Shenker et al., “Specification of Guaranteed Quality of Service, IETF Request for Comment RFC2212”, Sep. 1997.Applicant
- W. Stallings, “Overview”, SNMP, SNMPv2. and CMIP: The Practical Guide To Network Management, Addison Wesley, 1993, Chapter 1, pp. 1-14.Applicant
- A.Tannebaum, “Routing Algorithms”, Computer Networks, (3rd Ed) Prentice Hall, 1996, Chapter 5.2, pp. 345-374.Applicant
- C. Topolcic (Ed.) Experimental Internet Stream Protocol, Version 2 (ST-II), RFC 1190, Oct. 1990.Applicant
- J. Wroclawski, “Specification of the Controlled-Load Network Element Service”, IETF RFC 2211, Sep. 1997.Applicant
- D. Mills, “Network Time Protocol (Version 3) Specification, Implementation and Analysis”, Network Working Group, RFC 1305, University of Delaware, Mar. 1992.Applicant
- S.J.Golestani, “A Framing Strategy for Congestion Management”, IEEE Journal on Selected Areas in Communications, vol. 9, No. 7, Sep. 1991, pp. 1064-1077.Applicant
- Li et al., “Pseudo-isonchronous Cell Forwarding”, Computer Networks and ISDN Systems, vol. 30 (1998), pp. 2359-2372.Applicant
- Li et al., “Time-driven Priority Flow Control for Real-time Heterogeneous Internetworking”, Proceedings of Infocom, vol. 15, Los Alamitos, CA, Mar. 1996, pp. 189-197.Applicant