Sciweavers

11580 search results - page 1915 / 2316
» Communication vs. Computation
Sort
View
P2P
2009
IEEE
167views Communications» more  P2P 2009»
16 years 1 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
16 years 1 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
114views Communications» more  P2P 2009»
16 years 1 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
120views Communications» more  P2P 2009»
16 years 1 months ago
A Flexible Divide-And-Conquer Protocol for Multi-View Peer-to-Peer Live Streaming
Abstract—Multi-view peer-to-peer (P2P) live streaming systems have recently emerged, where a user can simultaneously watch multiple channels. Previous work on multi-view P2P stre...
Miao Wang, Lisong Xu, Byrav Ramamurthy
P2P
2009
IEEE
115views Communications» more  P2P 2009»
16 years 1 months ago
An Approximation Algorithm for Minimum-Delay Peer-to-Peer Streaming
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
Fei Huang, Binoy Ravindran, Anil Vullikanti
« Prev « First page 1915 / 2316 Last » Next »