Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic routing for multimedia traffic over ATM networks
ISCC '95 Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95)
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The goal of this paper is to recommend a good PrivateNetwork-to-Network Interface (PNNI) routing algorithm for private ATMnetworks. A good routing algorithm has to work well with multimediatraffic with several quality of service (QoS) requirements (such ascell loss ratio, cell delay and its variation etc.) in differentnetworks under various traffic conditions. The multiplicity ofQoS requirements makes the routing problem NP-complete, so ourapproach to the problem is based on large scale simulationsinvolving several empirical algorithms (compliant with thePNNI routing specification) which have been tested for different networktopologies and traffic scenarios. Based on analysis of tradeoffsinvolving performance metrics (such as blocking rate, complexity,load distribution) we recommend a consistently goodrouting algorithm for single domain ATM networks.