Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels. The algorithm operates online that is handling requests which arrive one at a time without prior knowledge of the traffic pattern. It combines the key concepts in the...

Full description

Bibliographic Details
Main Authors: Tan, Su Wei, Lee, Sze Wei, Vaillaint, Benoit
Format: Article
Language:English
Published: Elsevier 2002
Subjects:
QA75.5-76.95 Electronic computers. Computer science
Online Access:http://shdl.mmu.edu.my/2624/
http://shdl.mmu.edu.my/2624/1/Non-greedy%20minimum%20interference%20routing%20algorithm%20for%20bandwidth-guaranteed%20flows.pdf

Similar Items

Similar Items