CA2450421C - Physical capacity aggregation system & method - Google Patents

Physical capacity aggregation system & method Download PDF

Info

Publication number
CA2450421C
CA2450421C CA2450421A CA2450421A CA2450421C CA 2450421 C CA2450421 C CA 2450421C CA 2450421 A CA2450421 A CA 2450421A CA 2450421 A CA2450421 A CA 2450421A CA 2450421 C CA2450421 C CA 2450421C
Authority
CA
Canada
Prior art keywords
size
transfer unit
packet
transmitter
lanes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CA2450421A
Other languages
French (fr)
Other versions
CA2450421A1 (en
Inventor
Wang-Hsin Peng
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Rockstar Consortium US LP
Original Assignee
Nortel Networks Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nortel Networks Ltd filed Critical Nortel Networks Ltd
Publication of CA2450421A1 publication Critical patent/CA2450421A1/en
Application granted granted Critical
Publication of CA2450421C publication Critical patent/CA2450421C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L12/5602Bandwidth control in ATM Networks, e.g. leaky bucket
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • H04L45/245Link aggregation, e.g. trunking
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/36Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/55Prevention, detection or correction of errors
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/50Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

Provided is a method and apparatus for segmenting packets into cells of variable sizes in order to facilitate the parallel transport of data symbols common to a single packet through a composite medium made up of a number of lanes. According to the invention the method of segmenting packets results in cell sizes that efficiently use the available capacity and minimize the complexity of any additional apparatus required in the receivers used to reassemble the packets from the variable-sized cells. Additionally, the invention could be advantageously combined with the Generic Framing Procedure (GFP) as defined in ITU-T G.7041/Y.1303 that was ratified 12/2001.

Description

15188ROUSOlU

Physical ~apaoitg Aggregation ~:~st~~ ~ Method Field of the ~nventio:n This invention relates to the parallel transport of data common to a single packet across a composite mediam made up of a number of sep:~rate lanes or channels.
Baokgro~nd of the Invention At the physical layer of a digital communication system, a transmitter transmits data over a medium (e.g. an optical fiber or an electrical back-plane) to a receiver. In many cases the medium simply defines a v~~ngle lane or channel that is used as a pipeline to carry data grouped in packets from a transmitter to a receiver. In other words, a packet originating from a transmitter travels through a single channel to a receiver so that the data s.ymbo:Ls of the packet arrive at the received_ sequentially.
Increasing the rate at which packets can be serially transmitted i_hrough an optical fiber, as a complete unbroken sequence of rata symbols, is becoming more expensive due to the extraordinary effort and rising costs of producing serial interfaces that can support increasingly higher data rate transmission and reception. Thus, the full capacity of optical fibers, in te_=ms of the amount cf dat:a that can be passed through them, ~s not always reali~;ed due to cost limitations. Consequently, this slows the development of technologies and serv__ces in associated and complementary fields.
One solution has been to use multiple physical media (or lanes) to form a composite medium (channel) rather than use only a single physical medium. In such a scheme, each lane of the composite channel may be a. single optical 15188ROUSOlU
2 fiber or a single well-delineated frequency :band within a wideband of frequencies supported by a single optical fiber as is the case in a typical DWDM architecture. Alternatively, a lane may exist within one optical fiber that is in a bundle of optical fibers, in which each optica=_ fiber in the bundle supports a set of well-delineated frequency bands within a wideband of frequencies.
Data common to a single packets or multiple packet of a single flow can be sent in paralle7_ across the multiple lanes of the composite medium. Beneficially, because the data common to a single packet or flow is simultaneously moving in parallel across multi=ple lanes, the rate at which the segmented data traverses any given lane can be significantly slower than the rate required to serial7_y send a whole unbroken packets) through a single channel (lane). In this way the multiple lanes form a composite channel that provides a high data rate, the high data rate achieved through the summation of a number of lower ceata rates corresponding to respective lanes contained within the composite medium.
Additionally, standard practice and common teachings in the art imply that each lane is treated as a separate physical layer in the communication system despite the obvious fact that each lane contrioutes to a single composite channel for a single point-to-point link/span.
As an example of the above, an optical fiber supporting a single 1~0 Gb~s channel may be replaced wits. four 2.5 Gbps channels operated in parallel. Each 2.5 Gbps channel may be realized as either a separate optical fiber or a single frequency band (channel) within a wideband of frequencies supported in a single optical fiber. This scheme theoretically maintains the desired capacity of the connection (10 Gbps), while enabling thE: use of less
3 expensive serial interfaces for each of the four 2.5 Gbps channels. It should also be understood from this example that the use of multiple lanes also allows greater granularity in selecting the combined capacity for a connection.
However, the use of multiple lanes does raise some difficulties. An obvious difficulty is that transmission and reception equipment must be provided for each lane and all such equipment must be synchronized so that the multiple lanes operate in unison to provide a composite channel capable of supporting the desired capacity.
Moreover, because each lane is treated as a separate ~ahysical layer, a packet that is to be sent across the composite medium, must be separated into a number smaller segments so that the complete packet wi__1 arrive at the receiver in a time representative of the desired high data rate. The packet segments can not be made too small because the real-rate at which meaningful data traverses the composite medium will be significantly .Lowered as a result of the required synchronization information that is added (typically within a header) to each segrnent. On the other end of the spectrum, if the segments are too large issues such as fitter, buffering and the requirement for extensive complex data equalization between the lanes will become problematic.
Clearly, at either end of the spectrum on this issue, the advantage of using multiple lanes significantly diminishes.
Another related issue is how to establish a procedure to keep track of the segments so that the packets can be correctly reassembled at the receiver, without adding too much costly overhead to each segmenl~. Previous solutions to these problems involved dividing a packet into a number of
4 smaller fixed-sized cells. However, this leads to what is commonly known as the '~65-byte problem". Typically, the fixed-sized cells are chosen to have a payload capacity of 64 bytes (a number chosen to be compatible with a number of data processing arid switching protocols). If packets are not evenly divisible by 64 (or whatever number is chosen to be the capacity of a cell's payload) then there will be a significant portion of the fixed-size cells transported through the composite channel that do not contain a high percentage of meaningful ir._formation (data). In fact, such cells may contain only small portions of meaningful information corresponding to the remain«er of the packet not divisible by the size of the fixed-size cell. Thus, the available capacity of the link ~ail1 not be efficiently used and the real rate at which data traverses the composite channel will be much lower than the desired capacity that the system was hoped to provide.
Prior efforts to resolve this problem, for example Link Aggregation (LA), facilitate a sysi~em where complete packets are transmitted over one lame, employ a packet traffic director to determine which pacl~et goes down which lane. However, to maintain packet transmission order the effectiveness of multiple lanes is now dependent on the decisior_ criteria such as a destination and source address pair. Furthermore, to support large packet sizes this scheme induces large delays, requires unruly arnou:nts of buffering at the receive-end and -reduces the goal of achieving a high transmission rate with the use of multiple lanes. In fact, if a packet is to arrive at a receiver in a time representative of the desired high data rate, the lane on which the packet is sent would 'nave to operate at the de:~ired high data z:ate.
Thus, a system based on LA would require costly serial interfaces if it is to provide a high d<xta rate link. Another prior solution commor.,.ly known as the Link Capacity Adjustment Scheme (LCAS) employs the use of fixed synchronous envelopes.
The envelopes are transmitted across the lanes periodically and the data symbols are interleaved among different
5 envelopes. Generally, other prior solutions do not provide a flexible transport scheme because they :z:etain the use of fixed-size data transport units (e. g. packets, cells, envelopes, etc.).
Suanmary of the Invention 1C According to one aspect of the present invention, there is provided a method of transmitt:i_ng in parallel data symbols common to a single packet having a packet size across a composite medium, the composite medium comprised of a plurality of separate lanes that conneci~ a transmitter and a receiver, the method com.prisingo segmeni~.ing the packet into a plurality of variable sized transfer units; and transmitting the plurality of variable sized transfer units from the transmitter to the receiver on the plurality of separate lanes.
In some embodiments the method comprises adding a unique sequence number to each of the plurality of variable size transfer units prior to transmission.
In some embodiments segmenting the packet into a plurality of variable sized transfer units is done subject to a constraint that each transfer unit has a respective size between a minimum transfer unit size and a maximum transfer unit size.
In some embodiments segmenting the packet into a plurality of variable sized transfer units is done subject to 15i88ROUSClU
6 a further constraint that a fewest possible number of transfer units are used.
In some embodiments segmenting t:he packet into a plurality of variable sized transfer units is done subject to the constraint that each transfer unit has a respective size between a minimum transfer unit size and a maximum transfer unit size and subject to the constraint that the fewest possible number of transfer units are used comprises:
determining a nominal transfer unit size; determining a i0 nominal number of transfer units accord_Lng to: nominal number of transfer units equals integer part of (packet size/norninal transfer unit size); if the packet size can be accommodated by the nominal number of transfer units each with a respective size between the minimum transfer unit size and the maximum transfer unit size, segmenting the packet into the nominal number of transfer units; otherwise, segmenting the packet into the nominal number of transfer units plus at least one additional transfer unit, each transfer unit having a respective size betc~~een the m~_nimum transfer unit size and the maximum transfer unit size.
In some embodiments the method further comprises determining the nominal transfer unit size as a function of link conditions of the composite medium.. In some embodiments the nominal transfer unit size is selected to be either the minimum transfer unit size or the maximum transfer unit size.
In some embodiments transmitting the plurality of variable sized transfer units from the t::~ans:mitter to th.e receiver on the plurality of separate lanes is done by distributing the transfer units in a round-robin fashion. to the plurality of lanes.

