Title :
How to establish and utilize virtual paths in ATM networks
Author :
Chlamtac, Imrich ; Faragó, András ; Zhang, Tao
Author_Institution :
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
Abstract :
It is shown that optimizing the use of virtual paths involves computationally hard (NP-complete) problems. Approximate solutions are developed, and it is shown that they have feasible computational complexity for even very large networks and can account for network topology, the available bandwidth, and traffic requirements. It is proved that the proposed approach yields guaranteed performance and provable bounds on the deviation of the results from the optimum
Keywords :
approximation theory; asynchronous transfer mode; computational complexity; network topology; optimisation; polynomials; telecommunication network routing; telecommunication traffic; ATM networks; asynchronous transfer mode; available bandwidth; computational complexity; network topology; performance; traffic requirements; virtual paths; Asynchronous transfer mode; Bandwidth; Circuits; Computational complexity; Computer networks; Intelligent networks; Network topology; Power engineering and energy; Power engineering computing; Telecommunication traffic;
Conference_Titel :
Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on
Conference_Location :
Geneva
Print_ISBN :
0-7803-0950-2
DOI :
10.1109/ICC.1993.397513
