Asymptotics for the random coupon collector problem

Papanicolaou, Vassilis G.; Kokolakis, George; Boneh, Shahar

doi:10.1016/s0377-0427(98)00058-2

Cited by 20 publications

(18 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…,n − 1 is a non-stationary stochastic process whose first-order characterization is given by the probabilities p S ′ (n) = Pr{S(n) = S ′ } for each possible S ′ = goal. Using the probabilities (2) we have that…”

Section: A Markov Modelmentioning

confidence: 99%

Benefits of Cooperation in Multiplayer Coupon Collectors' Games

Rovatti

Passerini

Mazzini

2013

International Journal of Adaptive, Resilient and Autonomic Systems

View full text Add to dashboard Cite

The paper introduces a modified version of the classical Coupon Collector's Problem entailing exchanges and cooperation between multiple players. Results of the development show that, within a proper Markov framework, the complexity of the Cooperative Multiplayer Coupon Collectors' Problem can be attacked with an eye to the modeling of resource harvesting and sharing within the context of Next Generation Network. The cost of cooperation is computed in terms of exchange protocol burden and found to be dependent on only ensemble parameters such as the number of players and the number of coupons but not on the detailed collection statistics. The benefits of cooperation are quantified in terms of reduction of the average number of actions before collection completion.

show abstract

Section: A Markov Modelmentioning

confidence: 99%

Benefits of Cooperation in Multiplayer Coupon Collectors' Games

Rovatti

Passerini

Mazzini

2013

International Journal of Adaptive, Resilient and Autonomic Systems

View full text Add to dashboard Cite

show abstract

“…A segment can only be downloaded from one peer. Scheduling segments for download is similar to the coupon collector problem [39].…”

Section: B Streaming Without Router Supportmentioning

confidence: 99%

A Survey and Synthesis of User Behavior Measurements in P2P Streaming Systems

Ullah

Doyen

Bonnet

et al. 2011

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

In terms of scalability, cost and ease of deployment, the Peer-to-Peer (P2P) approach has emerged as a promising solution for video streaming applications. Its architecture enables end-hosts, called peers, to relay the video stream to each other. P2P systems are in fact networks of users who control peers. Thus, user behavior is crucial to the performance of these systems because it directly impacts the streaming flow. To understand user behavior, several measurement studies have been carried out over different video streaming systems. Each measurement analyzes a particular system focusing on specific metrics and presents insights. However, a single study based on a particular system and specific metrics is not sufficient to provide a complete model of user behavior considering all of its components and the impact of external factors on them. In this paper, we propose a comparison and a synthesis of these measurements. First of all, we review video streaming architectures, followed by a survey on the user behavior measurements in these architectures. Then, we gather insights revealed in these measurements and compare them for consensual and contrasting points. Finally, we extract components of user behavior, their external impacting factors and relationships among them. We also point out those aspects of user behavior which require further investigations.

show abstract

“…In order not to suffer from the Coupon Collector Problem [10], and to avoid that each tracker keeps state about which providers were supplied to each request, a solution based on Bloom filters [4] is used. Queries to primary and secondary trackers include a Bloom filter with all already known providers.…”

Section: Improving Efficiencymentioning

confidence: 99%

B-Tracker: Improving load balancing and efficiency in distributed P2P trackers

Hecht

Bocek

Stiller

2011

2011 IEEE International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

Trackers are used in peer-to-peer (P2P) networks for provider discovery, that is, mapping resources to potential providers. Centralized trackers, e.g., as in the original BitTorrent protocol, do not benefit from P2P properties, such as no single point of failure, scalability, and load balancing. Decentralized mechanisms have thus been proposed, based on distributed hash tables (DHTs) and gossiping, such as BitTorrent's Peer Exchange (PEX). While DHT-based trackers suffer from load balancing problems, gossip-based ones cannot deliver new mappings quickly. This paper presents B-Tracker, a fullydistributed, pull-based tracker. B-Tracker extends DHT functionality by distributing the tracker load among all providers in a swarm. Bloom filters are used to avoid redundant mappings to be transmitted. This results in the important properties of load balancing and scalability, while adding the ability for peers to fetch new mappings instantly. B-Tracker shows, through simulations, improved load balancing and better efficiency when compared to pure DHTs and PEX.

show abstract

Asymptotics for the random coupon collector problem

Cited by 20 publications

References 5 publications

Benefits of Cooperation in Multiplayer Coupon Collectors' Games

Benefits of Cooperation in Multiplayer Coupon Collectors' Games

A Survey and Synthesis of User Behavior Measurements in P2P Streaming Systems

B-Tracker: Improving load balancing and efficiency in distributed P2P trackers

Contact Info

Product

Resources

About