- 15188ROUSOlU
7 In some embodiments the method further comprises receiving an indication that at least o:r~e of said plura_Lity of lanes which lanes) has experienced failure or degradation wherein transmitting the plurality of variable sized transfer units from the transmitter to the receiver on the plurality of separate lanes is done only using working lanes of the plurality of separate lanes.
In some embodiments the method further comprises transmitting an idle pattern on the at .least one of said plurality of lanes which lanes) has ex;~erienced failure or degradation to enable fault recovery detection at a receiver.
In some embodiments the method further comprises transmitting the plurality of variable sized. transfer units from the transmitter to the receiver on the plurality of separate lanes is done suc'r~ that each of the plurality of separate lanes each carry respective signals that are of varying rates in relation to one another, the method further comprising adjusting the respective varying rates have been adjusted to compensate for delay induced by the size of the packet.
In some embodiments each transfer unit is defined with a frame structure comprising: l) a Payload Length indicator field (PLI)~ ii) a Core Header Error Control (cHEC) field; iii) a sequence number field; iv) a sequence number Header Error Control (sHEC) field; v) a transfer unit p<~yload (TUP) field into which a segment (i.e. grouping of data symbols) of the single packet is copied; and vi) a transfer unit Error Control (tuCRC) field.

15188ROUSOlU
8 In some embodiments the cHEC field contains a CRC-16 error control code, and the CRC-16 error control code is applied to the PLI field.
In some embodiments the sHEC field contains a CRC-16 error control code, and the CRC-16 errcr control code is applied to the sequence number field.
In some embodiments the tuCRC field contains a CRC-32 error control code, and the CRC-32 error control code is applied to the TUP field.
In some embodiments each sequence number field is comprised of a packet. number, a transfer unit indicia, and a lane number.
In some embodiments each sequence number field is further comprised of a time stamp field, the time stamp field containing a value indicating the time a particular transfer unit was transmitted.
In some embodiments each sequence number field is further comprised of a header extension field.
In some embodiments the packet number is a four-byte number unique to the single packet In some embodiments the transfer unit indicia comprises twc five-bit numbers ~Tf and M~, wherein Nf represents transfer unit number Nf of Mf, wherein Mf is a total number of transfer units derived from the single packet.
In some embodiments segmenting the packet into a plurality of variables sized transfer units is done subject to the constraint that each transfer unit has a respective size between a minimum transfer unit size and a maximum transfer 15188ROUSOlU
9 unit size and subject to the constraint that the fewest possible number of transfer units are used comprises: i) setting values TU min and TU max, the value TU min being the minimum size of a transfer unit and the value TU max being the maximum size of a transfer unit,; ii) setting the nominal transfer unit size, TU base size depending upon the condition of the composite medium; iii) calculating a minimum number of transfer units; iv) calculating a remaining number of data symbols for the packet that do not fit .into the minimum number of transfer units calculated in step iii); v) if the remaining number of data symbols is greater than zero distributing the remaining data symbols amongst the minimum number of transfer units calculated in step iii) if there is room to do so without increasing any transfer unit beyond TU max; vi) if the remaining number of data symbols is greater than zero and there is not room to distribute the remaining data symbols amongst the minir~~.um number of transfer units calculated in step iii), defining at least one additional transfer unit above the minimum number of transfer units calculated in step ~-ii) and distr~'~buting the entire packet over the minimum number of trans3'er units and the additional transfer units such that each 'transfer unit is at least as large as TU min and no larger than TU max; vii) adding a unique sequence number to each of the transfer units into which the packet has been segmented.
According to another aspect of the present invention, there is provided a method of receiving a packet transferred in a plurality of variable size transfer units from a composite transmission medium comprising a plurality of separate lanes, th~~ method comprising: receiving the plurality of transfer units from the plurality of separate lanes; performing delay equalization across all of the plurality of separate lanes; recombining the plurality of 1 t) transfer units received through the composite medium into the packet.
In some embodiments the method of receiving a packet further comprises detecting that one or more of the plurality of separate lanes has failed, a failure indicated by a lack of reception of any type of recognisable sequence of data symbols or incorrect reception of such data as detected by an error control code; signalling to a transmitter at another end of the composite medium on a working lane which lanes) have experienced failure (or degradation).
In some embodiments the method further comprises monitoring failed lanes for receipt of an idle pattern, and signalling the transmitter on a working lane that a failed lanes) has recovered. after detecting the idle pattern an the failed lane ( s ) .
According to another aspect of_ the present invention, there is provided a transmitter for transmitting in parallel data symbols common to a single packet having a packet size into a ccnposite medium, the composite medium comprised of a plurality of separate lames, the transmitter comprising: a segment~r for segmenting the packet into a plurality of variable size transfer units; and a physical layer interface adapted to transmit the plurality of variable sized transfer units from the segmenter into the composite medium.
In some embodiments the transmitter also comprises a plurality of rate adaptation circuits corlneCted between the segmenter and the physical layer interface, each of which can be controlled to set -'he a corresponding rate of transmission for each of the plurality of separate lanes.

15188ROUSOlU
1~
In score embodiments the segmenter of the transmitter is adapted tc segmer._t the packet into a plurality of Variable sized transfer units subject to a constraint that each transfer unit has a respecti Ve sizs= '_oetween a minirnum transfer unit size and a maximum transfer unit size.
In some embodiments segmenter segments the packet into a plurality of Variable sized transfer units subject to a further constraint that a fewest possible number of transfer units are useda In some embodiments the segmenter, in segmenting the packet into a plurality of ~rariable sized transfer units subject to the constraint that each transfer unit has a respective size betceeen the minimum transfer unit size and the maximum transfer unit size and subjE~Ct t0 the constraint that the fewest possible number of tran;>fer units are u:>ed~
is adapted to: determine a nominal transfer unit size;
determine a nominal number of transfer units according to:
nominal number of transfer units equals integer part of (packet size/nominal transfer unit size ; if the packet size can be accommodated by the nominal number of transfer units each with a respective size between the minimum transfer unit size and the maximum transfer unit size, segmenting the packet into the nominal number of transfer units~ otherwise, segmenting the packet into the nominal number of transfE:r units plus at least one additional transfer unit, each transfer unit having a respective size between the minimum transfer unit size and the maximum transfer unit size.
In some embodiments the transrlitter is adapted to determine the nominal transfer unit size as a function of link conditions of the composite medium,.

In some embodiments the transrn_itter is adapted to select the nominal transfer unit size to be either the minimum transfer unit: size or t:~e maximum transfer unit size.
In some embodiments the trans;~titter is further_ adapted to: receive ~:n indication that at least one of said plurality of lanes which lanes) has experienced failure or degradation; wherein the transmitter transmits the plurality of variable sized. transfer units to the receiver only on working lanes of the plurality of separate lanes.
In some embodiments the transmitter is further adapted to: transmit an idle pattern on the at least one of said plurality of lanes which lane{s) h<~s experienced failure or degradation to enable fault recovery detection at a receiver.
In some embodiments the transmitter adapted to transmit the plurality of variable sized transfer units from the transmitter to a receiver on the plurality of separate lanes does so such that each of the plurality of separate lanes each carry respective signals that are of varying rates in relation to one another, and the transmitter further adapted to adjust the respective varying rates to compensate for delay induced by the size of the pac~~.et.
According to another embodiment, there is prop,sided a system comprisinge the transmitter described above; said composite medium; and a receiver; where~_n the transmitter is connected to the receiver via the composite medium.
In some embodiments of the system the plurality of separate lanes comprising the composite medium each correspond to a respective plurality of well-delineated 15188ROUSOlU

