By Topic

Least measured cost routing in VP-based ATM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tsz-Mei Ko ; Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong ; Miao Chang

We consider the routing problem in a virtual path based ATM network with multiple classes of traffic. The traffic classes are assumed to have identical end-to-end quality of service (QOS) requirement but at different data rates. The concept of effective bandwidth is used to simplify call admission control and to transform the VP-based ATM routing problem into an equivalent multi-rate circuit-switched network routing problem. The Markov decision process (MDP) is known to provide an optimal solution but is computationally infeasible to implement in any realistic network. We propose to measure the relative costs in a Markov decision process directly to simplify the required computation and yet achieve near-optimal routing. The performance of the proposed algorithm is compared with least loaded routing (LLR) and minimum free capacity routing (MFCR). Simulation results show that the Markov decision process with measured relative cost outperforms other routing algorithms

Published in:

Global Telecommunications Conference, 1997. GLOBECOM '97., IEEE  (Volume:3 )

Date of Conference:

3-8 Nov 1997