Multiplex communications – Fault recovery – Bypass an inoperative channel
Reexamination Certificate
2003-05-15
2010-10-12
Mills, Donald L (Department: 2462)
Multiplex communications
Fault recovery
Bypass an inoperative channel
C370S238000, C370S252000
Reexamination Certificate
active
07813270
ABSTRACT:
A maximum-flow based route precomputation algorithm includes at least a route generation phase and a route selection phase, and determines one or more routes between at least a given pair of nodes in a network. In the route generation phase, a maximum-flow algorithm is applied to a first set of information characterizing links between the given pair of nodes in the network. The output of the maximum-flow algorithm is utilizable to generate a second set of information characterizing corresponding admissible flows. In the route selection phase, one or more routes are determined based on the second set of information using, for example, a shortest widest path (SWP) algorithm. The route generation and route selection phases may be repeated for each of a plurality of node pairs of the network.
REFERENCES:
patent: 2003/0227877 (2003-12-01), Kar et al.
E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik 1, pp. 269-271, 1959.
E.L. Lawler, “A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem,” Management Science, vol. 18, pp. 401-405, Mar. 1972.
S.-W. Lee et al., “A K-Best Paths Algorithm for Highly Reliable Communication Networks,” IEICE Trans. Communications, pp. 586-590, 1999.
S.D. Nikolopoulos et al., “Addressing Network Survivability Issues by Finding the K-best Paths Through a Trellis Graph,” Proc. of IEEE Infocom, pp. 1-8, 1997.
A. Shaikh et al., “Efficient Precomputation of Quality-of-Service Routes,” Proc. Workshop on Network and Operating Systems Support for Digital Audio and Video, 16 pages, Jul. 1998.
A. Orda et al., “QoS Routing: The Precomputation Perspective,” Proc. of IEEE Infocom, 9 pages, 1999.
M. Peyravian et al., “Network Path Caching: Issues, Algorithms and a Simulation Study,” Computer Communications, 20(8), pp. 605-614, Aug. 1997.
M. Kodialam et al., “Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications,” Proc. of IEEE Infocom, pp. 1-16, 2000.
S. Suri et al. “Profile-Based Routing: A New Frame work for MPLS Traffic Engineering,” Proc. of. QofIS, pp. 1-2, 2001.
D. Awduche et al., “Extensions to RSVP for LSP Tunnels,” RFC3209, pp. 1-3, Dec. 2001.
L. Andersson et al., “Label Distribution Protocol Specification,” RFC3036, pp. 1-17, Jan. 2001.
Z. Wang et al., “Quality-of-Service Routing for Supporting Multimedia Applications,” IEEE Journal on Selected Areas in Comm., vol. 14, No. 7, pp. 1228-1234, Sep. 1996.
A.V. Goldberg et al., “A New Approach to the Maximum-Flow Problem,” Journal of the Association for Computing Machinery, vol. 35, No. 4, pp. 921-940, Oct. 1988.
S. Acharya et al., “Architecting Self-Tuning Optical Networks,” Proceedings of the European Conference of Optical Communications, 2 pages, Sep. 2002.
D. Katz et al., “Traffic Engineering Extensions to OSPF Version 2,” Network Working Group, IETF, pp. 1-14, Oct. 2002.
D.H. Lorenz et al., “QoS Routing in Networks with Uncertain Parameters,” IEEE/ACM Transactions on Networking, vol. 6, No. 6, 8 pages, Dec. 1998.
Acharya Swarup
Gupta Bhawna
Risbood Pankaj
Srivastava Anurag
Alcatel-Lucent USA Inc.
Mills Donald L
Russell Wanda Z
Ryan & Mason & Lewis, LLP
LandOfFree
Route precomputation method and apparatus for bandwidth... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Route precomputation method and apparatus for bandwidth..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Route precomputation method and apparatus for bandwidth... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4193082