Sciweavers

P2P
2009
IEEE
114views Communications» more  P2P 2009»
13 years 11 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
P2P
2009
IEEE
13 years 11 months ago
A Trusted Infrastructure for P2P-based Marketplaces
Peer-to-peer (P2P) based marketplaces have a number of advantages over traditional centralized systems (such as eBay). Peers form a distributed hash table and store sale offers fo...
Tien Tuan Anh Dinh, Tom Chothia, Mark Ryan
P2P
2009
IEEE
189views Communications» more  P2P 2009»
13 years 11 months ago
Badumna Network Suite: A Decentralized Network Engine for Massively Multiplayer Online Applications
We present Badumna Network Suite, a network engine for Massively Multiplayer Online (MMO) applications. MMO applications such as World of Warcraft and Second Life use client-serve...
Santosh Kulkarni
P2P
2009
IEEE
101views Communications» more  P2P 2009»
13 years 11 months ago
Monitoring and Management of Structured Peer-to-Peer Systems
The peer-to-peer paradigm shows the potential to provide the same functionality and quality like client/server based systems, but with much lower costs. In order to control the qu...
Kalman Graffi, Dominik Stingl, Julius Rueckert, Al...
P2P
2009
IEEE
13 years 11 months ago
On Tracking Freeriders in Gossip Protocols
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received ...
Rachid Guerraoui, Kévin Huguenin, Anne-Mari...
P2P
2009
IEEE
167views Communications» more  P2P 2009»
13 years 11 months ago
ID Repetition in Kad
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on IDmatching. Many previous works and measurements on Kad do not take into account that...
Jie Yu, Chengfang Fang, Jia Xu, Ee-Chien Chang, Zh...
P2P
2009
IEEE
126views Communications» more  P2P 2009»
13 years 11 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
P2P
2009
IEEE
231views Communications» more  P2P 2009»
13 years 11 months ago
Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...
P2P
2009
IEEE
143views Communications» more  P2P 2009»
13 years 11 months ago
SimGrid: a Generic Framework for Large-Scale Distributed Experiments
Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unf...
Martin Quinson