Abstract
Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the application layer. Often, there is topology mismatching between the overlay network and the physical network, which may cause great traffic overhead. In this paper, we study the topology mismatching problem and its impact on communication in wireless ad hoc networks. We present an efficient, fully distributed algorithm, named D-TAOC, for constructing the overlay network. By qualitative analysis and simulation experiments, we show that D-TAOC can significantly reduce the traffic overhead while slightly sacrificing the routing efficiency. We also prove that D-TAOC works well in a dynamic peer-to-peer environment.
Original language | English |
---|---|
Title of host publication | Proceedings - 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2006 |
Pages | 340-347 |
Number of pages | 8 |
Volume | 2006 |
DOIs | |
Publication status | Published - 26 Oct 2006 |
Event | 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2006 - Montbeliard-Sochaux, France Duration: 15 Feb 2006 → 17 Feb 2006 |
Conference
Conference | 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2006 |
---|---|
Country/Territory | France |
City | Montbeliard-Sochaux |
Period | 15/02/06 → 17/02/06 |
ASJC Scopus subject areas
- General Engineering