On the stable b-matching problem in multigraphs
Discrete Applied Mathematics
Analysis of bittorrent-like protocols for on-demand stored media streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Deep diving into BitTorrent locality
Proceedings of the 5th international student workshop on Emerging networking experiments and technologies
Upper bounds for stabilization in acyclic preference-based systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Deep diving into BitTorrent locality
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On modeling clustering indexes of BT-like systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Improving QoS in bittorrent-like VoD systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Insights on media streaming progress using BitTorrent-like protocols for on-demand streaming
IEEE/ACM Transactions on Networking (TON)
Acyclic preference systems in p2p networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
We consider a model for decentralized collaborative networks that is based on stable matching theory. This model is applied to systems with a global ranking utility function, which admits a unique stable configuration. We study the speed of convergence and analyze the stratification properties of the stable configuration, both when all collaborations are possible and for random possible collaborations. As a practical example, we consider the BitTorrent Titfor- Tat policy. For this system, our model provides an interesting insight into peer download rates and a good understanding of upload settings strategy.