Approximation algorithms for survivable multicommodity flow problems with applications to network design

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Todimala, Ajay ^a   Ramamurthy, Byrav ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Approximation algorithms; Linear programming; Multicommodity flow; Network design

Indexed keywords

LINEAR PROGRAMMING; MACHINE DESIGN; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

MULTICOMMODITY FLOW; NETWORK DESIGN;

APPROXIMATION ALGORITHMS;

EID: 39049123079     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.92     Document Type: Conference Paper

References (30)

1. th annual IEEE Symposium on foundations of computer science, pp. 300-309, 1998.
2. L. K. Fleischer, "Approximating fractional multicommodity flows independent of the number of commodities," SIAM J. Discrete Math. vol. 13, no. 4, pp. 505-520, 2000.
3. M. J. Fischer, D. A. Garbin, T. C. Harris, and J. E. Knepley, "Large scale communications networks design and analysis," Int. J. Manage. Sci., vol. 6, pp. 331-340, 1978.
4. J. E. Knepley, "Minimum cost design for circuit switched networks," Defense Commun. Agency Syst., Eng. Facility, Reston, VA, Tech. Rep. AD-A014 101, July 1973.
5. R. R. Srikanta Kumar, "On optimal flows in circuit switched networks," in Proc. Globecom '84, pp.27.3.1-27.3.5, 1984.
6. B. Sanso, M. Gendreau, and F. Soumis, "An algorithm for network dimensioning in under reliability considerations," Ann. Operations Res., vol. 36, pp. 263-274, 1992.
7. A.Girard, and B. Sanso, "Multicommodity flow models, failure propagation, and reliable loss network design," IEEE/ACM Transactions on Networking, vol. 6, no. 1, Feb. 1998.
8. R. M. Krishnaswamy and K. N. Sivarajan, "Algorithms for routing and wavelength assignment and topology design in opticalnetwork," Ph. D. dissertation, Dept. of Electrical Commun. End., Indian Institute of Science, Banglore, India, Nov. 1998.
9. R. M. Krishnaswamy and K. N. Sivarajan, "Algorithms for routing and wavelength assignment based on solutions of LP-relaxations," IEEE Communication Letters, vol. 5, no. 10, pp. 435-437, Oct. 2001.
10. P. Raghavan, "Probabilistic construction of deterministic algorithm: Approximating packing integer programs," Journal of Computer and Systems Sciences, vol. 38, pp. 683-707, 1994.
11. D. Coudert and H. Rivano, "Lightpath assignment for multifibers WDM optical networks with wavelength translators," In IEEE Globecom'02, vol. 3, pp. 2686 - 2690, Taiwan, 17-21 Nov. 2002.
12. M. Bouklit, D. Coudert, J-F. Lalande, C. Paul, and H. Rivano, "Approximate multicommodity flow for WDM networks design," In Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO '03), Carleton Scientific 17, pp. 43-56, 2003.
13. A. Ferreira, S. Prennes, A. W. Richa, H. Rivano, and N. Stier Moses, "Models, complexity and algorithms for the design of multifiber WDM networks," In ICT'03, Papeete, French Polynesia, February 2003.
14. O. Crochat, and J. -Y. Le Boudec, "Design protection for WDM optical networks," IEEE Journal on Selected Areas in Communications, vol. 16, no. 7, pp. 1158-1165, Sept. 1998 .
15. S. Ramamurthy and B. Mukherjee, "Survivable WDM Mesh Networks Part I: Protection," in Proc. IEEE INFOCOM, pp. 744-751, Mar. 1999.
16. Y. Miyao and H. Saito,"Optimal design and evaluation of survivable WDM transport networks," IEEE J. Select. Areas Commun., vol. 16, pp. 11901198, Sept. 1998.
17. B. V. Caenegem, W. V. Parys, F. De Turck, and P. M. Demeester, "Dimensioning of survivable WDM networks," IEEE J. Select. Areas Commun., vol. 16, pp. 11461157, Sept. 1998.
18. B. T. Doshi, S. Dravida, P. Harshavardhana, O. Hauser, and Y. Wang, "Optical network design and restoration," Bell Labs Tech. J., pp. 5883, Jan.Mar. 1999.
19. M. Alanyali and E. Ayanoglu, "Provisioning algorithms for WDM optical networks," in IEEE INFOCOM, vol. 2, pp. 910918, Mar. 1998.
20. R. R. Iraschko and W. D. Grover, "A highly efficient path-restoration protocol for management of optical network transportintegrity, " IEEE Journal on Selected Areas in Communications, vol. 18, no. 5, pp. 779-794, Oct. 2000.
21. X. Yang , L. Shen and B. Ramamurthy, "Survivable lightpath provisioning in WDM mesh networks under shared path protection and signal quality constraints," in IEEE/OSA Journal of Lightwave Technology, Apr. 2005.
22. D. Bienstock, O. Gunluk, "Capacitated network design polyhedral structure and computation," INFORMS Journal on Computing, vol. 8, pp. 243-259, 1996.
23. O. Gunluk, "A branch-and-cut algorithm for capacitated network design problems," Math. Programming, vol. 86, pp. 17-39, 1999.
24. B. Gendron, T. G. Crainic and A. Frangioni, "Multicommodity capacitated network design," In B. Sans'o and P. Soriano (eds), Telecommunications Network Planning, pp. 1-19, Kluwer, Norwell, MA, 1998.
25. M. Alicherry, R. Bhatia and Y-C. Wan, "Designing networks with existing traffic to support fast restoration." APPROX, 2004.
26. M. Alicherry and R. Bhatia, "Pre-provisioning networks to support fast restoration with minimum over-build," INFOCOM, 2004
27. H. A. Taha, "Operations research: An introduction," Third Edition, MacMillan Publishing Co., Inc., New York, 1982.
28. F. Shahrokhi and D. Matula, "The maximum concurrent flow problem," J. ACM, vol. 37, no. 2, pp. 318-334, 1990.
29. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, "Network flows: Theory, Algorithms, and Applications," Prentice Hall, New Jersey, 1993.
30. S. A. Plotkin, D. Shmoys, and E. Tardos,"Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, vol. 20, pp. 257-301, 1995.