Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking

Volumn 7, Issue 5, 1999, Pages 641-652

  Médard, Muriel ^a,b   Finn, Steven G ^a,c   Barry, Richard A ^d   Gallager, Robert G ^a,e  

^a IEEE   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c MIT LINCOLN LABORATORY   (United States)

^d Sycamore Networks   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Graph theory; Multicasting; Network recovery; Network robustness; Routing; Trees

Indexed keywords

EID: 26444462927     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.803380     Document Type: Article

References (81)

1. M. H. Ammar, S. Y. Cheung, and C. M. Scoglio, "Routing multipoint connections using virtual paths in an ATM network," in Proc. INFOCOM'93, pp. 1c.4.1-8.
2. M. Azuma, Y. Fujii, Y. Sato, T. Chujo, and K. Murakami, "Network restoration algorithm for multimedia communication services and its performance characteristics," IEICE Trans. Commun., vol. E78-B, no. 7, pp. 987-994, July 1995.
3. G. B. Brewster and M. S. Borella, "Multicast routing algorithms for the WDM shufflenet local optical network," in Proc. ICC '97, vol. 1, pp. 111-115.
4. R. Bhandari, "Optimal diverse routing in telecommunication fiber networks," in Proc. INFOCOM'94, vol. 3, pp. 11c.3.1-11.c.3.11.
5. J. Bicknell, C. E. Chow, and S. Syed, "Performance analysis of fast distributed network restoration algorithms," in Proc. GLOBECOM '93, vol. 3, pp. 1596-1600.
6. K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, pp. 343-351, Mar. 1983.
7. A. Bellary and K. Mizushima, "Intelligent transport network survivability: Study of distributed and centralized control techniques using DCS and ADM's," in Proc. GLOBECOM'90, pp. 1264-1268.
8. A. Banerjea, C. J. Parris, and D. Ferrari, "Recovering guaranteed performance service connections from single and multiple faults," in Proc. GLOBECOM'94, vol. 1, pp. 162-166.
9. M. Barezzani, E. Pedrinelli, and M. Gerla, "Protection planning in transmission networks," in Proc. SUPERCOMM/ICC'92, pp. 316.4.1-316.4.5.
10. F. Bauer and A. Varma, "ARIES: A rearrangeable edge-based online Steiner algorithm," IEEE J. Select. Areas Commun., vol. 15, pp. 382-397, Apr. 1997.
11. C. E. Chow, J. Bicknell, S. McCaughey, and S. Syed, "A fast distributed network restoration algorithm," in Proc. 12th Int. Phoenix Conf. Computers and Communcations, Mar. 1993, pp. 261-267.
12. R. S. K. Chng, C. P. Botham, D. Johnson, G. N. Brown, M. C. Sinclair, M. J. O'Mahony, and I. Hawker, "A multi-layer restoration strategy for reconfigurable networks," in Proc. GLOBECOM '94, vol. 3, pp. 1872-1878.
13. T. H. Corman, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press; New York: McGraw-Hill, 1990.
14. J.-M. Chang and N. F. Maxemchuk, "Reliable broadcast protocols," ACM Trans. Comput. Syst., vol. 2, no. 3, pp. 251-273, Aug. 1984.
15. M. Doar and I. Leslie, "How bad is naïve multicast routing?," in Proc. INFOCOM'93, pp. 1c.2.1-1c.2.8.
16. R. Doverspike, "A multi-layered model for survivability in intra-LATA transport networks," in Proc. GLOBECOM'91, pp. 2025-2031.
17. R. Doverspike and B. Wilson, "Comparison of capacity efficiency of DCS network restoration routing techniques," J. Network Syst. Manage., vol. 2, 1994.
18. D. Edinger, P. Duthie, and G. R. Prabhakara, "A new answer to fiber protection," Telephony, Apr. 9, 1990, pp. 53-55.
19. J. Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, Courant Institute Computer Science Symposium 9. New York: Algorithmics Press, Jan. 24-25, 1972.
20. S. Even and R. E. Tarjan, "Computing an st-numbering," Theoretical Comput. Sci., vol. 2, pp. 339-344, 1976.
21. T. Frisanco, "Optimal spare capacity design for various protection switching methods in ATM networks," in Proc. ICC 97, vol. 1, pp. 293-298.
22. H. Fujii and N. Yoshikai, "Double search self-healing algorithm and its characteristics," Electron. Commun. Jpn., pt. 1, vol. 77, no. 3, 1994.
23. M. Médard, S. G. Finn, and R. A. Barry, "WDM loop-back recovery in mesh networks" in Proc. OFC'98, pp. 298-299.
24. _, "A novel approach to automatic protection switching using trees," in Proc. ICC'97, pp. 272-276.
25. A. Gersht, S. Kheradpir, and A. Shulman, "Dynamic bandwidth-allocation and path-restoration in SONET self-healing networks," IEEE Trans. Rel., vol. 45, pp. 321-331, June 1996.
26. C. J. Green, "Protocols for a self-healing network," in Proc. 1995 Military Communications (MILCOM), pt. 1, pp. 252-256.
27. W. D. Grover, "The SelfHealmg™ Network," Proc. GLOBECOM '87, vol 2, pp. 1090-1095.
28. D. K. Hsing, B.-C. Cheng, G. Goncu, and L. Kant, "A restoration methodology based on pre-planned source routing in ATM networks," Proc. ICC '97, vol. 1, pp. 277-182.
29. A. Itai and M. Rodeh, "The multi-tree approach to reliability in distributed networks," Inform. Computation, vol. 79, pp. 43-59, 1988.
30. D. Johnson, G. N. Johnson, S. L. Beggs, C. Botahm, I. Hawker, R. S. K. Chng, M. C. Sinclair, and M. J. O'Mahony, "Distributed restoration strategies in telecommunications networks," in Proc. IEEE ICC, 1994, vol. 1, pp. 483-488.
31. J. P. Jue and B. Mukherjee, "The advantages of partitioning multicast transmissions in a single-hop optical WDM network," in Proc. ICC '97, vol. 1, pp. 427-143.
32. H. Kobrinski and M. Azuma, "Distributed control algorithms for dynamic restoration in DCS mesh networks: Performance evaluation," in Proc. GLOBECOM'93, vol. 3, pp. 1584-1588.
33. S.-B. Kim, "An optimal VP-based multicast routing in ATM networks," in Proc. INFOCOM'96, vol. 2, pp. 10c.4.1-10c.4.8.
34. R. Kawamura, H. Hadama, and I. Tokizawa, "Implementation of self-healing function in ATM networks," J. Network Syst. Manage., vol. 3, no. 3, pp. 243-264, 1995.
35. J. Kadiririe and G. Knight, "Comparison of dynamic multicast routing algorithms for wide-area packet-switched (asynchronous transfer mode) networks," in Proc. INFOCOM'95, pp. 2c.1.-8.
36. R. Kawamura, K. Sato, and I. Tokizawa, "High-speed self-healing techniqies utilizing virtual paths," presented at the 5th Int. Network Planning Symp., Kobe, Japan, May 1992.
37. Y. Kajiyama, N. Tokura, and K. Kikuchi, "ATM self-healing ring," in Proc. GLOBECOM 92, pp. 639-643.
38. M. T. Lucas, B. J. Dempsey, and A. C. Weaver, "MESH: Distributed error recovery for multimedia streams in wide-area multicast networks," in Proc. ICC '97, vol. 2, pp. 1127-1131.
39. A. Lempel, S. Even, and I. Cederbaum, "An algorithm for planarity testing of graphs," in Theory of Graphs, In. Symp., July 1966, pp. 215-232.
40. N. D. Lin, A. Zolfaghari, and B. Lusignan, "ATM virtual path self-healing based on a new path restoration protocol," in Proc. GLOBECOM '94, vol. 2, pp. 794-798.
41. P. Mateti and N. Deo, "On algorithms for enumerating all circuits of a graph," SIAM J. Comput., vol. 5, no. 1, Mar. 1976.
42. M. Médard, S. G. Finn, and R. A. Barry, "Automatic protection switching for multicasting in optical mesh networks," in Proc. OFC'97, pp. 314-315.
43. K. Menger, "Zur allgemeinen kurventheorie," Fundamental Math., vol. 10, pp. 96-115, 1927.
44. K. Murakami and H. S. Kim, "Virtual path routing for survivable ATM networks," IEEE/ACM Trans. Networking, vol. 4, Feb. 1998.
45. MPLS Web Site: www.ietf.org/html.charters/mpls-charter.html
46. R. Nakamura, H. Ono, and K. Nishikawara, "Reliable switching services," in Proc. GLOBECOM'94, vol. 3, pp. 1596-1600.
47. D. J. Pai and H. L. Owen, "An algorithm for bandwidth management with survivability constraints in ATM networks," in Proc. ICC '97, vol. 1. pp. 261-266.
48. S. Ramanathan, "Multicast tree generation in networks with asymmetric links," IEEE/ACM Trans. Networking, vol. 4, pp. 558-568, Aug. 1996.
49. J. Shi and J. Fonseka, "Interconnection of self-healing rings," in Proc. ICC'96, pp. 1563-1567.
50. J. B. Slevinsky, W. D. Grover, and M. H. MacGregor, "An algorithm for survivable network design employing multiple self-healing rings," in Proc. GLOSECOM'93, vol. 3, pp. 1568-1573.
51. S. Z. Shaikh, "Span-disjoint paths for physical diversity in networks," in Proc. IEEE Symp. Computers and Communications, 1995, pp. 127-133.
52. Y. Shiloah, "Edge-disjoint branching in directed multigraphs," Inform. Processing Lett., vol. 8, no. 1, Jan. 1979.
53. H. Sakauchi, Y. Okanoue, H. Okazaki, and S. Hasegawa, "Distributed self-healing control in SONET," J. Network Syst. Manage., vol. 1, no. 2, 1993.
54. M. W. Slominski and H. Okazaki, "Guided restoration of ATM Cross-Connect networks," in Proc. ICC 94, vol. 1, pp. 466-470.
55. J. Sosnosky, "Service application for SONET DCS distributed restoration," IEEE J. Select. Areas Commun., vol. 12, pp. 59-68, Jan. 1994.
56. J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
57. M. Stoer, Design of Survivable Networks. New York: Springer-Verlag, 1992.
58. C.-C. Shyur, S.-H, Tsao, and Y.-M. Wu, "Survivable network planning methods and tools in Taiwan," IEEE Commun. Mag., vol. 33, Sept. 1995.
59. J. W. Suurballe, "Disjoint paths in a network," Networks, pp. 125-145, 1974.
60. R. E. Tarjan, "A good algorithm for edge-disjoint branching," Inform. Processing Lett., vol. 3, no. 2, Nov. 1974.
61. H. Towster, R. Stephenson, S. Morgan, M. Keller, R. Mayer, and R. Shalayda, "Self-healing ring networks: Gateway to public information networking," IEEE Commun. Mag., vol. 28, pp. 54-60, June 1990.
62. M. Tomizawa, Y. Yamabayashi, N. Kawase, and Y. Kobayashi, "Self-healing algorithm for logical mesh connection on ring networks," Electron. Lett., vol. 30, no. 19, pp. 1615-1616, Sept. 15, 1994.
63. S. Voß, "Steiner's problem in graphs: Heuristic methods," Discrete Appl. Mathem., vol. 40, pp. 45-72, 1992.
64. R. Venkateswaran, C. S. Raghavendra, X. Chen, and V. P. Kumar, "Hierarchical multicast routing in ATM networks," in Proc. ICC'96, pp. 1690-1694.
65. J. Veerasamy, S. Vemkatesan, and J. C. Shah, "Effect of traffic splitting on link and path restoration planning," in Proc. GLOBECOM'94, vol. 3, pp. 1867-1871.
66. B. Van Caenegem, N. Wauters, and P. Demeester, "Spare capacity assignment for different restoration strategies in mesh survivable networks," in Proc. ICC 97, vol. 1, pp. 288-292.
67. O. J. Wasem, "Optimal topologies for survivable fiber optic networks using SONET self-healing rings," in Proc. GLOBECOM'91, vol. 3, pp. 57.5.1-57.5.7.
68. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, pp. 1617-1622, Dec. 1989.
69. T.-H. Wu, R. H. Caldwell, and M. Boyden, "A multi-period design model for survivable network architecture selection for SDH/SONET interoffice networks," IEEE Trans. Rel., vol. 40, pp. 417-432, Oct. 1991.
70. P. Winter, "Steiner tree problem in networks: A survey," Networks, vol. 17, pp. 129-167, 1987.
71. T.-H. Wu, D. J. Kolar, and R. H. Cardwell, "High-speed self-healing ring architectures for future interoffice networks," in Proc. GLOBECOM'89, vol. 2, pp. 23.1.1-23.1.7.
72. J. S. Whalen and J. Kenney, "Finding maximal link disjoint paths in a multigraph," in Proc. GLOBECOM '90, pp. 403.6.1-403.6.5.
73. C.-S. Wu, S.-W. Lee, and Y.-T. Hou, "Backup VP preplanning strategies for survivable multicast ATM networks," in Proc. ICC '97, vol. 1, pp. 267-271.
74. P. Winter and J. MacGregor Smith, "Path-distance heuristics for the Steiner problem in undirected networks," Algorithmica, vol 7, no. 2-3, pp. 309-327, 1992.
75. T.-H. Wu, Fiber Network Service Survivability. Norwood, MA: Artech House, 1992.
76. _, "A passive protected self-healing mesh network architecture and applications," IEEE/ACM Trans. Networking, vol. 2, pp. 40-52, Feb. 1994.
77. T.-H. Wu and W. I. Way, "A novel passive protected SONET bidirectional self-healing ring architecture," J. Lightwave Technol., vol. 10, Sept. 1992.
78. Y. Xie, M. J. Lee, and T. N. Saadawi, "Multicasting over ATM using connection server," in Proc. ICC '97, vol. 3, pp. 1376-1380.
79. C. H. Yang and S. Hasegawa, "FITNESS: Failure immunization technology for network service survivability," in Proc. GLOBECOM'88, vol. 3, pp. 47.3.1-47.3.6.
80. B. Yener, Y. Offek, and M. Yung, "Design and performance of convergence routing on multiple spanning trees," in Proc. GLOBECOM'94, vol. 1, pp. 169-175.
81. A. Zehavi and A. Itai, "Three tree-paths," J. Graph Theory, vol. 13, no. 2, pp. 175-188, 1989.