Path probing relay routing for achieving high end-to-end performance

Chen Mou Cheng*, Yu Sheng Huang, H. T. Kung, Chun Hsin Wu

*Corresponding author for this work

Research output: Contribution to conferenceConference Paperpeer-review

13 Scopus citations


We present an overlay network routing scheme, called Path Probing Relay Routing (PPRR), which is capable of promptly switching to alternative paths when the direct paths provided by the underlying IP networks suffer from serious performance degradation or outage. PPRR uses a randomized search algorithm to discover available alternative paths and employs an end-to-end, on-demand probing technique to determine their quality. To assess the effectiveness of PPRR, we conduct performance simulations using four sets of real-world traces, collected by various research groups at different times and places. Our simulation results show that the performance of PPRR is comparable to that of a typical link state relay routing algorithm. Compared with the latter, PPRR has lower probing overhead in the sense that the overhead remains constant as network size grows. In particular, PPRR avoids the need to flood the overlay network with link state updates.

Original languageEnglish
Number of pages7
StatePublished - 2004
Externally publishedYes
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: 29 11 200403 12 2004


ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
Country/TerritoryUnited States
CityDallas, TX


  • End-to-end performance
  • Overlay networks
  • Path probing
  • Relay routing


Dive into the research topics of 'Path probing relay routing for achieving high end-to-end performance'. Together they form a unique fingerprint.

Cite this