Fault-Tolerant Virtual Path Layout in ATM Networks

References

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