frequency bands within a wideband of frequencies supported on a single optical fiberm In some embodiments of the system the plurality of separate lanes compring the composite medium are supported by a plurality of well-caelineated frequency bands distributed through-out multiple optical fiberso In some embodiments c:E the system the plurality of separate lanes comprising the composite medium each carry respective signals teat are substantially at the same rate in relation to one anotr.er.
In some embodiments of the system wherein the plurality of separate lanes comprising 'the composite medium each carry respective signals that are substantially at different rates in relation to one another<
?5 According to another aspect o:f the present invention, there is provided a receiver for receiving in parallel a plurality of signals from a composite medium comprising a respective plurality of separate lanes, the receiver comprising: a physical layer interface adapted to receive in parallel the plurality of signals; an equaliser adapted to perform equalization across the respective plurality of lanes or. the plurality of signals received;' and a recombiner adapted to reconstruct a packet from a plurality of variable size transfer units carried on the signals from the plurality of separate laneso In some embodiments the receiTfer is further adapted to detect that one or more of the plurality of separate lanes has failed, a failure indicated by a lack of reception of any type of recognisable sequence of data symbols or incorrect reception. of such data as detected by the use of an error control code.
In some embodiments the receiwe-r is further adapted to signal to a transn.itter located at another end of the plurality of separate lanes on a working lane which lane{s) have experienced failure {or degradation).
In some embodiments the recei~aer is further adapted to monitor failed lanes for receipt of an idle pattern, and signalling the transmitter on a working lane that a f.aiJ_ed lane has recovered after detecting the :idle pattern on the failed lane.
In some embodiments the receiver signals the transmitter on a working lane that a failed lane has recovered when the receiver detects an idle pattern on the failed lane.
Other aspects and features of the present invention will become apparent to those ordinarily skilled in the art upon review of the following description of specific embodiments of the invention in conjunct=ion 'with the accompanying figures.
~ri.ef D~s~r~pW on of the D~~~inc~s The invention will now be described in greater detail with reference to the accompanying diagrams, in which:
Figure 1A is a block diagram of an optical communication system according to one embodiment of the invention;
Figure 1B is a block diagram of an adaptation of the optical communica~~ion system illustrated in Figure 1A~

