Modeling Priority-based Incentive Policies for Peer-assisted Content Delivery Systems
2008 (English)In: NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet: 7th International IFIP-TC6 Networking Conference Singapore, May 5-9, 2008, Proceedings / [ed] Amitabha Das, Hung Keng Pung, Francis BuSung Lee and Lawrence WaiChoong Wong, Springer Berlin/Heidelberg, 2008, 421-432 p.Chapter in book (Refereed)
Content delivery providers can improve their service scalability and offload their servers by making use of content transfers among their clients. To provide peers with incentive to transfer data to other peers, protocols such as BitTorrent typically employ a tit-for-tat policy in which peers give upload preference to peers that provide the highest upload rate to them. However, the tit-for-tat policy does not provide any incentive for a peer to stay in the system beyond completion of its download.
This paper presents a simple fixed-point analytic model of a priority-based incentive mechanism which provides peers with strong incentive to contribute upload bandwidth beyond their own download completion. Priority is obtained based on a peer's prior contribution to the system. Using a two-class model, we show that priority-based policies can significantly improve average download times, and that there exists a significant region of the parameter space in which both high-priority and low-priority peers experience improved performance compared to with the pure tit-for-tat approach. Our results are supported using event-based simulations.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2008. 421-432 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 4982
Modeling - peer-assisted content delivery - priority-based incentive
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-64651DOI: 10.1007/978-3-540-79549-0_37ISBN: 3-540-79548-0ISBN: 978-3-540-79548-3OAI: oai:DiVA.org:liu-64651DiVA: diva2:393201