[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

US20130094370A1 - Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment. - Google Patents

Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment. Download PDF

Info

Publication number
US20130094370A1
US20130094370A1 US13/708,331 US201213708331A US2013094370A1 US 20130094370 A1 US20130094370 A1 US 20130094370A1 US 201213708331 A US201213708331 A US 201213708331A US 2013094370 A1 US2013094370 A1 US 2013094370A1
Authority
US
United States
Prior art keywords
cell
data
copy
redundantly transmitted
network node
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.)
Abandoned
Application number
US13/708,331
Inventor
Mark E. Boduch
Mark A. Richmond
Lawrence D. Weizeorick
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.)
Coriant Operations Inc
Original Assignee
Tellabs Operations Inc
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 Tellabs Operations Inc filed Critical Tellabs Operations Inc
Priority to US13/708,331 priority Critical patent/US20130094370A1/en
Assigned to TELLABS OPERATIONS, INC. reassignment TELLABS OPERATIONS, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WEIZEORICK, LAWRENCE D., BODUCH, MARK E., RICHMOND, MARK A.
Assigned to TELLABS OPERATIONS, INC. reassignment TELLABS OPERATIONS, INC. CORRECTIVE ASSIGNMENT TO CORRECT THE TYPOGRAPHICAL ERROR IN THE DOCKET NUMBER PREVIOUSLY RECORDED ON REEL 029715 FRAME 0516. ASSIGNOR(S) HEREBY CONFIRMS THE DOCKET NUMBER SHOULD NOW READ 2376.2144-013. Assignors: WEIZEORICK, LAWRENCE D., BODUCH, MARK E., RICHMOND, MARK A.
Publication of US20130094370A1 publication Critical patent/US20130094370A1/en
Assigned to CERBERUS BUSINESS FINANCE, LLC, AS COLLATERAL AGENT reassignment CERBERUS BUSINESS FINANCE, LLC, AS COLLATERAL AGENT SECURITY AGREEMENT Assignors: TELLABS OPERATIONS, INC., TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.), WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.)
Assigned to TELECOM HOLDING PARENT LLC reassignment TELECOM HOLDING PARENT LLC ASSIGNMENT FOR SECURITY - - PATENTS Assignors: CORIANT OPERATIONS, INC., TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.), WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.)
Assigned to TELECOM HOLDING PARENT LLC reassignment TELECOM HOLDING PARENT LLC CORRECTIVE ASSIGNMENT TO CORRECT THE REMOVE APPLICATION NUMBER 10/075,623 PREVIOUSLY RECORDED AT REEL: 034484 FRAME: 0740. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT FOR SECURITY --- PATENTS. Assignors: CORIANT OPERATIONS, INC., TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.), WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.)
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H04L29/02
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/15Interconnection of switching modules
    • H04L49/1515Non-blocking multistage, e.g. Clos
    • H04L49/153ATM switching fabrics having parallel switch planes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478Provisions for broadband connections
    • 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
    • H04L2012/5625Operations, administration and maintenance [OAM]
    • H04L2012/5627Fault tolerance and recovery
    • 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
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/565Sequence integrity

