An Incentive Compatible Mechanism for Replica Placement in Peer-Assisted Content Distribution

An Incentive Compatible Mechanism for Replica Placement in Peer-Assisted Content Distribution

Prabir Bhattacharya, Minzhe Guo
DOI: 10.4018/IJSSCI.2020010104
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Content delivery is a key technology on the Internet to achieve large scale, low-latency, reliable, and intelligent data delivery. Replica placement (RP) is a key machinery in content delivery systems to achieve efficient and effective content delivery. This work proposes a novel decentralized algorithm for the replica placement in peer-assisted content delivery networks with simultaneous considerations for peer incentives. By applying techniques from the algorithmic mechanism design theory, the authors show the incentive compatibility of the proposed algorithm. Experiments were conducted to validate the properties of the proposed method and comparisons were made with the state-of-the-art RP algorithms.
Article Preview
Top

1. Introduction

Content delivery is one of the key technologies in the Internet computing paradigm to achieve large scale, low-latency, reliable, and intelligent data delivery, enabling higher-level value-added applications, such as the video-on-demand streaming. Content delivery networks (CDNs) and peer-to-peer (P2P) networks are two alternative technologies for delivering the contents by the Internet. Both these approaches have some advantages and some disadvantages. With huge sets of servers deployed around the world, the CDN companies, such as Akamai, are serving geo-distributed data consumers with a higher throughput and better quality of service (QoS). However, the maintenance and management of a large number of server clusters scattered around the globe is challenging and expensive. On the other hand, the P2P networks can achieve a high scalability by leveraging the resources of the participating peers while keeping the server requirements low. For example, the PPLive used less than 10Mbps of server bandwidth to simultaneously serve a 400 kbps video stream to roughly 1.5 million end users (Huang & Ross, 2007). Nevertheless, the decentralized and uncoordinated operation in the P2P systems implies that this scaling comes with undesirable side effects, such as the high startup delay (Yin et al., 2010) and potential asynchronicity in the peer arrival times (Karamshuk et al., 2015). Given the complementary advantages of both the approaches, researchers proposed some hybrid CDN-P2P systems (Jiang et al., 2008; Xu et al., 2006), aiming to incorporate the best of both approaches and offset each other’s disadvantages. Based on the coupling model, the hybrid system can be classified into two categories (Lu et al., 2012): the peer-assisted CDN (PCDN) and the CDN-assisted P2P. Most of the existing approaches (Yin et al., 2010; Jian et al., 2008; Xu et al., 2006; Zhao et al., 2013; Jian et al., 2008; Huang et al., 2008) fall into the first category, in which the P2P network is designed as a complement component for the regular CDN-based content delivery. Large-scale measurements revealed that substantial savings could be obtained from such approaches, e.g., a reported 70% of server traffic offload in Akamai’s NetSession (Zhao et al., 2013), and over 87% savings for a video-on-demand workload from Conviva (Balachandran et al., 2013), suggesting that peer assistance can greatly decrease the cost of content delivery. Nevertheless, the gains from peer assistance can be limited due to a number of obstacle factors. Karamshuk et al. (2015) identified three obstacle factors, including ISP-friendliness – requiring peers to be within the same Internet service provider (ISP), bit rate stratification – the need to match peers with others needing similar bit rate, and partial participation – some peers choosing not to redistribute the content.

Although a large number of replica placement (RP) algorithms have been proposed for traditional CDNs (Zaman & Grosu 2011; Neves et al., 2009; Benoit et al., 2008; Vicari et al., 2007; Wauters et al., 2006; Bakiras & Loukopoulos 2005; Tang & Xu 2005; Karlsson & Karamanolis 2004; Khan & Ahmad 2004; Loukopoulos & Ahmad 2004; Bartolini et al., 2003; Karlsson et al., 2002; Karlsson & Mahalingam 2002; Chen et al., 2002; Kangasharju et al., 2002; Dilley et al., 2002; Jamin et al., 2001; Qiu et al., 2001; Kalpakis et al., 2001; Wolfson et al., 1997), they may not work efficiently in the PCDN environment where the P2P technology is incorporated to achieve the cost-efficiency in a two-level hybrid architecture. In PCDNs, the increase in user requests also means a higher probability that the requests can be served by nearby peers (Jiang et al., 2009), reducing the traffic overload in the nearby CDN servers. The RP algorithms for the PCDN need to take the peer contributions into consideration.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing