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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2002
|
| Subjects: | |
| 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 |
| _version_ | 1848790106556596224 |
|---|---|
| author | Tan, Su Wei Lee, Sze Wei Vaillaint, Benoit |
| author_facet | Tan, Su Wei Lee, Sze Wei Vaillaint, Benoit |
| author_sort | Tan, Su Wei |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | 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 minimum interference routing algorithm and the algorithms developed based on theoretic competitive analysis to provide efficient routing. Using extensive simulations, we show that our algorithm out-performs several previously proposed algorithms on several metrics such as the acceptance rate of the tunnel set-up requests, fairness and the capability of providing priorities to tunnel requests of certain source-destination pairs in the network. (C) 2002 Elsevier Science B.V. All rights reserved. |
| first_indexed | 2025-11-14T18:07:20Z |
| format | Article |
| id | mmu-2624 |
| institution | Multimedia University |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:07:20Z |
| publishDate | 2002 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-26242015-03-03T03:45:12Z http://shdl.mmu.edu.my/2624/ Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows Tan, Su Wei Lee, Sze Wei Vaillaint, Benoit QA75.5-76.95 Electronic computers. Computer science 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 minimum interference routing algorithm and the algorithms developed based on theoretic competitive analysis to provide efficient routing. Using extensive simulations, we show that our algorithm out-performs several previously proposed algorithms on several metrics such as the acceptance rate of the tunnel set-up requests, fairness and the capability of providing priorities to tunnel requests of certain source-destination pairs in the network. (C) 2002 Elsevier Science B.V. All rights reserved. Elsevier 2002-11 Article NonPeerReviewed text en http://shdl.mmu.edu.my/2624/1/Non-greedy%20minimum%20interference%20routing%20algorithm%20for%20bandwidth-guaranteed%20flows.pdf Tan, Su Wei and Lee, Sze Wei and Vaillaint, Benoit (2002) Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows. Computer Communications, 25 (17). pp. 1640-1652. ISSN 0140-3664 http://dx.doi.org/10.1016/S0140-3664(02)00055-5 doi:10.1016/S0140-3664(02)00055-5 doi:10.1016/S0140-3664(02)00055-5 |
| spellingShingle | QA75.5-76.95 Electronic computers. Computer science Tan, Su Wei Lee, Sze Wei Vaillaint, Benoit Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| title | Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| title_full | Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| title_fullStr | Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| title_full_unstemmed | Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| title_short | Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| title_sort | non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows |
| topic | QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/2624/ http://shdl.mmu.edu.my/2624/ http://shdl.mmu.edu.my/2624/ http://shdl.mmu.edu.my/2624/1/Non-greedy%20minimum%20interference%20routing%20algorithm%20for%20bandwidth-guaranteed%20flows.pdf |