Figure 2 is a flowchart illustrating a method of segmenting a protocol.. data unit (or packet) into a number of smaller transfer units corresponding to those used in the embodiment of the invention used in Figure 1;
5 Figure 3 is a diagram of the structure of a transfer unit according to an embodiment of the invention;
Figure 4 is an efficiency plot comparing the example efficiencies of adaptations of the invention to prior solutions that employ fixed-size cells; and
10 Figure 5 is a state diagram dE~~icting the synchronization process provided in somEembodiments of the invention for dealing with lane failures within a composite channel connecting and transmitter and a receiver according to an embodiment of the invention.
15 Detailed Description of the Preferred Err~odiments In order to transport data cornman to a single packet in parallel across a composite medium so that the efficiency of a link is improved while the complexity and cost of apparatus employed is reduced, a method and apparatus for segmenting packets into variable sued transfer units (TU's) is provided. In some embodiments the method and apparatus according to the invention may be employed advantageously in combination with the Generic Framing Procedure (GFP) as defined in ITU-T G.7041/Y.1303 that was ratified 12/2001.
Referring to Figure 1A, illustrated is a block diagram of an optical communication system i00 according to one embodiment of the invention. A transmitter 8 is connected to a receiver 9 by a plurality of lanes L, to L., contained within a single strand or bundle o:E strands 60. For 15188RGUSOlU

simplicity the single strand or bundle of strands 60 will be referred to as a composite medium 60.
The lanes L~i to L~; supported by the composite medium 60 are used in parallel to establish a :Link, having a high data rate R, between the transmitter 8 and~the receiver 9.
Accordingly, each of the lanes L1 to L~ has a corresponding rate of transmission (i.e. rate) r1 to z:~, each of which is substantially lower than the high data :rate (R). In some embodiments each of the rates ri to rN is substantially equal to a rate r, which is approximately equ<zl to R/N, N being the total number of lanes (channels) suppor'~ed by the composite medium.
However, the rates r1 to rN do not necessarily need to be substantially equal to one another. For example, it is possible that, while the surnmation of the rates r1 to rN is substantially equal to R (and preferably somewhat greater), each one of the -rates r1 to r,~ is unique and less than R.
Referring still to Figure 1A, the transmitter 8 includes a combination of hardware, software and firmware grouped into functional blocks and layers. A first layer:
within the transmitter 8 is widely known as a TX Media Access Control (MAC) Layer 50 and is a combinai~ion of hardware,.
software and firmware whose broad function is to control how the transmitter 8 gains access to data and the process to transmit data. A commonly known second .Layer within the transmitter is a TX physical (PHY) layer 40 having the broad function of emitting the actual physical signal used to represent the encoded data symbols (for example, sequences of microwave electro-magnetic or laser light impulses) through the composite medium 60. In other words the TX PHY layer 40 is made up of elements such as serializers,. lasers, electro-15188ROUSOlU

1?
optic modulators and the like used to generate sequences of physical emissions representing information bearing symbols.
Traditionally, the functional :clocks in the Tx MAC
layer 50 would directly couple too and drive the elements of the TX PHY layer 40. However, provided by t:he present embodiment of the invention is a new functional layer embodied by a TX Physical Capacity AggrE:gation Scheme (PCAS) unit 10 connected between the TX MAC layer 50 and the T~ PHY
layer 40. The TX PCAS 10 comprises a secrnenter 25 that branches out to a plurality of N TX Transfer Unit Lanes (TULs) 22. Each of the N outputs of the segmenter 25 serves as a signal source for a corresponding lane r~-_ to LN within the composite medium 6G. The TX PCAS unit 10 (and thus the N
outputs of the segmenter 25) is connected to the composite medium 60 via the TX PHY layer 40.
The receiver 9 similarly includes a combination of hardware, software and firmware grouped into functional blocks and layers corresponding to those found within the transmitter 8. The receiver 9 also has a PHY layer and MAC
layer shown in Figure 1A as RX PHY layer 42 and RX MAC layer 52. The RX PHY layer 42 and RX MAC layer 52 have complementary functions and apparatus to the 'I'x PHY layer 40 and TX MAC
layer 50 in the transmitter 8. The RX PHY layer 42 and Rx MAC
layer 52 are traditionally connected directly to one another.
According to the present embodiment of the invention a Rx PCAS
unit 12 is connected between the Ry PHY layer 42 and RX MAC
layer 52. The RX PCAS unit 12 provides the complementary functions to that of v~he TX PCAS unit 10 in addition to equalization of the received data to compensate for anomalies amongst the lanes that make up the composite medium 60.

Specifically, the R~ PCAS unit: 12 comprises a plurality of RX TULs 34 (i.e. internal receive-side lanes) coupled to respective delay equalizers 32 for each lane Ll to LN respectively. The outputs of the delay equalizers 32 for the lanes Ll to Lr, are aggregated within a reassembler 35, which in turn is coupled to deliver an output to the RX MAC
layer 52. Each of the plurality of RX TULs 34 is coupled to a respective lane Ll to L.within the composite medium 60 via the RX PHY layer 42.
In operation, the optical communication system 100 shown in Figure 1A operates to transpori~ data common to a single packet (or more generally protocol data units (PDU°s)) in parallel, through the composite medium 60. Beginning in the transmitter 8 the TX MAC layer 50 delive_~s to the TX PCAS
unit 10 a TX PDU 6. Generally, a typical PDU contains a large number of bytes NpD~ that are to be sent to the receiver 9 at a rate representative of R, the desired rate. The rate R at which the PDU is to be transmitted can be known by the TX PCAS
unit 10 a priori or information about the rate R can be sent from the TX MAC layer 50 to the TX PCAS unit 10.
Once a PDL? has been accepted by 'the TX PCAS unit 10 the segmenter 25 proceeds to divide the TX PDU 6 into smaller variable sized transfer units ('fU's). The TU°s are also formatted and assigned sequence numbers (and/or a time stamp, along with other header information) to facilitate re-assembly of data originating from TX PDU 6. The method of segmentation of a PDU into variable sized 'transfer units is described in detail below with reference to Figure 2. The TU's are then distributed among the TX TULs 22, from which they are passed to the TX PHY layer 40. The elements for the corresponding lanes L1 to LN witzin the '~X PHY layer 40 are then operated at the rates r1 to rN _respectively to transmit the TU's through the composite medium 60. It would be appreciated by those skilled in the art that the TX PCAS unit is supported by a combination of hardware, software and firmware and described above is the combined functional~_ty of 5 those elements.
At the receiver 9 TU's arriving on the respective lanes L1 to LN are first received by the elements of the RX
PHY layer 42 where they are converted from optical signals to electrical signals, and tr:en directly passed to corresponding 10 RX TULs 34. The RX TULs 34 receive TU's on each of the lanes L, to L~, at respective rates r1 to rN. Th.e delay equalisers 32 compensate for differences in the respective signals and pass the TU's from each lane L1 to LN to the reassembler 35. There are a number of factors, such as the physical inconsistencies between lanes that may add to propagation delays and frequency drift experienced by signals traversing the composite medium 60. Consequently, the respective received signals differ because of uncontrollable parasitic delays and frequency drift such that the rates r1 to r~, cannot be guaranteed to be equivalent to one another once the respective signals reach the receiver 9.
The de wy equalizers 32 and the reassembler 35 use the sequence numbers assigned to the TU's in the transmitter 8 to reconstruct the veceived TU's into P~X PDU ?. The RX PDU 7 should be equivalent to Ta PDU 6 barring any catastrophic errors, for example, errors that could not be corrected by using error control coding. Various forms of error control could be employed to complement the present invention, as is the case for most other systems. The receiver 9 may also signal to the transmitter 8 that a PDU has or has not been successfully reconstructed. In the event that a PDU has not been successfully reconstructed that receiver 9 may request 15188ROUSOlU

that one or more of the TU's that make u~ the PDU be resent or that the entire set of TU°s be resenr~<
It should again be stressed that the rates r1 to rN
are each significantly lower than the rate R; but employed in 5 parallel the rates r1 to r~ can be used to transport data through the composite medium 60 at a rate substantially equivalent to R, the desired rate. The efficiency with which the bandwidth within each of the lanes is used is substantially increased because the method used to segment 10 the PDU's uses variable-size cells. Thus, the capacity of the link is almost fully realized. This will be discussed in detail below in relation to Figure 4.
Shown in Figure 1B is an adapt:atioz of the invention presented i;z Figure 1A. Figure 1B .is similar t.o 15 Figure 1A, thus like components are labelled as they are: in Figure 1A. In the adaptation of the invention shown in E'igure 1B the TX PCAS unit 10 has been :modified to include a plurality of rate adapter circuit blocks 24. Each of the rate adapter circuit blocks 24 is coupled between an output of the 20 segmenter 25 and the TX PHY layer 10 on each of the plurality of TX TULs 22 respectively. Accordingly, TU's are sent to respective rate adapter circuit blocks 2~ which override the function of the TX PHY layer 40 to the e.Ytent that the transmission rates r1 to rN are now controlled by the respective rate adapter circuit blocks 2i.
The rate adapter circuit blocks 24 can dynamically adjust the rates r1 to rN to new rates rl~ to r~~ in order to maintain R as the real rate at which data in carried through the composite channel 60. The newly adjusted rates rl~ to rN, remain less than R, the desired real rate. Preferably the number of lanes L1 to LN comprising the composite medium is chosen so that the ma~_ginal increases to ratE:s rl to rN
required to sustain tine real rate at a value close to R falls within a known and controlled range.
Shown in Figure 2 is a flow chart 300 detailing the method steps the TX PCAS unit 10 of Figure 1A follows to segment a PDU into smaller TU's. For the sake of the present discussion the smallest data unit considered is a byte (i.e.
an 8 bit binary segue:~:ce), but it should be understood that the invention is not constrained to the use of bytes, as other base units could be used.
Definitions for the terms °'TU ruin", °'TU max" a.nd °'TU base size" are given below and hereinafter used to a.id in the description of the method steps illustrated by Figure 2.
The term TU base size is an initial sizE: of all transfer units and its value ranges from TU min too TU max, where TU min and TU max are system parameters defining the minimum and maximum sizes of any given transfer unit respectively.
The parameters TU min and TU max can be set by automated processes that generate optimum values for each. The actual value of TU base size is dete_rm~_ned as a. function of link conditions. In some embodiments TU base size is selected to be either TU min or TU max only for a gi~ren PDU based on the current link conditions. Also, in some embodiments TU rnax is defined to have a value double that of TU min (i.e. TU max =
2TU min). In some embodiments, TU min is calculated to minimize fitter at the expense of latency.
By way of overview, a number Mf of transfer units having an initial size of TU base size :is initially defined where:
Mf = Integer part of (NDpU/Tt~ base size} (1) However, unless TU base size divides NpD~ evenly, the number Mf of transfer units each having a size of TrJ base size will not provide a combined capacity required to accommodate the entire contents of a given PDU. Thus, as will be detailed below, one or more of the transfer units is adjusted in capacity and possibly a single additional -transfer unit, being no smaller than TU min, may be added to accommodate the contents of the given PDU depending upon the current link conditions.
Referring now to Figure 2 and raith further reference to Figure 1A, by default the 'Px PCAS unit 10 will loop through an insert idle step 301 whale the TX PCAS unit 10 awaits a PDU to process from the TX MAC layer 50. At step 302 the TX PCAS unit 10 receives a PDU from the TX MAC layer 50.
It would be understood in the art that inhere would typically be a handshaking and acknowledgement procedure between the TX
PCAS unit i0 and the TX MAC layer 50 for this step to take place reliably.
In either case, the Tx PCAS unit 10 would then.
proceed to determine TU base-size at stE~p 304. TU base size (initial size of a transfer unit), in some embodiments is set to either TU min (the minimum possible size of a transfer unit) cr TU max (the maximum possible size of a transfer=
unit). The transfer unit base size (TU lsase_.size) may be adjusted up to TU max to ta'.~ce advantage of favourable kink conditions and high available data rates at any time.
For example, TU min could be .set at 64 (bytes) and TU max at 128 (bytes). The TU base size in favourable 1_ink conditions might be set as high as 128.
The next step 306 is to calculate the number Mf of TU9 s . The number Mf o:f TU° s required depends on I~pDU

