Topological design of survivable mesh-based transport networks

Details Topological design of survivable mesh-based transport networks Topological design of survivable mesh-based transport networks

2006-07-11

2006-07-11

Ton, Dang (Department: 2668)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S256000

Reexamination Certificate

active

07075892

ABSTRACT:
A method of designing a telecommunications network, the method comprising the steps of A) for all working demand flows required to be routed in the telecommunications network, finding an initial topology of spans between nodes in the telecommunications network that is sufficient for routing all working demand flows, while attempting to minimize the cost of providing the spans; B) given the initial topology of spans identified in step A, finding a set of additional spans that ensures restorability of working demand flows that are required to be restored in case of failure of any span in the initial topology of spans, while attempting to minimize the cost of providing additional spans; and C) starting with the initial topology of spans and the additional spans identified in step B, finding a final topology of spans between nodes in the telecommunications network that attempts to minimize the total cost of the final topology of spans, while routing all working demand flows and ensuring restorability of working demand flows required to be restored in case of failure of any span in the final topology of spans. A network so designed may be implemented in whole or in part.

REFERENCES:
patent: 5850505 (1998-12-01), Grover et al.
patent: 6052796 (2000-04-01), Croslin
patent: 6154296 (2000-11-01), Elahmadi et al.
patent: 6377543 (2002-04-01), Grover et al.
patent: 6404734 (2002-06-01), Stamatelakis et al.
patent: 6421349 (2002-07-01), Grover
patent: 6510139 (2003-01-01), Yoshida
patent: 6819662 (2004-11-01), Grover et al.
patent: 6937576 (2005-08-01), Di Benedetto et al.
patent: 2002/0071392 (2002-06-01), Grover et al.
A photocopy of Canadian Patent Application No. 2,161,847, filed Oct. 31, 1995 (published May 1, 1997), including drawings and filing certificate, 32 pages.
A photocopy of Canadian Patent Application No. 2,212,933, filed Aug. 13, 1997 (published Feb. 13, 1999), including drawings and filing certificate, 154 pages.
A photocopy of Canadian Patent Application No. 2,210,207, filed Jul. 11, 1997 (published Jan. 11, 1999), including drawings and filing certificate, 93 pages. (Corresponds to A4 listed above).
A photocopy of Canadian Patent Application No. 2,269,649, filed Apr. 22, 1999 (published Oct. 22, 2000), including drawings and filing certificate, 21 pages. (Corresponds to C8 listed below).
A photocopy of Canadian Patent Application No. 2,280,981, filed Aug. 27, 1999 (published Apr. 6, 2000), including drawings and filing certificate, 22 pages. (Corresponds to A5 listed above).
A photocopy of Canadian Patent Application No. 2,285,101, filed Oct. 6, 1999 (published Apr. 8, 2000), including drawings and filing certificate, 38 pages. (Corresponds to C9 listed below).
A photocopy of Canadian Patent Application No. 2,307,520, filed April 28, 2000 (published Oct. 29, 2000), including drawings and filing certificate, 131 pages. (Corresponds to C10 listed below).
A photocopy of U.S. Appl. No. 09/314,518, filed May 19, 1999, including drawings and filing certificate, 21 pages. (Corresponds to C4 listed above).
A photocopy of U.S. Appl. No. 09/414,474, filed Oct. 7, 1999, including drawings and filing certificate, 38 pages. (Corresponds to C6 listed above).
A photocopy of U.S. Appl. No. 09/561,355, filed Apr. 28, 2000, including drawings and filing certificate, 125 pages. (Corresponds to C7 listed above).
A photocopy of Canadian Patent Application No. 2,359,168, filed Oct. 16, 2001, including drawings and filing certificate, 51 pages. (Corresponds to A6 listed above).
“Protection Cycles in Mesh WDM Networks”, Ellinas, G, Hailemariam, A. G., Stern, T. E.;IEEE Journal on Selected Areas in Communications,vol. 18, No. 10, Oct. 2000.
“MENTOR: an algorithm for mesh network topological optimization and routing”, G. Grover, A. Kershenbaum, P. Kermani,IEEE Transaction on Communications,vol. 39, p. 503-513, 1991.
“Algorithms for the Spare Capacity Design of Mesh Resorable Networks”, B. D. Venables, M.Sc. Thesis, University of Alberta, Edmonton, 1992.
“Optimal capacity placement for path restoration in STM and ATM mesh-survivable networks”, R. R. Iraschko, M. H. MacGregor, W. D. Grover,IEEE/ACM Transactions on Networking,vol. 6, No. 3, pp. 325-336, Jun. 1998.
“Near optimal spare capacity planning in a mesh restorable network”, W. D. Grover, T. D. Bilodeau, B. D. Venables,IEEE Globecom '91, pp. 2007-2012, 1991.
“A fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networks”,Electronics Letters,vol. 33, No. 3, pp. 195-196, Jan. 30, 1997.
“Two strategies for spare capacity placement in mesh restorable networks”, B. D. Venables, W. Grover, M. H. MacGregor,Proceedings of the IEEE ICC '93,Geneva, pp. 267-271, May 1993.
“Comparative methods and issues in design of mesh-restorable STM and ATM networks”, W.D. Grover, R.R. Iraschko, Y. Zheng,Telecommunication Network Planning,pp. 169-200, editors: B. Sanso and P. Soriano, Kluwer Academic Publishers, 1999.
“A self-healing network with an economical spare-channel assignment”, H. Sakauchi, Y. Nishimura, S. Hasegawa,Proc. IEEE Globecom,(1990) pp. 438-443.
“An optimal spare-capacity assignment model for survivable networks with hop limits,” M. Herzberg, and S. Bye,Proc. IEEE GLOBECOM '94,pp. 1601-1607, 1994.
“Distributed self-healing network and its optimum spare capacity assignment algorithm”, Chujo, T., Komine, H., Miyazaki, K., Ogura, T., Soejima, T., ,Electronics and Commun. in Japan,part 1, vol. 74, No. 7, 1991, pp. 1-8.
“A unified approach to network survivability for teletraffic networks: models, algorithms and analysis”, D. Medhi,IEEE Trans. on Communications,vol. 42, 1994, pp. 534-548.
T. Cinkler, T. Henk, G. Gordos, “Stochastic algorithms for thrifty single-failure-protected networks”, in Proc.Design of Reliable Communication Networks,Munich, Germany Apr. 2000, pp. 299-303.
Y. Wang,Modelling and solving single and multiple facility restoration problems,Ph.D. dissertation, Sloan School of Mangagement, MIT, Jun. 1998., pp. 32-33.
W.D. Grover, “Distributed Restoration of the Transport Network”, inNetwork Management into the 21st Century,editors T. Plevyak, S. Aidarous, IEEE / IEE Press co-publication, Chapter 11, pp. 337-417, Feb. 1994.
W.D. Grover, “Self-organizing Broad-band Transport Networks”,Proceedings of the IEEE Special Issue on Communications in the 21st Century,vol. 85, No. 10, Oct. 1997, pp. 1582-1611.
Y. Xiong; L.G. Mason, “Restoration strategies and spare capacity requirements in self-healing ATM networks”IEEE/ACM Transactions on Networking,vol.: 7 Issue: 1, Feb. 1999, pp. 98-110.
J. L. Kennington, M.W. Lewis, The Path Restoration Version of the Spare Capacity Allocation Problem with Modulartiy Restrictions: Models, Algorithms, and an Empirical Analysis,Technical Report 98-CSE-13,Department of Computer Science And Engineering, Southern Methodist University, Dallas, Dec. 1998.
Rainer R. Iraschko, “Path Restorable Networks”, PhD Thesis, University of Alberta, chapter 4, pp. 56-85, Fall 1996.
M. H. MacGregor, W. D. Grover, “Optimizedk-shortest-path Algorithm for Facility Restoration”,Software-Practice and Experience,vol. 24, No. 9, Sep. 1994, pp. 823-834.
I. Saniee, “Optimal Routing Designs in Self-Healing Communications Networks”,Bellcore, MRE 2D-362,May 1994, 10 pages.
“Introduction to SONET Networking”, NORTEL tutorial handbook, Oct. 30, 1996.
R.R. Iraschko, M.H. Mac Gregor, W.D. Grover, “Optimal Capacity Placement for Path Restoration in Mesh Survivable Networks”, IEEE, 1996, pp. 1568-1574.
G.N. Brown, W.D. Grover, J.B. Slevinsky, M.H. MacGregor, “Mesh/Arc Networking: An Architecture for Efficient Survivable Self-Healing Networks”IEEE Int'l Conference on Communications, May 1-5, 1994, pp. 471-477.
W.D. Grover, “Network Survivability: A Crucial Issue for the Information Society”,

Affiliated with

Also associated with

Rating

Topological design of survivable mesh-based transport 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 Topological design of survivable mesh-based transport networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological design of survivable mesh-based transport networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3572795