Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Alternate path routing
Reexamination Certificate
2003-06-03
2011-12-13
Caldwell, Andrew (Department: 2445)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Alternate path routing
C709S226000, C709S251000, C370S222000, C370S228000, C370S258000
Reexamination Certificate
active
08078756
ABSTRACT:
Methods and apparatus for enabling a protected circuit path to be created efficiently are disclosed. In accordance with one embodiment of the present invention, a method for creating a protected circuit path within an optical network system includes identifying a first node, a second node, and a third node. Once the nodes are identified, a pseudo link or a virtual link may be created between the second node and the third node. A first circuit path is then routed between the first node and the second node, and a second circuit path which protects that first circuit path is routed between the first node and the third node using the pseudo link.
REFERENCES:
patent: 4862496 (1989-08-01), Kelly et al.
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5459716 (1995-10-01), Fahim et al.
patent: 5467345 (1995-11-01), Cutler, Jr. et al.
patent: 5497368 (1996-03-01), Reijnierse et al.
patent: 5627822 (1997-05-01), Edmaier et al.
patent: 5727051 (1998-03-01), Holender
patent: 5854899 (1998-12-01), Callon et al.
patent: 5923646 (1999-07-01), Mandhyan
patent: 6073248 (2000-06-01), Doshi et al.
patent: 6078590 (2000-06-01), Farinacci et al.
patent: 6185210 (2001-02-01), Troxel
patent: 6272107 (2001-08-01), Rochberger et al.
patent: 6301254 (2001-10-01), Chan et al.
patent: 6359859 (2002-03-01), Brolin et al.
patent: 6430150 (2002-08-01), Azuma et al.
patent: 6433903 (2002-08-01), Barry et al.
patent: 6532088 (2003-03-01), Dantu et al.
patent: 6542468 (2003-04-01), Hatakeyama
patent: 6549513 (2003-04-01), Chao et al.
patent: 6553034 (2003-04-01), Chan et al.
patent: 6556319 (2003-04-01), Feinberg et al.
patent: 6567194 (2003-05-01), Badr
patent: 6587241 (2003-07-01), Saleh
patent: 6606297 (2003-08-01), Magill et al.
patent: 6616350 (2003-09-01), de Boer et al.
patent: 6643464 (2003-11-01), Roorda et al.
patent: 6646990 (2003-11-01), Gray et al.
patent: 6658013 (2003-12-01), de Boer et al.
patent: 6671819 (2003-12-01), Passman et al.
patent: 6683891 (2004-01-01), Mazzurco et al.
patent: 6707820 (2004-03-01), Arndt et al.
patent: 6721502 (2004-04-01), Al-Salameh et al.
patent: 6728205 (2004-04-01), Finn et al.
patent: 6744775 (2004-06-01), Beshai et al.
patent: 6751190 (2004-06-01), Swallow
patent: 6765880 (2004-07-01), Hillard et al.
patent: 6768718 (2004-07-01), Beshai et al.
patent: 6775305 (2004-08-01), Delvaux
patent: 6775477 (2004-08-01), Badr
patent: 6804712 (2004-10-01), Kracht
patent: 6813241 (2004-11-01), Wang et al.
patent: 6813242 (2004-11-01), Haskin et al.
patent: 6816680 (2004-11-01), Purse et al.
patent: 6826158 (2004-11-01), Seaman et al.
patent: 6895091 (2005-05-01), Elliott et al.
patent: 6917759 (2005-07-01), de Boer et al.
patent: 6952395 (2005-10-01), Manoharan et al.
patent: 6959000 (2005-10-01), Lee
patent: 6975588 (2005-12-01), Katukam et al.
patent: 6980711 (2005-12-01), Feinberg et al.
patent: 7006500 (2006-02-01), Pedersen et al.
patent: 7012887 (2006-03-01), Zhu et al.
patent: 7012917 (2006-03-01), Brolin et al.
patent: 7016312 (2006-03-01), Semaan et al.
patent: 7016379 (2006-03-01), Falkenstein et al.
patent: 7023851 (2006-04-01), Chakravorty
patent: 7031253 (2006-04-01), Katukam et al.
patent: 7035208 (2006-04-01), Najda et al.
patent: 7042839 (2006-05-01), Stewart et al.
patent: 7058011 (2006-06-01), Stearns et al.
patent: 7058012 (2006-06-01), Chen et al.
patent: 7093024 (2006-08-01), Craddock et al.
patent: 7095714 (2006-08-01), Suetsugu et al.
patent: 7120359 (2006-10-01), Way
patent: 7130264 (2006-10-01), Wiebe et al.
patent: 7167443 (2007-01-01), Dantu et al.
patent: 7167444 (2007-01-01), Afferton
patent: 7170851 (2007-01-01), Chen et al.
patent: 7173927 (2007-02-01), Kumar et al.
patent: 7206281 (2007-04-01), Chen et al.
patent: 7209478 (2007-04-01), Rojas et al.
patent: 7227837 (2007-06-01), Bi et al.
patent: 7260059 (2007-08-01), Grover et al.
patent: 7260091 (2007-08-01), Yamamoto
patent: 7274869 (2007-09-01), Pan
patent: 7280529 (2007-10-01), Black et al.
patent: 7308198 (2007-12-01), Chudak et al.
patent: 7333512 (2008-02-01), Kumar et al.
patent: 7345991 (2008-03-01), Shabtay et al.
patent: 7352758 (2008-04-01), Makam et al.
patent: 7352966 (2008-04-01), Chaudhuri et al.
patent: 7353293 (2008-04-01), Hipfinger
patent: 7366989 (2008-04-01), Naik et al.
patent: 7385918 (2008-06-01), Takagi
patent: 7426179 (2008-09-01), Harshavardhana et al.
patent: 7450497 (2008-11-01), Trudel et al.
patent: 7502315 (2009-03-01), Huang et al.
patent: 7505683 (2009-03-01), Lemieux et al.
patent: 7573814 (2009-08-01), Luft et al.
patent: 2002/0004843 (2002-01-01), Andersson et al.
patent: 2002/0131431 (2002-09-01), Wank et al.
patent: 2002/0133698 (2002-09-01), Wank
patent: 2003/0009599 (2003-01-01), Lee et al.
patent: 2003/0021222 (2003-01-01), Boer et al.
patent: 2003/0063613 (2003-04-01), Carpini et al.
patent: 2003/0072057 (2003-04-01), Frigo et al.
patent: 2003/0076816 (2003-04-01), Naranjo et al.
patent: 2003/0142678 (2003-07-01), Chan et al.
patent: 2003/0169692 (2003-09-01), Stern et al.
patent: 2003/0185201 (2003-10-01), Dorgan
patent: 2003/0185562 (2003-10-01), Feinberg et al.
patent: 2004/0208554 (2004-10-01), Wakai et al.
patent: 2006/0140118 (2006-06-01), Alicherry et al.
patent: 2009/0190636 (2009-07-01), Mui et al.
Zhang, Yuna and Yang, Oliver. “Different Implementations of Token Tree Algorithm for DWDM Network Protection/Restoration,” 11th Intl. Conference on Computer Communications and Networks, Oct. 14-16, 2002, pp. 290-295.
Zhang, Yuna and Yang, Oliver. “A Distributed Tree Algorithms for WDM Network Protection/Restoration,” 5th Intl. Conference on High Speed Networks and Multimedia Communications, Jul. 3-5, 2002, pp. 289-294.
Stoll, Detlef et al. “Metropolitan DWDM: A Dynamically Configurable Ring for the KomNet Field Trial in Berlin,” IEEE Communications Magazine, vol. 39, Issue 2, Feb. 2001, pp. 106-113.
Ayandeh, Siamack. “Convergence of Protection and Restoration in Telecommunication Networks,” Photonic Network Communications, vol. 4, Nos. 3-4, Jul. 2002, pp. 237-250.
Wuttisittikulkij, L. and O'Mahony, M.J. “Multiwavelength Self-Healing Ring Transparent Networks,” IEEE Global Telecommunications Conference, vol. 1, Nov. 14-16, 1995, pp. 45-49.
Hague, Izaz, et al. “Self-Healing Rings in a Synchronous Environment,” IEEE LTS, vol. 2, Issue 4, Nov. 1991, pp. 30-37.
Kuhfeld, J. et al. “Definitions of Managed Objects for Synchronous Optical Network (SONET) Linear Automatic Protection Switching (APS) Architectures,” RFC 3498, Mar. 2003, pp. 1-43.
Kane, L. “Cabletron's VLS Protocol Specification,” RFC 2642, Aug. 1999, pp. 1-95.
Gencata, A. and Mukherjee, B. “Virtual-Topology Adaptation for WDM Mesh Networks under Dynamic Traffic,” IEEE/ACM Transactions on Networking, vol. 11, Issue 2, Apr. 2003, pp. 236-247.
Stamatelakis, D. and Grover, W.D. “IP Layer Restoration and Network Planning Based on Virtual Protection Cycles,” IEEE Journal on Selected Areas in Communications, vol. 18, Issue 10, Oct. 2000, pp. 1938-1949.
Banerjee, A. et al. “Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques,” IEEE Communications Magazine, vol. 39, Issue 7, Jul. 2001, pp. 144-151.
Sato, K. et al. “Network Reliability Enhancement with Virtual Path Strategy,” IEEE Global Telecommunications (Globecom) Conference and Exhibition—Communications: Connecting the Future, vol. 1, Dec. 5, 1990, pp. 464-469.
Office Action in counterpart Canadian Application No. 2,521,518, mailed Aug. 2, 2010.
Anbiah Anix
Katukam Suresh
Caldwell Andrew
Cisco Technology Inc.
Pollack Melvin H
LandOfFree
Computing a path for an open ended uni-directional path... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computing a path for an open ended uni-directional path..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a path for an open ended uni-directional path... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4306335