Fault-Tolerant Virtual Path Layout in ATM Networks

INFORMS Journal on Computing

Volumn 13, Issue 1, 2001, Pages 76-94

  Ball, Michael O ^a   Vakhutinsky, Andrew ^b  

^a University of Maryland   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

ATM Networks; Network Optimization; Routing Algorithms; Statistical Multiplexing

Indexed keywords

EID: 0346452840     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.1.76.9750     Document Type: Article

References (40)

1. Anderson, J., B. Doshi, S. Dravida, P. Harshavardhana. 1993. Fast restoration of ATM networks. IEEE Journal on Selected Areas in Communications 12 128-138.
2. Bahk, S., M Zarki. 1992. Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area networks. SIGCOMM '92 53-64.
3. Ball, M O., A. Vakhutinsky. 1998. Fault tolerant virtual path layout: optimization models. B. Sanso, P. Soriano, eds. Telecommunications Network Planning. Kluwer Academic, Boston, MA. 201-217.
4. Barahona, F. 1992. Separating from the dominant of the spanning tree polytope. Operations Research Letters 12 201-203.
5. Barahona, F. 1996. Network design using cut inequalities. SIAM Journal on Optimization 6 823-837.
6. Baras, J. 1996. ATM networks. Lecture Course, Department of Electrical Engineering, University of Maryland, College Park, MD.
7. Cheng, K.-T, F. Y.-S. Lin. 1994. On the joint virtual path assignment and virtual circuit routing problem in ATM networks. IEEE GLOBECOM '94 777-782.
8. Chopra, S. 1989. On the spanning tree polyhedron, Operations Research Letters 8 25-29.
9. Dahl, G., M. Stoer. 1995. A cutting plane algorithm for multicommodity survivable network design problems. Technical Report 3, Institute of Informatics, University of Oslo, Oslo, Norway.
10. Erramilli, A., J. L. Wang. 1998. A connection admission control algorithm for self-similar traffic. IEEE GLOBECOM '98, Sydney, Australia.
11. Gavish, B., I. Neuman. 1992. Routing in a network with unreliable components. IEEE Transactions on Communications 40 94-110.
12. Gawlick, R., A. Kamath, S. Plotkin, K. Ramakrishnan. 1994. Routing and admission control in general topology networks. Technical Report STAN-CS-TR-95-1548, Department of Computer Science, Stanford University, Stanford, CA.
13. Gersht, A., A. Shulman, J. Vucetic, J. Keilson. 1993. Dynamic bandwidth allocation, routing, and access control in ATM networks. IEEE Workshop 94-110.
14. Gersht, A., A. Shulman. 1994. Optimal dynamic virtual path bandwidth allocation and restoration in ATM networks. IEEE GLOBECOM '94 770-776.
15. Grover, W. D., R. R. Iraschko, Y. Zheng, M. H. MacGregor. 1998. Comparative methods and issues in design of mesh-restorable STM and ATM networks. B. Sanso, P. Soriano, eds. Telecommunications Network Planning. Kluwer Academic, Boston, MA. 169-200.
16. Gupta, S., K. Ross, M. Zarki. 1992. Routing in virtual path based ATM networks. IEEE GLOBECOM '92 571-575.
17. Iri, M. 1971. On an extension of the maximum-flow minimum-cut theorem to multicommodity flows. Journal of the Operation Research Society of Japan 13 129-135.
18. Kawamura, R., K. Sato, I. Tokizawa. 1994. Self-healing ATM networks based on virtual path concept. IEEE Journal on Selected Areas in Communications 12 120-127.
19. Kawamura, R., H. Hadama, I. Tokizawa. 1995. Implementation of self-healing function in ATM networks based on virtual path concept. IEEE INFOCOM '95.
20. Kawamura, R., I. Tokizawa. 1995b. Self-healing virtual path architecture in ATM networks. IEEE Communications Magazine 33 72-79.
21. Krishnan, K. R. 1996. A new class of performance results for a fractional brownian traffic model. Queueing Systems 22 277-285.
22. Krishnan, K. R., A. L. Neidhardt, A. Erramilli. 1997. Scaling analysis in traffic management of self-similar processes. 15th International Teletraffic Congress. Washington, D.C. 1087-1098.
23. Le Boudec, J. Y. 1992. The asynchronous transfer mode: a tutorial. Computer Networks and ISDN Systems 24 279-309.
24. Leland, W., D. Wilson. 1991. High time resolution measurement and analysis of LAN traffic: implications for LAN interconnection. INFOCOM '91 1360-1366.
25. Leland, W., M. Taqqu, W. Willinger, D. Wilson. 1993. On the self-similar nature of ethernet traffic. SIGCOMM '93 183-193.
26. Liang, B., K. Ross. 1995. Loss models for ATM networks with separable statistical multiplexing. Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA.
27. Liang, B., K. Ross. 1996. Tutorial: stochastic network models for asynchronous transfer modes. INFORMS National Meeting, Washington, D.C. Institute for Operations Research and the Management Sciences.
28. Lin, F. Y.-S., K.-T. Cheng. 1993. Virtual path assignment and virtual circuit routing in ATM networks. IEEE GLOBECOM '93 436-441.
29. Magnanti, T., P. Mirchandani, R. Vachani. 1995. Modeling and solving the two-facility capacitated network loading problem. Operations Research 43 142-157.
30. Murakami, K., H. Kim. 1996. Virtual path routing for survivable ATM networks. IEEE/ACM Transactions on Networking 4 22-39.
31. Nash-Williams, C. 1961. Edge-disjoint spanning trees of finite graphs, Journal of London Mathematical Society 36 445-450
32. Onaga, K., O. Kakusho. 1971. On feasibility conditions of multicommodity flows in networks. IEEE Transactions on Circuit Theory 18 425-429.
33. Onvural, R. O. 1994. Asynchronous transfer mode networks: performance issues. Artech House, Inc., Norwood, MA.
34. Parulekar, M., A. Makowski. 1995. Tail probabilities for a multiplexer with self-similar traffic. Manuscript, Institute for Systems Research, University of Maryland, College Park, MD.
35. Plotkin, S. 1995. Competitive routing in ATM networks. IEEE Journal on Selected Areas in Communications 13 1128-1138.
36. Prycker, M. 1991. Asynchronous transfer mode: solution for broadband ISDN. Ellis Horwood, New York, NY.
37. Stoer, M., G. Dahl. 1994. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik 68 149-167.
38. Tutte, W. 1961. On the problem of decomposing a graph into n connected factors, Journal of London Mathematical Society 36 221-230.
39. Vakhutinsky, A. 1996. Fault tolerant rerouting in broadband multiclass networks. Ph.D. Thesis, College of Business and Management, University of Maryland, College Park, MD.
40. Verbiest, W., L. Pinnoo, A. 1989. Variable bit rate video code for asynchronous transfer mode networks. IEEE Journal on Selected Areas in Communications 7 1253-1265.