TU base size and by T;.' max. The number NI~ of TU's required is determined in step 306 to be the integer portion of the quotient of the PDU size Npp~ (in bytes) divided by the TU base size parameter as indicated in equation (1) presented above. The integer of the quotient is the integer portion of a real number obtained by truncating the number to the nearest unit value.
Upon completion of step 306 the TX PCAS unit 10 has established the number Mf of TU's into ~rhich the PDU will be placed, and all of the TU°s share a common TU base size..
However, the PDU size NpD~ (in bytes) is not guaranteed to be evenly divisible by TU base_size and as a result there may be a remaining number of bytes that must be distributed among the existing TU's or allocated to a single new TU.
The remaining number of bytes can be calculated either by subtractinc the product of TU base size and the number M~ of TU's from NPD;; or by perforrning a calculation of the MOD (NIodulus ) of NPD;~ in relation to TU base size . Both procedures will yield identical results. Thus, in step 308 the TX PCAS unit IO calculates the remaining number of bytes, otherwise known as the remainder, and in step 310 a comparison is made to determine whether or not the remainder is eaual to zero.
At step 310 if the remainder is equal to zero (yes path, step 310), the TX PCAS unit 10 proceeds to step 312 in which the contents o- the PDU are transferred directly into the TU's. The TX PCAB~ unit 10 acts to keep track of how a PDU
is segmented as the PDU's contents are transferred into the TU's.
On the other hand, if the remainder is not equal to zero (no path, step 310), the Tz PCAS unit 1.0 proceeds 'to step 311a At step 311 the TX PCAS unit 10 determines whether or not any or all of the number Mf of TU's already defined can be adjusted in terms of their capacity to accommodate the remaining number of bytes (i.e. the remainder) without exceeding TU max.
If the capacity prcvided by tree number Mf of TU' s can be adjusted to accommodate remainde:= (yes path 311), the T~ PCAS unit 10 p~.~oceeds to step 314. At: step 314 the capacity of some of the TU' s rnay be increased so that the remain_~_ng bytes can be distributed among the plurality TU's or appended to one TU. In other words, befo=~e the PDU is segmented and moved into the TU°s, extra bytes a_re al:Located to a number of the TU°s so that the entire PDU can be segmented and moved into the number Mf of TU's. In some embodiments extra bytes are evenly allocated to a number of TU's so that the remaining bytes are as evenly distributed amongst the plurality of TU's as possible. It should be clear that the remaining number of bytes is less than the 'fU base size.
Alternatively, if the capacity provided by thf~
number Mf of TU's can not be adjusted to accommodate the remainder (no path 311), the TX PCAS un_Lt 10 proceeds to step 313. At step 313 an ~.dditional TU is defined to contain the remaining number of bytes (i.e. the remainder). More generally, the entire PDU is redistributed in some manner over Mf + 1 TU's, subject to the constraints that no TU has a size less than TU min, and no TrJ has a size greater than TU max. Preferably, the Mf + 1 TU's are made as close as possible in size. If the remainder is less than TU min, then it would be necessary that the contents of at least one of the My TU's defined with size TU base size will need to be redistributed to the M~ + 1S' TU so that no '7:'U has a size less than TU min.

In some embodiments the caay the additional TU is defined at step 313 is dependent upon the size of the remainder and TU base size in relation to TU min and TU max.
The following specific implementation examples assumes TU max 5 - 2 TU min.
If TU base size was chosen to 'oe TU min and the remainder is less than TU min, then the remainder would have been distributed among the Mf TLT's as described in step 314 (i.e. the TX PCAS unit 10 would not have proceeded to this 10 point) .
However, if the rarnainder is greater than TU rnin and since for these specific circumstan~~es, there will be room in the Mf TU's for the rem~_inder, another TU is defined that is the size of the remainder, which is larger than 15 TU min and smaller tr-an TU max (since TU rnax = 2TU min).
If the TU base size was chosen to be TU max and the remainder is less than TU min then the rernai.nder cannot be redistributed over the Mf TU's, and a ne~a TU having a size equal to the remainder will be smaller than TU min which is 20 not allowed. Therefore, some redistribution over Mf + ~_ TU's is necessary. For the specific implementation where TU max =
2 TU min, one of the original Mf TU°s (leaving a initial size of TU max) can be sp~_it into two TU's each having an initial size of TU min (again re,~~ying on the fact that TU max =
25 2TU min). The remainder can then be split amongst the two TU's just defined having an initial size of TU min. On the other hand, if the remainder is greater than TU min, then a new TU can be defined having an initial size of TU min; but then the new TU is adjusted in size to provide enough capacity for the ent_Lre remainder.

15188ROUSOlU

As a numeri:Jal example of the above, say there is a PDU having 20 bytes and TU min is 6 bytes and TU base size is chosen as the TU min. From the above discussion following through from steps 302 to the ir:.stant before step 320 the TX
PCAS unit 10 would define three TU°s (i.e. Mf = 3), each initially with a capacity of 6 bytes. Wish an initial capacity of 6 bytes only 18 bytes cf the 20-:byte PDU would fit into the three TU's. Prior art solutions would have the system add a fourth 6-byte TU, but that TU would obviously contain 4 bytes of meaningless information or padding, thus reducing the efficiency of the link. According to one embodiment of the invention extra capacity for the 2 remaining bytes is allocated to two of ':,he three TU's. Thus, there would be two TU's with a capacity of 7 bytes and the third with a capacity of 6 bytes. All three TU's would now have a total combineG. capacity that provides space for all of the contents of the 20-byte PDU. Preferably, in this example, the 20-byte PDU is segmented in sequence so that its bytes 0-6, 7-13 and 14-19 car. be moved into the two 7 bytes TU's and the one 6 byte TU respectively. Alternatively, the two remaining bytes could have been allocated to one of the three transfer units, as long as the addition of the two remaining bytes did not increa'~e the transfer unit they were added to beyond TU max.
If the TU base size was selected to be TU max and there was a remainder, the operation of the TX PCAS unit 10 would follow steps 37_1 and 313 from 310. As an alternative but related example, suppose that TU min is 6, TU~max is 12, i.e. TU max = 2 TU mv~n, and suppose the very specific TU
splitting method described above for this scenario is being implemented. Assume that the PDU size is 27 bytes and the TU base size has been chosen tc be TU max due to favourable link conditions. In this case the initial number Mf of TU's calculated would be two. However, two 1:? byte TU's would only provide enough capacity to transport 24 bytes of the 27. In this case, one of the two 12 bytes TLT's would be split into two 6 byte TU's (at step 313) and there would then be a total of 3 TU' s ( i . a . Mf + 1 ) : ene 12 byte TU and 'two 6 byte TU' s .
The remaining 3 bytes would be divided between the two ~ byte TU's to provide all of the desired capacity (27 bytes).
However, suppose that the PDU size is 23 and TU base size remains set at TU max (12). In this case, the initial number of TU's required would be one; but that would only provide enough capacity for 12 of the 23 bytes. There would be a total of remaining 11 bytes (a number greater than or equal to TU min and less than TU max}. These 11 bytes would require at learnt one more TU of 6 bytes to which .' bytes of capacity to the TU could be added without violating the maximum size of a transfer unit specified by TU max.
Following ~>teps 312 or 313 or 314, in step 320 sequence numbers are assigned to each of the TU's. The details of the sequence numbers are elaborated upon further on in relation to Figure 3. And finally, at step 324 each of the TU° s is transmitted across one of the lanes L1 to LN that the particular TU has been assigned to. In preferred embodiments of the invention, the TU's are assigned to the different lanes L1 to LN in a round-robin fashion, in order to evenly distribute the TU's thrcughout the composite medium 60. It is conceivable that other schemes for distributing the TU' s may be used for various ot'_ner rea.~;ons, however the round-robin type distribution is simple and uses the available bandwidth efficiently.

.- 15188ROTJS01U

