Not applicable.
Not applicable.
Ethernet is the preferred protocol for many types of networks because it is flexible, decentralized, and scalable. Ethernet is flexible in that it allows variable-sized data packets to be transported across different types of mediums using various nodes each having different transmission speeds. Ethernet is decentralized in that it allows the end devices to transmit and receive data without oversight or intervention from a centralized server or party. Furthermore, Ethernet is scalable in that it can be implemented in both small-scale and large-scale networks. These advantages make Ethernet a preferred choice for data distribution in many computer networks.
Unfortunately, Ethernet does have some drawbacks. When Ethernet packets are transported through the network, the Ethernet packets contend with other traffic being transported over the same links or through the same nodes. The contentious traffic not only includes packets bound for the same destination, but also packets bound for other destinations that are transported over the same link or through the same node as the Ethernet packet. This contention produces burstiness and jitter at the nodes within the network. Some of these problems can be addressed by using resource arbitration and buffers at the nodes, and by prioritizing the packets into high priority data and low priority data. However, these solutions increase network complexity, increase delay, and detract from the inherent advantages of Ethernet.
The aforementioned drawbacks are part of the reason Ethernet has not been widely implemented in networks carrying time division multiplexed (TDM) data. Specifically, Ethernet does not provide a sufficient Quality of Service (QoS) to meet the stringent jitter and data loss requirements for voice traffic in the public switched telephone network (PSTN) and other TDM networks. Instead, TDM traffic is carried by highly synchronized networks, such as synchronous optical networks (SONET) and synchronous digital hierarch (SDH) networks. Various Ethernet enhancements, such as circuit emulation, provider backbone transport, and pseudowires, have been proposed to address the jitter and data loss issues, but these enhancements fail to couple the flexibility of Ethernet with the high QoS requirements of TDM networks. Thus, a need exists for an improved Ethernet protocol that is flexible, easy to implement, supports the QoS requirements of TDM networks, and is compatible with existing technology.
In one aspect, the disclosure includes a network component comprising a processor configured to implement a method comprising promoting the communication of a frame of octet-sized timeslots, wherein the timeslots are configured to carry a plurality of data types.
In another aspect, the disclosure includes a method comprising communicating a high priority data and a low priority data in a frame comprising a plurality of octet-sized timeslots, wherein each timeslot is assigned to the high priority data or the low priority data, wherein the high priority data is provided in the timeslots assigned to the high priority data, and wherein the low priority data is provided in the timeslots assigned to the low priority data.
In a third aspect, the disclosure includes a network component comprising a processor configured to implement a method comprising recognizing the reception of a plurality of data streams each having a priority, and promoting the multiplexing of the data streams based on the priority of each data stream.
These and other features will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.
For a more complete understanding of this disclosure, reference is now made to the following brief description, taken in connection with the accompanying drawings and detailed description, wherein like reference numerals represent like parts.
It should be understood at the outset that, although an illustrative implementation of one or more embodiments are provided below, the disclosed systems and/or methods may be implemented using any number of techniques, whether currently known or in existence. The disclosure should in no way be limited to the illustrative implementations, drawings, and techniques illustrated below, including the examples of designs and implementations illustrated and described herein, but may be modified within the scope of the appended claims along with their full scope of equivalents.
Disclosed herein is an operational mode that multiplexes different data types using an overlay synchronous timeslot scheme, referred to herein as a Huawei time division multiplexed (H-TDM) operational mode. The overlay synchronous timeslot scheme may time division multiplex timestamp data, control data, and payload data in octet-sized timeslots within a predefined synchronization window. The payload data may include a plurality of data types, such as time division multiplexed (TDM) data, high performance flow (HPF) data, and best-effort packet (BEP) data. When multiple data types are included in the payload, a timeslot map may indicate the type and location of the different data types. The overlay synchronous timeslot scheme may allow high priority data to be transported through a network in a deterministic manner and without contention, thereby meeting the QoS requirements of the PSTN. The overlay synchronous timeslot scheme also promotes the efficient use of bandwidth by allowing low priority data to use timeslots that are assigned to the high priority data when the high priority data is idle. The overlay synchronous timeslot scheme also enables efficient mapping of data between Ethernet nodes and SONET or SDH nodes.
Further disclosed herein is a circuit architecture that multiplexes a plurality of data sources into the overlay synchronous timeslot scheme. The circuit architecture provides priority specific buffering such that low priority data may be buffered at the nodes while high priority data passes through the nodes without being buffered. The circuit architecture also provides backpressure flow control to maintain an optimal capacity of the buffers in the nodes.
The packet 100 continues with a length/type field 114, which may specify the length of the payload 116 and the Ethernet protocol being used, and may be about two octets. The payload 116 may be a variable-sized field that carries a data payload. Although the payload 116 may contain any amount of data, in specific embodiments the payload 116 may contain from about 42 octets to about 1,500 octets in standard packets, and may contain from about 9,000 octets to about 12,000 octets in jumbo packets. The frame check sequence (FCS) 118 may be used for error detection, and may be a four-octet field that contains a cyclic redundancy check (CRC) value calculated using the contents of the packet 100. Although not part of the packet 100, the inter-packet gap (IPG) 102 may be data or idle characters that separate the packets 100. The IPG 102 may contain about twelve octets of idle control characters, although any amount of data or idle characters may be used in the IPG 102.
The overlay synchronous timeslot scheme may continue with the TS Map 208, which may specify the type and location of the data in the payload 210. In one embodiment, the individual timeslots in the payload 210 may be assigned to TDM, HPF, and BEP traffic according to a predefined pattern. For example, the first one thousand timeslots may be assigned to TDM traffic, the subsequent five thousand timeslots may be assigned to HPF traffic, and the subsequent three thousand timeslots may be assigned to BEP traffic. In such an embodiment, the TS Map 208 may be omitted from the H-TDM frame if the nodes are aware of the predefined pattern. Alternatively, the TS Map 208 may indicate the assignment of each timeslot in the payload 210 as a TDM, a HPF, or a BEP timeslot. Using the TS Map 208, TDM, HPF, and BEP traffic may be dynamically interleaved within the overlay synchronous timeslot scheme.
Some timeslots at the beginning and/or end of the synchronization window may be part of a guard interval 202. The guard intervals 202 allow the H-TDM frame to float within the synchronization window. Specifically, the location of SFD 204 in relation to the start of the synchronization window may vary between synchronization windows. As such, the guard interval 202 at the beginning of the synchronization window may be the same or a different size than the guard interval 202 at the end of the synchronization window, and the size of the guard intervals 202 in one synchronization window may vary from the size of the guard intervals 202 in other synchronization windows. Such an embodiment may be advantageous because the integrity of the SFD 204, Sync 206, TS Map 208, and the data in the payload 210 is maintained if any of the data in the guard intervals 202 is dropped, corrupted, lost, or otherwise unreadable, for example, due to clock tolerances or other non-deterministic factors. In some embodiments, the guard interval 202 may transport low priority BEP data. Alternatively, the guard interval 202 may be zero-padded or may contain idle characters.
Although the synchronization window may be any duration, there are particular advantages to using a synchronization window with a period of about 125 μs. Specifically, synchronizing the overlay synchronous timeslot schemes to a 125 μs synchronization window enables the Ethernet nodes to be interoperable with the PSTN, SONET, SDH, and other TDM networks. As such, when the overlay synchronous timeslot scheme has a 125 μs window, SONET/SDH transport overhead may be added to the overlay synchronous timeslot scheme format.
The overlay synchronous timeslot scheme may allow the H-TDM frame to transport a variety of data types. When the synchronization window has a period of about 125 μs and each timeslot carries an octet of data, each of the timeslots in the overlay synchronous timeslot scheme represents a single channel with about 64 kilobits per second (Kbps) of bandwidth. These channels provide sufficient bandwidth to carry a voice conversation compatible with the PSTN. Thus, voice channels that are carried in an H-TDM frame may be referred to as TDM data.
The overlay synchronous timeslot scheme also provides octet-sized granularity that supports the communication of other traffic with stringent QoS requirements, referred to herein as HPF data. In an embodiment, the HPF data may require a deterministic amount of bandwidth. Examples of HPF traffic include video, audio, and other multimedia traffic. HPF traffic may be assigned multiple channels with single-octet granularity according to the bandwidth requirements of the HPF traffic. In other words, each channel assigned to a HPF increases the bandwidth allocated to the HPF by 64 Kbps. For example, a low resolution streaming video HPF requiring about 256 Kbps of bandwidth may be assigned about four channels from the H-TDM frame. Similarly, a HPF requiring about 3.2 megabits per second (Mbps) of bandwidth may be assigned about fifty channels from the H-TDM frame. In an embodiment, HPFs may be allocated bandwidth in 576 Kbps granularity to correspond to an entire column of a SONET/SDH frame.
In addition to being assigned to carry TDM and HPF data, the timeslots in the payload 210 may be assigned to carry BEP data. The BEP data may include low priority Ethernet packet data, data downloads, web browsing, or any other low priority data. In an embodiment, any timeslots in the payload 210 that are not assigned as TDM or HPF timeslots are automatically assigned as BEP timeslots. In another embodiment, at least a portion of the timeslots are assigned as BEP timeslots to ensure that at least some BEP data is contained in each H-TDM frame.
While the allocation of bandwidth may be performed as described above for constant bit rate (CBR) data streams, variable bit rate (VBR) data streams present an additional challenge. In an embodiment, VBR data streams may be allocated bandwidth according to a maximum amount of bandwidth that the VBR data streams may use. Consider a case wherein the VBR HPF may be a Motion Picture Experts Group (MPEG) encoded video data stream. The MPEG format may encode video data such that less bandwidth is needed to display scenes with few changes or movement, and more bandwidth is needed to display scenes with many changes or movement. In such a case, a HPF carrying the MPEG encoded video data may be allocated a sufficient quantity of timeslots to transport the maximum amount of bandwidth that the MPEG encoded video data stream will require. During scenes where less than the maximum amount of bandwidth is being used to communicate the MPEG encoded video data stream, the unused bandwidth may be reused by other data types, as described in detail below.
The synchronization window may begin at timeslot 0. Timeslots 0 through X represent the guard intervals 202, and thus the descriptor 306 indicates that BEP traffic may be transported during these timeslots. Specifically, timeslot X−1 includes a first part of a first BEP, identified as BEP A. At timeslot X, BEP A may be interrupted by the SFD 204 that may delineate the start of the H-TDM frame. If the H-TDM frame includes SONET/SDH overhead 212, as shown in
The payload 210 of the H-TDM frame follows timeslot X+Y. The payload 210 may contain a second part of BEP A, which may be interrupted by one or more timeslots of TDM or HPF data. Upon the completion of the TDM or HPF timeslots, BEP A may continue until BEP A terminates at timeslot J. Following an IPG or immediately following the end of BEP A, a second BEP identified as BEP B may be initiated in timeslot K and the remaining timeslots. The H-TDM frame may end at timeslot N, however BEP B may continue into the guard interval 202, and perhaps into the guard interval 202 of the subsequent synchronization window. Thus, the transmission of a BEP does not necessarily end at the end of the H-TDM frame or at the end of the synchronization window, but instead when the BEP is complete or when interrupted by the subsequent SFD 204.
While the timeslot layout depicted in
In an embodiment, the bandwidth of timeslots assigned to carry high priority data may be reused when a high priority timeslot is idle. Specifically, when timeslots assigned to HPF or TDM are not being used or are otherwise idle, the timeslots may carry low priority BEP data. As shown in
In contrast, column X+2 has the control bit set to “0” to indicate that the timeslot assigned to HPF data is idle, and thus bit 1 through bit 7 of column X+2 may be used to carry BEP data. Similarly, each of columns X, X+1, and X+2 are idle in rows 2 and 3, and column X is idle in row 4, and thus those areas may be used to carry BEP data. The BEP data may include the start of a new BEP, the end of a BEP, or idle data between BEPs. Further, the BEP data carried in the idle HPF timeslots may include BEP data that is located elsewhere in the overlay synchronous timeslot scheme. For example, the BEP data may include data from a previous BEP, such as a BEP that was located in a guard band or in the payload prior to the HPF timeslots.
As shown in row 4 of column X+1, a new HPF is started, and the remaining rows may be active and contain the new HPF. The new HPF data does not wait for the BEP to be completed, but instead interrupts the BEP as soon as the HPF is received. In this way, bandwidth assigned to carry high priority data in HPF timeslots may be dynamically reused by the BEP without any delay to the HPF data.
In an embodiment, the Sync 206 may be included within the transport overhead 702. Specifically, the Sync 206 may be located within a plurality of undefined octets in the second row in the transport overhead 702. While the Sync 206 is shown located in particular undefined octets, e.g. anywhere in columns 2 through 191 of the second row, persons of ordinary skill in the art will appreciate that the Sync 206 may be communicated in any other undefined octets of the transport overhead 702. Alternatively, the Sync 206 may be communicated in the first two columns of the STM-67/OC-192 frame payload, e.g. columns X+1 and X+2. In such an embodiment, the first half of the Sync 206 may be located in the first column, and the second half of the Sync 206 may be located in the second column.
While particular values are described as being associated with one of the three traffic types, persons of ordinary skill in the art will recognize other pairings of value and traffic type are possible. For example, the TS Map 208 may use the value “01” to designate BEP traffic and the value “00” to designate TDM traffic. Further, while the TS Map 208 in this embodiment assigns each timeslot as being a timeslot for carrying one of BEP, HPF, or TDM data, in other embodiments other designations may be used. For example, the traffic type designation may correspond with different QoS levels. In this case, timeslots may be designated as carrying traffic for voice data, video data, best-effort data, or background data. Still further, while one or two bits may be used to indicate the assignment of a traffic type to each timeslot in the payload 210, more bits may be used in the TS Map 208. For example, if three bits were used for the TS Map 208 then a greater number of traffic types may be indicated. In particular, with three bits, eight traffic types may be differentiated within the TS Map 208.
Each entry in the STM-64/OC-192 frame may contain an octet of data, where an entry is defined as the intersection of a column and a row. As such, each entry in the TS Map 706 provides the data type assignment for four columns in the payload 708 when the TS Map 208 format shown in
The STM-64/OC-192 frame may be serially transported over a SONET/SDH interface on a row-by-row basis. Specifically, the first row of columns 1 through 17,280 may be transported prior to transporting the second row of columns 1 through 17,280. As such, the serial data stream transporting the STM-64/OC-192 frame includes nine sections, where each section contains portions of the transport overhead 212, the TS Map 704, and the payload 708. In contrast, the transport overhead 212, TS Map 208, and payload 210 are generally communicated in distinct sections over an Ethernet interface, as depicted in
As shown in
The controller 1108 instructs the egress multiplexer 1112 to select each of the inputs according to the TS Map 208. For example, within the guard intervals 202 of the H-TDM overlay synchronous timeslot scheme, the controller 1108 instructs the egress multiplexer 1112 to select BEP data from the buffer 1110. Upon receiving the SFD 204, the controller 1108 instructs the egress multiplexer 1112 to accept a portion of the transport overhead 212 from the controller 1108, and then accept the Sync 206 from the synchronization input. Upon completion of the Sync 206, the controller 1108 instructs the egress multiplexer 1112 to accept the remainder of the transport overhead 212 and the TS Map 208 from the controller 1108. Upon completion of the transport overhead 212 and the TS Map 208, the controller instructs the egress multiplexer 1112 to accept the TDM data, the HPF data, and the BEP data according to the TS Map 208. Finally, upon completion of the payload 210, the controller 1108 instructs the egress multiplexer 1112 to accept the BEP data from the buffer 1110, e.g. for transport during the guard interval 202.
The ingress port 1104 of node B is configured to receive the data transported over the communication medium on an ingress PHY interface 1114. The ingress PHY interface 1114 forwards the data to an ingress demultiplexer 1116, which demultiplexes the data stream. The ingress demultiplexer 1116 also forwards the data to a controller 1118, a buffer 1120, a TDM data output, an HPF data output, or a synchronization output as instructed by the controller 1118. The buffer 1120 may be configured to store the BEP data received from the ingress demultiplexer 1116. The controller 1118 may control the ingress demultiplexer 1116 using control information received from the ingress demultiplexer 1116 and/or from other components in node B. As part of the control, the controller 1118 uses the TS Map 208 received over the ingress PHY interface 1114 to control the demultiplexing of the data stream.
Similar to the controller 1108, the controller 1118 instructs the ingress demultiplexer 1116 to forward the received data to the outputs according to the TS Map 208. For example, within the guard intervals 202 of the H-TDM overlay synchronous timeslot scheme, the controller 1118 instructs the ingress demultiplexer 1116 to send the received BEP data to the buffer 1120. When the SFD 204 is received, the controller 1118 instructs the ingress demultiplexer 1116 to send the received data to the controller 1118. In an alternative embodiment, the ingress demultiplexer 1116 may contain logic that recognizes the SFD 204 such that the received data is sent to the controller 1118 without any instructions from the controller 1118. If the data received after the SFD 204 includes a portion of the transport overhead 212, the ingress demultiplexer 1116 sends such data to the controller 118. The ingress demultiplexer 1116 then sends the Sync 206 to the synchronization output. Subsequent to the Sync 206, the ingress demultiplexer 1116 may send the remainder of the transport overhead 212 and the TS Map 208 to the controller 1118. The controller 1118 may then use the received TS Map 208 to instruct the ingress demultiplexer 1116 to distribute the received data to the TDM data output, the HPF data output, and the buffer 1120. Finally, upon completion of the payload 210, the controller 1118 again instructs the ingress demultiplexer 1116 to send the BEP data received during the guard interval 202 to the buffer 1120.
The egress port 1102 and the ingress port 1104 may each be implemented as part of a communication interface between two nodes. In an embodiment, the egress port 1102 and the ingress port 1104 may each be implemented as part of a line card that supports core network communications. Further, while only the egress port 1102 of node A and the ingress port 1104 of node B are shown, full-duplex communications may be supported by each of nodes A and B including an ingress port on node A and an egress port on node B. In such a case, in addition to the egress port 1102 of node A and the ingress port 1104 of node B communicating with each other, an egress port of node B and an ingress port of node A may also communicate with each other.
While the payload 210 described above only contains one instance of each traffic type, the payload 210 may also contain multiple instances of each traffic type, as shown in
As shown in
The ingress port 1104 of node B includes the ingress PHY interface 1114 and the controller 1118 as described above. The ingress port 1104 has been modified to include an ingress demultiplexer 1306 that forwards the demultiplexed data to the various outputs according to the TS Map 208. The ingress port 1104 has further been modified to include a plurality of output buffers 1308 that may be implemented similar to the buffers 1302 as described above.
When the egress and ingress ports contain multiple instances of a data type, the instances within the data type may be prioritized such that the individual instances are treated differently. For example, if there are two BEP instances, BEP1 and BEP2, then BEP1 may be prioritized over BEP2 such that all of the BEP1 data is transported, e.g. in the guard bands, the BEP timeslots, and the idle HPF timeslots, before any of the BEP2 data is transported. Alternatively, a policy may be created that favors BEP1 data over BEP2 data in transport selection, but allows some BEP2 data to be transported in each frame even if not all of the BEP1 data has been transported. Similar priorities and policies may also be created for the TDM and HPF data, if desired.
While the H-TDM overlay synchronous timeslot scheme enables the communication of both TDM data and BEP data over Ethernet communication interfaces, the H-TDM overlay synchronous timeslot scheme may not be backwards compatible with some Ethernet nodes at the media access control (MAC) layer, or OSI Layer 2. In such a case, a Huawei jumbo (H-JUMBO) operational mode may partition the H-TDM overlay synchronous timeslot scheme into a plurality of sections and encapsulate each section with Ethernet Layer 2 framing. By doing so, the H-JUMBO operational mode enables the transport of H-TDM payloads through Ethernet nodes that do not support the H-TDM overlay synchronous timeslot scheme.
As shown in
At node B, the ingress port 1104 includes the egress PHY interface 1114 and a demultiplexer 1514, which may be similar to the demultiplexer 1116 and the demultiplexer 1306 described above. However, the ingress port 1104 has been modified such that the received Ethernet Layer 2 compatible data stream may be input to an Ethernet Layer 2 de-framer 1510 to extract each partition of the H-TDM overlay synchronous timeslot scheme. The extracted partitions of the H-TDM overlay synchronous timeslot scheme may then be input to an H-TDM stream re-constructor 1512 that reconstructs the H-TDM overlay synchronous timeslot scheme. The reconstructed H-TDM overlay synchronous timeslot scheme may then be input to the demultiplexer 1512 and processed as described above.
As shown in
The ingress controller 1602 may instruct the ingress buffer 1610 to store BEP data that is received from the ingress controller 1602 in the ingress buffer 1610. The ingress controller 1602 may also instruct the ingress buffer 1610 to send data from the ingress buffer 1610 to the MAC logic 1612. The ingress buffer 1610 may operate as a first-in-first-out (FIFO) memory such that BEP data is switched across the node 1600 in the order that it is received. The ingress buffer 1610 may buffer the BEP traffic en route to a packet switch 1614 while smoothing out and hiding interruptions and delays caused by the multiplexing of multiple data types in the H-TDM overlay synchronous timeslot scheme. In an embodiment, the ingress buffer 1610 may buffer the BEP data at least until an entire packet has been received. In another embodiment, BEP data stored in the ingress buffer may begin being switched prior to receiving a complete packet. For cut-through BEP traffic, ingress packet delay due to the ingress buffer 1610 may be minimized if the length of the packet is known because the number of interrupting timeslots is always deterministic. In addition, the ingress buffer can support cut-through traffic by calculating the minimum amount of time that it has to buffer a packet before it can start transmitting the packet to a packet switch 1614 because the number of timeslots in use is known to the ingress controller due to the storage of the TS Map 208 in memory 1606. Such an embodiment eliminates the possibility of needing data before it is available, a condition known as under-run.
The MAC logic 1612 provides the BEP data to the packet switch 1614 such that the BEP data may be switched across the node 1600. In embodiments, the MAC logic 1612 may be implemented as Ethernet MAC logic or any other logic known to persons of ordinary skill in the art. After being switched by the packet switch 1614, the BEP data is provided to a second MAC logic 1612, and subsequently stored in an egress buffer 1616. The egress buffer 1616 may buffer the BEP packet data to smooth out the delays in the packet traffic caused by the insertion of HPF and TDM traffic in the egress data stream. While the TDM switch 1608 and the packet switch 1614 are illustrated as separate switching fabrics, they may be combined into a unified switching fabric. Several architectures for providing ingress and egress controllers that communicate over a unified switching fabric are detailed in the aforementioned provisional applications.
For HPFs that are high priority packet data, the HPF may be communicated to the packet switch 1614 for transport across the node 1600. In this case, the high priority packet data may be sent directly to the first MAC logic 1612, through the packet switch 1614 and output from the second MAC logic 1612 without being buffered in the ingress buffer 1610 or the egress buffer 1616. In an alternative embodiment, the high priority packet data may be provided to a separate ingress and egress buffer that are used exclusively for providing high priority packet data to and from the packet switch 1614. Further in the alternative, high priority packets may have their own switch fabric and may not be routed through any buffers. In another embodiment, all HPF data is switched using the TDM switch 1608 regardless of whether the data is high priority packet data. Using these embodiments, the high priority packet data may be switched with greater expedience than the lower priority BEP data.
The egress controller 1618 may receive control information, such as the TS Map 208 and the Sync 206, from the ingress controller 1602 via a control channel 1620. Specifically, the egress controller 1618 maintains a copy of the TS Map 208 in a memory 1622 such that the egress controller 1618 knows how to multiplex TDM, HPF, and BEP traffic with the TS Map 208 and the Sync 206. The egress controller 1618 also provides control data to the egress buffer 1616 such that BEP data may be removed from the egress buffer 1616 as needed according to the TS Map 208 stored in the memory 1622. Similarly, the egress controller 1618 receives TDM and HPF data from the TDM switch 1608, and forwards the TDM and HPF data to the egress data stream according to the TS Map 208 stored in the memory 1622. Upon receiving the various traffic types from the TDM switch 1608 and the egress buffer 1616, an egress controller 1618 multiplexes the traffic with control and timing information, such as the TS Map 208 and the Sync 206, and transmits the multiplexed data via a PHY interface 1624. The egress controller 1618 may include one of the egress multiplexer 1112 or 1304 and other circuits or logic that enable the egress controller 1618 to send the H-TDM overlay synchronous timeslot scheme over the PHY interface 1624.
The egress controller 1618 may also provide back-pressure flow control to the egress buffer 1616, thereby controlling the traffic flow from the packet switch 1614 to the egress buffer 1616. The back-pressure flow control provides a mechanism through which the flow of BEP data may be adjusted without affecting the flow of TDM and HPF data. In one embodiment, the egress buffer 1616 may supply the back-pressure flow control to the ingress controller 1602. The ingress controller 1602 may then provide instructions to the ingress buffer 1610 to vary the flow of BEP data sent to the packet switch 1614. In an alternative embodiment, the back-pressure flow control may be supplied directly to the packet switch 1614, as shown by the dashed line, thereby controlling traffic flow at the packet switch 1614. Regardless of the specific implementation, the back-pressure flow control may conform to IEEE 802.3x, which is incorporated by reference as if reproduced in its entirety.
The egress controller 1618 may supply back-pressure flow control to either increase or decrease the traffic flow. For example, when the BEP data in the egress buffer 1616 reaches an upper capacity threshold, the egress controller 1618 may provide back-pressure flow control to decrease traffic flow from the packet switch 1614 such that data in the egress buffer 1616 does not get overwritten. Similarly, when the BEP data in the egress buffer 1616 reaches a lower capacity threshold, the egress controller 1618 may provide back-pressure flow control to increase traffic flow from the packet switch 1614 such that the egress buffer 1616 may maintain a minimum amount of BEP data.
When the ingress controller 1602 receives the back-pressure flow control, the ingress controller may provide instructions to the ingress buffer 1610 to increase or decrease an amount of BEP data that is sent to the packet switch 1614. For example, if the back-pressure flow control requests a reduction in traffic flow from the packet switch 1614, then the ingress controller 1602 may instruct the ingress buffer 1610 to decrease the amount of BEP data sent to the packet switch 1614. In some situations, the ingress controller may instruct the ingress buffer 1610 to stop all BEP data from being sent to the packet switch 1614. Similarly, if the back-pressure flow control requests an increase in traffic flow from the packet switch 1614, then the ingress controller 1602 may instruct the ingress buffer 1610 to increase the amount of BEP data sent to the packet switch 1614.
While each of nodes A 1702 and B 1704 are shown with only two line cards 1706 and 1710, it is contemplated that any number of line cards may be in communication with each other over each of the switches 1708 and 1710. Further, while each of the line cards 1706 and 1710 are illustrated as having only one ingress port and one egress port, it is contemplated that one or more of the line cards 1706 and 1710 may have multiple ingress and egress ports. Further, while each of nodes A 1702 and B 1704 have a single switch 1708 or 1712, it is contemplated that the switches 1708 and 1712 may be comprised of multiple switching fabrics. For example, the switch 1708 or 1712 may include at least a first switching fabric for switching TDM and HPF data and a second switching fabric for switching BEP data. Such configurations allow the nodes to serve as routers, switches, bridges, or any other type of node within a network.
The systems and methods described above may be implemented on any general-purpose computer with sufficient processing power, memory resources, and network throughput capability to handle the necessary workload placed upon it.
The secondary storage 1884 is typically comprised of one or more disk drives or tape drives and is used for non-volatile storage of data and as an over-flow data storage device if RAM 1888 is not large enough to hold all working data. Secondary storage 1884 may be used to store programs which are loaded into RAM 1888 when such programs are selected for execution. The ROM 1886 is used to store instructions and perhaps data which are read during program execution. ROM 1886 is a non-volatile memory device which typically has a small memory capacity relative to the larger memory capacity of secondary storage. The RAM 1888 is used to store volatile data and perhaps to store instructions. Access to both ROM 1886 and RAM 1888 is typically faster than to secondary storage 1884.
I/O 1890 devices may include printers, video monitors, liquid crystal displays (LCDs), touch screen displays, keyboards, keypads, switches, dials, mice, track balls, voice recognizers, card readers, paper tape readers, or other well-known input devices. The network connectivity devices 1892 may take the form of modems, modem banks, Ethernet cards, universal serial bus (USB) interface cards, serial interfaces, token ring cards, fiber distributed data interface (FDDI) cards, wireless local area network (WLAN) cards, radio transceiver cards such as code division multiple access (CDMA) and/or global system for mobile communications (GSM) radio transceiver cards, and other well-known network devices. These network connectivity devices 1892 may enable the processor 1882 to communicate with an Internet or one or more intranets. With such a network connection, it is contemplated that the processor 1882 might receive information from the network or might output information to the network in the course of performing the above-described method steps. Such information, which is often represented as a sequence of instructions to be executed using processor 1882, may be received from and outputted to the network, for example, in the form of a computer data signal embodied in a carrier wave.
Such information, which may include data or instructions to be executed using processor 1882, may be received from and outputted to the network, for example, in the form of a computer data base-band signal or signal embodied in a carrier wave. The base-band signal or signal embodied in the carrier wave generated by the network connectivity devices 1892 may propagate in or on the surface of electrical conductors, in coaxial cables, in waveguides, in optical media, for example optical fiber, or in the air or free space. The information contained in the base-band signal or signal embedded in the carrier wave may be ordered according to different sequences, as may be desirable for either processing or generating the information or transmitting or receiving the information. The base-band signal or signal embedded in the carrier wave, or other types of signals currently used or hereafter developed, referred to herein as the transmission medium, may be generated according to several methods well known to persons of ordinary skill in the art.
The processor 1882 executes instructions, codes, computer programs, scripts that it accesses from hard disk, floppy disk, optical disk (these various disk-based systems may all be considered secondary storage 1884), ROM 1886, RAM 1888, or the network connectivity devices 1892.
While several embodiments have been provided in the present disclosure, it should be understood that the disclosed systems and methods might be embodied in many other specific forms without departing from the spirit or scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated in another system or certain features may be omitted, or not implemented. In addition, persons of ordinary skill in the art will appreciate that the term octet as used herein is synonymous with the term byte, and that the octets described herein do not necessarily have to contain eight bits.
In addition, techniques, systems, subsystems, and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods without departing from the scope of the present disclosure. Other items shown or discussed as coupled or directly coupled or communicating with each other may be indirectly coupled or communicating through some interface, device, or intermediate component whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by persons of ordinary skill in the art and could be made without departing from the spirit and scope disclosed herein.
This application is a divisional of U.S. patent application Ser. No. 11/735,591 filed Apr. 16, 2007, now U.S. Pat. No. 8,340,101 issued Dec. 25, 2012, and entitled “Multiplexed Data Stream Payload Format,” which claims priority to U.S. Provisional Application Ser. No. 60/826,764 filed Sep. 25, 2006 and entitled “System for TDM Data Transport Over Ethernet Interfaces,” U.S. Provisional Application Ser. No. 60/857,741 filed Nov. 8, 2006 and entitled “TDM Data Transport Over Ethernet,” and U.S. Provisional Application Ser. No. 60/886,833 filed Jan. 26, 2007 and entitled “Closed Loop Clock Synchronization,” all of which are by Serge F. Fourcand and are incorporated herein by reference as if reproduced in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
5303241 | Takada et al. | Apr 1994 | A |
5361261 | Edem et al. | Nov 1994 | A |
5367524 | Rideout, Jr. et al. | Nov 1994 | A |
5434848 | Chimento, Jr. et al. | Jul 1995 | A |
5696798 | Wright et al. | Dec 1997 | A |
5802051 | Petersen et al. | Sep 1998 | A |
5933607 | Tate et al. | Aug 1999 | A |
6049541 | Kerns et al. | Apr 2000 | A |
6108307 | McConnell et al. | Aug 2000 | A |
6233237 | Yucebay et al. | May 2001 | B1 |
6272109 | Pei et al. | Aug 2001 | B1 |
6320877 | Humphrey et al. | Nov 2001 | B1 |
6487169 | Tada | Nov 2002 | B1 |
6490248 | Shimojo | Dec 2002 | B1 |
6496477 | Perkins et al. | Dec 2002 | B1 |
6501810 | Karim et al. | Dec 2002 | B1 |
6570890 | Keenan et al. | May 2003 | B1 |
6570891 | Arimilli | May 2003 | B1 |
6577631 | Keenan et al. | Jun 2003 | B1 |
6633566 | Pierson, Jr. | Oct 2003 | B1 |
6674750 | Castellano | Jan 2004 | B1 |
6674756 | Rao et al. | Jan 2004 | B1 |
6693909 | Mo et al. | Feb 2004 | B1 |
6731654 | Champion, Jr. et al. | May 2004 | B1 |
6754206 | Nattkemper et al. | Jun 2004 | B1 |
6771614 | Jones, IV et al. | Aug 2004 | B1 |
6816500 | Mannette et al. | Nov 2004 | B1 |
6847644 | Jha | Jan 2005 | B1 |
6859458 | Yuang et al. | Feb 2005 | B2 |
6868093 | Bohm et al. | Mar 2005 | B1 |
6874048 | Knapp et al. | Mar 2005 | B2 |
6907048 | Treadaway et al. | Jun 2005 | B1 |
6944163 | Bottorff et al. | Sep 2005 | B2 |
6959151 | Cotter et al. | Oct 2005 | B1 |
6985497 | Hsu et al. | Jan 2006 | B2 |
6985499 | Elliot | Jan 2006 | B2 |
6999479 | Jha | Feb 2006 | B1 |
7007099 | Donati et al. | Feb 2006 | B1 |
7031341 | Yu | Apr 2006 | B2 |
7043651 | Aweya et al. | May 2006 | B2 |
7089485 | Azadet et al. | Aug 2006 | B2 |
7103124 | Lindskog et al. | Sep 2006 | B1 |
7139338 | Wilson et al. | Nov 2006 | B2 |
7188189 | Karol et al. | Mar 2007 | B2 |
7236126 | Jeon et al. | Jun 2007 | B2 |
7257087 | Grovenburg | Aug 2007 | B2 |
7305002 | Ageby et al. | Dec 2007 | B1 |
7324537 | Samudrala et al. | Jan 2008 | B2 |
7403514 | Moulsley | Jul 2008 | B1 |
7436765 | Sisto et al. | Oct 2008 | B2 |
7453885 | Rogers | Nov 2008 | B2 |
7463709 | Raphaeli et al. | Dec 2008 | B2 |
7496112 | Danielson et al. | Feb 2009 | B1 |
7519747 | Cory et al. | Apr 2009 | B1 |
7613212 | Raz et al. | Nov 2009 | B1 |
7646710 | Christie, IV | Jan 2010 | B2 |
7668203 | Pannell et al. | Feb 2010 | B1 |
7720101 | Chapman et al. | May 2010 | B2 |
7774461 | Tanaka et al. | Aug 2010 | B2 |
7986700 | Fourcand | Jul 2011 | B2 |
8340101 | Fourcand | Dec 2012 | B2 |
8416770 | Fourcand | Apr 2013 | B2 |
8493993 | Patel et al. | Jul 2013 | B2 |
20010043603 | Yu | Nov 2001 | A1 |
20010053130 | Tanaka et al. | Dec 2001 | A1 |
20010053149 | Mo et al. | Dec 2001 | A1 |
20020057709 | Edmon et al. | May 2002 | A1 |
20020068593 | Deltour et al. | Jun 2002 | A1 |
20020087716 | Mustafa | Jul 2002 | A1 |
20020131425 | Shalom | Sep 2002 | A1 |
20020141456 | Wang et al. | Oct 2002 | A1 |
20020163926 | Moharram | Nov 2002 | A1 |
20020167955 | Shimojo | Nov 2002 | A1 |
20020172200 | Shin et al. | Nov 2002 | A1 |
20020176389 | Colombo et al. | Nov 2002 | A1 |
20030095568 | Tominaga et al. | May 2003 | A1 |
20030117899 | Eidson | Jun 2003 | A1 |
20030147348 | Jiang | Aug 2003 | A1 |
20030161307 | Lo | Aug 2003 | A1 |
20030174700 | Ofek et al. | Sep 2003 | A1 |
20030179755 | Fraser | Sep 2003 | A1 |
20030214977 | Kuo | Nov 2003 | A1 |
20030219042 | Tosa | Nov 2003 | A1 |
20040001483 | Schmidt et al. | Jan 2004 | A1 |
20040001502 | Garmire et al. | Jan 2004 | A1 |
20040028408 | Cox et al. | Feb 2004 | A1 |
20040047367 | Mammen | Mar 2004 | A1 |
20040062265 | Poledna | Apr 2004 | A1 |
20040063401 | Meckelburg et al. | Apr 2004 | A1 |
20040066775 | Grovenburg | Apr 2004 | A1 |
20040071166 | Yen et al. | Apr 2004 | A1 |
20040076166 | Patenaude | Apr 2004 | A1 |
20040076186 | Chen et al. | Apr 2004 | A1 |
20040120438 | Forte | Jun 2004 | A1 |
20040151125 | Holmeide et al. | Aug 2004 | A1 |
20040177162 | Wetzel et al. | Sep 2004 | A1 |
20040179551 | Lentine et al. | Sep 2004 | A1 |
20040208554 | Wakai et al. | Oct 2004 | A1 |
20040213149 | Mascolo | Oct 2004 | A1 |
20040252688 | May et al. | Dec 2004 | A1 |
20050033947 | Morris et al. | Feb 2005 | A1 |
20050041691 | Laufer et al. | Feb 2005 | A1 |
20050099988 | Wang et al. | May 2005 | A1 |
20050117576 | McDysan et al. | Jun 2005 | A1 |
20050129028 | Peeters et al. | Jun 2005 | A1 |
20050141568 | Kwak et al. | Jun 2005 | A1 |
20050175013 | LePennec et al. | Aug 2005 | A1 |
20050190796 | Date et al. | Sep 2005 | A1 |
20050254484 | Barzegar et al. | Nov 2005 | A1 |
20050278457 | Hall et al. | Dec 2005 | A1 |
20050281217 | Mottier | Dec 2005 | A1 |
20060015507 | Butterworth et al. | Jan 2006 | A1 |
20060083265 | Jordan et al. | Apr 2006 | A1 |
20060092985 | Cho et al. | May 2006 | A1 |
20060104302 | Cho et al. | May 2006 | A1 |
20060109864 | Oksman | May 2006 | A1 |
20060123126 | Kim et al. | Jun 2006 | A1 |
20060176905 | Liu et al. | Aug 2006 | A1 |
20060182144 | Dove et al. | Aug 2006 | A1 |
20060233116 | Kyusojin et al. | Oct 2006 | A1 |
20060239300 | Hannel et al. | Oct 2006 | A1 |
20060256768 | Chan | Nov 2006 | A1 |
20060274791 | Garcia et al. | Dec 2006 | A1 |
20070008958 | Clemm et al. | Jan 2007 | A1 |
20070014372 | Hershbarger | Jan 2007 | A1 |
20070022209 | Delvai et al. | Jan 2007 | A1 |
20070031153 | Aronson et al. | Feb 2007 | A1 |
20070064587 | Langley et al. | Mar 2007 | A1 |
20070076605 | Cidon et al. | Apr 2007 | A1 |
20070097926 | Liu et al. | May 2007 | A1 |
20070121661 | Ohta et al. | May 2007 | A1 |
20070140127 | Frei | Jun 2007 | A1 |
20070192515 | Kraus | Aug 2007 | A1 |
20070201356 | Liao et al. | Aug 2007 | A1 |
20070201365 | Skoog et al. | Aug 2007 | A1 |
20070206602 | Halabi et al. | Sep 2007 | A1 |
20070206603 | Weich et al. | Sep 2007 | A1 |
20070206604 | Best et al. | Sep 2007 | A1 |
20070206709 | Kermosh et al. | Sep 2007 | A1 |
20070211720 | Fuchs et al. | Sep 2007 | A1 |
20070211750 | Li et al. | Sep 2007 | A1 |
20070222648 | Sontag et al. | Sep 2007 | A1 |
20070258419 | Zhao et al. | Nov 2007 | A1 |
20070297375 | Bonta et al. | Dec 2007 | A1 |
20070299987 | Parker et al. | Dec 2007 | A1 |
20080031136 | Gavette et al. | Feb 2008 | A1 |
20080043732 | Desai et al. | Feb 2008 | A1 |
20080071924 | Chilukoor | Mar 2008 | A1 |
20080074996 | Fourcand | Mar 2008 | A1 |
20080075002 | Fourcand | Mar 2008 | A1 |
20080075069 | Fourcand | Mar 2008 | A1 |
20080075110 | Fourcand | Mar 2008 | A1 |
20080075120 | Fourcand | Mar 2008 | A1 |
20080075121 | Fourcand | Mar 2008 | A1 |
20080075122 | Fourcand | Mar 2008 | A1 |
20080075123 | Fourcand | Mar 2008 | A1 |
20080075124 | Fourcand | Mar 2008 | A1 |
20080075127 | Fourcand | Mar 2008 | A1 |
20080075128 | Fourcand | Mar 2008 | A1 |
20080123541 | Dielissen et al. | May 2008 | A1 |
20080130689 | Kumar et al. | Jun 2008 | A1 |
20080137675 | Pauwels | Jun 2008 | A1 |
20080181114 | Fourcand | Jul 2008 | A1 |
20080250469 | Agnoli et al. | Oct 2008 | A1 |
20090168797 | Danielson et al. | Jul 2009 | A1 |
20090254685 | Diepstraten et al. | Oct 2009 | A1 |
20090274172 | Shen et al. | Nov 2009 | A1 |
20100135314 | Fourcand | Jun 2010 | A1 |
20100135315 | Fourcand | Jun 2010 | A1 |
20100284421 | Fourcand | Nov 2010 | A1 |
20100316069 | Fourcand | Dec 2010 | A1 |
20110255402 | Fourcand | Oct 2011 | A1 |
Number | Date | Country |
---|---|---|
1293843 | May 2001 | CN |
1352841 | Jun 2002 | CN |
1512683 | Jul 2004 | CN |
1516463 | Jul 2004 | CN |
1522077 | Aug 2004 | CN |
1522510 | Aug 2004 | CN |
1529471 | Sep 2004 | CN |
1571348 | Jan 2005 | CN |
1575568 | Feb 2005 | CN |
1601951 | Mar 2005 | CN |
1710828 | Dec 2005 | CN |
1728720 | Feb 2006 | CN |
1767499 | May 2006 | CN |
1770673 | May 2006 | CN |
1773887 | May 2006 | CN |
1788501 | Jun 2006 | CN |
1855935 | Nov 2006 | CN |
1091529 | Apr 2001 | EP |
1655885 | May 2006 | EP |
1771027 | Apr 2007 | EP |
2366161 | Feb 2002 | GB |
2003188912 | Jul 2003 | JP |
9956422 | Nov 1999 | WO |
02099578 | Dec 2002 | WO |
03017543 | Feb 2003 | WO |
03032539 | Apr 2003 | WO |
03087984 | Oct 2003 | WO |
2005101755 | Oct 2005 | WO |
2006032583 | Mar 2006 | WO |
2006051465 | May 2006 | WO |
2006056415 | Jun 2006 | WO |
Entry |
---|
Office Action dated Apr. 24, 2013, 43 pages, U.S. Appl. No. 13/162,803, filed Jun. 17, 2011. |
Foreign Communication From a Related Counterpart Application, Chinese Application 200880000770.9, Chinese Office Action dated Mar. 19, 2013, 8 pages. |
Foreign Communication From a Related Counterpart Application, Chinese Application 200880000770.9, Partial English Translation Office Action dated Mar. 19, 2013, 7 pages. |
Office Action dated Sep. 18, 2013, 7 pages, U.S. Appl. No. 12/862,521, filed Aug. 24, 2010. |
Office Action dated Nov. 13, 2013, 15 pages, U.S. Appl. No. 13/162,803, filed Jun. 17, 2011. |
Foreign Communication From a Counterpart Application, Chinese Application No. 200880000770.9, Chinese Office Action dated Jul. 26, 2013, 8 pages. |
Foreign Communication From a Counterpart Application, Chinese Application No. 200880000770.9, Partial English Translation of Chinese Office Action dated Jul. 26, 2013, 9 pages. |
Notice of Allowance dated May 22, 2013, 18 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Mar. 13, 2013, 27 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated Apr. 3, 2013, 58 pages, U.S. Appl. No. 12/842,794, filed Jul. 23, 2010. |
Office Action dated Jun. 4, 2013, 6 pages, U.S. Appl. No. 13/162,803, filed Jun. 17, 2011. |
Office Action dated Jun. 18, 2013, 18 pages, U.S. Appl. No. 12/842,794, filed Jul. 23, 2010. |
Notice of Allowance dated Jul. 30, 2013, 9 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Notice of Allowance dated Aug. 1, 2013, 12 pages, U.S. Appl. No. 12/842,794, filed Jul. 23, 2010. |
Notice of Allowance dated Jun. 20, 2013, 40 pages, U.S. Appl. No. 13/271,691, filed Oct. 12, 2011. |
Office Action dated Aug. 2, 2013, 5 pages, U.S. Appl. No. 13/162,803, filed Jun. 17, 2011. |
Office Action dated Sep. 3, 2013, 6 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Notice of Allowance dated Nov. 26, 2013, 38 pages, U.S. Appl. No. 11/735,596, filed Apr. 16, 2007. |
Office Action dated Dec. 26, 2013, 30 pages, U.S. Appl. No. 12/862,521, filed Aug. 24, 2010. |
Office Action dated Mar. 5, 2014, 20 pages, U.S. Appl. No. 13/162,803, filed Jun. 17, 2011. |
Notice of Allowance dated Aug. 24, 2010, 14 pages, U.S. Appl. No. 11/735,598, filed Apr. 16, 2007. |
Office Action dated Oct. 16, 2012, 40 pages, U.S. Appl. No. 12/862,521, filed Aug. 24, 2012. |
Office Action dated Feb. 1, 2013, 4 pages, U.S. Appl. No. 12/862,521, filed Aug. 24, 2010. |
Office Action dated Sep. 18, 2009, 13 pages, U.S. Appl. No. 11/735,602, filed Apr. 16, 2007. |
Office Action dated Feb. 22, 2010, 21 pages, U.S. Appl. No. 11/735,602, filed Apr. 16, 2007. |
Office Action dated Jul. 29, 2010 15 pages, U.S. Appl. No. 11/735,602, filed Apr. 16, 2007. |
Notice of Allowance dated Apr. 11, 2011 8 pages, U.S. Appl. No. 11/735,602, filed Apr. 16, 2007. |
Office Action dated Sep. 15, 2009, 13 pages, U.S. Appl. No. 11/735,604, filed Apr. 16, 2007. |
Office Action dated Feb. 17, 2010, 24 pages, U.S. Appl. No. 11/735,604, filed Apr. 16, 2007. |
Office Action dated Jul. 29, 2010, 15 pages, U.S. Appl. No. 11/735,604, filed Apr. 16, 2007. |
Office Action dated May 24, 2011, 14 pages, U.S. Appl. No. 11/735,604, filed Apr. 16, 2007. |
Office Action dated Oct. 29, 2009, 9 pages, U.S. Appl. No. 11/735,605. |
Office Action dated Mar. 3, 2010, 20 pages, U.S. Appl. No. 11/735,605. |
Office Action dated Jun. 22, 2010, 18 pages, U.S. Appl. No. 11/735,605. |
Office Action dated Oct. 27, 2010, 14 pages, U.S. Appl. No. 11/735,605. |
Office Action—Notice of Allowance—dated Mar. 17, 2011, 9 pages, U.S. Appl. No. 11/735,605. |
Office Action dated Jun. 26, 2009, 15 pages, U.S. Appl. No. 11/737,803, filed Apr. 20, 2007. |
Office Action—Notice of Allowance—dated Dec. 29, 2009, 16 pages U.S. Appl. No. 11/737,803, filed Apr. 20, 2007. |
Notice of Allowance dated Oct. 16, 2012, 42 pages U.S. Appl. No. 12/691,367, filed Jan. 21, 2010. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN20081070037, Apr. 17, 2008, 10 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070038, Apr. 17, 2008, 6 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070045, Apr. 17, 2008, 7 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070046, Apr. 17, 2008, 6 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070183, May 8, 2008, 11 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070632, Jul. 10, 2008, 5 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN20081070630, Jul. 3, 2008, 8 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN20081070690, Jul. 17, 2008, 7 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070717, Jul. 24, 2008, 10 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070017, Apr. 3, 2008, 6 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN20081070005, Apr. 10, 2008, 9 pages. |
Foreign Communication From a Related Counterpart Application—International Search Report and Written Opinion, PCT/CN2008/070007, Apr. 17, 2008, 8 pages. |
Foreign Communication From a Related Counterpart Application—European Application No. 08700043.6, Supplementary European Search Report and Written Opinion dated Oct. 29, 2009, 7 pages. |
Foreign Communication From a Related Counterpart Application—European Application No. 08700043.6, European Office Action dated Jul. 20, 2012, 7 pages. |
Foreign Communication From a Related Counterpart Application—European Search Report, EP Application 08700032.9, Dec. 2, 2009, 7 pages. |
Foreign Communication From a Related Counterpart Application—European Application No. 08700032.9, European Office Action dated Jun. 11, 2012, 10 pages. |
Foreign Communication from a counterpart application, Chinese application 200880001140.3, Office Action dated Feb. 9, 2011, 5 pages. |
Foreign Communication from a counterpart application, Chinese application 200880001140.3, Partial English Translation Office Action dated Feb. 9, 2011, 7 pages. |
Foreign Communication from a counterpart application, Chinese application 200880000770.9, Office Action dated Dec. 14, 2010, 7 pages. |
Foreign Communication from a counterpart application, Chinese application 200880000770.9, Partial English Translation Office Action dated Dec. 14, 2010, 6 pages. |
Foreign Communication From a Related Counterpart Application, Chinese Application 200880001609.3, Chinese Office Action dated Oct. 28, 2011, 4 pages. |
Foreign Communication From a Related Counterpart Application, Chinese Application 200880001609.3, Translation of First Chinese Office Action dated Oct. 28, 2011, 3 pages. |
Foreign Communication From a Related Counterpart Application, Chinese Application 200880002509.2, Chinese Office Action dated May 19, 2011, 4 pages. |
Foreign Communication From a Related Counterpart Application, Chinese Application 2008800025092, Partial English Translation Office Action dated May 19, 2011, 2 pages. |
Notice of Allowance dated Aug. 13, 2012, 25 pages, U.S. Appl. No. 11/735,591, filed Apr. 16, 2007. |
Office Action dated Aug. 6, 2012, 25 pages, U.S. Appl. No. 11/735,596, filed Apr. 16, 2007. |
Notice of Allowance dated Jul. 30, 2012, 42 pages, U.S. Appl. No. 12/691,372, filed Jan. 21, 2010. |
Foreign Communication From a Related Counterpart Application, Chinese Application 200880000770.9, Office Action dated Oct. 9, 2012, 5 pages. |
Foreign Communication From a Related Counterpart application, Chinese application 200880000770.9, Partial English Translation Office Action dated Oct. 9, 2012, 5 pages. |
Precise Networked Clock Synchronization Working Group of the IM/ST Committee, IEEE P1588™ D2.2, “Draft Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems,” 2007, 305 pages, IEEE Standards Activities Department, Piscataway, NJ. |
IEEE Standard for Infomration Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirement Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access and Physical Layer Specifiactions—IEEE Computer Society, IEEE std. 802.3-2008, Dec. 26, 2008—Section 1. |
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirement Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifiactions—IEEE Computer Society, IEEE std. 802.3-2008, Dec. 26, 2009—Section 2. |
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirement Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifiactions—IEEE Computer Society, IEEE std. 802.3-2008, Dec. 26, 2008—Section 3. |
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirement Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Phyiscal Layer Specifications—IEEE Computer Society, IEEE Std. 802.3-2008, Dec. 26, 2008—Section 4. |
IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirement Part 3: Carrier Sense Multiple Access Collision Detection (CSMA/CD) Access Method and Physical Layer Specification—IEEE Computer Society, IEEE Std. 802.3-2008, Dec. 26, 2008—Section 5. |
Krzyanowski, “Lectures on Distributed Systems Clock Synchronization,” Rutgers University—CS 417: Distributed Systems, copyright 2000-2009, 14 pages. |
National Instruments, “Introduction to Distributed Clock Synchronization and the IEEE 1588 Precision Time Protocol,” http://zone.ni.com/devzone/cda/tut/p/id/2822, May 14, 2008, pp. 1-4. |
Pratt G., et al., “Distributed Synchronous Clocking,” IEEE Transactions on Parallel and Distributed Systems, vol. 6, No. 3, Mar. 1995, pp. 314-328. |
Wikipedia, “TTEthernet,” http://en.wikipedia.org/wiki/TTEthernet, Retrieved Dec. 22, 2011. |
Fourcand, Serge Francois; U.S. Appl. No. 13/624,625; Title: “Inter-Packet Gap Network Clock Synchronization”; filed Sep. 21, 2012. |
Office Action dated May 12, 2009, 15 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated Nov. 23, 2009, 19 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated Aug. 7, 2009, 10 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Office Action dated Dec. 30, 2009, 22 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Office Action dated Jun. 9, 2010, 13 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Office Action dated Jan. 11, 2011, 10 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Office Action dated Feb. 1, 2011, 10 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Office Action dated Jun. 3, 2011, 17 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Notice of Allowance dated Jun. 21, 2012, 11 pages, U.S. Appl. No. 11/735,590, filed Apr. 16, 2007. |
Office Action dated Sep. 23, 2009, 10 pages, U.S. Appl. No. 11/735,591, filed Apr. 16, 2007. |
Office Action dated Jan. 6, 2010, 19 pages, U.S. Appl. No. 11/735,591, filed Apr. 16, 2007. |
Office Action dated Jan. 13, 2011, 10 pages, U.S. Appl. No. 11/735,591, filed Apr. 16, 2007. |
Office Action dated Jun. 17, 2011, 20 pages, U.S. Appl. No. 11/735,591, filed Apr. 16, 2007. |
Office Action dated Mar. 6, 2012, 13 pages, U.S. Appl. No. 11/735,591, filed Apr. 16, 2007. |
Office Action dated Jul. 1, 2011, 18 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated Nov. 21, 2011, 5 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated May 25, 2012, 8 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated Aug. 21, 2012, 17 pages, U.S. Appl. No. 11/737,800, filed Apr. 20, 2007. |
Office Action dated Jun. 20, 2012, 44 pages, U.S. Appl. No. 13/271,691, filed Oct. 12, 2011. |
Final Office Action dated Jan. 4, 2013, 27 pages, U.S. Appl. No. 13/271,691, filed Oct. 12, 2011. |
Office Action dated Aug. 5, 2009, 21 pages, U.S. Appl. No. 11/739,316, filed Apr. 24, 2007. |
Office Action dated Mar. 25, 2010, 22 pages, U.S. Appl. No. 11/739,316, filed Apr. 24, 2007. |
Notice of Allowance dated Aug. 19, 2010, 16 pages, U.S. Appl. No. 11/739,316, filed Apr. 24, 2007. |
Office Action dated Feb. 26, 2010, 22 pages, U.S. Appl. No. 11/971,386, filed Jan. 9, 2008. |
Notice of Allowance dated Jul. 19, 2010, 12 pages, U.S. Appl. No. 11/971,386, filed Jan. 9, 2008. |
Office Action dated Sep. 2, 2009, 13 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Feb. 18, 2010, 22 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Aug. 4, 2010, 9 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Jan. 3, 2011, 16 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Aug. 3, 2011, 11 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Jan. 23, 2012, 12 pages, U.S. Appl. No. 11/735,592, filed Apr. 16, 2007. |
Office Action dated Sep. 3, 2009, 15 pages, U.S. Appl. No. 11/735,596, filed Apr. 16, 2007. |
Office Action dated Feb. 2, 2010, 23 pages, U.S. Appl. No. 11/735,596, filed Apr. 16, 2007. |
Office Action dated Jun. 9, 2011, 17 pages, U.S. Appl. No. 11/735,596, filed Apr. 16, 2007. |
Office Action dated Oct. 25, 2011, 29 pages, U.S. Appl. No. 11/735,596, filed Apr. 16, 2007. |
Final Office Action dated Jan. 14, 2013,15 pages, U.S. Appl. No. 11/735,596 filed Apr. 16, 2007. |
Office Action dated Sep. 30, 2009, 15 pages, U.S. Appl. No. 11/735,598, filed Apr. 16, 2007. |
Office Action dated Feb. 17, 2010, 23 pages, U.S. Appl. No. 11/735,598, filed Apr. 16, 2007. |
Notice of Allowance dated Jun. 1, 2010, 8 pages, U.S. Appl. No. 11/735,598, filed Apr. 16, 2007. |
Office Action dated Jul. 3, 2014, 7 pages, U.S. Appl. No. 13/624,625, filed Sep. 21, 2012. |
Notice of Allowance dated Dec. 19, 2014, 11 pages, No. 13/624,625, filed Sep. 21, 2012. |
Number | Date | Country | |
---|---|---|---|
20130044756 A1 | Feb 2013 | US |
Number | Date | Country | |
---|---|---|---|
60826764 | Sep 2006 | US | |
60857741 | Nov 2006 | US | |
60886833 | Jan 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11735591 | Apr 2007 | US |
Child | 13649820 | US |