2006/12/22 by Anh-Tuan Gai, Gai, Anh-Tuan, Fabien Mathieu +6 · 1 citation
Computer Science · #Caching and Content Delivery #FOS: Computer and information sciences #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI) #Peer-to-Peer Network Technologies #cs.NI
paper · pdf · doi:10.48550/arxiv.cs/0612130
arxiv created 2006/12/22 · openalex publication_date 2006/12/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a model for decentralized networks with collaborating peers. The model is based on the stable matching theory which is applied to systems with a global ranking utility function. We consider the dynamics of peers searching for efficient collaborators and we prove that a unique stable solution exists. We prove that the system converges towards the stable solution and analyze its speed of convergence. We also study the stratification properties of the model, both when all collaborations are possible and for random possible collaborations. We present the corresponding fluid limit on the choice of collaborators in the random case. As a practical example, we study the BitTorrent Tit-for-Tat policy. For this system, our model provides an interesting insight on peer download rates and a possible way to optimize peer strategy.