Fast restoration for virtually-concatenated data traffic

Details Fast restoration for virtually-concatenated data traffic Fast restoration for virtually-concatenated data traffic

2003-05-28

2008-08-12

Nguyen, Chau (Department: 2619)

Multiplex communications

Fault recovery

Bypass an inoperative switch or inoperative element of a...

C370S907000

Reexamination Certificate

active

07411900

ABSTRACT:
Techniques are disclosed for restoration of virtually-concatenated data traffic in a data transmission network. A virtually-concatenated group is formed comprising: (i) a plurality of primary members each associated with a corresponding data stream, and (ii) at least one backup member. Each of the plurality of primary members and the backup member of the virtually-concatenated group may be assigned a corresponding one of a plurality of data transmission routes between first and second nodes of the network. Responsive to a failure of a given one of the plurality of primary members, the backup member is utilized for restoring at least a portion of the data traffic of the given member. The invention also provides a modified link capacity adjustment scheme (LCAS) protocol which substantially reduces the time required to report changes in member status information from a sink node to a source node, thereby substantially reducing the amount of time required to perform a restoration operation.

REFERENCES:
patent: 6014707 (2000-01-01), Miller et al.
patent: 6606297 (2003-08-01), Magill et al.
patent: 6667989 (2003-12-01), Sekii et al.
patent: 6697373 (2004-02-01), Sandstrom
patent: 6912201 (2005-06-01), Yoshida et al.
patent: 6965612 (2005-11-01), Chohan et al.
patent: 7020158 (2006-03-01), Rouaud
patent: 7058008 (2006-06-01), Wilson et al.
patent: 7167442 (2007-01-01), Courtney et al.
patent: 7298744 (2007-11-01), Suh et al.
patent: 2002/0181479 (2002-12-01), Okuno
patent: 2003/0165115 (2003-09-01), Sutoh et al.
patent: 2004/0076176 (2004-04-01), Kfir
patent: 2004/0081081 (2004-04-01), Colombo
patent: WO 00/31986 (2000-06-01), None
ITU-T Recommendation G.7042/Y.1305—Corrigendum 1, “Link Capacity Adjustment Scheme (LCAS) for Virtual Concatenated Signals,” 16 pages, 2002.
ITU-T Recommendation G.7042/Y.1305, “Link Capacity Adjustment Scheme (LCAS) for Virtual Concatenated Signals,” 24 pages, 2001.
ITU-T Recommendation G.707/Y.1322, “Network Node Interface for the Synchronous Digital Hierarchy,” 184 pages, 2000.
U.S. Appl. No. 10/745,881, filed Dec. 26, 2003, S. Acharya et al., “Route Determination Method and Apparatus for Virtually-Concatenated Data Traffic.”
J. Edmonds et al., “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems,” Journal of ACM, vol. 19, No. 2, pp. 248-264, Apr. 1972.
James B. Orlin, “A Faster Strongly Polynomial Minimum Cost Flow Algorithm,” Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 377-387, 1988.

Affiliated with

Also associated with

Rating

Fast restoration for virtually-concatenated data traffic does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast restoration for virtually-concatenated data traffic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast restoration for virtually-concatenated data traffic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3997448