Sharing restoration path bandwidth in mesh networks

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S242000, C370S248000, C370S250000, C370S244000

Reexamination Certificate

active

07606237

ABSTRACT:
A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.

REFERENCES:
patent: 4190821 (1980-02-01), Woodward
patent: 4594709 (1986-06-01), Yasue
patent: 4797882 (1989-01-01), Maxemchuk
patent: 5452286 (1995-09-01), Kitayama
patent: 5506956 (1996-04-01), Cohen
patent: 5706276 (1998-01-01), Arslan et al.
patent: 5754543 (1998-05-01), Seid
patent: 5854903 (1998-12-01), Morrison et al.
patent: 5856981 (1999-01-01), Voelker
patent: 5881048 (1999-03-01), Croslin
patent: 5933422 (1999-08-01), Kusano et al.
patent: 5933425 (1999-08-01), Iwata
patent: 5956339 (1999-09-01), Harada et al.
patent: 5995485 (1999-11-01), Croslin
patent: 6075766 (2000-06-01), Croslin
patent: 6104701 (2000-08-01), Avargues et al.
patent: 6130875 (2000-10-01), Doshi et al.
patent: 6141319 (2000-10-01), Dighe et al.
patent: 6205117 (2001-03-01), Doshi et al.
patent: 6282170 (2001-08-01), Bentall et al.
patent: 6477582 (2002-11-01), Luo et al.
patent: 6512740 (2003-01-01), Baniewicz et al.
patent: 6538987 (2003-03-01), Cedrone et al.
patent: 6549513 (2003-04-01), Chao et al.
patent: 6606303 (2003-08-01), Hassel et al.
patent: 6643464 (2003-11-01), Roorda et al.
patent: 6697334 (2004-02-01), Klincewicz et al.
patent: 6711125 (2004-03-01), Walrand et al.
patent: 6725401 (2004-04-01), Lindhorst-Ko
patent: 6744727 (2004-06-01), Liu et al.
patent: 6760302 (2004-07-01), Ellinas et al.
patent: 6778492 (2004-08-01), Charny et al.
patent: 6795394 (2004-09-01), Swinkels et al.
patent: 6807653 (2004-10-01), Saito
patent: 6850487 (2005-02-01), Mukherjee et al.
patent: 6856592 (2005-02-01), Grover et al.
patent: 6863363 (2005-03-01), Yabuta
patent: 6882627 (2005-04-01), Pieda et al.
patent: 6904462 (2005-06-01), Sinha
patent: 6977889 (2005-12-01), Kawaguchi et al.
patent: 6982951 (2006-01-01), Doverspike et al.
patent: 6996065 (2006-02-01), Kodialam et al.
patent: 7039009 (2006-05-01), Chaudhuri et al.
patent: 7042836 (2006-05-01), Isonuma et al.
patent: 7099286 (2006-08-01), Swallow
patent: 7110356 (2006-09-01), Illikkal et al.
patent: 7133358 (2006-11-01), Kano
patent: 7164652 (2007-01-01), Puppa et al.
patent: 7180852 (2007-02-01), Doverspike et al.
patent: 7188280 (2007-03-01), Shinomiya et al.
patent: 7197008 (2007-03-01), Shabtay et al.
patent: 7209975 (2007-04-01), Zang et al.
patent: 7218851 (2007-05-01), Zang
patent: 7248561 (2007-07-01), Ishibashi et al.
patent: 7272116 (2007-09-01), Houchen
patent: 7280755 (2007-10-01), Kang et al.
patent: 7308198 (2007-12-01), Chudak et al.
patent: 7362709 (2008-04-01), Hui et al.
patent: 7398321 (2008-07-01), Qiao et al.
patent: 7477657 (2009-01-01), Murphy et al.
patent: 2001/0038471 (2001-11-01), Agrawal et al.
patent: 2002/0004843 (2002-01-01), Andersson et al.
patent: 2002/0059432 (2002-05-01), Masuda et al.
patent: 2002/0067693 (2002-06-01), Kodialam et al.
patent: 2002/0071392 (2002-06-01), Grover et al.
patent: 2002/0097671 (2002-07-01), Doverspike et al.
patent: 2002/0118636 (2002-08-01), Phelps et al.
patent: 2002/0141334 (2002-10-01), Deboer et al.
patent: 2002/0174207 (2002-11-01), Battou
patent: 2002/0191247 (2002-12-01), Lu et al.
patent: 2002/0194339 (2002-12-01), Lin et al.
patent: 2003/0005165 (2003-01-01), Langridge et al.
patent: 2003/0009582 (2003-01-01), Qiao et al.
patent: 2003/0018812 (2003-01-01), Lakshminarayana et al.
patent: 2003/0021222 (2003-01-01), Boer et al.
patent: 2003/0037276 (2003-02-01), Mo et al.
patent: 2003/0048749 (2003-03-01), Stamatelakis et al.
patent: 2003/0065811 (2003-04-01), Lin et al.
patent: 2003/0095500 (2003-05-01), Cao
patent: 2003/0112760 (2003-06-01), Puppa et al.
patent: 2003/0117950 (2003-06-01), Huang
patent: 2003/0147352 (2003-08-01), Ishibashi et al.
patent: 2003/0169692 (2003-09-01), Stern et al.
patent: 2003/0179700 (2003-09-01), Saleh et al.
patent: 2003/0193944 (2003-10-01), Sasagawa
patent: 2003/0223357 (2003-12-01), Lee
patent: 2004/0004938 (2004-01-01), Buddhikot et al.
patent: 2004/0008619 (2004-01-01), Doshi et al.
patent: 2004/0042402 (2004-03-01), Galand et al.
patent: 2004/0052207 (2004-03-01), Charny et al.
patent: 2004/0057375 (2004-03-01), Shiragaki et al.
patent: 2004/0114512 (2004-06-01), Johri
patent: 2004/0165526 (2004-08-01), Yada et al.
patent: 2004/0174882 (2004-09-01), Willis
patent: 2004/0184402 (2004-09-01), Alicherry et al.
patent: 2004/0190445 (2004-09-01), Dziong et al.
patent: 2004/0190461 (2004-09-01), Gullicksen et al.
patent: 2004/0205239 (2004-10-01), Doshi et al.
patent: 2004/0208547 (2004-10-01), Sabat et al.
patent: 2004/0233843 (2004-11-01), Barker
patent: 2005/0185652 (2005-08-01), Iwamoto
patent: 2005/0201276 (2005-09-01), Sinha
patent: 2005/0232144 (2005-10-01), Doverspike et al.
patent: 2006/0013149 (2006-01-01), Jahn et al.
patent: 2006/0051090 (2006-03-01), Saniee et al.
patent: 2006/0178918 (2006-08-01), Mikurak
patent: 2007/0011284 (2007-01-01), Le Roux et al.
patent: 2008/0095045 (2008-04-01), Owens et al.
ITU-T;“Operation & Maintenance mechanism for MPLS networks”; 2002; ITU-T pp. 1-22.
“Optical Network Design and Restoration” by B. T. Doshi, et al., BLTJ, Jan.-Mar. 1999.
“Design of a Meta-mesh of Chain Subnetworks: Enhancing the Attractiveness of Mesh-Restorable WDM networking on Low Connectivity Graphs” by W. D. Grover and J. Doucette, IEEE JSAC, vol. 20, No. 1, Jan. 2002.
“Sonet Bidirectional Line-Switched Ring Equipment Generic Criteria,” Generic Requirements, GR-1230-Core, Issue 4, Dec. 1998, pp. 3-48 through 3-61.
“RSVP-TE: Extensions to RSVP for LSP Tunnels” by D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow; Cisco Systems, Inc. Dec. 2001, pp. 1-55.
“Operation & Maintenance mechanism for MPLS networks”; ITU-T Recommendation Y.1711; Telecommunication Standardization Sector of ITU; Series Y: Global Information Infrastructure And Internet Protocol Aspects; Nov. 2002.
Cisco's Packet over Sonet/SDH (POS) Technology Support; Mission Accomplished Copyright 1997. Cisco Systems, Inc. pp. 1-8.
“Fast, Scalable, and Distributed Restoration in General Mesh Optical Networks” by Gary P. Austin et al.; Bell Labs Technical Journal; Jan.-Jun. 2001; pp. 67-81.
“Optimal Design and Evaluation of Survivable WDM Transport Networks” by Yasuhiro Miyao et al.; IEEE Journal on Selected Areas in Communications, vol. 16, No. 7, Sep. 1998, pp. 1190-1198.
“Using Local Information for WDM Network Protection”, by Hungjen Wang et al., http://www.mit.edu/˜modiano/papers/C46.pdf, 2002, pp. 1-4.

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

Sharing restoration path bandwidth in mesh 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 Sharing restoration path bandwidth in mesh networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharing restoration path bandwidth in mesh networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4094711

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