Definitions

  • the present invention relates generally to methods and apparatus for selecting between or among cell streams in a communication network. More particularly, the present invention relates generally to methods for selecting between two or more redundant or competing cell streams from a cell-oriented environment, such as for example in an ATM (Asynchronous Transfer Mode) cell-based redundant switching system, connected to an external communications network.
  • ATM Asynchronous Transfer Mode
  • Switching equipment may be designed with various layers of redundancy, including redundancy in the switch network portion of the switch itself.
  • a switch network which provides redundancy is comprised of two or more redundant switch network copies.
  • Such a redundancy scheme provides a vehicle whereby the “better” (also sometimes characterized in the art as the “best”) cell of two or more copies of a cell may be selected for insertion into the data stream.
  • Providing at least two redundant or competing cell streams from which to choose the better cell, as determined based upon at least one measure of cell quality, ensures the integrity of the data and minimizes the number of cells that may be dropped as “bad.” Because different paths can be used to route different copies of a cell to the same destination, typically a decision must be made as to which of the copies received at that destination shall be further communicated in the network.
  • control cells to synchronize cell streams that are redundantly transmitted in a cell-based communication network.
  • These control cells which contain a continuously changing sequence number, are inserted at regular intervals into the redundant cell streams at the start of the path. The presence of these control cells is monitored at the end of the path for each of the cell streams. The selected stream is identified, but it is not passed on until the sequence number in the selected stream matches the sequence number in its corresponding redundant stream.
  • the cells are only aligned after a control cell is received; no alignment takes place in the time interval between arrival of control cells. Thus, dropped cells can cause misalignment until the next control cell is received.
  • a cell is not selected to be sent on to the customer network based on cell quality, i.e., the “best” of the received cells is not necessarily the cell sent on to the customer. Instead, the basis for selection is the presence or absence of a matching sequence number in the control cells of the two streams.
  • One objective of the present invention is to intelligently select one of two or more copies of a cell. According to one aspect of the invention, this selection is made by aligning the cell streams prior to selecting the best cell.
  • Another objective of the present invention is to tolerate a limited delay between the arrival of both cell copies, as well as a varying degree of bit errors associated with each of the cell copies.
  • Another objective of the present invention is to provide glitchless copy switching in a cell-oriented environment.
  • Another objective of the present invention is to select the best cell copy despite bit errors or other problems which may occur on one or both copies of the cell stream as the cell stream propagates.
  • Another objective of the present invention is to select the best cell copy while reducing or minimizing the number of cells dropped and maintaining the ordered nature of the cell stream.
  • the present invention relates to methods and apparatus for selecting the better of two or more copies of any given cell from the received cell streams, dropping the least number of cells, while maintaining the ordered nature of the cell stream.
  • the two or more copies of a cell presented for selection originate from multiple redundant switch network copies. These cell copies move through a redundant switch network, where the best cell copy selection is made, and the selected cell copy is inserted into the data stream.
  • the cell streams are aligned prior to selecting which of the two or more cells to insert into the data stream.
  • the corresponding cell streams from the multiple redundant switch network copies are aligned using a buffer.
  • one of the cells is selected for insertion into the data stream, based on a direct comparison of the two or more cell copies. If a cell is missing from all of the multiple redundant switch network copies, idle filler bytes are used to compensate for the missing data. Because the streams are aligned before the copy selection is made, the cells can be compared to one another at the same instant in time to determine which cell should be sent on to the customer network.
  • FIG. 1 is a diagram of a redundant switching system
  • FIG. 2 is a block diagram of the cell stream alignment best cell copy selection ASIC
  • FIG. 3 is a state machine diagram for the sequence manager of the best cell copy selection ASIC
  • FIG. 4 is a block diagram of the sequence manager, the CDV FIFO, and the byte interleaving of the cell stream alignment best cell copy selection ASIC;
  • FIG. 5 is an illustration of the CDV FIFO cell stream alignment
  • FIG. 6 a is a flow chart illustrating the operation of the cell stream alignment best cell copy selection ASIC upon arrival of a single cell or no cell;
  • FIG. 6 b is a flow chart illustrating the operation of the cell stream alignment best cell copy selection ASIC upon arrival of two cells.
  • a switching system in a communication network is often designed with a redundant switch network.
  • This redundancy provides an alternate route over which traffic may be redirected in the event that the primary route is unavailable.
  • This redundancy scheme also provides a vehicle where the “best” data may be selected for insertion into the outgoing data stream, thus ensuring data integrity and minimizing the amount of data that may be dropped as bad.
  • ATM Asynchronous Transfer Mode
  • FIG. 1 depicts a redundant switching system 100 in which the best cell copy selection ASIC 110 may be employed.
  • a redundant switching system 100 is connected to an external communications system.
  • SONET Synchronous Optical NETwork
  • the invention is not limited to SONET data.
  • the invention may be implemented with any cell-based data.
  • the cells may encapsulate, for example, synchronous transfer mode (STM) data, ATM cells, or internet protocol (IP) packets.
  • STM synchronous transfer mode
  • IP internet protocol
  • a signal 103 comes into the redundant switching system 100 to an ingress port module 104 .
  • Signal 103 may be a SONET stream consisting of multiple STS-N payloads.
  • the ingress port module 104 splits the signal 103 into two identical signals, signal 105 and signal 106 .
  • the ingress port module 104 may segment each of the STS-N payloads into cells (for the case of STM-type switching), or it may retrieve ATM cells from the payloads.
  • signals 105 , 106 , 111 , and 112 are characterized as composite cell streams, each of which may contain cells associated with multiple connections.
  • Signal 105 and signal 106 are passed to redundant switch network copies 107 and 108 , respectively. While two switch network copies provide redundancy, additional switch network copies (beyond two) may be used to provide additional redundancy. In that case, ingress port module 104 would split signal 103 into additional identical copies, one per switch network copy. For illustrative purposes, all the connections associated with signal 103 are assumed to be forwarded (switched) to the same egress port module. After signal 105 is input to switch network copy 107 , the signal is routed through switch network copy 107 and output as signal 111 .
  • signal 106 After signal 106 is input to switch network copy 108 , the signal is routed through switch network copy 108 and output as signal 112 . Signals 111 and 112 are then passed to the egress port module 109 . The egress port module 109 determines whether signal 111 or signal 112 will be sent on to the customer's network as output signal 113 .
  • the best cell copy selection ASIC (Application Specific Integrated Circuit) 110 resides in the egress port module 109 .
  • the inputs to the best cell copy selection ASIC 110 are composite cell streams, while the output of the best cell copy selection ASIC 110 is a data stream.
  • the best cell copy selection is preferably performed by an ASIC, but can alternately be implemented by discrete hardware components or by software executing on a microprocessor.
  • Each cell stream has a unique identifier, hereinafter referred to as the source identification number.
  • Cell streams are those which contain cells with only one source identification number; composite cell streams contain cells with multiple source identification numbers.
  • the source identification number identifies the source of a given cell stream.
  • Each cell stream is given a unique source identification number within an ingress port module 104 .
  • Egress port module 109 recognizes one or more cell streams based upon these source identification numbers.
  • Each cell has a multi-bit sequence number which is attached at ingress port module 104 and which is identical for both copies of the same cell, and increasing for each subsequent cell entering the best cell copy selection ASIC 110 for any given source identification number.
  • the sequence number identifies the position of the cell within the cell stream.
  • a source identification number is associated with each cell stream source, and each cell stream source may assign sequence numbers independently.
  • the best cell copy selection ASIC 110 aligns the cell streams from the redundant switch network copies before selecting which one of the two cells to insert into the data stream.
  • SONET Synchronous Optical NETwork
  • the invention is not limited to SONET data. If any cells required to construct the outgoing data stream are missing from both networks, the best cell copy selection ASIC 110 inserts idle filler bytes, consisting, for example, of alternating ‘1’s and ‘0's, to compensate for the missing data.
  • the best cell copy selection ASIC 110 need only insert these filler bytes for applications in which STM-type switching, as previously defined, is used.) Because the streams are aligned before the copy selection is made, both cells can be compared to one another at the same instant in time, and the historical quality of the data streams need not be considered.
  • FIG. 2 depicts a block diagram of the cell stream alignment best cell copy selection ASIC 110 .
  • the best cell copy selection ASIC 110 includes a cell overhead extractor/monitor 201 , a source ID translator 202 , a sequence manager 203 , a cell delay variation FIFO (CDV FIFO) function 204 , a byte interleaver 205 , and a copy selector 206 .
  • CDV FIFO cell delay variation FIFO
  • FIG. 2 shows the byte interleaver 205 occurring before the copy selecting, the byte interleaver 205 can alternately be performed after the copy selecting.
  • the cell overhead extractor/monitor 201 takes two received composite cell streams, composite cell stream 220 and composite cell stream 221 , and extracts overhead status information from the fields of cell overhead that accompany each cell.
  • Composite cell stream 220 originates from switch network copy 107 (shown in FIG. 1 ).
  • Composite cell stream 221 originates from switch network copy 108 (shown in FIG. 1 ).
  • the cell overhead extractor/monitor 201 extracts overhead status information from each stream emanating from each switch network copy.
  • the cell overhead extractor/monitor 201 maintains the status of the extracted fields in user registers 210 .
  • the user registers 210 though shown in FIG. 2 as residing internal to the best cell copy selection ASIC 110 , may alternately reside external to the best cell copy selection ASIC 110 .
  • One or more user registers may be associated with each source identification number and with each switch network copy.
  • the cell overhead extractor/monitor 201 may also provide error counts for each stream emanating from each switch network copy.
  • Information extracted by the cell overhead extractor/monitor 201 is passed to the source ID translator 202 .
  • the extracted information is stored in user registers 210 and accessed by the source ID translator 202 .
  • each cell stream has a source identification number, identifying the source of a given cell stream.
  • the source identification number is one of the fields extracted by the cell overhead extractor/monitor 201 .
  • the source ID translator 202 translates the source identification number (extracted by the cell overhead extractor/monitor 201 ) from the particular switch network copy into multiple signals for that switch network copy.
  • the source ID translator 202 outputs a corresponding number of control signals per switch network copy. For example, for a synchronous transport signal, level 12 (STS- 12 ), the source ID translator 202 outputs 12 control signals. These control signals indicate into which STS- 1 the current cell is to be inserted.
  • the source ID translator 202 may also capture cell overhead information associated with any misrouted cell.
  • a misrouted cell is a cell containing a source identification number which does not match one of the expected source identification numbers with which it is compared.
  • the source ID translator 202 performs this comparison by comparing the source identification number of each cell that arrives with as many as 24 expected source identification numbers. Because there are two source identification numbers for each outgoing stream, 24 expected source identification numbers are used in the comparison process. This minimizes the interruption of cell transmission for the case where the source of a given STS cell stream switches from one originating ingress port module 104 to another. If the incoming source identification number matches an expected source identification number, a bit corresponding to that expected source identification number is set by the source ID translator 202 . The incoming cell is then forwarded to a corresponding STS CDV FIFO (discussed on subsequent pages).
  • the STS mapping 225 is comprised of the sequence manager 203 , the CDV
  • the STS mapping 225 combines the individual incoming streams into one outgoing data stream.
  • the sequence manager 203 determines whether the cell stream is in sequence or out of sequence and provides the sequence number to the CDV FIFO function 204 .
  • the sequence manager 203 also ensures the validity and order of the data passed to the CDV FIFO function 204 by monitoring the sequence number within a single cell stream.
  • the sequence number is used in conjunction with the source identification number to identify the cell stream and the cell order within that stream.
  • the size or length of the sequence number is programmable and may be set to, for example, 8, 10, 12, or 14 bits in length via user register controls (not shown).
  • the sequence manager 203 of FIG. 2 determines the sequence status of a particular cell stream.
  • the method by which the sequence manager 203 determines whether a cell stream is in sequence or out of sequence may be implemented by the state machine shown in FIG. 3 .
  • the sequence status may be in one of three states: out of sequence 301 , in sequence 302 , or sequence error 303 .
  • the sequence manager 203 evaluates the sequence number received from the current cell and compares it to the sequence number of the cell that was previously received.
  • a composite cell stream error exists when errors which affect all cells within a composite cell stream (such as “loss of cell delineation”) are detected.
  • Composite cell stream errors are inputs to the state machine, the composite cell stream errors being determined by devices external to the best cell copy selection itself.
  • the sequence manager 203 initially starts in the in sequence state 302 . Repeated execution of the state machine begins in the state of the previous cell. If the sequence manager 203 starts in the out of sequence state 301 (the last cell was out of sequence) and the conditions at block 304 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the in sequence state 302 .
  • the sequence manager 203 determines that the initialization bit in the cell overhead is not set (the initialization bit in the cell overhead is set at the ingress port module 104 in order to force initialization of the best cell circuitry associated with a given cell stream at the egress port module 109 ), and initialization has not been commanded by software (by means of setting a user register bit by a microprocessor), and no composite cell stream errors have occurred, and the sequence number is equal to the previous sequence number +1, then the sequence manager 203 transitions the sequence status to the in sequence state 302 , writes the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • sequence manager 203 begins in the out of sequence state 301 and the conditions at block 305 exist, then the sequence manager 203 maintains the sequence status of that cell stream in the out of sequence state 301 .
  • the sequence manager 203 determines that the sequence number is not equal to the previous sequence number +1, or the initialization bit in the cell overhead is set, or initialization has been commanded by software, or a composite cell stream error has occurred, then the sequence manager 203 maintains the sequence status in the out of sequence state 301 , reports a loss of sequence in the CDV FIFO status 207 , does not write the cell into CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • sequence manager 203 begins in the in sequence state 302 (the initial execution of the state machine or the last cell was in sequence) and the conditions at block 306 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the sequence error state 303 .
  • the sequence manager 203 determines that the initialization bit in the cell overhead is not set, and initialization has not been commanded by software, and no composite cell stream errors have occurred, and the sequence number is not between the previous sequence number and the previous sequence +4, then the sequence manager 203 transitions the sequence status to sequence error 303 and does not write the cell into the CDV FIFO. Note that if the conditions at block 306 exist, the sequence manager 203 does not update the previous sequence number with the value of the sequence number of the current cell.
  • sequence manager 203 begins in the sequence state 302 and the conditions at block 307 exist, then the sequence manager 203 maintains the sequence state of that cell stream in the in sequence state 302 .
  • the sequence manager 203 determines that the initialization bit in the cell overhead is not set, and initialization has not been commanded by software, and no composite cell stream errors have occurred, and the sequence number is between the previous sequence number and the previous sequence +4, then the sequence manager 203 maintains the sequence status in the in sequence state 302 , writes the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • sequence manager 203 If the sequence manager 203 starts in the in sequence state 302 and the conditions at block 308 exist, then the sequence manager 203 transitions the sequence state of that cell stream to out of sequence 301 . In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is set, or initialization has been commanded by software, or composite cell stream errors have occurred, then the sequence manager 203 transitions the sequence status to the out of sequence state 301 , reports a loss of sequence, does not write the cell into the CFV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • sequence manager 203 If the sequence manager 203 starts in the sequence error state 303 and the conditions at block 309 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the in sequence state 302 . In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is not set, and initialization has not been commanded by software, and no composite cell stream errors have occurred, and the sequence number is equal to the previous sequence number +1, then the sequence manager 203 transitions the sequence status to the in sequence state 302 , writes the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • sequence manager 203 begins in the sequence error state 303 and the conditions at block 305 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the out of sequence state 301 .
  • the sequence manager 203 determines that the sequence number is not equal to the previous sequence number +1, or the initialization bit in the cell overhead is set, or initialization has been commanded by software, or composite cell stream errors have occurred, then the sequence manager 203 transitions the sequence status to the out of sequence state 301 , reports a loss of sequence, does not write the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • An STS- 12 signal may consist of 12 STS- 1 s , a combination of STS- 3 cs and STS- 1 s , or an STS- 12 c . If an STS- 12 signal is configured as 12 STS- 1 s , there is one sequence manager for each STS- 1 stream pair. Stream 449 and stream 450 form one STS- 1 stream pair, for example. In the case of an STS- 12 signal configured as 12 STS- 1 s , sequence manager 405 is the sequence manager for the STS- 1 stream pair formed by stream 449 and stream 450 .
  • an STS- 12 signal is configured as a combination of STS- 3 cs and STS- 1 s , there is one sequence manager for each STS- 1 stream pair as before, and one sequence manager for each STS- 3 c stream pair.
  • sequence manager 405 is the sequence manager for the STS- 3 c stream pair formed by streams 449 - 454 .
  • For an STS- 12 c only sequence manager 405 is used.
  • the CDV FIFO collection 402 may be a RAM (random access memory) or some other storage device which allows buffering of the cell streams.
  • the CDV FIFO collection 402 consists of a series of parallel arrays, the size of each being dependent upon the number of cell streams.
  • the CDV FIFO collection 402 of FIG. 4 consists of 24 CDV FIFOs 425 - 448 , forming 12 CDV FIFO pairs.
  • the size of the CDV FIFO collection 402 is 2 ⁇ 12 by 8, or 24 parallel arrays with eight cell locations per array.
  • CDV FIFO 447 and CDV FIFO 448 form a CDV FIFO pair.
  • CDV FIFO pair formed by CDV FIFO 447 and CDV FIFO 448 will be used to describe the CDV FIFO function 204 .
  • This description applies equally to any of the other CDV FIFO pairs illustrated in FIG. 4 .
  • Each cell stream has associated with it a CDV FIFO.
  • a CDV FIFO 447 eight cells deep, is used.
  • the CDV FIFO 448 is associated with the redundant STS- 1 stream.
  • three CDV FIFO pairs are concatenated end-to-end to make two larger FIFOs capable of absorbing three times the cell delay variation. This is necessary because an STS- 3 c is three times the rate of an STS 1 ; hence, three times the buffering capacity is required.
  • the CDV FIFO function 204 is used to absorb cell delay variation imparted by a single switch network. In addition, the CDV FIFO function 204 aligns the cells received from the multiple switch network copies before the copy selection decision is made. The CDV FIFO function 204 also performs clock rate conversion as necessary. Another function of the CDV FIFO is to serve as the reassembly buffer which enables the SONET stream reassembly function (for STM-type switching applications).
  • Cells may be received at non-regular intervals from the redundant switch network copies, or one or more cells may be dropped entirely.
  • the CDV FIFO collection 402 must be able to absorb this delay variation in order to pass along cells at regular intervals.
  • the best cell copy selection ASIC 110 aligns the cell streams by writing the matching cells from the multiple redundant switch network copies (cells with the same source identification number and same sequence number) into corresponding CDV FIFO locations in two CDV FIFOs, CDV FIFO 447 and 448 , one for each switch network copy.
  • By writing the matching cells into corresponding CDV FIFO locations in CDV FIFOs 447 and 448 a read of CDV FIFO 447 and CDV FIFO 448 at the same location will result in cells with matching source identification and sequence numbers.
  • the switch network copy associated with one STS- 1 of a given stream pair is referred to as the master switch network copy, while the switch network copy associated with the other STS- 1 of the stream pair is referred to as the slave switch network copy.
  • the CDV FIFO associated with the master switch network copy is ‘referred to as the master CDV FIFO, while the CDV FIFO associated with the slave switch network copy is referred to as the slave CDV FIFO.
  • the write pointer indicates the location within the CDV FIFO into which the next cell should be written, where the read pointer indicates the location within the CDV FIFO from which the next cell should be read.
  • the slave CDV FIFO sets its write pointer value to the value of the master FIFO's write pointer plus the difference between the master's sequence number value and the slave's sequence number value.
  • CDV FIFO 447 and CDV FIFO 448 Because the same read pointer is used for CDV FIFO 447 and CDV FIFO 448 and because the read pointer is incremented at regular intervals as cells are needed for insertion into the data stream, either CDV FIFO 447 or 448 will be centered, while the other will be off-center by the amount of skew between the cell streams of either switch network copy.
  • CDV FIFO either CDV FIFO 447 or CDV FIFO 448 . This centering operation interrupts the flow of data, and thus, might be performed only upon initialization.
  • the other switch network copy (the slave) writes its data into its CDV FIFO (CDV FIFO 447 or CDV FIFO 448 ) relative to where the master is writing, so that when both streams are read out of CDV FIFO 447 and CDV FIFO 448 , they will be aligned with one another.
  • CDV FIFO CDV FIFO 447 or CDV FIFO 448
  • the CDV FIFO function 204 first determines which switch network copy is “bad.” A switch network copy is bad if its sequence manager 405 is out of sequence, if the copy selection is forced to the other switch network copy, or if the switch network copy's CDV FIFO 447 and 448 is overflowed or underflowed. An overflow may occur if cells arrive at an average rate that is faster than the number of cells required to make up an STS- 1 frame. An underflow may occur if cells arrive at an average rate slower than the number of cells required to make up an STS- 1 frame.
  • An overflow or underflow condition may exist, resulting in a switch network copy being marked as “bad,” if the data rate into CDV FIFO 447 and/or CDV FIFO 448 is not equal to the data rate out of the CDV FIFO 447 and/or the CDV FIFO 448 , respectively.
  • the bad switch network copy is the slave, and the other switch network copy is the master. If both switch network copies are bad or if both switch network copies are not bad, the title of “master” stays with the previous master switch network copy.
  • the CDV FIFO function 204 also provides a conversion from one clock rate to another. This conversion is required when the incoming cell payload is received by the CDV FIFO function 204 at one clock rate, but read out to the byte interleaver 205 at another clock rate.
  • the byte interleaver 205 determines which location is read from the CDV FIFO collection 402 .
  • the byte interleaver 205 also dictates in which order the CDV FIFOs 425 - 448 will be read to create byte-interleaved STS- 12 signals 422 and 423 .
  • the byte interleave 401 consists of four STS- 3 multiplexers 417 , 418 , 419 , and 420 , and one STS- 12 multiplexer 421 .
  • Each of the four STS- 3 multiplexers 417 - 420 and the STS- 12 multiplexer 421 is depicted in FIG. 4 as a pair of multiplexers to illustrate the redundant nature of the stream design.
  • STS- 3 multiplexer 417 for example, appears as a pair of multiplexers to accommodate multiple streams.
  • STS- 3 multiplexers 418 , 419 , and 420 are depicted as multiplexer pairs.
  • the STS- 12 multiplexer 421 is also depicted as a pair of multiplexers.
  • the STS- 12 multiplexer outputs two redundant streams from which the best cell copy selection is made (by the copy selector 206 ).
  • FIG. 4 depicts 12 STS- 1 signals 449 - 472 which are combined into four STS- 3 c signals 473 - 476 after being operated upon by the sequence manager 203 and the CDV FIFO function 204 .
  • the interleaving order depends on the configuration of the STS- 12 signal. As mentioned previously, there are three possible configurations: an STS- 12 (consisting of 12 STS- 1 signals), an STS- 12 c , or any combination of STS- 3 cs and STS- 1 s .
  • An STS- 3 c is made by combining three STS- 1 streams.
  • STS- 1 signals 449 , 451 , and 453 are combined into STS- 3 or STS- 3 c signal 473 by STS- 3 multiplexer 417 .
  • STS- 1 signals 450 , 452 , and 454 (redundant copies of STS- 1 signals 449 , 451 , and 453 ) are combined into STS- 3 or STS- 3 c signal 473 by STS- 3 multiplexer 417 .
  • STS- 1 signals 455 , 457 , and 459 are combined into STS- 3 or STS- 3 c signal 474 at STS- 3 multiplexer 418 .
  • STS- 1 signals 461 , 463 , and 465 are combined into STS- 3 or STS- 3 c signal 475 at STS- 3 multiplexer 419 .
  • STS- 1 signals 467 , 469 , and 471 are combined into STS- 3 or STS- 3 c signal 476 at STS- 3 multiplexer 420 .
  • the STS- 3 or STS 3 c signals 473 - 476 from STS- 3 multiplexers 417 , 418 , 419 , and 420 respectively are combined into STS- 12 signal 422 and STS- 12 signal 423 by STS- 12 multiplexer 421 .
  • Two identical STS- 12 signals 422 and 423 are output by the STS- 12 multiplexer 421 . It is from these signals which the best cell copy selection is made.
  • the best cell copy selection ASIC 110 invokes the copy selector 206 to select the better of the two copies of each cell to be sent on to the customer network.
  • the term “better” refers to the cell that arrives at egress port module 109 of FIG. 1 with fewest errors, and the selection is made on a cell-by-cell basis.
  • the better of the two cells is then inserted by the best cell copy selection ASIC 110 into the corresponding data stream.
  • the copy selection is made as each cell is read from the CDV FIFO collection 402 . Because the sequence number is used to write the cells into the CDV FIFO collection 402 , reading the same location of each switch network copy's CDV FIFO collection 402 for a given STS signal yields cells from identical streams and with the same sequence number.
  • the copy selector 206 selects a cell from one of the redundant switch network copies. When a cell is not available from either switch network copy, the copy selector 206 inserts a filler cell to maintain the average data rate.
  • the filler cell is generated by the best cell copy selection ASIC 110 , and contains, for example, alternating ‘1’s and ‘0 ’s.
  • the copy selector 206 reads the same location from each switch network copy's CDV FIFO collection 402 .
  • the copy selector 206 bases its cell selection on status information. This status information is read by the copy selector 206 from a CDV FIFO status 207 .
  • This status information includes information such as whether the FIFO cell location is occupied, whether the CDV FIFO collection 402 has overflowed or underflowed, and whether the given cell contains bit errors. If bit errors are detected within the non-overhead field of a received cell, then the cell's associated bit error status bit is set to TRUE.
  • a cell has “arrived” if its occupied flag is TRUE and its CDV FIFO collection 402 has not overflowed or underflowed. When a single cell arrives, it is selected. When two cells arrive (one from each switch network copy), a selection is made based on the status of a bit error status bit.
  • FIGS. 6 a and 6 b depict the possible cell status combinations and the resulting copy selections based on the values of the various flags and the contents of the bit error status bit, where applicable.
  • FIG. 6 a illustrates the cell selection strategy when the best cell copy selection ASIC 110 detects the arrival of a single cell or no cell.
  • the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network copy A. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy A, the best cell copy selection ASIC 110 proceeds to block 601 . At block 601 , the best cell copy selection ASIC 110 sends the cell from switch network copy A on to the customer network.
  • the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy A
  • the best cell copy selection ASIC 110 proceeds to block 602 .
  • the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network copy B. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy B, the best cell copy selection ASIC 110 proceeds to block 603 .
  • the best cell copy selection ASIC 110 selects the cell that has arrived from switch network copy B to send on to the customer network.
  • the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy B, the best cell copy selection ASIC 110 proceeds to block 604 .
  • the best cell copy selection ASIC 110 inserts a filler cell (for example, alternating ‘1’s and ‘0’s) into the data stream sent to the customer network to compensate for the missing data.
  • FIG. 6 b illustrates a cell selection strategy when the best cell copy selection ASIC 110 detects the arrival of two cells, one from switch network copy A and one from switch network copy B.
  • the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network, copy A with the bit error status bit set to FALSE.
  • a bit error status bit set to FALSE indicates no error, whereas a bit error status bit set to TRUE indicates error. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy A with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 606 .
  • the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network copy B with its bit error status bit set to FALSE. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy B with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 607 . At block 607 , the best cell copy selection ASIC 110 sends the cell from the preferred switch network copy on to the customer network.
  • the preferred switch network copy is the switch network copy from which the last cell was sent on to the customer network.
  • the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy B with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 608 .
  • the best cell copy selection ASIC 110 sends the cell from switch network copy A on to the customer network.
  • the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy A with its bit error status bit set to FALSE. If at block 605 the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy A with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 609 . At block 609 the best cell copy selection ASIC 110 determines whether a cell arrived from switch network copy B with its bit error status bit set to FALSE. If the best cell copy selection ASIC 110 determines that a cell arrived from switch network copy B with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 610 . At block 610 , the best cell copy selection ASIC 110 sends the cell from switch network copy B on to the customer network.
  • the best cell copy election ASIC 110 proceeds to block 607 .
  • best cell copy selection ASIC 110 sends the cell from the preferred switch network copy on to the customer network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Apparatus Associated With Microorganisms And Enzymes (AREA)
  • For Increasing The Reliability Of Semiconductor Memories (AREA)
  • Design And Manufacture Of Integrated Circuits (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Semiconductor Integrated Circuits (AREA)

Abstract

The specification discloses methods and apparatus for selecting the better of two or more copies of a cell in a cell-oriented redundant switching system connected to an external communications network. In the preferred embodiment, the best cell copy selection aligns redundantly transmitted cell streams before selecting cells for insertion in the data stream. Because the streams are aligned before the selection is made, the best cell copy selector compares each cell at the same instant in time, rather than basing its selection on past events.

Description

    RELATED APPLICATIONS
  • This application is a continuation of U.S. application Ser. No. 10/429,761, filed May 5, 2003, which is continuation of U.S. application Ser. No. 09/501,930 filed Feb. 10, 2000, now U.S. Pat. No. 6,667,954. The entire teachings of the above applications are incorporated herein by reference.
  • BACKGROUND OF THE INVENTION
  • The present invention relates generally to methods and apparatus for selecting between or among cell streams in a communication network. More particularly, the present invention relates generally to methods for selecting between two or more redundant or competing cell streams from a cell-oriented environment, such as for example in an ATM (Asynchronous Transfer Mode) cell-based redundant switching system, connected to an external communications network.
  • Switching equipment may be designed with various layers of redundancy, including redundancy in the switch network portion of the switch itself. A switch network which provides redundancy is comprised of two or more redundant switch network copies. Such a redundancy scheme provides a vehicle whereby the “better” (also sometimes characterized in the art as the “best”) cell of two or more copies of a cell may be selected for insertion into the data stream. Providing at least two redundant or competing cell streams from which to choose the better cell, as determined based upon at least one measure of cell quality, ensures the integrity of the data and minimizes the number of cells that may be dropped as “bad.” Because different paths can be used to route different copies of a cell to the same destination, typically a decision must be made as to which of the copies received at that destination shall be further communicated in the network.
  • One prior art solution for selecting between redundant cell streams involves the use of control cells to synchronize cell streams that are redundantly transmitted in a cell-based communication network. These control cells, which contain a continuously changing sequence number, are inserted at regular intervals into the redundant cell streams at the start of the path. The presence of these control cells is monitored at the end of the path for each of the cell streams. The selected stream is identified, but it is not passed on until the sequence number in the selected stream matches the sequence number in its corresponding redundant stream. However, the cells are only aligned after a control cell is received; no alignment takes place in the time interval between arrival of control cells. Thus, dropped cells can cause misalignment until the next control cell is received. Further, a cell is not selected to be sent on to the customer network based on cell quality, i.e., the “best” of the received cells is not necessarily the cell sent on to the customer. Instead, the basis for selection is the presence or absence of a matching sequence number in the control cells of the two streams.
  • One objective of the present invention is to intelligently select one of two or more copies of a cell. According to one aspect of the invention, this selection is made by aligning the cell streams prior to selecting the best cell.
  • Another objective of the present invention is to tolerate a limited delay between the arrival of both cell copies, as well as a varying degree of bit errors associated with each of the cell copies.
  • Another objective of the present invention is to provide glitchless copy switching in a cell-oriented environment.
  • Another objective of the present invention is to select the best cell copy despite bit errors or other problems which may occur on one or both copies of the cell stream as the cell stream propagates.
  • Another objective of the present invention is to select the best cell copy while reducing or minimizing the number of cells dropped and maintaining the ordered nature of the cell stream.
  • These and other objects of the invention are discussed in or will be apparent to those skilled in the art from the following detailed description of the invention.
  • SUMMARY OF THE INVENTION
  • The present invention relates to methods and apparatus for selecting the better of two or more copies of any given cell from the received cell streams, dropping the least number of cells, while maintaining the ordered nature of the cell stream. The two or more copies of a cell presented for selection originate from multiple redundant switch network copies. These cell copies move through a redundant switch network, where the best cell copy selection is made, and the selected cell copy is inserted into the data stream.
  • In the preferred embodiment, the cell streams are aligned prior to selecting which of the two or more cells to insert into the data stream. The corresponding cell streams from the multiple redundant switch network copies are aligned using a buffer.
  • After the two or more streams are aligned, one of the cells is selected for insertion into the data stream, based on a direct comparison of the two or more cell copies. If a cell is missing from all of the multiple redundant switch network copies, idle filler bytes are used to compensate for the missing data. Because the streams are aligned before the copy selection is made, the cells can be compared to one another at the same instant in time to determine which cell should be sent on to the customer network.
  • These and other features of the present invention are discussed or are apparent in the following detailed description of the invention.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The foregoing will be apparent from the following more particular description of example embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating embodiments of the present invention.
  • FIG. 1 is a diagram of a redundant switching system;
  • FIG. 2 is a block diagram of the cell stream alignment best cell copy selection ASIC;
  • FIG. 3 is a state machine diagram for the sequence manager of the best cell copy selection ASIC;
  • FIG. 4 is a block diagram of the sequence manager, the CDV FIFO, and the byte interleaving of the cell stream alignment best cell copy selection ASIC;
  • FIG. 5 is an illustration of the CDV FIFO cell stream alignment;
  • FIG. 6 a is a flow chart illustrating the operation of the cell stream alignment best cell copy selection ASIC upon arrival of a single cell or no cell;
  • FIG. 6 b is a flow chart illustrating the operation of the cell stream alignment best cell copy selection ASIC upon arrival of two cells.
  • DETAILED DESCRIPTION OF THE INVENTION
  • A switching system in a communication network is often designed with a redundant switch network. This redundancy provides an alternate route over which traffic may be redirected in the event that the primary route is unavailable. This redundancy scheme also provides a vehicle where the “best” data may be selected for insertion into the outgoing data stream, thus ensuring data integrity and minimizing the amount of data that may be dropped as bad. When a communication network is cell-oriented, as it is in the case of an Asynchronous Transfer Mode (ATM) communication network, for example, data travels through the communication network as cells. These cells reside in cell streams. When the best cell can be selected from redundant cell streams and can be inserted into the outgoing data stream and sent on to a customer network, data integrity is ensured while the ordered nature of the cell stream is maintained.
  • FIG. 1 depicts a redundant switching system 100 in which the best cell copy selection ASIC 110 may be employed. Such a redundant switching system 100 is connected to an external communications system. It is noted that although the discussion below proceeds with reference, in part, to SONET (Synchronous Optical NETwork) data, the invention is not limited to SONET data. The invention may be implemented with any cell-based data. Thus, the cells may encapsulate, for example, synchronous transfer mode (STM) data, ATM cells, or internet protocol (IP) packets.
  • Returning to FIG. 1, in the redundant switching system 100, there are two copies of a redundant switch network, switch network copy 107 and switch network copy 108. A signal 103 comes into the redundant switching system 100 to an ingress port module 104. Signal 103 may be a SONET stream consisting of multiple STS-N payloads. The ingress port module 104 splits the signal 103 into two identical signals, signal 105 and signal 106. Depending upon how a given port is configured, the ingress port module 104 may segment each of the STS-N payloads into cells (for the case of STM-type switching), or it may retrieve ATM cells from the payloads. In either case, signals 105, 106, 111, and 112 are characterized as composite cell streams, each of which may contain cells associated with multiple connections. Signal 105 and signal 106 are passed to redundant switch network copies 107 and 108, respectively. While two switch network copies provide redundancy, additional switch network copies (beyond two) may be used to provide additional redundancy. In that case, ingress port module 104 would split signal 103 into additional identical copies, one per switch network copy. For illustrative purposes, all the connections associated with signal 103 are assumed to be forwarded (switched) to the same egress port module. After signal 105 is input to switch network copy 107, the signal is routed through switch network copy 107 and output as signal 111. After signal 106 is input to switch network copy 108, the signal is routed through switch network copy 108 and output as signal 112. Signals 111 and 112 are then passed to the egress port module 109. The egress port module 109 determines whether signal 111 or signal 112 will be sent on to the customer's network as output signal 113.
  • The best cell copy selection ASIC (Application Specific Integrated Circuit) 110 resides in the egress port module 109. The inputs to the best cell copy selection ASIC 110 are composite cell streams, while the output of the best cell copy selection ASIC 110 is a data stream. The best cell copy selection is preferably performed by an ASIC, but can alternately be implemented by discrete hardware components or by software executing on a microprocessor.
  • Each cell stream has a unique identifier, hereinafter referred to as the source identification number. Cell streams are those which contain cells with only one source identification number; composite cell streams contain cells with multiple source identification numbers. The source identification number identifies the source of a given cell stream. Each cell stream is given a unique source identification number within an ingress port module 104. Egress port module 109 recognizes one or more cell streams based upon these source identification numbers. Each cell has a multi-bit sequence number which is attached at ingress port module 104 and which is identical for both copies of the same cell, and increasing for each subsequent cell entering the best cell copy selection ASIC 110 for any given source identification number. The sequence number identifies the position of the cell within the cell stream. A source identification number is associated with each cell stream source, and each cell stream source may assign sequence numbers independently.
  • The best cell copy selection ASIC 110 aligns the cell streams from the redundant switch network copies before selecting which one of the two cells to insert into the data stream. As noted above, although the discussion below proceeds with reference to SONET (Synchronous Optical NETwork) data, the invention is not limited to SONET data. If any cells required to construct the outgoing data stream are missing from both networks, the best cell copy selection ASIC 110 inserts idle filler bytes, consisting, for example, of alternating ‘1’s and ‘0's, to compensate for the missing data. (The best cell copy selection ASIC 110 need only insert these filler bytes for applications in which STM-type switching, as previously defined, is used.) Because the streams are aligned before the copy selection is made, both cells can be compared to one another at the same instant in time, and the historical quality of the data streams need not be considered.
  • FIG. 2 depicts a block diagram of the cell stream alignment best cell copy selection ASIC 110. Referring to FIG. 2, the best cell copy selection ASIC 110 includes a cell overhead extractor/monitor 201, a source ID translator 202, a sequence manager 203, a cell delay variation FIFO (CDV FIFO) function 204, a byte interleaver 205, and a copy selector 206. Although FIG. 2 shows the byte interleaver 205 occurring before the copy selecting, the byte interleaver 205 can alternately be performed after the copy selecting.
  • The cell overhead extractor/monitor 201 takes two received composite cell streams, composite cell stream 220 and composite cell stream 221, and extracts overhead status information from the fields of cell overhead that accompany each cell. Composite cell stream 220 originates from switch network copy 107 (shown in FIG. 1). Composite cell stream 221 originates from switch network copy 108 (shown in FIG. 1). The cell overhead extractor/monitor 201 extracts overhead status information from each stream emanating from each switch network copy. The cell overhead extractor/monitor 201 maintains the status of the extracted fields in user registers 210. The user registers 210, though shown in FIG. 2 as residing internal to the best cell copy selection ASIC 110, may alternately reside external to the best cell copy selection ASIC 110. One or more user registers may be associated with each source identification number and with each switch network copy. The cell overhead extractor/monitor 201 may also provide error counts for each stream emanating from each switch network copy. Information extracted by the cell overhead extractor/monitor 201 is passed to the source ID translator 202. Alternatively, the extracted information is stored in user registers 210 and accessed by the source ID translator 202.
  • As noted above, each cell stream has a source identification number, identifying the source of a given cell stream. The source identification number is one of the fields extracted by the cell overhead extractor/monitor 201.
  • The source ID translator 202 translates the source identification number (extracted by the cell overhead extractor/monitor 201) from the particular switch network copy into multiple signals for that switch network copy. The source ID translator 202 outputs a corresponding number of control signals per switch network copy. For example, for a synchronous transport signal, level 12 (STS-12), the source ID translator 202 outputs 12 control signals. These control signals indicate into which STS-1 the current cell is to be inserted.
  • The source ID translator 202 may also capture cell overhead information associated with any misrouted cell. A misrouted cell is a cell containing a source identification number which does not match one of the expected source identification numbers with which it is compared. For STS's, the source ID translator 202 performs this comparison by comparing the source identification number of each cell that arrives with as many as 24 expected source identification numbers. Because there are two source identification numbers for each outgoing stream, 24 expected source identification numbers are used in the comparison process. This minimizes the interruption of cell transmission for the case where the source of a given STS cell stream switches from one originating ingress port module 104 to another. If the incoming source identification number matches an expected source identification number, a bit corresponding to that expected source identification number is set by the source ID translator 202. The incoming cell is then forwarded to a corresponding STS CDV FIFO (discussed on subsequent pages).
  • The STS mapping 225 is comprised of the sequence manager 203, the CDV
  • FIFO function 204, and the byte interleaver 205. The STS mapping 225 combines the individual incoming streams into one outgoing data stream.
  • The sequence manager 203 determines whether the cell stream is in sequence or out of sequence and provides the sequence number to the CDV FIFO function 204. The sequence manager 203 also ensures the validity and order of the data passed to the CDV FIFO function 204 by monitoring the sequence number within a single cell stream. The sequence number is used in conjunction with the source identification number to identify the cell stream and the cell order within that stream. The size or length of the sequence number is programmable and may be set to, for example, 8, 10, 12, or 14 bits in length via user register controls (not shown).
  • The sequence manager 203 of FIG. 2 determines the sequence status of a particular cell stream. The method by which the sequence manager 203 determines whether a cell stream is in sequence or out of sequence may be implemented by the state machine shown in FIG. 3. Referring to FIG. 3, the sequence status may be in one of three states: out of sequence 301, in sequence 302, or sequence error 303. The sequence manager 203 evaluates the sequence number received from the current cell and compares it to the sequence number of the cell that was previously received. A composite cell stream error exists when errors which affect all cells within a composite cell stream (such as “loss of cell delineation”) are detected. Composite cell stream errors are inputs to the state machine, the composite cell stream errors being determined by devices external to the best cell copy selection itself.
  • The sequence manager 203 initially starts in the in sequence state 302. Repeated execution of the state machine begins in the state of the previous cell. If the sequence manager 203 starts in the out of sequence state 301 (the last cell was out of sequence) and the conditions at block 304 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the in sequence state 302. In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is not set (the initialization bit in the cell overhead is set at the ingress port module 104 in order to force initialization of the best cell circuitry associated with a given cell stream at the egress port module 109), and initialization has not been commanded by software (by means of setting a user register bit by a microprocessor), and no composite cell stream errors have occurred, and the sequence number is equal to the previous sequence number +1, then the sequence manager 203 transitions the sequence status to the in sequence state 302, writes the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • If the sequence manager 203 begins in the out of sequence state 301 and the conditions at block 305 exist, then the sequence manager 203 maintains the sequence status of that cell stream in the out of sequence state 301. In particular, if the sequence manager 203 determines that the sequence number is not equal to the previous sequence number +1, or the initialization bit in the cell overhead is set, or initialization has been commanded by software, or a composite cell stream error has occurred, then the sequence manager 203 maintains the sequence status in the out of sequence state 301, reports a loss of sequence in the CDV FIFO status 207, does not write the cell into CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • If the sequence manager 203 begins in the in sequence state 302 (the initial execution of the state machine or the last cell was in sequence) and the conditions at block 306 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the sequence error state 303. In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is not set, and initialization has not been commanded by software, and no composite cell stream errors have occurred, and the sequence number is not between the previous sequence number and the previous sequence +4, then the sequence manager 203 transitions the sequence status to sequence error 303 and does not write the cell into the CDV FIFO. Note that if the conditions at block 306 exist, the sequence manager 203 does not update the previous sequence number with the value of the sequence number of the current cell.
  • If the sequence manager 203 begins in the sequence state 302 and the conditions at block 307 exist, then the sequence manager 203 maintains the sequence state of that cell stream in the in sequence state 302. In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is not set, and initialization has not been commanded by software, and no composite cell stream errors have occurred, and the sequence number is between the previous sequence number and the previous sequence +4, then the sequence manager 203 maintains the sequence status in the in sequence state 302, writes the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • If the sequence manager 203 starts in the in sequence state 302 and the conditions at block 308 exist, then the sequence manager 203 transitions the sequence state of that cell stream to out of sequence 301. In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is set, or initialization has been commanded by software, or composite cell stream errors have occurred, then the sequence manager 203 transitions the sequence status to the out of sequence state 301, reports a loss of sequence, does not write the cell into the CFV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • If the sequence manager 203 starts in the sequence error state 303 and the conditions at block 309 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the in sequence state 302. In particular, if the sequence manager 203 determines that the initialization bit in the cell overhead is not set, and initialization has not been commanded by software, and no composite cell stream errors have occurred, and the sequence number is equal to the previous sequence number +1, then the sequence manager 203 transitions the sequence status to the in sequence state 302, writes the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • If the sequence manager 203 begins in the sequence error state 303 and the conditions at block 305 exist, then the sequence manager 203 transitions the sequence state of that cell stream to the out of sequence state 301. In particular, if the sequence manager 203 determines that the sequence number is not equal to the previous sequence number +1, or the initialization bit in the cell overhead is set, or initialization has been commanded by software, or composite cell stream errors have occurred, then the sequence manager 203 transitions the sequence status to the out of sequence state 301, reports a loss of sequence, does not write the cell into the CDV FIFO, and updates the previous sequence number with the value of the sequence number of the current cell.
  • The sequence manager 203, the CDV FIFO function 204, and the byte interleaver 205 of FIG. 2 are further illustrated in FIG. 4. An STS-12 signal may consist of 12 STS-1 s, a combination of STS-3 cs and STS-1 s, or an STS-12 c. If an STS-12 signal is configured as 12 STS-1 s, there is one sequence manager for each STS-1 stream pair. Stream 449 and stream 450 form one STS-1 stream pair, for example. In the case of an STS-12 signal configured as 12 STS-1 s, sequence manager 405 is the sequence manager for the STS-1 stream pair formed by stream 449 and stream 450. If an STS-12 signal is configured as a combination of STS-3 cs and STS-1 s, there is one sequence manager for each STS-1 stream pair as before, and one sequence manager for each STS-3 c stream pair. In the case of an STS-12 signal configured as a combination of STS-3 cs and STS-1 s, if streams 449-454 comprise an STS-3 c stream pair, then sequence manager 405 is the sequence manager for the STS-3 c stream pair formed by streams 449-454. For an STS-12 c, only sequence manager 405 is used.
  • The CDV FIFO collection 402 may be a RAM (random access memory) or some other storage device which allows buffering of the cell streams. The CDV FIFO collection 402 consists of a series of parallel arrays, the size of each being dependent upon the number of cell streams. The CDV FIFO collection 402 of FIG. 4 consists of 24 CDV FIFOs 425-448, forming 12 CDV FIFO pairs. Here, the size of the CDV FIFO collection 402 is 2×12 by 8, or 24 parallel arrays with eight cell locations per array. For example, CDV FIFO 447 and CDV FIFO 448 form a CDV FIFO pair. For the remainder of this specification, when reference is made to a CDV FIFO pair, the CDV FIFO pair formed by CDV FIFO 447 and CDV FIFO 448 will be used to describe the CDV FIFO function 204. This description applies equally to any of the other CDV FIFO pairs illustrated in FIG. 4.
  • Each cell stream has associated with it a CDV FIFO. For example, for an STS-1, a CDV FIFO 447, eight cells deep, is used. The CDV FIFO 448 is associated with the redundant STS-1 stream. For an STS-3 c, three CDV FIFO pairs are concatenated end-to-end to make two larger FIFOs capable of absorbing three times the cell delay variation. This is necessary because an STS-3 c is three times the rate of an STS1; hence, three times the buffering capacity is required. Similarly, for an STS-12 c, 12 CDV FIFO pairs are concatenated into two larger FIFOs (one for the STS-12 c and a second for the redundant STS-12 c) to absorb 12 times the delay variation. Combining multiple CDV FIFOs to create a large FIFO buffer allows the size to increase by a factor of three for an STS-3 c, and by a factor of 12 for an STS-12 c.
  • The CDV FIFO function 204 is used to absorb cell delay variation imparted by a single switch network. In addition, the CDV FIFO function 204 aligns the cells received from the multiple switch network copies before the copy selection decision is made. The CDV FIFO function 204 also performs clock rate conversion as necessary. Another function of the CDV FIFO is to serve as the reassembly buffer which enables the SONET stream reassembly function (for STM-type switching applications).
  • Cells may be received at non-regular intervals from the redundant switch network copies, or one or more cells may be dropped entirely. However, the CDV FIFO collection 402 must be able to absorb this delay variation in order to pass along cells at regular intervals.
  • The best cell copy selection ASIC 110 aligns the cell streams by writing the matching cells from the multiple redundant switch network copies (cells with the same source identification number and same sequence number) into corresponding CDV FIFO locations in two CDV FIFOs, CDV FIFO 447 and 448, one for each switch network copy. By writing the matching cells into corresponding CDV FIFO locations in CDV FIFOs 447 and 448, a read of CDV FIFO 447 and CDV FIFO 448 at the same location will result in cells with matching source identification and sequence numbers.
  • The switch network copy associated with one STS-1 of a given stream pair is referred to as the master switch network copy, while the switch network copy associated with the other STS-1 of the stream pair is referred to as the slave switch network copy. The CDV FIFO associated with the master switch network copy is ‘referred to as the master CDV FIFO, while the CDV FIFO associated with the slave switch network copy is referred to as the slave CDV FIFO. There is both a write pointer and a read pointer associated with each CDV FIFO. The write pointer indicates the location within the CDV FIFO into which the next cell should be written, where the read pointer indicates the location within the CDV FIFO from which the next cell should be read. The slave CDV FIFO sets its write pointer value to the value of the master FIFO's write pointer plus the difference between the master's sequence number value and the slave's sequence number value.
  • FIG. 5 provides an illustrative example of the alignment performed by the CDV FIFO function 204. If the master switch network copy writes sequence number 4 into cell location 3 (8 cell locations per CDV FIFO 447 and CDV FIFO 448), then if the slave receives sequence number 6, it will write it into cell location 3+(6−4)=5. For the master switch network copy, sequence number 5 will be written into cell location 4 and sequence number 6 will be written into cell location 5, which will match the slave's FIFO. In this way, if the best cell copy selection ASIC 110 reads the same location from both CDV FIFO 447 and CDV FIFO 448, the output cells will have the same sequence numbers, providing a cell was not dropped.
  • Because the same read pointer is used for CDV FIFO 447 and CDV FIFO 448 and because the read pointer is incremented at regular intervals as cells are needed for insertion into the data stream, either CDV FIFO 447 or 448 will be centered, while the other will be off-center by the amount of skew between the cell streams of either switch network copy. To center the CDV FIFO associated with one switch network copy in order to use it as a reference, one switch network copy is declared to be the master and that switch network copy's CDV FIFO (either CDV FIFO 447 or CDV FIFO 448) is centered. This centering operation interrupts the flow of data, and thus, might be performed only upon initialization. The other switch network copy (the slave) writes its data into its CDV FIFO (CDV FIFO 447 or CDV FIFO 448) relative to where the master is writing, so that when both streams are read out of CDV FIFO 447 and CDV FIFO 448, they will be aligned with one another.
  • To determine which switch network copy is the master, the CDV FIFO function 204 first determines which switch network copy is “bad.” A switch network copy is bad if its sequence manager 405 is out of sequence, if the copy selection is forced to the other switch network copy, or if the switch network copy's CDV FIFO 447 and 448 is overflowed or underflowed. An overflow may occur if cells arrive at an average rate that is faster than the number of cells required to make up an STS-1 frame. An underflow may occur if cells arrive at an average rate slower than the number of cells required to make up an STS-1 frame. An overflow or underflow condition may exist, resulting in a switch network copy being marked as “bad,” if the data rate into CDV FIFO 447 and/or CDV FIFO 448 is not equal to the data rate out of the CDV FIFO 447 and/or the CDV FIFO 448, respectively.
  • If only one switch network copy is bad, the bad switch network copy is the slave, and the other switch network copy is the master. If both switch network copies are bad or if both switch network copies are not bad, the title of “master” stays with the previous master switch network copy.
  • The CDV FIFO function 204 also provides a conversion from one clock rate to another. This conversion is required when the incoming cell payload is received by the CDV FIFO function 204 at one clock rate, but read out to the byte interleaver 205 at another clock rate.
  • The byte interleaver 205 determines which location is read from the CDV FIFO collection 402. The byte interleaver 205 also dictates in which order the CDV FIFOs 425-448 will be read to create byte-interleaved STS-12 signals 422 and 423.
  • The byte interleave 401 consists of four STS-3 multiplexers 417, 418, 419, and 420, and one STS-12 multiplexer 421. Each of the four STS-3 multiplexers 417-420 and the STS-12 multiplexer 421 is depicted in FIG. 4 as a pair of multiplexers to illustrate the redundant nature of the stream design. Hence, STS-3 multiplexer 417, for example, appears as a pair of multiplexers to accommodate multiple streams. Similarly, STS-3 multiplexers 418, 419, and 420 are depicted as multiplexer pairs. The STS-12 multiplexer 421 is also depicted as a pair of multiplexers. The STS-12 multiplexer outputs two redundant streams from which the best cell copy selection is made (by the copy selector 206).
  • FIG. 4 depicts 12 STS-1 signals 449-472 which are combined into four STS-3 c signals 473-476 after being operated upon by the sequence manager 203 and the CDV FIFO function 204. The interleaving order depends on the configuration of the STS-12 signal. As mentioned previously, there are three possible configurations: an STS-12 (consisting of 12 STS-1 signals), an STS-12 c, or any combination of STS-3 cs and STS-1 s. An STS-3 c is made by combining three STS-1 streams. For example, STS-1 signals 449, 451, and 453 are combined into STS-3 or STS-3 c signal 473 by STS-3 multiplexer 417. Similarly, STS-1 signals 450, 452, and 454 (redundant copies of STS-1 signals 449, 451, and 453) are combined into STS-3 or STS-3 c signal 473 by STS-3 multiplexer 417. STS-1 signals 455, 457, and 459 are combined into STS-3 or STS-3 c signal 474 at STS-3 multiplexer 418. STS-1 signals 461, 463, and 465 are combined into STS-3 or STS-3 c signal 475 at STS-3 multiplexer 419. STS-1 signals 467, 469, and 471 are combined into STS-3 or STS-3 c signal 476 at STS-3 multiplexer 420. The STS-3 or STS3 c signals 473- 476 from STS-3 multiplexers 417, 418, 419, and 420 respectively are combined into STS-12 signal 422 and STS-12 signal 423 by STS-12 multiplexer 421. Two identical STS-12 signals 422 and 423 are output by the STS-12 multiplexer 421. It is from these signals which the best cell copy selection is made.
  • After the individual streams are combined into one outgoing stream, and the stream and its corresponding redundant stream have been aligned, the best cell copy selection ASIC 110 invokes the copy selector 206 to select the better of the two copies of each cell to be sent on to the customer network. The term “better” refers to the cell that arrives at egress port module 109 of FIG. 1 with fewest errors, and the selection is made on a cell-by-cell basis. The better of the two cells is then inserted by the best cell copy selection ASIC 110 into the corresponding data stream. The copy selection is made as each cell is read from the CDV FIFO collection 402. Because the sequence number is used to write the cells into the CDV FIFO collection 402, reading the same location of each switch network copy's CDV FIFO collection 402 for a given STS signal yields cells from identical streams and with the same sequence number.
  • The copy selector 206 selects a cell from one of the redundant switch network copies. When a cell is not available from either switch network copy, the copy selector 206 inserts a filler cell to maintain the average data rate. The filler cell is generated by the best cell copy selection ASIC 110, and contains, for example, alternating ‘1’s and ‘0 ’s. The copy selector 206 reads the same location from each switch network copy's CDV FIFO collection 402. The copy selector 206 bases its cell selection on status information. This status information is read by the copy selector 206 from a CDV FIFO status 207. This status information includes information such as whether the FIFO cell location is occupied, whether the CDV FIFO collection 402 has overflowed or underflowed, and whether the given cell contains bit errors. If bit errors are detected within the non-overhead field of a received cell, then the cell's associated bit error status bit is set to TRUE.
  • A cell has “arrived” if its occupied flag is TRUE and its CDV FIFO collection 402 has not overflowed or underflowed. When a single cell arrives, it is selected. When two cells arrive (one from each switch network copy), a selection is made based on the status of a bit error status bit. FIGS. 6 a and 6 b depict the possible cell status combinations and the resulting copy selections based on the values of the various flags and the contents of the bit error status bit, where applicable.
  • FIG. 6 a illustrates the cell selection strategy when the best cell copy selection ASIC 110 detects the arrival of a single cell or no cell. Referring to FIG. 6 a, at block 600 the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network copy A. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy A, the best cell copy selection ASIC 110 proceeds to block 601. At block 601, the best cell copy selection ASIC 110 sends the cell from switch network copy A on to the customer network.
  • If at block 600 the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy A, the best cell copy selection ASIC 110 proceeds to block 602. At block 602, the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network copy B. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy B, the best cell copy selection ASIC 110 proceeds to block 603. At block 603, the best cell copy selection ASIC 110 selects the cell that has arrived from switch network copy B to send on to the customer network.
  • If at block 602, the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy B, the best cell copy selection ASIC 110 proceeds to block 604. At block 604, the best cell copy selection ASIC 110 inserts a filler cell (for example, alternating ‘1’s and ‘0’s) into the data stream sent to the customer network to compensate for the missing data.
  • FIG. 6 b illustrates a cell selection strategy when the best cell copy selection ASIC 110 detects the arrival of two cells, one from switch network copy A and one from switch network copy B. Referring to FIG. 6 b, at block 605 the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network, copy A with the bit error status bit set to FALSE. A bit error status bit set to FALSE indicates no error, whereas a bit error status bit set to TRUE indicates error. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy A with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 606. At block 606 the best cell copy selection ASIC 110 determines whether a cell has arrived from switch network copy B with its bit error status bit set to FALSE. If the best cell copy selection ASIC 110 determines that a cell has arrived from switch network copy B with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 607. At block 607, the best cell copy selection ASIC 110 sends the cell from the preferred switch network copy on to the customer network. The preferred switch network copy is the switch network copy from which the last cell was sent on to the customer network.
  • If at block 606 the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy B with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 608. At block 608 the best cell copy selection ASIC 110 sends the cell from switch network copy A on to the customer network.
  • If at block 605 the best cell copy selection ASIC 110 determines that a cell has not arrived from switch network copy A with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 609. At block 609 the best cell copy selection ASIC 110 determines whether a cell arrived from switch network copy B with its bit error status bit set to FALSE. If the best cell copy selection ASIC 110 determines that a cell arrived from switch network copy B with its bit error status bit set to FALSE, the best cell copy selection ASIC 110 proceeds to block 610. At block 610, the best cell copy selection ASIC 110 sends the cell from switch network copy B on to the customer network.
  • If at block 609 the best cell copy selection ASIC 110 determines that a cell did not arrive from switch network copy B with its bit error status bit set to FALSE, the best cell copy election ASIC 110 proceeds to block 607. At block 607, best cell copy selection ASIC 110 sends the cell from the preferred switch network copy on to the customer network.
  • The teachings of all patents, published applications and references cited herein are incorporated by reference in their entirety.
  • While this invention has been particularly shown and described with references to example embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention encompassed by the appended claims.
  • The preferred embodiment of the present invention is described herein. It is to be understood, of course, that changes and modifications may be made in the above-described embodiment without departing from the true scope and spirit of the present invention as defined by the appended claims.

Claims (20)

What is claimed is:
1. A method for selecting data at a network node coupled to a communications network, the method comprising:
selecting a better copy of data at the network node from at least two copies of the data in redundantly transmitted streams, received via one or more communications paths, based on an error status identified for each of the at least two copies of the data in the redundantly transmitted streams.
2. The method of claim 1 wherein selecting the better copy of the data from the at least two copies of the data in the redundantly transmitted streams is further based on an arrival status identified for each of the at least two copies of the data in the redundantly transmitted streams.
3. The method of claim 1 further comprising:
identifying a preferred switch network copy from the at least two copies of the data in the redundantly transmitted streams, the preferred switch network copy being data from one of the redundantly transmitted streams from which a last better copy of data was selected; and
selecting the preferred switch network copy as the better copy of the data based on each of the at least two copies of the data in the redundantly transmitted streams having an error status indicating bit errors.
4. The method of claim 1 wherein the redundantly transmitted streams each includes an asynchronous transfer mode cell.
5. The method of claim 1 wherein the redundantly transmitted streams each includes a synchronous transfer mode cell.
6. The method of claim 1 wherein the redundantly transmitted streams each includes an Internet protocol packet.
7. The method of claim 1 wherein the method is performed by an Application Specific Integrated Circuit (ASIC) at the network node.
8. The method of claim 1 further comprising:
inserting the better copy of the data selected into a data stream being sent by the network node or generating a cell or packet at the network node and incorporating the better copy into the cell or packet prior to sending the cell or the packet from the network node.
9. The method of claim 1 further comprising:
extracting overhead status information from each of the redundantly transmitted cell streams and maintaining the overhead status information in one or more memory locations of at least one memory in the network node.
10. The method of claim 1 further comprising:
absorbing delay variation resulting from data received from one of the redundantly transmitted streams at non-regular intervals.
11. A network node for selecting data, the network node comprising:
a network interface configured to receive redundantly transmitted streams; and
a selection module configured to select a better copy of data from at least two copies of the data in the redundantly transmitted streams, received via one or more communications paths, based on an error status identified for each of the at least two copies of the data in the redundantly transmitted streams.
12. The network node of claim 11 wherein the selection module is further configured to select the better copy of the data from the at least two copies of the data in the redundantly transmitted streams based on an arrival status identified for each of the at least two copies of the data in the redundantly transmitted streams.
13. The network node of claim 11 wherein the selection module further includes:
an identification module configured to identify a preferred switch network copy from the at least two copies of the data in the redundantly transmitted streams, the preferred switch network copy being data from one of the redundantly transmitted streams from which a last better copy of data was selected; and
wherein the selection module is further configured to select the preferred switch network copy as the better copy of the data based on each of the at least two copies of the data in the redundantly transmitted streams having an error status indicating bit errors.
14. The network node of claim 11 wherein the redundantly transmitted streams each includes an asynchronous transfer mode cell.
15. The network node of claim 11 wherein the redundantly transmitted streams each includes a synchronous transfer mode cell.
16. The network node of claim 11 wherein the redundantly transmitted streams each includes an Internet protocol packet.
17. The network node of claim 11 wherein the selection module is an Application Specific Integrated Circuit (ASIC).
18. The network node of claim 11 further comprising:
a transmission module configured to insert the better copy of the data selected into a data stream being sent by the network node or to generate a cell or packet incorporating the better copy into the cell or the packet prior to sending the cell or packet from the network node.
19. The network node of claim 11 further comprising:
at least one memory; and
an extractor module configured to extract overhead status information from each of the redundantly transmitted cell streams and to maintain the overhead status information in one or more memory locations of the at least one memory in the network node.
20. A non-transient computer-readable medium having stored thereon a sequence of instructions which, when loaded and executed by a processor, causes the processor to:
select a better copy of data from at least two copies of data in redundantly transmitted streams, received via one or more communications paths, based on an error status identified for each of the at least two copies of the data in the redundantly transmitted streams.
US13/708,331 2000-02-10 2012-12-07 Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment. Abandoned US20130094370A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/708,331 US20130094370A1 (en) 2000-02-10 2012-12-07 Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment.

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US09/501,930 US6667954B1 (en) 2000-02-10 2000-02-10 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment
US10/429,761 US8339941B2 (en) 2000-02-10 2003-05-05 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment
US13/708,331 US20130094370A1 (en) 2000-02-10 2012-12-07 Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment.

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/429,761 Continuation US8339941B2 (en) 2000-02-10 2003-05-05 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment

Publications (1)

Publication Number Publication Date
US20130094370A1 true US20130094370A1 (en) 2013-04-18

Family

ID=23995604

Family Applications (3)

Application Number Title Priority Date Filing Date
US09/501,930 Expired - Fee Related US6667954B1 (en) 2000-02-10 2000-02-10 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment
US10/429,761 Expired - Lifetime US8339941B2 (en) 2000-02-10 2003-05-05 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment
US13/708,331 Abandoned US20130094370A1 (en) 2000-02-10 2012-12-07 Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment.

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US09/501,930 Expired - Fee Related US6667954B1 (en) 2000-02-10 2000-02-10 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment
US10/429,761 Expired - Lifetime US8339941B2 (en) 2000-02-10 2003-05-05 Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment

Country Status (7)

Country Link
US (3) US6667954B1 (en)
EP (4) EP1953938A1 (en)
AT (1) ATE397810T1 (en)
AU (1) AU2001234988A1 (en)
CA (2) CA2734550A1 (en)
DE (1) DE60134306D1 (en)
WO (1) WO2001059978A2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130266005A1 (en) * 2002-07-15 2013-10-10 Rockstar Consortium Us Lp Hitless switchover bandwidth sharing in a communication network

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6667954B1 (en) 2000-02-10 2003-12-23 Tellabs Operations, Inc. Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment
AU2002237132A1 (en) * 2001-03-02 2002-09-19 Meriton Networks Inc. Data path architecture for a light layer 1 oeo switch
US20020122222A1 (en) * 2001-03-02 2002-09-05 Denis Gallant Data path integrity in transparent OEO switch
US6966009B1 (en) 2001-08-28 2005-11-15 Tellabs Operations, Inc. System and method for aligning data in a network environment
EP1523820B1 (en) * 2002-06-21 2009-10-07 Thomson Licensing A fault-tolerant broadcast router
EP1383282A1 (en) * 2002-07-16 2004-01-21 Lucent Technologies Inc. Communication network comprising at least a source and a switch for receiving and forwarding data packets originated by the source
EP1525694A2 (en) * 2002-07-31 2005-04-27 Tellabs Operations, Inc. Methods and apparatus for improved communications networks
GB2395096B (en) * 2002-11-04 2004-11-10 Roke Manor Research Method of operating a redundant system
FR2848058B1 (en) * 2002-11-28 2005-02-11 Nec Technologies Uk Ltd METHOD FOR CELL RESELECTION BY A MOBILE TERMINAL IN SLEEP MODE IN A CELLULAR TELECOMMUNICATION NETWORK
US7443845B2 (en) * 2002-12-06 2008-10-28 Cisco Technology, Inc. Apparatus and method for a lightweight, reliable, packet-based transport protocol
US7475142B2 (en) * 2002-12-06 2009-01-06 Cisco Technology, Inc. CIFS for scalable NAS architecture
US20070058530A1 (en) * 2005-09-14 2007-03-15 Sbc Knowledge Ventures, L.P. Apparatus, computer readable medium and method for redundant data stream control
JP5176623B2 (en) * 2008-03-18 2013-04-03 日本電気株式会社 Ethernet transmission method, transmission apparatus and system
US9137166B2 (en) * 2010-01-28 2015-09-15 Brocade Communications Systems, Inc. In-order traffic aggregation with reduced buffer usage

Family Cites Families (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5072440A (en) * 1989-03-01 1991-12-10 Fujitsu Limited Self-routing switching system having dual self-routing switch module network structure
JP2677418B2 (en) * 1989-06-22 1997-11-17 富士通株式会社 ATM switch system switching method
EP0455827B1 (en) * 1989-11-29 1997-01-29 Fujitsu Limited Changing over method for doubled atm switch system
US5144619A (en) 1991-01-11 1992-09-01 Northern Telecom Limited Common memory switch for routing data signals comprising ATM and STM cells
JP2671699B2 (en) * 1991-11-15 1997-10-29 三菱電機株式会社 Cell exchange device
US5256958A (en) 1991-11-26 1993-10-26 At&T Bell Laboratories Concentrator-based growable packet switch
US5285441A (en) 1992-03-17 1994-02-08 At&T Bell Laboratories Errorless line protection switching in asynchronous transer mode (ATM) communications systems
SE515274C2 (en) * 1992-11-09 2001-07-09 Ericsson Telefon Ab L M Package selector for telecommunication system
SE515421C2 (en) 1993-02-15 2001-07-30 Ericsson Telefon Ab L M Methods for handling redundant selector plan in package selector and selector for execution of the method
SE516073C2 (en) * 1993-02-15 2001-11-12 Ericsson Telefon Ab L M Methods for handling redundant selector planes in packet switches and packet switches for execution of the method
JP3249648B2 (en) * 1993-07-19 2002-01-21 富士通株式会社 ATM switch and test method thereof
FI98773C (en) 1994-02-28 1997-08-11 Nokia Telecommunications Oy A method for sharing traffic in a telecommunications network implemented with ATM technology
DE4416719C2 (en) 1994-05-11 1998-08-20 Siemens Ag Circuit arrangement for the trouble-free rerouting of a message cell stream to an alternative path
DE4416720C1 (en) 1994-05-11 1995-03-23 Siemens Ag Method and circuit arrangement for synchronising communication cell streams transmitted redundantly
US5436886A (en) 1994-07-14 1995-07-25 Northern Telecom Limited ATM switch in dual switch plane operation
DE69532939T2 (en) * 1994-07-18 2005-06-16 Nippon Telegraph And Telephone Corp. A trouble-free path switching arrangement and method
DE4432061C1 (en) 1994-09-09 1995-12-07 Philips Patentverwaltung Packet data transmission system with input number generation circuits
JP2780660B2 (en) * 1995-03-20 1998-07-30 日本電気株式会社 Line switching device
JP2780669B2 (en) 1995-05-09 1998-07-30 日本電気株式会社 Multiple STM / ATM converter
US6026092A (en) * 1996-12-31 2000-02-15 Northern Telecom Limited High performance fault tolerant switching system for multimedia satellite and terrestrial communications networks
US6490251B2 (en) * 1997-04-14 2002-12-03 Nortel Networks Limited Method and apparatus for communicating congestion information among different protocol layers between networks
WO1999009784A2 (en) 1997-08-15 1999-02-25 Telefonaktiebolaget Lm Ericsson Cell selection for atm switch having redundant switch planes
FR2769778B1 (en) * 1997-10-14 2000-10-27 France Telecom METHOD FOR SECURING THE TRANSMISSION OF CELLS FROM A TELECOMMUNICATION SYSTEM
US6167041A (en) 1998-03-17 2000-12-26 Afanador; J. Abraham Switch with flexible link list manager for handling ATM and STM traffic
EP0961442B1 (en) 1998-05-29 2004-09-29 International Business Machines Corporation Switching architecture comprising two switch fabrics
US7065037B1 (en) * 1999-03-25 2006-06-20 Samsung Electronics Co., Ltd. Method and apparatus to provide facility and module redundancy in telecommunication switching equipment
US6667954B1 (en) 2000-02-10 2003-12-23 Tellabs Operations, Inc. Methods and apparatus for selecting the better cell from redundant streams within a cell-oriented environment

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130266005A1 (en) * 2002-07-15 2013-10-10 Rockstar Consortium Us Lp Hitless switchover bandwidth sharing in a communication network

Also Published As

Publication number Publication date
CA2734550A1 (en) 2001-08-16
EP2317674A1 (en) 2011-05-04
US8339941B2 (en) 2012-12-25
US20030231583A1 (en) 2003-12-18
EP2302824A1 (en) 2011-03-30
AU2001234988A1 (en) 2001-08-20
EP1254532B1 (en) 2008-06-04
ATE397810T1 (en) 2008-06-15
US6667954B1 (en) 2003-12-23
EP1254532A2 (en) 2002-11-06
CA2399619A1 (en) 2001-08-16
CA2399619C (en) 2011-05-10
EP1254532A4 (en) 2003-04-23
WO2001059978A3 (en) 2002-04-18
EP1953938A1 (en) 2008-08-06
WO2001059978A2 (en) 2001-08-16
DE60134306D1 (en) 2008-07-17

Similar Documents

Publication Publication Date Title
US20130094370A1 (en) Methods and Apparatus for Selecting the Better Cell From Redundant Streams Within A Cell-Oriented Environment.
JP2788577B2 (en) Frame conversion method and apparatus
US7088735B1 (en) Processing data packets in a multiple protocol system area network
US6631130B1 (en) Method and apparatus for switching ATM, TDM, and packet data through a single communications switch while maintaining TDM timing
US20060268913A1 (en) Streaming buffer system for variable sized data packets
EP1234412A2 (en) Receiver makes right
US6636515B1 (en) Method for switching ATM, TDM, and packet data through a single communications switch
US7245641B2 (en) Variable length packet switching system
US7061935B1 (en) Method and apparatus for arbitrating bandwidth in a communications switch
EP0683949B1 (en) A method for handling redundant switching planes in packet switches and a switch for carrying out the method
US5949778A (en) High performance fault tolerant switching system for multimedia satellite and terrestrial communications switches
JPH10126412A (en) Method and system for transmitting atm cell through atm link
US7272675B1 (en) First-in-first-out (FIFO) memory for buffering packet fragments through use of read and write pointers incremented by a unit access and a fraction of the unit access
US7197031B2 (en) Cross-connection of high bandwidth signal traffic across independent parallel shelves
US6636511B1 (en) Method of multicasting data through a communications switch
CA2436146A1 (en) Methods and apparatus for switching atm, tdm, and packet data through a single communications switch
US7379467B1 (en) Scheduling store-forwarding of back-to-back multi-channel packet fragments
US5475675A (en) Apparatus and method for non-stop switching in asynchronous transfer mode
KR20010102399A (en) Data communications
JP2644023B2 (en) Communication switching element
US20020181463A1 (en) System and method for handling asynchronous transfer mode cells
US6788699B1 (en) Output buffer type asynchronous transfer mode switch
USRE43218E1 (en) Circuit and method for processing communication packets and valid data bytes
JPH0423540A (en) Cell error correcting system in atm network
KR20010057812A (en) Atm switch interface device in the atm switch based mpls edge router system

Legal Events

Date Code Title Description
AS Assignment

Owner name: TELLABS OPERATIONS, INC., ILLINOIS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BODUCH, MARK E.;RICHMOND, MARK A.;WEIZEORICK, LAWRENCE D.;SIGNING DATES FROM 20130104 TO 20130123;REEL/FRAME:029715/0516

AS Assignment

Owner name: TELLABS OPERATIONS, INC., ILLINOIS

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE TYPOGRAPHICAL ERROR IN THE DOCKET NUMBER PREVIOUSLY RECORDED ON REEL 029715 FRAME 0516. ASSIGNOR(S) HEREBY CONFIRMS THE DOCKET NUMBER SHOULD NOW READ 2376.2144-013;ASSIGNORS:BODUCH, MARK E.;RICHMOND, MARK A.;WEIZEORICK, LAWRENCE D.;SIGNING DATES FROM 20130104 TO 20130123;REEL/FRAME:029794/0405

AS Assignment

Owner name: CERBERUS BUSINESS FINANCE, LLC, AS COLLATERAL AGEN

Free format text: SECURITY AGREEMENT;ASSIGNORS:TELLABS OPERATIONS, INC.;TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.);WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.);REEL/FRAME:031768/0155

Effective date: 20131203

AS Assignment

Owner name: TELECOM HOLDING PARENT LLC, CALIFORNIA

Free format text: ASSIGNMENT FOR SECURITY - - PATENTS;ASSIGNORS:CORIANT OPERATIONS, INC.;TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.);WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.);REEL/FRAME:034484/0740

Effective date: 20141126

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: TELECOM HOLDING PARENT LLC, CALIFORNIA

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE REMOVE APPLICATION NUMBER 10/075,623 PREVIOUSLY RECORDED AT REEL: 034484 FRAME: 0740. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT FOR SECURITY --- PATENTS;ASSIGNORS:CORIANT OPERATIONS, INC.;TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.);WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.);REEL/FRAME:042980/0834

Effective date: 20141126