Sciweavers

162 search results - page 6 / 33
» Minimizing Average Finish Time in P2P Networks
Sort
View
CONEXT
2008
ACM
13 years 9 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
ICCCN
2007
IEEE
13 years 11 months ago
Fair Efficiency, or Low Average Delay without Starvation
Abstract-- Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit su...
Sergey Gorinsky, Christoph Jechlitschek
INFOCOM
2005
IEEE
14 years 1 months ago
An analytic framework for modeling peer to peer networks
Abstract—This paper presents an analytic framework to evaluate the performance of peer to peer (P2P) networks. Using the time to download or replicate an arbitrary file as the m...
Krishna K. Ramachandran, Biplab Sikdar
P2P
2006
IEEE
153views Communications» more  P2P 2006»
14 years 1 months ago
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
Anwitaman Datta, Karl Aberer
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 7 months ago
Optimal Scheduling of Peer-to-Peer File Dissemination
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Intern...
Jochen Mundinger, Richard R. Weber, Gideon Weiss