Sciweavers

844 search results - page 9 / 169
» Solving the p
Sort
View
ICDCS
2008
IEEE
15 years 4 months ago
Circumventing Server Bottlenecks: Indirect Large-Scale P2P Data Collection
In most large-scale peer-to-peer (P2P) applications, it is necessary to collect vital statistics data — sometimes referred to as logs — from up to millions of peers. Tradition...
Di Niu, Baochun Li
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Probabilistic scalable P2P resource location services
Scalable resource discovery services form the core of directory and other middleware services. Scalability requirements preclude centralized solutions. The need to have directory ...
Daniel A. Menascé, Lavanya Kanchanapalli
INFOCOM
2010
IEEE
14 years 8 months ago
Understanding Sub-stream Scheduling in P2P Hybrid Live Streaming Systems
—The P2P pull-push hybrid architecture has achieved great success in delivering live video traffic over the Internet. However, a formal study on the sub-stream scheduling proble...
Zhenjiang Li, Danny H. K. Tsang, Wang-Chien Lee
ICUMT
2009
14 years 7 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
CONEXT
2008
ACM
14 years 11 months ago
Maintaining replicas in unstructured P2P systems
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
Christof Leng, Wesley W. Terpstra, Bettina Kemme, ...