Path protection and blocking probability minimization in optical networks

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 142-153

  Lee, David ^a   Libman, Lavy ^b   Orda, Ariel ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b CSIRO   (Australia)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; FAILURE ANALYSIS; GAME THEORY; POLYNOMIALS; PROBABILITY;

APPROXIMATION ALGORITHM; BLOCKING PROBABILITY; FAILURE PROBABILITY; PATH PROJECTION;

FIBER OPTIC NETWORKS;

EID: 8344267557     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. E. Bouillet, J.-F. Labourdette, G. Ellinas, R. Ramamurthy, and S. Chaudhuri. Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures. In Proc. IEEE Infocom. New York, NY, June 2002.
2. G. Li, D. Wang, C. Kalmanek, and R. Doverspike. Efficient distributed path selection for shared restoration connections. In Proc. IEEE Infocom. New York, NY. June 2002.
3. C.-X. Chi, D.-W. Huang, D. Lee, and X.-R. Sun, Lazy flooding: a new technique for signaling in all-optical networks. In Proc. Optical Fiber Communication (OFC), Anaheim, CA, March 2002.
4. M. Voorneveld, P. Borm, F. van Megen, S. Tijs, and G. Facchini, Congestion games and potentials reconsidered. International Game Theory Review, 1:283-299, 1999.
5. D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, Englewood Cliffs, NJ, 2nd edition, 1992.
6. A. Orda, R. Rom, and N. Shimkin. Competitive routing in multiuser communication networks. IEEE/ACM Transactions on Networking, 1(5):510-521, October 1993.
7. L. Libman and A. Orda. The designer's perspective to atomic noncooperative networks. IEEE/ACM Transactions on Networking, 7(6):875-884, December 1999.
8. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, March 2002.
9. E. Altman, R. El Azouzi, and V. Abramov, Non-cooperative routing in loss networks. Performance Evaluation, 49:257-272, September 2002.
10. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ, 1993.
11. M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman & Company, New York, NY, 1979.
12. R. Kohli, R. Krishnamurti, and P. Mirchandani, The minimum satisfiability problem. SIAM Journal on Discrete Mathematics, 7(2):275-283, 1994.