Presentation 2006-10-17
On decreasing the number of hops needed for long-distance communications in overlay networks
Fuminori MAKIKAWA, Takafumi MATSUO, Tatsuhiro TSUCHIYA, Tohru KIKUNO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In overlay networks, which are virtual networks for P2P applications, topological mismatching is known as a serious problem to be solved. So far several distributed algorithms have been proposed to reduce communication cost caused by this problem. However, they often create long routes with a large number of hops, especially for long distance communications. In this paper, we propose a distributed algorithm to address this issue. This algorithm designates nodes in an overlay network as special nodes with some probability. A special node iteratively exchanges one of its links with a new, longer distance link, instead of a shorter one. The new links are extensively used for long distance communications. The simulation studies show that in the overlay networks constructed by this algorithm, the number of hops per route is reduced for long distance communications, at the cost of a slight increase in communication cost.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) peer-to-peer systems / overlay network / topology mismatching / distributed algorithm
Paper # DE2006-121,DC2006-28
Date of Issue

Conference Information
Committee DC
Conference Date 2006/10/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Dependable Computing (DC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On decreasing the number of hops needed for long-distance communications in overlay networks
Sub Title (in English)
Keyword(1) peer-to-peer systems
Keyword(2) overlay network
Keyword(3) topology mismatching
Keyword(4) distributed algorithm
1st Author's Name Fuminori MAKIKAWA
1st Author's Affiliation Graduate Schoot of Information Science and Technology, Osaka University()
2nd Author's Name Takafumi MATSUO
2nd Author's Affiliation Graduate Schoot of Information Science and Technology, Osaka University
3rd Author's Name Tatsuhiro TSUCHIYA
3rd Author's Affiliation Graduate Schoot of Information Science and Technology, Osaka University
4th Author's Name Tohru KIKUNO
4th Author's Affiliation Graduate Schoot of Information Science and Technology, Osaka University
Date 2006-10-17
Paper # DE2006-121,DC2006-28
Volume (vol) vol.106
Number (no) 292
Page pp.pp.-
#Pages 6
Date of Issue