Endhost-based shortest path routing in dynamic networks: An online learning approach

Ting He, Dennis Goeckel, Ramya Raghavendra, Don Towsley

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

6 Citations (Scopus)

Abstract

We consider the problem of endhost-based shortest path routing in a network with unknown, time-varying link qualities. Endhost-based routing is needed when internal nodes of the network do not have the scope or capability to provide globally optimal paths to given source-destination pairs, as can be the case in networks consisting of autonomous subnetworks or those with endhost-based routing restrictions. Assuming the source can probe links along selected paths, we formulate the problem as an online learning problem, where an existing solution achieves a performance loss (called regret) that is logarithmic in time with respect to (wrt) an offline algorithm that knows the link qualities. Current solutions assume coupled probing and routing; in contrast, we give a simple algorithm based on decoupled probing and routing, whose regret is only constant in time. We then extend our solution to support multi-path probing and cooperative learning between multiple sources, where we show an inversely proportional decay in regret wrt the probing rate. We also show that without the decoupling, the regret grows at least logarithmically in time, thus establishing decoupling as critical for obtaining constant regret. Although our analysis assumes certain conditions (i.i.d.) on link qualities, our solution applies with straightforward amendments to much broader scenarios where these conditions are relaxed. The efficacy of the proposed solution is verified by trace-driven simulations.

Original languageEnglish (US)
Title of host publication2013 Proceedings IEEE INFOCOM 2013
Pages2202-2210
Number of pages9
DOIs
StatePublished - Sep 2 2013
Event32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013 - Turin, Italy
Duration: Apr 14 2013Apr 19 2013

Other

Other32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013
CountryItaly
CityTurin
Period4/14/134/19/13

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

He, T., Goeckel, D., Raghavendra, R., & Towsley, D. (2013). Endhost-based shortest path routing in dynamic networks: An online learning approach. In 2013 Proceedings IEEE INFOCOM 2013 (pp. 2202-2210). [6567023] https://doi.org/10.1109/INFCOM.2013.6567023
He, Ting ; Goeckel, Dennis ; Raghavendra, Ramya ; Towsley, Don. / Endhost-based shortest path routing in dynamic networks : An online learning approach. 2013 Proceedings IEEE INFOCOM 2013. 2013. pp. 2202-2210
@inproceedings{d61e44aee12343d283d9498e677955a6,
title = "Endhost-based shortest path routing in dynamic networks: An online learning approach",
abstract = "We consider the problem of endhost-based shortest path routing in a network with unknown, time-varying link qualities. Endhost-based routing is needed when internal nodes of the network do not have the scope or capability to provide globally optimal paths to given source-destination pairs, as can be the case in networks consisting of autonomous subnetworks or those with endhost-based routing restrictions. Assuming the source can probe links along selected paths, we formulate the problem as an online learning problem, where an existing solution achieves a performance loss (called regret) that is logarithmic in time with respect to (wrt) an offline algorithm that knows the link qualities. Current solutions assume coupled probing and routing; in contrast, we give a simple algorithm based on decoupled probing and routing, whose regret is only constant in time. We then extend our solution to support multi-path probing and cooperative learning between multiple sources, where we show an inversely proportional decay in regret wrt the probing rate. We also show that without the decoupling, the regret grows at least logarithmically in time, thus establishing decoupling as critical for obtaining constant regret. Although our analysis assumes certain conditions (i.i.d.) on link qualities, our solution applies with straightforward amendments to much broader scenarios where these conditions are relaxed. The efficacy of the proposed solution is verified by trace-driven simulations.",
author = "Ting He and Dennis Goeckel and Ramya Raghavendra and Don Towsley",
year = "2013",
month = "9",
day = "2",
doi = "10.1109/INFCOM.2013.6567023",
language = "English (US)",
isbn = "9781467359467",
pages = "2202--2210",
booktitle = "2013 Proceedings IEEE INFOCOM 2013",

}

He, T, Goeckel, D, Raghavendra, R & Towsley, D 2013, Endhost-based shortest path routing in dynamic networks: An online learning approach. in 2013 Proceedings IEEE INFOCOM 2013., 6567023, pp. 2202-2210, 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013, Turin, Italy, 4/14/13. https://doi.org/10.1109/INFCOM.2013.6567023

Endhost-based shortest path routing in dynamic networks : An online learning approach. / He, Ting; Goeckel, Dennis; Raghavendra, Ramya; Towsley, Don.

2013 Proceedings IEEE INFOCOM 2013. 2013. p. 2202-2210 6567023.

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

TY - GEN

T1 - Endhost-based shortest path routing in dynamic networks

T2 - An online learning approach

AU - He, Ting

AU - Goeckel, Dennis

AU - Raghavendra, Ramya

AU - Towsley, Don

PY - 2013/9/2

Y1 - 2013/9/2

N2 - We consider the problem of endhost-based shortest path routing in a network with unknown, time-varying link qualities. Endhost-based routing is needed when internal nodes of the network do not have the scope or capability to provide globally optimal paths to given source-destination pairs, as can be the case in networks consisting of autonomous subnetworks or those with endhost-based routing restrictions. Assuming the source can probe links along selected paths, we formulate the problem as an online learning problem, where an existing solution achieves a performance loss (called regret) that is logarithmic in time with respect to (wrt) an offline algorithm that knows the link qualities. Current solutions assume coupled probing and routing; in contrast, we give a simple algorithm based on decoupled probing and routing, whose regret is only constant in time. We then extend our solution to support multi-path probing and cooperative learning between multiple sources, where we show an inversely proportional decay in regret wrt the probing rate. We also show that without the decoupling, the regret grows at least logarithmically in time, thus establishing decoupling as critical for obtaining constant regret. Although our analysis assumes certain conditions (i.i.d.) on link qualities, our solution applies with straightforward amendments to much broader scenarios where these conditions are relaxed. The efficacy of the proposed solution is verified by trace-driven simulations.

AB - We consider the problem of endhost-based shortest path routing in a network with unknown, time-varying link qualities. Endhost-based routing is needed when internal nodes of the network do not have the scope or capability to provide globally optimal paths to given source-destination pairs, as can be the case in networks consisting of autonomous subnetworks or those with endhost-based routing restrictions. Assuming the source can probe links along selected paths, we formulate the problem as an online learning problem, where an existing solution achieves a performance loss (called regret) that is logarithmic in time with respect to (wrt) an offline algorithm that knows the link qualities. Current solutions assume coupled probing and routing; in contrast, we give a simple algorithm based on decoupled probing and routing, whose regret is only constant in time. We then extend our solution to support multi-path probing and cooperative learning between multiple sources, where we show an inversely proportional decay in regret wrt the probing rate. We also show that without the decoupling, the regret grows at least logarithmically in time, thus establishing decoupling as critical for obtaining constant regret. Although our analysis assumes certain conditions (i.i.d.) on link qualities, our solution applies with straightforward amendments to much broader scenarios where these conditions are relaxed. The efficacy of the proposed solution is verified by trace-driven simulations.

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

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

U2 - 10.1109/INFCOM.2013.6567023

DO - 10.1109/INFCOM.2013.6567023

M3 - Conference contribution

AN - SCOPUS:84883097189

SN - 9781467359467

SP - 2202

EP - 2210

BT - 2013 Proceedings IEEE INFOCOM 2013

ER -

He T, Goeckel D, Raghavendra R, Towsley D. Endhost-based shortest path routing in dynamic networks: An online learning approach. In 2013 Proceedings IEEE INFOCOM 2013. 2013. p. 2202-2210. 6567023 https://doi.org/10.1109/INFCOM.2013.6567023