Referring to Figure 3, shown ..s an example of a TU
frame structure 61 according to a preferred embodiment of the invention. The TU frame structure 61 complies with the Generic Framing Procedure (GFP) as defined in ITU-T
G.7041/Y.1303 that was ratified 12/2001 and the entire contents of which are herein incorporated by referenoe.
A first field in the TU frame structure 61 is a Payload Length Indicator (PLI) field 60. According to the GFP
the PLI field 60 is two bytes long and .indicates the number of bytes in the payload area of a frame. In the present embodiment the payload (to be discussed in more detail further on) will store a segment of a PDU.
A second field in the TU frame structure 61 is a two-byte Core Header Frror Control (cHEC) field 62. Again according to the GFP the cHEC contains a CRC-16 error control code that protects the integrity of the contents of the PLI
field 60 in combination with the cHEC field 62 by enabling both single-bit error correction and mufti-bit error detection.
A third field, specific to the present embodiment of the invention, is a sequence number field 64, having four bytes. The sequence number field 64 is provided, in place of a Payload Information Field (PIF) that was originally specified in the GFP, according to the present embodiment of the invention. This does not adversely effect the TU frame structure 61 as it relates to the GFP specification, but it does allow for customization of the TU frame structure 61 to meet the desired requirements of the present invention.
In some embodiments the sequE:nce number field. 64 is comprised of three sub-fields. Tn orie embodiment of the invention the maximum payload size for a PDl7 is 2048 bytes 15188ROUSOlU

and TU min is set at 64 bytes. The first: of the three sub-fields is a four-bit packet number field used to distinguish TU's belonging to the same or d-.fferent packets. The second sub-field is composed of two 5-bit binary numbers Nf and Mf, where Nf indicates TU Nt out of 11f total TU's belonging to a PDL'. The third sub-field is a 4-bit sequence representing which lane L1 to L~ a TL1 is carried on.
In some embodiments four additional sub-fields are provided consisting of a time stamp sub--field, a type sub-field, a tuCRC presence sub-field, and header extension sub-field, which maybe each employed as required.
Similar to the second field, g>rovided as a fourth field in the TU frame structure 61 is a Sequence Header Error Control (sHEC) field 66. The sHEC field 66 also contain, (in two bytes) a CRC-16 error control code that protects the integrity of the contents of the sequence number field E>4 in combination with the sHEC field 66 by enabling both sinc~le-bit error correction and mufti-bit error detection acro~>s the two fields (64 and 66).
A fifth field in the TU frame structure is a TU
Payload (TUP) field 68. It is within the TUP field 68 that a corresponding segment of a_ PDU is carried through a lane. The TUP field 68 size will be at least TU min and at most TL1 max.
The TUP field 68 is expanded (to a maxirnum of TU max) upon accordingly in order to ensure that there is enough capacity in all the TU°s corresponding to a single PDU.
The final field in the TU frarne structure 61 is a four-byte CRC field, known as the tuCRC field 70. The tvzCRC
field 70 contains a CRC-32 error control code that protects the integrity of the contents of the TUI? field 68 in 15188ROUSOlU
combination with that of the tuCRC field 70 by enabling both single-bit error correction and multi-bit error detection.
In preferred embodiments of the invention the CRC-16 error control codes used in the cHEC field 62, and the 5 sHEC field 66, may be the same CRC-16 error control code as they are applied independently to different portions of the TU frame structure o1. The tuCRC is a CRC-32 error control code because a higher polynomial CRC is preferred due to the large number of data bits, i.e. pre-coded TUP bits. This 10 latter field is optional because the PDU maybe covered by a frame check sequence which may be validated by the receive client which would mG.ke the tuCRC redundant. Moreover, the three codes may be applied in varying ways. Varying methods of applying CRC error control codes are known in the art and 15 it would be understood by those in the art that a particular method can be used to obtain a particular result.
Figure 4 shows calculation results comparing the efficiencies of adaptations of the invention to prior solutions that employ fixed-size cells. Specifically, 20 referring to plot 73, depicted is the efficiency plot for a standard 64-byte fixed-size cell. The ploy 73 clearly illustrates that the efficiency for a syster:~ using 64-byte fixed-size cells var-~es wildly from well below 50o to 90% at best. In practical c=_rcumstances it is difficult to ensure 25 that every packet (or PDU) is divisible by a specific cell size. Thus, the effi~iency of the link in practice can not be guaranteed to be high most of the time. Cansequently, the real rate of data th~~oughput is degraded significantly.
Alternatively, referring to plots 77 and 75 30 respectively, for adaptations of the ir..vention simulated where the number of '!'U's used to transfer an aribitary PDU is either maximized (smallest TU size used) or minimized (larger TU values used) the efficiency varies very little. On average the efficiencies are typically better than 87o most of the time for both adaptations and consistently well over 90% when TU base size is maximized. The variable TU sizing (between 64-128 bytes) removes the ineff:icie:ncy. It would be understood that the efficiency could not: actually be lOCo since each TU must ccntain header information that is considered overhead that degrades the efficiency of the system. In fact, if TU min is too small the efficiency would be seriously degraded since there would be a disproportionate amount of header information required for the resulting large number of TU's per PDU.
During Operation, Administration and Management (OA&M) of an optical communication system Iike the one ~,hown in Figure 1 it would be desirable for the receiver 9 to signal the transmitter 8 in the event of a lane failure.
Shown in Figure 5 is a state diagram 200 illustrating the synchronization process between the transmitter 8 and the receiver 9 in which the receiver 9 handles the detection and signalling of a lane failure. A failure could be signal degrade (SD) introducing excess bit error, as detected by tuCRC or signal fail (SF) such as lost of optical signal.
In the event of a lane failure, if the individual lane transmission rates of the remaining operational lanes are not adjusted then the combined rate is reduced by the capacity lost from the failed lane. That is, the summation of the remaining rates will be less than th.e desired combined rate (i.e. capacity) R by an amount equal to the rate of the failed lane before it failed.

The transmitter 8 at the near er~d sends to the receiver 9 at the far end. Similarly, the far end transmitter sends data to the near end receiver. When the far end receiver detects a failure, such as SD o_r SF, the status should be relayed to the rear end so the defective lane will not be used in the composite medium 60. rJpon receiving a.
signal from the receiver 9 that a lane or a group of lanes are not available for reliable transmis:~ion the transmitter 8 will skip over the failed lanes) for data transmission until such time that the receiver 9 signals that the lanes) are again reliable for transmission. However, the transmitter 8 in some embodiments transmits an OA&M idle signal through the lanes) that were designated unreliable to enable the receiver 9 to detect fault recovery. In the event that the lanes(s) recover from a fault the receiver 9 will then tsignal to the transmitter 8 and the transmitter will then re- -establish data transmission through the recovered lane(s).
The receiver g will then operate to monitor the recovered lanes) for valid TU's and aui~omatically attempt to reassemble a PDU based on reoeived TU's. All of the lanes would be preferably bi-directional, and so fault signal:
could be transmitted from the receiver '~ to the transmitaer 8 on any working lane. Otherwise remote fault signalling will have to be used to indicate the failure of the complete channel rather than failure of a signal .lane. The two options are degraded performance under a failure of a lane or a complete failure of the channel due to one lane failure, Referring to Figure 5 and imagining an arbitrary lane, it can be initially assumed that i~~~e receiver 9 is in an initial search state 80. While in the search state 80 the receiver 9 monitors the arbitrary lane :Eon either an id)_e signal or valid TU. If either of the two aforementioned is detected on the arbit:vary lane the recei;rer 9 proceeds to a second state, known as the recovery state 82 in which the receiver is looking specifically for a valid TU. A valid TU
includes idle signal received without error. A TU detected for the previous state transition 91 into the recovery state 82 can be used again for a state transition 93 from the recovery state 82 into a locked state 84.
The receiver 9 remains in the ioc:ked state 84 in regard to the arbitrary lane as long as the :receiver is receiving TU°s througz the arbitrary lane being considered.
If the receiver 9 det~~cts a signal fault or rather a lane fault due to a lack of reception of any type of signal on the arbitrary lane or TU received with errors, the receiver 9 changes state to the 'aunt state 86. The receiver 9 would. also signal the transmitter through a return lane (in the case of bidirectional configuration this is in the opposite direction) that the lane being monitored is not reliable for data transmission. However, if the receiver 9 receives a.
valid TU while in the hunt state 86 it will change states back into the locked state 82. This type of situation rna.y occur when there is bit error or. the medium causing the error control module to discard a received TU.
Alternatively, from th.e hunt state 86, the receiver may either move through a state transition 92 to the recovery state 82, if it were to receive an OA&M idle signal, or move through state transition 96 to the initial search state 80 if no signal were present on the arbitrary lane being considered. The hunt state 86 provides a faster recovery of the lane in case of a error condition which transient.
Persistence error conditions will cause the state machine to transit to the initial state 80.

