On the quality of triangle inequality violation aware routing overlay architecture

Ryoichi Kawahara, Eng Keong Lua, Masato Uchida, Satoshi Kamei, Hideaki Yoshino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

It is known that Internet routing policies for both intra- and inter-domain routing can naturally give rise to Triangle Inequality Violations (TIVs) with respect to Quality of Service (QoS) network metrics such as latencies between nodes. This motivates the exploitation of such TIVs phenomenon in network metrics to design TlV-aware routing overlay architecture which is capable of choosing quality overlay routing paths to improve end-to-end QoS without changing the underlying network architecture. Our idea is to find quality overlay routes between node pairs based on TIV optimization in terms of the latency and packet loss ratio, and that can offer near optimal routing quality in cost-effective and scalable manner. Our intuition to do this is to choose these overlay routes from a small set of transit nodes. We propose to assign nodes with transit selection frequency scores that are computed based on previous node usage for transit, and consolidate a small set of highly ranked transit nodes. For every node pair, we choose the best transit node in this small set for overlay routing, based on TIV optimization in latency and packet loss ratio. We analyze the quality of our TlV-aware routing overlay algorithm analytically and using real Internet measurements on latency and packet loss ratio. Our results show good quality performance in improving end-to-end QoS routing.

Original languageEnglish
Title of host publicationIEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Pages2761-2765
Number of pages5
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: 2009 Apr 192009 Apr 25

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period09/4/1909/4/25

Fingerprint

Packet loss
Quality of service
Internet
Network architecture
Costs

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Kawahara, R., Lua, E. K., Uchida, M., Kamei, S., & Yoshino, H. (2009). On the quality of triangle inequality violation aware routing overlay architecture. In IEEE INFOCOM 2009 - The 28th Conference on Computer Communications (pp. 2761-2765). [5062227] https://doi.org/10.1109/INFCOM.2009.5062227

On the quality of triangle inequality violation aware routing overlay architecture. / Kawahara, Ryoichi; Lua, Eng Keong; Uchida, Masato; Kamei, Satoshi; Yoshino, Hideaki.

IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. 2009. p. 2761-2765 5062227.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kawahara, R, Lua, EK, Uchida, M, Kamei, S & Yoshino, H 2009, On the quality of triangle inequality violation aware routing overlay architecture. in IEEE INFOCOM 2009 - The 28th Conference on Computer Communications., 5062227, pp. 2761-2765, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 09/4/19. https://doi.org/10.1109/INFCOM.2009.5062227
Kawahara R, Lua EK, Uchida M, Kamei S, Yoshino H. On the quality of triangle inequality violation aware routing overlay architecture. In IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. 2009. p. 2761-2765. 5062227 https://doi.org/10.1109/INFCOM.2009.5062227
Kawahara, Ryoichi ; Lua, Eng Keong ; Uchida, Masato ; Kamei, Satoshi ; Yoshino, Hideaki. / On the quality of triangle inequality violation aware routing overlay architecture. IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. 2009. pp. 2761-2765
@inproceedings{5679c82149a6447fac4a0cf58b4b35ac,
title = "On the quality of triangle inequality violation aware routing overlay architecture",
abstract = "It is known that Internet routing policies for both intra- and inter-domain routing can naturally give rise to Triangle Inequality Violations (TIVs) with respect to Quality of Service (QoS) network metrics such as latencies between nodes. This motivates the exploitation of such TIVs phenomenon in network metrics to design TlV-aware routing overlay architecture which is capable of choosing quality overlay routing paths to improve end-to-end QoS without changing the underlying network architecture. Our idea is to find quality overlay routes between node pairs based on TIV optimization in terms of the latency and packet loss ratio, and that can offer near optimal routing quality in cost-effective and scalable manner. Our intuition to do this is to choose these overlay routes from a small set of transit nodes. We propose to assign nodes with transit selection frequency scores that are computed based on previous node usage for transit, and consolidate a small set of highly ranked transit nodes. For every node pair, we choose the best transit node in this small set for overlay routing, based on TIV optimization in latency and packet loss ratio. We analyze the quality of our TlV-aware routing overlay algorithm analytically and using real Internet measurements on latency and packet loss ratio. Our results show good quality performance in improving end-to-end QoS routing.",
author = "Ryoichi Kawahara and Lua, {Eng Keong} and Masato Uchida and Satoshi Kamei and Hideaki Yoshino",
year = "2009",
doi = "10.1109/INFCOM.2009.5062227",
language = "English",
isbn = "9781424435135",
pages = "2761--2765",
booktitle = "IEEE INFOCOM 2009 - The 28th Conference on Computer Communications",

}

TY - GEN

T1 - On the quality of triangle inequality violation aware routing overlay architecture

AU - Kawahara, Ryoichi

AU - Lua, Eng Keong

AU - Uchida, Masato

AU - Kamei, Satoshi

AU - Yoshino, Hideaki

PY - 2009

Y1 - 2009

N2 - It is known that Internet routing policies for both intra- and inter-domain routing can naturally give rise to Triangle Inequality Violations (TIVs) with respect to Quality of Service (QoS) network metrics such as latencies between nodes. This motivates the exploitation of such TIVs phenomenon in network metrics to design TlV-aware routing overlay architecture which is capable of choosing quality overlay routing paths to improve end-to-end QoS without changing the underlying network architecture. Our idea is to find quality overlay routes between node pairs based on TIV optimization in terms of the latency and packet loss ratio, and that can offer near optimal routing quality in cost-effective and scalable manner. Our intuition to do this is to choose these overlay routes from a small set of transit nodes. We propose to assign nodes with transit selection frequency scores that are computed based on previous node usage for transit, and consolidate a small set of highly ranked transit nodes. For every node pair, we choose the best transit node in this small set for overlay routing, based on TIV optimization in latency and packet loss ratio. We analyze the quality of our TlV-aware routing overlay algorithm analytically and using real Internet measurements on latency and packet loss ratio. Our results show good quality performance in improving end-to-end QoS routing.

AB - It is known that Internet routing policies for both intra- and inter-domain routing can naturally give rise to Triangle Inequality Violations (TIVs) with respect to Quality of Service (QoS) network metrics such as latencies between nodes. This motivates the exploitation of such TIVs phenomenon in network metrics to design TlV-aware routing overlay architecture which is capable of choosing quality overlay routing paths to improve end-to-end QoS without changing the underlying network architecture. Our idea is to find quality overlay routes between node pairs based on TIV optimization in terms of the latency and packet loss ratio, and that can offer near optimal routing quality in cost-effective and scalable manner. Our intuition to do this is to choose these overlay routes from a small set of transit nodes. We propose to assign nodes with transit selection frequency scores that are computed based on previous node usage for transit, and consolidate a small set of highly ranked transit nodes. For every node pair, we choose the best transit node in this small set for overlay routing, based on TIV optimization in latency and packet loss ratio. We analyze the quality of our TlV-aware routing overlay algorithm analytically and using real Internet measurements on latency and packet loss ratio. Our results show good quality performance in improving end-to-end QoS routing.

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

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

U2 - 10.1109/INFCOM.2009.5062227

DO - 10.1109/INFCOM.2009.5062227

M3 - Conference contribution

SN - 9781424435135

SP - 2761

EP - 2765

BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications

ER -