Area based sub-path protection for communication networks

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S239000, C709S241000, C709S242000, C370S401000, C370S402000, C370S404000

Reexamination Certificate

active

10099079

ABSTRACT:
Methods, software products, and systems establish a connection between a source network element and a destination network element in a communication network comprising a plurality of first network elements. The first network elements are partitioned into at least two areas wherein a shared network element is shared between the at least two areas. A working path is then generated between the source network element and the destination network element through the shared network element. A first backup sub-path is then generated within a first one of the at least two areas between the source network element and the shared network element. A second backup sub-path is generated within a second one of the at least two areas between the shared network element and the destination network element.

REFERENCES:
patent: 6115753 (2000-09-01), Joens
patent: 6643464 (2003-11-01), Roorda et al.
patent: 6850705 (2005-02-01), Su et al.
patent: 2001/0032271 (2001-10-01), Allen
patent: 2002/0150041 (2002-10-01), Reinshmidt et al.
patent: 2002/0167899 (2002-11-01), Thompson et al.
patent: 2002/0181393 (2002-12-01), Grover et al.
patent: 2002/0181402 (2002-12-01), Lemoff et al.
patent: 2002/0191545 (2002-12-01), Pieda et al.
patent: 2003/0037168 (2003-02-01), Brabson et al.
patent: 2003/0058798 (2003-03-01), Fleischer et al.
patent: 2003/0063613 (2003-04-01), Carpini et al.
patent: 2003/0161304 (2003-08-01), deBoer et al.
patent: 2003/0223359 (2003-12-01), Einstein et al.
patent: 2004/0179472 (2004-09-01), Khalilzadeh et al.
patent: 2004/0205239 (2004-10-01), Doshi et al.
patent: 2004/0246892 (2004-12-01), Elie-Dit-Cosaque et al.
patent: 2005/0036442 (2005-02-01), Saleh et al.
patent: 2005/0071484 (2005-03-01), Kang et al.
patent: 1 303 110 (2003-04-01), None
patent: 2002335276 (2002-11-01), None
Hui Zang et al. “Path-Protection routing and Wavelength Assigment (RWA) in WDM Mesh Networks under Duct-Layer Constraints”, Apr. 2003.
Ramamurthy et al. “Survivable WDM Mesh Networks”, Apr. 2003.
Vishal Anand “A study of various protection schemes in optical WDM mesh networks”, Dec. 2000.
Callinescu et al. “Minimizing electronic line terminals for automatic ring protection in general WDM optical networks”, Jan. 2002.
Grover et al. “Design of a Meta-Mesh of chain subnetworks: Enhancing the attractiveness of Mesh-Restorable WDM Networking on low connectivity graphs”, Jan. 2002.
Visvanathan et al. “WDM mesh network link protection with wavelength conversion”, Computer science and Engineering University of Nebraska-Lincoln.
Krishnaswamy, Rajesh M.; Snarajan, Kumar N., “Design of Logical Topolgies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers.”, Electrical Communication Engineering Department, Indian Insttiute of Science, IEEE, pp. 919-927.
Mukherjee, Biswanath, “Optical Communication Networks,” Department of Computer Science, University of California, Davis McGraw-Hill, 1997.
Zhu, Keyao and Mukherjee, Biswanath. “A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges.” Computer Science Department, University of California, Davis, Davis, CA 95616, pp. 1-17.
Modiano, Eytan; Lin, Philip J., “Traffic Grooming in WDM Networks,” IEEE, Jul. 2001, pp. 124-129.
Zhu, Keyao and Mukherjee, Biswanath, “Traffic Grooming in an Optical WDM Mesh Network,” IEEE, vol. 20, No. 1, Jan. 2002, pp. 122-133.
Chlamtac, Imrich, “Lightpath Communications: An Approach to High Bandwidth Optical WAN'” IEEE, vol. 40, No. 7, Jul. 1992, pp. 1171-1182.
Mukherjee, Biswanath, “Some Principles for Designing a Wide-Area WDM Optical Network,” IEEE, vol. 4, No. 5, Oct. 1996, pp. 684-696.
Ramaswami, Rajiv, “Design of Logical Topologies for Wavelength-Routed Optical Networks,” IEEE, vol. 14, No. 5, Jun. 1996.
Ganz, Aura; Wang, Xudong, “Efficient Algorithm for Virtual Topology Design In Multihop Lightwave Networks,” IEEE, vol. 2, No. 3, Jun. 1994, pp. 217-225.
Krishnaswamy, Rajesh M.; Sivarajan, Kumar No., “Design of Logical Topolgies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers,” Electrical Communication Engineering Department, Indian Institute of Science, IEEE, pp. 919-927.
Gerstel, O.; Lin, P.; Sasaki, G., “Combined WDM and Sonet Network Design,” IEEE 1999 pp. 734-743.
Zang, Hui, Jue, Jason P.; Mukherjee, Biswanath, “A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks,” Baltzer Science Publishers 2000, pp. 47-60.
Chlamtac, I., Ganz, A. and Karmi, G., “Lightnets: Topologies for High-Speed Optical Networks,” IEEE vol. 11, No. 5/6, Many/Jun. 1993, pp. 951-961.
Chiu, Angela L. and Modiano, Eytan H., “Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks,” IEEE, vol. 18, No. 1, Jan. 2000.
Wan, Peng-Jun; Calinescu, Gruia, Liu, Liwu, and Frieder, Ophir, “Grooming of Arbitrary Traffic in SONET/WDM BLSRs,” IEEE, vol. 18, No. 10, Oct. 2000, pp. 1995-2003.
Zhang, Xijun and Qiao, Chunming, “An Effective and Comprehensive Approach for Traffic Grooming and Wavelength Assignment in SONET/WDM Rings,” vol. 8, No. 5, Oct. 2000.
Gerstel, Ornan, Ramaswami, Rajiv, and Sasaki, Galen H., “Cost-Effective Traffic Grooming in WDM Rings,” IEEE, vol. 8, No. 5, Oct. 2000, pp. 618-630.
Simmons, Jane M.; Goldstein, Evan L.; and Saleh, Adel A.M., “Quantifying the Benefit of Wavelength Add-Drop in WDM Rings with Distance-Independent and Department Traffic,” IEEE, vol. 17, No. 1., Jan. 1999, pp. 48-57.
Dutta, Rudra and Rouskas, George N., “On Optimal Traffic Grooming in WDM Rings,” IEEE, vol. 20, No. 1, Jan. 2002, pp. 110-121.
Wang, Jian; Cho, Wonhong; Vemuri, V. Rao; and Mukherjee, Biswanath, “Improved Approaches for Cost-Effective Traffic Grooming In WDM Ring Networks: ILP Formulations and Single-Hop and Multihop Connections,” IEEE, vol. 19, No. 11, Nov. 2001.
Wang, Jian, Mukherjee, Biswanath, “Interconnected WDM ring Networks: Strategies for Interconnection and Traffic Grooming,” SPIE Optical Networks Magazine.
Berry, Randall and Modiano, Eytan, “Reducing Electronic Multiplexing Costs in SONET/WDM rings with Dynamically Changing Traffic,” IEEE, vol. 18, No. 10, Oct. 2000, pp. 1961-1971.
Konda, V. R; and Chow, T. Y., “Algorithm for Traffic Grooming in Oprical Networks To Minimize the Number of Transceivers,” IEEE Workshop on High Performance Switching and Routing, (Dallas, TX), pp. 218-221, May 2001.
Brunato, Mauro and Battiti, Roberto, “A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies,” Technical Report Universita di Trento, Dec. 2001.
Thiagarajan, Sashisekaran and Somani, Arun K., “Capacity fairness of WDM Networks with Grooming Capabilities,”, Optical Networks Magazine, May/Jun. 2001, pp. 24-32.
Srinivasan, R.; and Somani, Arun K., “A Generalized Framework for Analyzing Time-Space Switched Optical Networks,” IEEE, vol. 20, No. 1, Jan. 2002, pp. 202-215.
Zhu, Keyao and Mukherjee, Biswanath, “On-Line Approaches for Provisioning Connections of Different Bandwidth granularties in WDM Mesh Networks,” OFC/ 2001.
Cox, JR., Louis Anthony and Sanchez (Ryan) Jennifer, Cost Savings from Optimized packing and grooming of Optical circuits: Mesh Versus ring Comparisons, optical Networks Magazine, May/Jun. 2001, pp. 72-90.
Lardies, Ana, Gupta, Rakesh and Patterson, Raymond A., “Traffic Grooming in a Multi-Layer Network,” Optical Networks Magazine, May/Jun. 2001, pp. 91-99.
Subramaniam, Suresh, Azizoglu, Murat and Somani, Arun K., “All-Optical Networks with Sparse Wavelength Conversion,” IEEE, vol. 4, No. 4, Aug. 1996, pp. 544-557.
Iness, Jason; and Mukherjee, Biswanath, ȁ

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Area based sub-path protection for communication networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Area based sub-path protection for communication networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Area based sub-path protection for communication networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3767139

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.