On the complexity of and algorithms for finding the shortest path with a disjoint counterpart

IEEE/ACM Transactions on Networking

Volumn 14, Issue 1, 2006, Pages 147-158

  Xu, Dahai ^a,d   Chen, Yang ^b   Xiong, Yizhi ^c   Qiao, Chunming ^a   He, Xin ^a  

^a the State University of New York   (United States)

^b Georgia Institute of Technology   (United States)

^c CEDARS SINAI MEDICAL CENTER   (United States)

^d Princeton University   (United States)

Author keywords

Bandwidth sharing; Dynamic provisioning; Graph theory; Optimization; Protection; Survivability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

BANDWIDTH SHARING; MIN-MIN PROBLEM; SURVIVABILITY; SURVIVABLE NETWORKS;

OPERATIONS RESEARCH;

EID: 33144457007     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.863451     Document Type: Article

References (27)

1. E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, "Lightpath re-optimization in mesh optical networks," presented at the 7th Eur. Conf. Netw. Opt. Commun., Darmstadt, Germany, Jun. 2002.
2. Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. IEEE INFOCOM, 2001, pp. 699-708.
3. M. Sridharan, A. K. Somani, and M. Salapaka, "Approaches for capacity and revenue optimization in survivable WDM network," J. High Speed Netw., vol. 10, no. 2, pp. 109-125, Aug. 2001.
4. J. Suurballe and R. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
5. J. W. Suurballe, "Disjoint paths in a network," Networks, vol. 4, pp. 125-145, 1974.
6. D. A. Dunn, W. D. Grover, and M. H. MacGregor, "Comparison of k-shortest paths and maximum flow routing for network facility restoration," IEEE J. Select. Areas Commun., vol. 2, no. 1, pp. 88-99, Jan. 1994.
7. Y. Liu, "Spare capacity allocation method, analysis and algorithms," Ph.D. dissertation, Sch. Inf. Sci., Univ. Pittsburgh, Pittsburgh, PA, 2001.
8. P. Laborczi et al., "Solving asymmetrically weighted optimal or near-optimal disjoint path-pair for the survivable optical networks," presented at the 3rd Int.Workshop On Design Of Reliable Communication Networks (DRCN'01), Budapest, Hungary, Oct. 2001.
9. C. Li, S. T. McCormick, and D. Simchi-Levi, "Finding disjoint paths with different path costs: Complexity and algorithms," Networks, vol. 22, pp. 653-667, 1992.
10. C. Li, S. T.McCormick, and D. Simchi-Levi, "The complexity of finding two disjoint paths with min-max objective function," Discrete Appl. Math., vol. 26, no. 1, pp. 105-115, Jan. 1990.
11. A. Sen, B. Shen, S. Bandyopadhyay, and J. Capone, "Survivability of lightwave networks path lengths in WDM protection scheme," J. High Speed Netw., vol. 10, no. 4, pp. 303-315, 2001.
12. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing. Norwell, MA: Kluwer, 1999.
13. M. Kodialam and T. V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in Proc. IEEE INFOCOM, 2000, pp. 902-911.
14. C. Qiao and D. Xu, "Distributed partial information management (DPIM) schemes for survivable networks - part I," in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 302-311.
15. D. Xu, C. Qiao, and Y. Xiong, "An ultra-fast shared path protection scheme-distributed partial information management, part II," in Proc. IEEE ICNP, Paris, France, Nov. 2002, pp. 344-353.
16. G. Li et al., "Efficient distributed path selection for shared restoration connections," in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 140-149.
17. Y. Liu and D. Tipper, "Successive survivable routing for node failures," in Proc. IEEE GLOBECOM, 2001, pp. 2093-2097.
18. J. Yen, "Finding the K shortest loopless paths in a network," Manag. Sci., vol. 17, no. 11, pp. 712-716, 1971.
19. R. Bhandari, "Optimal diverse routing in telecommunications fiber networks," in Proc. IEEE INFOCOM, 1994, pp. 1498-1508.
20. G. Li, B. Doverspike, and C. Kalmanek, "Fiber span failure protection in mesh optical networks," Opt. Netw. Mag., vol. 3, no. 3, pp. 21-31, May/Jun. 2002.
21. J. Hu, "Diverse routing in optical mesh networks," IEEE Trans. Commun., vol. 51, no. 3, pp. 489-494, Mar. 2003.
22. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity problems," SIAM J. Comput., vol. 5, pp. 691-703, 1976.
23. T. Corman, C. Leiserson, and R. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
24. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
25. S. Baroni, P. Bayvel, and R. J. Gibbens. (1998) On the number of wavelength in arbitrarily-connected wavelength-routed optical networks. Statistical Lab. Research Rep. 1998-7. Univ. Cambridge, Cambridge, U.K.[Online]. Available: http://www.statslab.cam.ac.uk/reports/1998/ 1998-7.pdf
26. Y. Xiong, D. Xu, and C. Qiao, "Achieving fast and bandwidth efficient shared-path protection," J. Lightw. Technol., vol. 21, no. 2, pp. 365-371, Feb. 2003.
27. E. Bouillet, J.-F. Labourdette, R. Ramamurthy, and S. Chaudhuri, "Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths," in Proc. Optical Fiber Commun. Conf., Mar. 2002, pp. 544-546.