QoS-Aware Overlay Routing with Limited Number of Alternative Route Candidates and Its Evaluation
Summary :
A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.9 pp.2361-2374
- Publication Date
- 2006/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.9.2361
- Type of Manuscript
- Special Section PAPER (Special Section on Networking Technologies for Overlay Networks)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masato UCHIDA, Satoshi KAMEI, Ryoichi KAWAHARA, Takeo ABE, "QoS-Aware Overlay Routing with Limited Number of Alternative Route Candidates and Its Evaluation" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 9, pp. 2361-2374, September 2006, doi: 10.1093/ietcom/e89-b.9.2361.
Abstract: A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.9.2361/_p
Copy
@ARTICLE{e89-b_9_2361,
author={Masato UCHIDA, Satoshi KAMEI, Ryoichi KAWAHARA, Takeo ABE, },
journal={IEICE TRANSACTIONS on Communications},
title={QoS-Aware Overlay Routing with Limited Number of Alternative Route Candidates and Its Evaluation},
year={2006},
volume={E89-B},
number={9},
pages={2361-2374},
abstract={A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.},
keywords={},
doi={10.1093/ietcom/e89-b.9.2361},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - QoS-Aware Overlay Routing with Limited Number of Alternative Route Candidates and Its Evaluation
T2 - IEICE TRANSACTIONS on Communications
SP - 2361
EP - 2374
AU - Masato UCHIDA
AU - Satoshi KAMEI
AU - Ryoichi KAWAHARA
AU - Takeo ABE
PY - 2006
DO - 10.1093/ietcom/e89-b.9.2361
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2006
AB - A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.
ER -
English
