[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Impacts of selfish behaviors on the scalability of hybrid client: server and peer-to-peer caching systems

Published: 01 December 2015 Publication History

Abstract

This paper considers a hybrid peer-to-peer (p2p) system, a dynamic distributed caching system with an authoritative server dispensing contents only if the contents fail to be found by searching an unstructured p2p system. We study the case when some peers may not be fully cooperative in the search process and examine the impact of various noncooperative behaviors in the aspect of scalability, more specifically average server load and average peer load as the peer population size increases. We categorize selfish peers into three classes: impatient peers that directly query the server without searching the p2p system, non-forwarders that refuse to forward query requests, and non-resolvers that refuse to share contents. It is shown that in the hybrid p2p system, impatient and/or non-forwarding behaviors prevent the system from scaling well because of the high server load, while the system scales well under the non-resolving selfish peers. Our study implies that the hybrid p2p system does not mandate an incentive mechanism for content sharing, which is in stark contrast to unstructured p2p systems, where incentivizing peers to share contents is known to be a key factor for the system's scalability.

References

[1]
C. Huang, J. Li, and K. W. Ross, "Can Internet video-on-demand be profitable?," in Proc. ACM SIGCOMM, 2007, pp. 133--144.
[2]
M. Cha, P. Rodriguez, S. Moon, and J. Crowcroft, "On next-generation telco-managed p2p TV architectures," in Proc. USENIX IPTPS, 2008, p. 5.
[3]
Y. Chen et al., "Towards capacity and profit optimization of video-on-demand services in a peer-assisted IPTV platform," Multimedia Syst., vol. 15, no. 1, pp. 19--32, 2009.
[4]
J. Cho and Y. Yi, "On the payoff mechanisms in peer-assisted services with multiple content providers: Rationality and fairness," IEEE/ACM Trans. Netw., vol. 22, no. 3, pp. 731--744, Jun. 2014.
[5]
V. Misra, S. Inoannidis, A. Chaintreau, and L. Maasoulié, "Incentivizing peer-assisted services: A fluid Shapley value approach," in Proc. ACM SIGMETRICS, 2010, pp. 215--226.
[6]
Y. Jin, Y. Yi, G. Kesidis, F. Kocak, and J. Shin, "Hybrid client-server and peer-to-peer caching systems with selfish peers," in Proc. IEEE INFOCOM, 2013, pp. 1744--1752.
[7]
C. Zhao, X. Lin, and C. Wu, "The streaming capacity of sparsely-connected p2p systems with distributed control," in Proc. IEEE INFOCOM, 2011, pp. 1449--1457.
[8]
C. Zhao, J. Zhao, X. Lin, and C. Wu, "Capacity of P2P on-demand streaming with simple, robust and decentralized control," in Proc. IEEE INFOCOM, 2013, pp. 2697--2705.
[9]
D. Ciullo, V. Martina, M. Garetto, and E. Leonardi, "How much can large-scale video-on-demand benefit from users' cooperation?," in Proc. IEEE INFOCOM, 2013, pp. 2724--2732.
[10]
S. Ioannidis and P. Marbach, "On the design of hybrid peer-to-peer systems," in Proc. ACM SIGMETRICS, Annapolis, MD, USA, Jun. 2008, pp. 157--168.
[11]
E. Adar and B. A. Huberman, "Free riding on Gnutella," First Monday, vol. 5, no. 10, 2000.
[12]
D. Huges, G. Coulson, and J. Walkerdine, "Free riding on Gnutella revisted: The bell tolls?," IEEE Distrib. Syst. Online, vol. 6, no. 6, 2005.
[13]
M. R. Rahman, "A survey of incentive mechanism in peer-to-peer systems," 2009 {Online}. Available: http://www.cs.uwaterloo.ca/research/tr/2009/CS-2009-22.pdf
[14]
C. Li, B. Yu, and K. Sycara, "An incentive mechanism for message relaying in unstructured peer-to-peer systems," in Proc. AAMAS, 2007, pp. 271--278.
[15]
J. Kleinberg and P. Raghavan, "Query incentive networks," in Proc. ACM FOCS, 2005, pp. 132--141.
[16]
M. Feldman, K. Lai, I. Stoica, and J. Chuang, "Robust incentive techniques for peer-to-peer networks," in Proc. ACM Conf. Electron. Commerce, 2004, pp. 102--111.
[17]
R. Wolff, Stochastic Modeling and the Theory of Queues. Englewood Cliffs, NJ, USA: Prentice-Hall, 1989.
[18]
S. Hoory, N. Linial, and A. Wigderson, "Expander graphs and their applications," Bull. AMS, vol. 43, no. 4, pp. 439--561, 2006.
[19]
C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in Proc. IEEE INFOCOM, 2004, pp. 120--130.
[20]
P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge, "Incentives for sharing in peer-to-peer networks," in Proc. 2nd Int. Workshop Electron. Commerce, 2001, pp. 75--87.
[21]
S. Marti and H. Garica-Molina, "Taxonomy of trust: Categorizing P2P reputation systems," Comput. Netw., vol. 50, no. 4, pp. 472--484, 2006.
[22]
S. Félegyházi, J. Hubaux, and L. Buttyán, "Nash equilibria of packet forwarding strategies in wireless ad hoc network," IEEE Trans. Mobile Comput., vol. 5, no. 5, pp. 463--476, May 2006.
[23]
V. Srinavasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, "Cooperation in wireless ad hoc networks," in Proc. IEEE INFOCOM, 2003, pp. 808--817.
[24]
L. Buttyan and J. P. Hubaux, "Stimulating cooperation in self-organizing mobile ad hoc networks," Mobile Netw. Appl., vol. 8, no. 5, pp. 579--592, 2003.
[25]
B. Yang, T. Condie, S. Kamvar, and H. Garcia-Molina, "Non-cooperation in competitive P2P networks," in Proc. IEEE ICDCS, 2005, pp. 91--100.
[26]
S. Ioannidis, "Scalable and reliable searching in unstructured peer-to-peer systems," Ph.D. dissertation, University of Toronto, Toronto, ON, Canada, 2009.
[27]
C. Law and K.-Y. Su, "Distributed construction of random expander networks," in Proc. IEEE INFOCOM, 2003, pp. 2133--2143.
[28]
D. B. West, Introduction to Graph Theory. Upper Saddle River, NJ, USA: Prentice-Hall, 2000.

Cited By

View all
  • (2022)Design and Implementation of Software Engineering Network Teaching System Based on CS ModeSecurity and Communication Networks10.1155/2022/74369882022Online publication date: 1-Jan-2022
  • (2019)An evaluation of reputation with regard to the opportunistic forwarding of messages in VANETsEURASIP Journal on Wireless Communications and Networking10.1186/s13638-019-1518-x2019:1(1-14)Online publication date: 1-Dec-2019

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 23, Issue 6
December 2015
306 pages
ISSN:1063-6692
  • Editor:
  • R. Srikant
Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 December 2015
Published in TON Volume 23, Issue 6

Author Tags

  1. hybrid
  2. incentive mechanism
  3. peer-to-peer
  4. scalability
  5. selfish behaviors

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Design and Implementation of Software Engineering Network Teaching System Based on CS ModeSecurity and Communication Networks10.1155/2022/74369882022Online publication date: 1-Jan-2022
  • (2019)An evaluation of reputation with regard to the opportunistic forwarding of messages in VANETsEURASIP Journal on Wireless Communications and Networking10.1186/s13638-019-1518-x2019:1(1-14)Online publication date: 1-Dec-2019

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media