QoS-aware overlay routing with limited number of alternative route candidates and its evaluation

Masato Uchida, Satoshi Kamei, Ryoichi Kawahara, Takeo Abe

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)2361-2374
Number of pages14
JournalIEICE Transactions on Communications
VolumeE89-B
Issue number9
DOIs
Publication statusPublished - 2006
Externally publishedYes

Fingerprint

Quality of service
Costs
Overlay networks
Routing algorithms

Keywords

  • Overlay network
  • Overlay routing
  • QoS

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

QoS-aware overlay routing with limited number of alternative route candidates and its evaluation. / Uchida, Masato; Kamei, Satoshi; Kawahara, Ryoichi; Abe, Takeo.

In: IEICE Transactions on Communications, Vol. E89-B, No. 9, 2006, p. 2361-2374.

Research output: Contribution to journalArticle

Uchida, Masato ; Kamei, Satoshi ; Kawahara, Ryoichi ; Abe, Takeo. / QoS-aware overlay routing with limited number of alternative route candidates and its evaluation. In: IEICE Transactions on Communications. 2006 ; Vol. E89-B, No. 9. pp. 2361-2374.
@article{1c22853da3ec4151952c047974abf238,
title = "QoS-aware overlay routing with limited number of alternative route candidates and its evaluation",
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 = "Overlay network, Overlay routing, QoS",
author = "Masato Uchida and Satoshi Kamei and Ryoichi Kawahara and Takeo Abe",
year = "2006",
doi = "10.1093/ietcom/e89-b.9.2361",
language = "English",
volume = "E89-B",
pages = "2361--2374",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - QoS-aware overlay routing with limited number of alternative route candidates and its evaluation

AU - Uchida, Masato

AU - Kamei, Satoshi

AU - Kawahara, Ryoichi

AU - Abe, Takeo

PY - 2006

Y1 - 2006

N2 - 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.

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.

KW - Overlay network

KW - Overlay routing

KW - QoS

UR - http://www.scopus.com/inward/record.url?scp=33748791450&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748791450&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e89-b.9.2361

DO - 10.1093/ietcom/e89-b.9.2361

M3 - Article

AN - SCOPUS:33748791450

VL - E89-B

SP - 2361

EP - 2374

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 9

ER -