What has been described is merely 3_llustrative of the application of the nrinoiples of the invention. Other arrangements and methods can be implemented by those skilled in the art without departing from the spirit and scope of the present invention.

Claims (25)

CLAIMS:
1. A method of simultaneously transmitting, in parallel, data symbols common to a single packet across a plurality of separate physical lanes supported by a composite medium and collectively forming a link between a transmitter and a receiver, the packet having a packet size, the method comprising:

segmenting the packet into a plurality of variable sized transfer units subject to the constraint that each transfer unit has a respective size between a minimum transfer unit size and a maximum transfer unit size and subject to the constraint that the fewest possible number of transfer units are used, the step of segmenting comprising:

i) setting values TU_min and TU_max, the value TU_min being the minimum size of a transfer unit and the value TU_max being the maximum size of a transfer unit,;

ii) setting a nominal transfer unit size, TU_base_size, depending upon a condition of the composite medium;

iii) calculating a minimum number of transfer units by dividing the packet size by the nominal transfer unit size;

iv) calculating a remaining number of data symbols for the packet that do not fit into the minimum number of transfer units calculated in step iii);

v) if the remaining number of data symbols is greater than zero distributing the remaining data symbols amongst the minimum number of transfer units calculated in step iii) if there is room to do so without increasing any transfer unit beyond TU_max;

vi) if the remaining number of data symbols is greater than zero and there is not room to distribute the remaining data symbols amongst the minimum number of transfer units calculated in step iii), defining at least one additional transfer unit above the minimum number of transfer units calculated in step iii) and distributing the entire packet over the minimum number of transfer units and the additional transfer units such that each transfer unit is approximately the same size, at least as large as TU_min, and no larger than TU_max;
vii) adding a unique sequence number to each of the transfer units into which the packet has been segmented;
and transmitting the plurality of variable sized transfer units from the transmitter to the receiver such that at least some of the data symbols common to the single packet are transmitted simultaneously from the transmitter to the receiver in parallel over at least some of the plurality of separate lanes of the composite medium interconnecting the transmitter and receiver and forming the link between the transmitter and receiver.
2. The method according to claim 1, wherein the nominal transfer unit size is selected to be either the minimum transfer unit size or the maximum transfer unit size.
3. The method of claim 1, wherein transmitting the plurality of variable sized transfer units from the transmitter to the receiver on the plurality of separate lanes is done by distributing the transfer units in a round-robin fashion to the plurality of separate lanes.
4. The method of claim 1 further comprising:

receiving an indication that at least one of said plurality of lanes has experienced failure or degradation;
wherein transmitting the plurality of variable sized transfer units from the transmitter to the receiver on the plurality of separate lanes is done only using working lanes of the plurality of separate lanes.
5. The method according to claim 4 further comprising:
transmitting an idle pattern on the at least one of said plurality of lanes that has experienced failure or degradation to enable fault recovery detection at a receiver.
6. The method according to claim 1, wherein transmitting the plurality of variable sized transfer units from the transmitter to the receiver on the plurality of separate lanes is done such that each of the plurality of separate lanes each carry respective signals that are of varying rates in relation to one another, the method further comprising adjusting the respective varying rates to compensate for delay induced by the size of the packet.
7. A method according to claim 1, further comprising:
defining each transfer unit with a frame structure comprising:
i) a Payload Length indicator field (PLI);
ii) a Core Header Error Control (cHEC) field;
iii) the a sequence number field;

iv) a sequence number Header Error Control (sHEC) field;

v) a transfer unit payload (TUP) field into which a segment (i.e. grouping of data symbols) of the single packet is copied; and vi) a transfer unit Error Control (tuCRC) field.
8. The method according to claim 7, wherein cHEC field contains a CRC-16 error control code, and the CRC-16 error control code is applied to the PLI field.
9. The method according to claim 7, wherein SHEC field contains a CRC-16 error control code, and the CRC-16 error control code is applied to the sequence number field.
10. The method according to claim 7, wherein tuCRC field contains a CRC-32 error control code, and the CRC-32 error control code is applied to the TUP field.
11. The method according to claim 7, wherein each sequence number field is comprised of a packet number, a transfer unit indicia, and a lane number.
12. The method according to claim 11, wherein each sequence number field is further comprised of a time stamp field, the time stamp field containing a value indicating the time a particular transfer unit was transmitted.
13. The method according to claim 12, wherein each sequence number field is further comprised of a header extension field.
14. The method according to claim 11, wherein the packet number is a four-byte number unique to the single packet, such that each transfer unit associated with the single packet contains the same packet number.
15. The method according to claim 11, wherein the transfer unit indicia comprises two five-bit numbers N f and M f, wherein N f represents transfer unit number N f of M f, wherein M f is a total number of transfer units derived from the single packet.
16. A transmitter for transmitting in parallel data symbols common to a single packet having a packet size into a composite medium, the composite medium comprising a plurality of separate lanes and forming a link between the transmitter and a receiver, the transmitter comprising:

a segmenter for segmenting the packet into a plurality of variable sized transfer units, the segmenter being configured to segment the packet subject to the constraint that each variable sized transfer unit has a respective size between a minimum transfer unit size and a maximum transfer unit size and subject to the constraint that the fewest possible number of transfer units are used, the segmenter further being configured to segment the packet by:
i) setting values TU_min and TU_max, the value TU_min being the minimum size of a transfer unit and the value TU_max being the maximum size of a transfer unit;

ii) setting a nominal transfer unit size, TU_base_size, depending upon a condition of the composite medium;
iii) calculating a minimum number of transfer units by dividing the packet size by the nominal transfer unit size;

iv) calculating a remaining number of data symbols for the packet that do not fit into the minimum number of transfer units calculated in step iii);
v) if the remaining number of data symbols is greater than zero distributing the remaining data symbols amongst the minimum number of transfer units calculated in step iii) if there is room to do so without increasing any transfer unit beyond TU_max;
vi) if the remaining number of data symbols is greater than zero and there is not room to distribute the remaining data symbols amongst the minimum number of transfer units calculated in step iii), defining at least one additional transfer unit above the minimum number of transfer units calculated in step iii) and distributing the entire packet over the minimum number of transfer units and the additional transfer units such that each transfer unit is approximately the same size, at least as large as TU_min, and no larger than TU_max;

vii) adding a unique sequence number to each of the transfer units into which the packet has been segmented;
and a physical layer interface adapted to transmit the plurality of variable sized transfer units from the segmenter onto the plurality of separate lanes forming the composite medium, to enable the packet to be transmitted on the plurality of separate lanes as a the plurality of variable sized transfer units such that at least some of the data symbols common to the single packet are transmitted simultaneously from the transmitter to the receiver in parallel over at least some of the plurality of separate lanes of the composite medium interconnecting the transmitter and receiver and forming the link between the transmitter and receiver.
17. The transmitter of claim 16, further comprising a plurality of rate adaptation circuits connected between the segmenter and the physical layer interface, each of which can be controlled to set a corresponding rate of transmission for each of the plurality of separate lanes.
18. The transmitter of claim 16 further adapted to select the nominal transfer unit size to be either the minimum transfer unit size or the maximum transfer unit size.
19. The transmitter of claim 16 further adapted to:
receive an indication that at least one of said plurality of lanes has experienced failure or degradation;

wherein the transmitter transmits the plurality of variable sized transfer units to the receiver only on working lanes of the plurality of separate lanes.
20. The transmitter of claim 19 further adapted to:

