Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
KCube: A novel architecture for interconnection networks
Information Processing Letters
Removing uncertainties from overlay network
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Future Generation Computer Systems
Fast track article: Peer-to-peer overlay topology control for mobile ad hoc networks
Pervasive and Mobile Computing
Cooperating with free riders in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reducing Network Overhead with Common Junction Methodology
International Journal of Mobile Computing and Multimedia Communications
| Hi-index | 0.00 |
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there is serious topology mismatch problem between the overlay and the physical topologies in many P2P systems. Such mismatching causes unnecessary query message duplications on both overlay and IP level, as well as increase query response time. In this research, we define the optimal overlay problem, and prove its NP-hardness. To address this issue, we propose a distributed overlay optimization algorithm, THANCS, and evaluate its effectiveness through trace driven simulations. The proposed THANCS has four major strengths. First, it does not need any global knowledge. Second, its optimization convergent speed is fast. Third, it is orthogonal to other types of advanced search approaches. Fourth, it reduces both the traffic cost and the search latency.