Optimal minimax routing in ATM networks
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A model for characterizing the cell loss probabilities of an ATM network is developed. The three types of cell losses considered are losses in the switch fabric, losses due to buffer overflow, and congestion control losses. The problem of determining routing assignments to minimize the maximum link cell loss probability is formulated as an optimization problem. Even though the problem is not a convex program, an algorithm is presented that determines a global optimal solution. The algorithm consists of a one-dimensional search procedure and a procedure for solving a generalized multicommodity flow problem with gains. The algorithm is shown to be reasonably efficient when tested on several networks Author(s) Lee, M.-J. Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA Yee, J.R.Keywords
This publication has 12 references indexed in Scilit:
- A growable packet (ATM) switch architecture: design principles and applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On calculating high throughputs in multi-hop slotted ALOHA packet radio networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Broadband ISDN and asynchronous transfer mode (ATM)IEEE Communications Magazine, 1989
- Evolution of ISDN towards broadband ISDNIEEE Network, 1989
- Queueing in high-performance packet switchingIEEE Journal on Selected Areas in Communications, 1988
- A Broadband Packet Switch for Integrated TransportIEEE Journal on Selected Areas in Communications, 1987
- The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet SwitchingIEEE Journal on Selected Areas in Communications, 1987
- Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-ForwardIEEE Transactions on Communications, 1978
- Optimal Routing in a Packet-Switched Computer NetworkIEEE Transactions on Computers, 1974
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973