Sciweavers

580 search results - page 17 / 116
» Choosing a random peer
Sort
View
ICMCS
2009
IEEE
96views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Optimizing segment caching for peer-to-peer on-demand streaming
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
Ho-Shing Tang, Shueng-Han Gary Chan, Haochao Li
DCC
2008
IEEE
13 years 7 months ago
A Reliable Chunkless Peer-to-Peer Architecture for Multimedia Streaming
In this paper we propose a chunkless structure for multimedia distribution over peer-to-peer networks. With the proposed approach, the original multimedia packets are partitioned ...
Riccardo Bernardini, Roberto Rinaldo, Andrea Vital...
COMBINATORICS
2002
84views more  COMBINATORICS 2002»
13 years 7 months ago
Compositions of Random Functions on a Finite Set
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
Avinash Dalal, Eric Schmutz
JSAC
2007
116views more  JSAC 2007»
13 years 7 months ago
Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
Abstract— On-demand and live multimedia streaming applications (such as Internet TV) are well known to utilize a significant amount of bandwidth from media streaming servers, es...
Tara Small, Baochun Li, Ben Liang
COLOGNETWENTE
2010
13 years 6 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik