Routing in virtual path based ATM networks
S. Gupta, Keith W. Ross, Magda El Zarki · 2003
The issue of routing requests for virtual circuits in a virtual path (VP) based asynchronous transfer mode (ATM) network is addressed. It is supposed that the VPs are partitioned in a manner such that all the virtual circuits (VCs) making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After suitable simplifying assumptions about the operation of the network are made, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.>