Multiplex communications – Fault recovery – Bypass an inoperative channel
Reexamination Certificate
2008-07-01
2008-07-01
Yao, Kwang B. (Department: 2616)
Multiplex communications
Fault recovery
Bypass an inoperative channel
C370S238000
Reexamination Certificate
active
07394760
ABSTRACT:
A system and method for identifying optimal mapping of logical links to the physical topology of a network is provided. Upon obtaining one or more mapping options for mapping multiple logical links between one or more pairs of network nodes onto physical paths that are at least relatively disjoint and obtaining a maximum time delay allowed between the each pair of network nodes, the mapping options are correlated with the maximum time delay to identify optimal mapping of logical links to the physical topology of a network.
REFERENCES:
patent: 5164938 (1992-11-01), Jurkevich et al.
patent: 5500808 (1996-03-01), Wang
patent: 5590356 (1996-12-01), Gilbert
patent: 5600638 (1997-02-01), Bertin et al.
patent: 5764740 (1998-06-01), Holender
patent: 5805578 (1998-09-01), Stirpe et al.
patent: 5933607 (1999-08-01), Tate et al.
patent: 6069894 (2000-05-01), Holender et al.
patent: 6577601 (2003-06-01), Wolpert
patent: 6956824 (2005-10-01), Mark et al.
patent: 2002/0097671 (2002-07-01), Doverspike et al.
patent: 950966 (1989-09-01), None
Modiano et al, “Survicable routing of logical topologies in WDM networks”, IEEE INFOCOM 2001, pp. 348-357.
Nucci et al, “Design of Fault-Tolerant Logical Topologies in Wavelength-Routed Optical IP Networks”, GLOBECOM 2001, pp. 1-6.
T. Erlebach, K. Jansen, C. Kakalamanis, M. Mihail and P. Perslano “Optimal wavelength routing on directed fiber trees”, Theoretical Computer Science, vol. 221, n.1-2, pp. 119-137, 1999.
D. S. Hochbaum editor “Approximation Algorithms for NP-Hard Problems”, PWS Publishing Company, 1997.
Eric J. Harder, Sang-Kyu Lee and Hyeong-Ah Choi “On Wavelength Assignment in WDM Optical Networks”, Proceedings of the 4th International Conference on Massively Parallel Processing Using Optical Interconnections (MPPOI'97), 1997.
A. Nucci, N. Taft, P. Tmran, H. Zang and C. Diot “Increasing the Link Utilization in IP over WDM Networks” Opticom 2002. Jun. 2002.
G. Iannaccone, C. Chuah, R. Mortier, S. Bhattacharyya and C. Diot “Analysis of Link Failures in a Large IP Backbone” in Proc. 2nd ACM Sigcomm Internet Measurement Workshop (IMW), Nov. 2002.
K. Papagiannaki, S. Moon, C. Fraleigh, P. Thiran, F. Tobagi and C. Diot “Analysis of Measured Single-Hop Delay from an Operational Backbone Network” in Proc.IEEE Infocom, New York, Jun. 2002.
J. Armitage, O. Crochat, J. Y. Le Boudec “Design of a Survivable WDM Photonic Network”, in Proc. INFOCOM '97, pp. 244-252, Apr. 1997.
O. Crochat, J.Y.Le Boudec “Design Protection for WDM Optical Networks”, IEEE Journal on Selected Areas in Communication, vol. 16, n.7, pp. 1158-1165, Sep. 1998.
O.Crochat, J.Y.Le Boudec, O.Gerstel “Protection Interoperability for WDM Optical Networks”, IEEE Transaction on Networking, vol. 8, n.3, pp. 384-395, Jun. 2000.
E. Modiano, A. Narula-Tam “Survivable routing of logical topologies in WDM networks”, in Proc. INFOCOM '01 vo1.l, pp. 348-357, Anchorage, Alaska, Apr. 2001.
F. Glover, E. Taillard and D. De Werra “A User's Guide to Tabu Search”, Annals of Operations Research, vol. 41, pp. 3-28, 1993.
V. Kumar “Approximating arc circular colouring and bandwidth allocation in all-optical ring networks”, First international Workshop on Approximation ALgorihms for Combinatorial Optimization Problems (APPROX'98), 1998.
A. Nucci, B. Sanso, T. G. Crainic, E. Leonardi, M. Marsan “Design of Fault-Tolerant Logical Topologies in Wavelength-Routed Optical IP Networks”, IEEE Globecom Proceedings, Nov. 2001.
B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Perennes and U. Vaccar “Graph problems arising from wavelength-routing in all-optical networks”, 2nd IEEE Workshop on Optics and Computer Science, part of IPP'97, Genova, Switzerland, Apr. 1997. IEEE Press.
V. Auletta, 1. Caragiannis and P. Persiano “Randomized path coloring on binary trees”, 3rd International Workshop on Approximation ALgorihms for Combinatorial Optimization Problems (APPROX'OO), vo1. I913, pp. 60-71, Springer-Verlag, 2000.
Diot Christophe
Giroire Frederic
Nucci Antonio
Taft Nina A.
Lai Andrew
Sprint Communications Company L.P.
Yao Kwang B.
LandOfFree
Method and system for correlating practical constraints in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for correlating practical constraints in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for correlating practical constraints in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2800295