Multiplex communications – Fault recovery – Bypass an inoperative channel
Reexamination Certificate
2007-06-12
2007-06-12
Nguyen, Steven (Department: 2616)
Multiplex communications
Fault recovery
Bypass an inoperative channel
C370S408000, C714S004110
Reexamination Certificate
active
10037031
ABSTRACT:
A method for restoring traffic in a network. The network includes plural distinct nodes interconnected by plural distinct spans, each span having working links and spare links. Each node has a digital cross-connect switch for making and breaking connections between adjacent spans forming span pairs at a node. Cross-connections between spare links in adjacent spans are made such that sets of successive nodes through which the adjacent spans form span paths form closed paths. A method of finding and construction closed paths is described in which statelets are broadcast through the network. In a preferred method of implementation of the method, the statelet broadcast occurs not in response to a network failure, but across the entire network before any particular span failure and may be carried out during normal network operations as a continual re-configuration of the network.
REFERENCES:
patent: 4956835 (1990-09-01), Grover
patent: 4993015 (1991-02-01), Fite, Jr.
patent: 5065399 (1991-11-01), Hasegawa et al.
patent: 5093824 (1992-03-01), Coan et al.
patent: 5146452 (1992-09-01), Pekarske
patent: 5173689 (1992-12-01), Kusano
patent: 5218601 (1993-06-01), Chujo et al.
patent: 5235599 (1993-08-01), Nishimura et al.
patent: 5239537 (1993-08-01), Sakauchi
patent: 5435003 (1995-07-01), Chng et al.
patent: 5444693 (1995-08-01), Arslan et al.
patent: 5495471 (1996-02-01), Chow et al.
patent: 5513345 (1996-04-01), Sato et al.
patent: 5537532 (1996-07-01), Chng et al.
patent: 5548639 (1996-08-01), Ogura et al.
patent: 5590119 (1996-12-01), Moran et al.
patent: 5604868 (1997-02-01), Komine et al.
patent: 5812524 (1998-09-01), Moran et al.
patent: 5835482 (1998-11-01), Allen
patent: 5850505 (1998-12-01), Grover
patent: 5884017 (1999-03-01), Fee
patent: 5999286 (1999-12-01), Venkatesan
patent: 6044064 (2000-03-01), Brimmage et al.
patent: 6047331 (2000-04-01), Medard et al.
patent: 6049529 (2000-04-01), Brimmage et al.
patent: 6052796 (2000-04-01), Croslin
patent: 6154296 (2000-11-01), Elahmadi et al.
patent: 2 299 729 (1996-10-01), None
patent: 2 305 811 (1997-04-01), None
patent: WO 97/06643 (1997-02-01), None
patent: WO 97/06644 (1997-02-01), None
patent: WO 97/06645 (1997-02-01), None
patent: WO 97/08860 (1997-03-01), None
patent: WO 97/11543 (1997-03-01), None
Grover, W.D. and M.H. MacGregor, “Potential for Spare Capacity Preconnection to Reduce Crossconnection Workloads in Mesh-Restorable Networks,”Electronics Letters30 (3):194-195, Feb. 3, 1994.
Herzberg, Meir and Stephen J. Bye,“An Optimal Spare-Capacity Assignment Model for Survivable Networks With Hop Limits,”Proceedings of IEEE Globecom'94, Telecom Australia Research Laboratories, IEEE, vol. 3, 1994, pp. 1601-1606.
Information sheet on Existing Telco Digital Cross-Connect Switch (DCS).
PCT International Application No. PCT/GB96/01912, filed Aug. 6, 1996, entitled Route Finding in Communications Networks, International Publication No. WO 97/06643, published Feb. 20, 1997.
PCT International Application No. PCT/GB96/01913, filed Aug. 6, 1996, entitled Route Finding in Communications Networks, International Publication No. WO 97/06644, published Feb. 20, 1997.
PCT International Application No. PCT/GB96/01914, filed Aug. 6, 1996, entitled Route Finding in Communications Networks, International Publication No. WO 97/06645, published Feb. 20, 1997.
PCT International Application No. PCT/US96/13830, filed Aug. 28, 1996, entitled Deterministic Selection of an Optimal Restoration Route in a Telecommunications Network, International Publication No. WO 97/08860, published Mar. 6, 1997.
PCT International Application No. PCT/US96/14999, filed Sep. 18, 1996, entitled Communication System and Method Providing Optimal Restoration of Failed Paths, International Publication No. WO 97/11543, published Mar. 27, 1997.
Photocopy of Candian Patent Application No. 2,161,847, filed Oct. 31, 1995 (published May 1, 1997), including drawings and filing certificate, corresponding to U.S. Appl. No. 08/551,709, filed Nov. 1, 1995, 32 pages.
Telecommunications Network Management Into the 21stCentury, Techniques, Standards, Technologies, and Applications, “Distributed Restoration of the Transport Network,”IEEE Press, Chapter 11, pp. 337-417, 1993.
Wu, Tsong-Ho, “Fiber Network Service Survivability,” Artech House, Boston, ©1992, pp. 1-211.
Baker, J.E., “A Distributed Link Restoration Algorithm With Robust Preplanning,”Proc. IEEE GlobeCom'91, Dec. 1991, pp. 10.4.1-10.4.6.
Chao, C.W., et al., “FASTAR-A Robust System for Fast DS3 Restoration,”Proc. IEEE GlobeCom'91, Dec. 1991, pp. 39.1.1-39.1.5.
Chow, C.E., et al., “Performance Analysis of Fast Distributed Link Restoration Algorithms,”International Journal of Communication Systems8:325-345, 1995.
Chujo, T., et al., “Distributed Self-Healing Network and Its Optimum Spare-Capacity Assignment Algorithm,”Electronics and Communications in Japan, Part 1, 74(7):1-8, 1991.
Coan, B.A., et al., “A Distributed Protocol to Improve the Survivability of Trunk Networks,”Proceedings of the 13th International Switching Symposium4: 173-179, May 1990.
Coan, B.A., et al., “Using Distributed Topology Update and Preplanned Configurations to Achieve Trunk Network Survivability,”IEEE Transactions on Reliability40(4):404-416, 427, 1991.
Fujii, H., and N. Yoshikai, “Restoration Message Transfer Mechanism and Restoration Characteristics of Double-Search Self-Healing ATM Network,”IEEE J-SAC Special Issue: Integrity of Public Telecommunication Networks 12(1):149-158 Jan. 1994.
Grover, W.D., and D. Stamatelakis, “Self-Organizing Closed Path Configuration of Restoration Capacity in Broadband Mesh Transport Networks,”CCBR '98, 12 pages.
Grover, W.D., and D. Stamatelakis, “Cycle-Oriented Distributed Preconfiguration: Ring-Like Speed With Mesh-Like Capacity for Self-Planning Network Restoration,”ICC '98, 7 pages.
Introduction to SONET Networking, Northern Telecom, Oct. 1996, 44 pages.
Iraschko, R.R., “Path Restorable Networks,”Ph.D. Dissertation, University of Alberta, Edmonton, Fall 1996.
Iraschko, R.R., et al., “Optimal Capacity Placement for Path Restoration in Mesh Survivable Networks,”Proc. IEEE ICC '96, Jun. 1996, pp. 1568-1574.
Kawamura, R., et al., “Self-Healing ATM Networks Based on Virtual Path Concept,”IEEE J-SAC Special Issue: Integrity of Public Telecommunication Networks 12(1):120-127, Jan. 1994.
Komine, H., et al., “A Distributed Restoration Algorithm for Multiple-Link and Node Failures of Transport Networks,”Proc. IEEE GlobeCom '90, San Diego, Dec. 1990, pp. 043.4.1-403.4.5.
Sakauchi, H., et al., “A Self-Healing Network With an Economical Spare-Channel Assignment,”Proc. IEEE GlobeCom '90, San Diego, Dec. 1990, pp. 403.1.1-403.1.6.
Saniee, I., “Optimal Routing Designs in Self-Healing Communications Networks,” Bellcore, Morristown, N.J., May 1994.
Stamatelakis, D., “Theory and Algorithms for Preconfiguration of Spare Capacity in Mesh Restorable Networks,”M.Sc. Thesis, University of Alberta, Edmonton, Spring 1997.
Ward, M., “There's an Ant in My Phone . . . ,”New Scientist, Jan. 24, 1998, pp. 32-35.
Wu, T.H.,Fiber Network Service Survivability, Artech House, Boston, 1992, pp. 1-15, 123-210.
Yang, C.H., and S. Hasagawa, “FITNESS: Failure Immunization Technology for Network Service Survivability,”Proc. IEEE GlobeCom '88, Hollywood, Fla., Nov./Dec. 1988, pp. 47.3.1-47.3.5.
Grover Wayne D.
Stamatelakis Demetrios
Christensen O'Connor Johnson & Kindness PLLC
Nguyen Steven
LandOfFree
Distributed preconfiguration of spare capacity in closed... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Distributed preconfiguration of spare capacity in closed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed preconfiguration of spare capacity in closed... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3846535