transmit an idle pattern on the at least one of said plurality of lanes has experienced failure or degradation to enable fault recovery detection at a receiver.
21. The transmitter according to claim 16, wherein each of the plurality of separate lanes carry respective signals that are of varying rates in relation to one another, and the transmitter is further adapted to adjust the respective varying rates to compensate for delay induced by the size of the packet.
22. The transmitter of claim 16, wherein the plurality of separate lanes comprising the composite medium each correspond to a respective plurality of frequency bands within a wideband of frequencies supported on a single optical fiber.
23. The transmitter of claim 16, wherein the plurality of separate lanes comprising the composite medium are supported by a plurality of frequency bands distributed through-out multiple optical fibers.
24. The transmitter of claim 16, wherein the plurality of separate lanes comprising the composite medium each carry respective signals that are at the same rate in relation to one another.
25. The transmitter of claim 16, wherein the plurality of separate lanes comprising the composite medium each carry respective signals that are at different rates in relation to one another.
CA2450421A 2002-11-22 2003-11-21 Physical capacity aggregation system & method Expired - Fee Related CA2450421C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/301,681 US7508846B2 (en) 2002-11-22 2002-11-22 Physical capacity aggregation system and method
US10/301,681 2002-11-22

Publications (2)

Publication Number Publication Date
CA2450421A1 CA2450421A1 (en) 2004-05-22
CA2450421C true CA2450421C (en) 2011-09-27

Family

ID=32229905

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2450421A Expired - Fee Related CA2450421C (en) 2002-11-22 2003-11-21 Physical capacity aggregation system & method

Country Status (4)

Country Link
US (1) US7508846B2 (en)
EP (1) EP1422890B1 (en)
CA (1) CA2450421C (en)
DE (1) DE60317027T2 (en)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7653924B1 (en) * 2003-10-01 2010-01-26 Cisco Technology, Inc. Digital video streaming over optical network
US6995695B1 (en) 2005-01-28 2006-02-07 International Business Machines Corporation System, method, and article of manufacture for synchronizing running disparity values in a computer and a data demapping device
US7321600B2 (en) * 2005-01-28 2008-01-22 International Business Machines Corporation System, method, and article of manufacture for initializing a communication link using GFP data frames
US7505409B2 (en) * 2005-01-28 2009-03-17 International Business Machines Corporation Data mapping device, method, and article of manufacture for adjusting a transmission rate of ISC words
US9014563B2 (en) 2006-12-11 2015-04-21 Cisco Technology, Inc. System and method for providing an Ethernet interface
EP2009554A1 (en) * 2007-06-25 2008-12-31 Stmicroelectronics SA Method for transferring data from a source target to a destination target, and corresponding network interface
JP4478180B2 (en) * 2007-08-10 2010-06-09 富士通株式会社 Wireless communication system
US7995914B2 (en) 2008-03-28 2011-08-09 Mci Communications Services, Inc. Method and system for providing fault recovery using composite transport groups
US8661173B2 (en) * 2008-03-31 2014-02-25 Intel Corporation USB data striping
US7869468B1 (en) * 2009-06-12 2011-01-11 Applied Micro Circuits Corporation Transport of multilane traffic over a multilane physical interface
JP5672932B2 (en) * 2010-10-13 2015-02-18 富士ゼロックス株式会社 COMMUNICATION DEVICE, COMMUNICATION SYSTEM, AND PROGRAM
US8971352B2 (en) 2012-09-28 2015-03-03 Thomas Jost High accuracy 1588 timestamping over high speed multi lane distribution physical code sublayers
KR20150025584A (en) * 2013-08-29 2015-03-11 삼성전자주식회사 Method for screen sharing and an electronic device
EP3709593B1 (en) * 2013-11-08 2023-04-19 Huawei Technologies Co., Ltd. Data distribution method and related apparatuses
US9413454B1 (en) * 2014-06-30 2016-08-09 Juniper Networks, Inc. Automatic bandwidth adjustment on multi-fiber optics

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US105949A (en) * 1870-08-02 Improvement in buck-saw frames
US5680400A (en) * 1995-05-31 1997-10-21 Unisys Corporation System for high-speed transfer of a continuous data stream between hosts using multiple parallel communication links
US5822321A (en) * 1996-04-10 1998-10-13 Telefonaktiebolaget Lm Ericsson Minicell segmentation and reassembly
US6819658B1 (en) * 1997-07-15 2004-11-16 Comsat Corporation Method and apparatus for segmentation, reassembly and inverse multiplexing of packets and ATM cells over satellite/wireless networks
US6195354B1 (en) * 1997-07-16 2001-02-27 Nortel Networks Limited Route selection for path balancing in connection-oriented packet switching networks
US6154535A (en) * 1998-05-15 2000-11-28 Bellsouth Corporation Methods and system for obtaining processing information relating to a communication
US6556573B1 (en) * 1998-06-05 2003-04-29 Nokia Telecommunications Oy Synchronization of ATM-based network system using variable bit rate ATM adaptation layer protocols
US6862622B2 (en) * 1998-07-10 2005-03-01 Van Drebbel Mariner Llc Transmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PTMP) transmission system architecture
US6226608B1 (en) * 1999-01-28 2001-05-01 Dolby Laboratories Licensing Corporation Data framing for adaptive-block-length coding system
US6876669B2 (en) * 2001-01-08 2005-04-05 Corrigent Systems Ltd. Packet fragmentation with nested interruptions
US20020176450A1 (en) * 2001-01-31 2002-11-28 Sycamore Networks, Inc. System and methods for selectively transmitting ethernet traffic over SONET/SDH optical network
JP4141106B2 (en) 2001-02-06 2008-08-27 富士通株式会社 Bandwidth control device
US7072317B2 (en) * 2001-03-22 2006-07-04 Telcordia Technologies, Inc. Method and apparatus for providing soft hand-off in IP-centric wireless CDMA networks
JP3577717B2 (en) * 2001-05-18 2004-10-13 日本電気株式会社 Communication device, scrambler circuit and descrambler circuit, scramble method and descramble method thereof
JP3690316B2 (en) * 2001-08-10 2005-08-31 ソニー株式会社 Data transmission system, header information addition device, data format conversion device, and data transmission method
JP3522247B2 (en) * 2001-09-26 2004-04-26 日本電気株式会社 Multiple transfer system and apparatus
US20030081582A1 (en) * 2001-10-25 2003-05-01 Nikhil Jain Aggregating multiple wireless communication channels for high data rate transfers

Also Published As

Publication number Publication date
US7508846B2 (en) 2009-03-24
DE60317027T2 (en) 2008-07-24
CA2450421A1 (en) 2004-05-22
DE60317027D1 (en) 2007-12-06
EP1422890B1 (en) 2007-10-24
US20040100958A1 (en) 2004-05-27
EP1422890A1 (en) 2004-05-26

Similar Documents

Publication Publication Date Title
CA2450421C (en) Physical capacity aggregation system &amp; method
US8488450B2 (en) Method and system for physical layer aggregation
CN109286416B (en) Multi-channel communication method and transceiver
US7809021B2 (en) Communication system and encoding method having low overhead
KR101363541B1 (en) Method and apparatus for encoding and decoding data
US7246303B2 (en) Error detection and recovery of data in striped channels
US7804855B2 (en) Method and system for exploiting spare link bandwidth in a multilane communication channel
US20160070615A1 (en) Fec coding/decoding data processing method and related apparatus
EP2975858B1 (en) Method for processing data in the ethernet, physical layer chip and ethernet device
US11356196B2 (en) Reconfigurable adaptive forward error correction
US20100195663A1 (en) Fabric Channel Control Apparatus and Method
US6963533B2 (en) Method and system for establishing link bit rate for inverse multiplexed data streams
US9668150B2 (en) System and method for selective protection switching
JPH08265332A (en) Data transfer method and its device
JP5069399B2 (en) Method and apparatus for forwarding and recovering incoming data packets
US7046623B2 (en) Fault recovery system and method for inverse multiplexed digital subscriber lines
Shacham Packet recovery and error correction in high-speed wide-area networks
EP1159828A1 (en) Method and system for reducing data errors in digital communications
US6928056B2 (en) System and method for distribution of a data stream from high-to-low-to-high bandwidth links
US8160057B2 (en) Multi-channel optical transport network training signal
US7536631B1 (en) Advanced communication apparatus and method for verified communication
Toyoda et al. A 100-Gb-Ethernet subsystem for next-generation metro-area network

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed

Effective date: 20161121