Differential delay constrained routing for...

Details Differential delay constrained routing for... Differential delay constrained routing for...

2004-09-24

2008-08-05

Ngo, Ricky (Department: 2616)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S228000, C709S241000

Reexamination Certificate

active

07408881

ABSTRACT:
Virtually-concatenated data traffic is routed in a network comprising a plurality of nodes. For a given traffic demand to be routed from a source node to a destination node in the network, an initial candidate path set satisfying a differential delay constraint is determined by arranging a plurality of paths in order of increasing delay and selecting a particular subset of the plurality of paths as the initial candidate set. A determination is then made as to whether the initial candidate path set is able to support a bandwidth requirement of the traffic demand. If the initial candidate path set is able to support the bandwidth requirement of the traffic demand, the initial candidate path set is utilized to route the traffic demand. Otherwise, the process is repeated for one or more additional iterations, with a different candidate path set satisfying the differential delay constraint being selected for a given additional iteration by application of a sliding-window function to the plurality of paths arranged in order of increasing delay, until a different candidate path satisfying the differential delay constraint is determined to support the bandwidth requirement of the traffic demand.

REFERENCES:
patent: 6111881 (2000-08-01), Soncodi
patent: 6304549 (2001-10-01), Srinivasan et al.
patent: 6735176 (2004-05-01), So
patent: 7031256 (2006-04-01), Hamlin et al.
patent: 7058008 (2006-06-01), Wilson et al.
patent: 2004/0076176 (2004-04-01), Kfir
U.S. Appl. No. 10/446,220, filed May 28, 2003, S. Acharya et al., “Fast Restoration for Virtually-Concatenated Data Traffic.”
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.”
U.S. Appl. No. 10/853,422, May 25, 2004, S. Acharya et al., “Link Delay Determination Using Virtual Concatenation.”
U.S. Appl. No. 10/856,444, May 28, 2004, H.S. Nagesh et al., “Route Determination with Differential Delay Compensation 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.
G. Garg et al., “Managing Differential Delay in SONET Architectures,” EE Times, pp. 1-5, Jan. 2002.
D. Karger et al., “On Approximating the Longest Path in a Graph,” Algorithmica 18, pp. 1-17, 1997.

Affiliated with

Also associated with

Rating

Differential delay constrained routing for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Differential delay constrained routing for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Differential delay constrained routing for... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4008694