Skip to main content

An Improved Cooperative Model of P2P and ISP

  • Conference paper
  • 971 Accesses

Part of the Communications in Computer and Information Science book series (CCIS,volume 401)

Abstract

P4P (Provider Portal for Applications) is a model aiming to incorporate P2P with ISP and improve the performance of both the ISP and the P2P applications. In this study, we analyze the relationship between the link traffic and the P-distance, which is the core interface of P4P, and illustrate the disadvantage of P4P in dealing with network topology with bottleneck links. Further, with link utility function as the optimization objective, we propose an improved model–Improved-P4P, making the traffic produced by P2P applications more homogeneous, which can reduce the peak link utilization and protect bottleneck links, and then improve both the network efficiency and the P2P performance. We have built a simulation platform based on BitTorrent and conducted extensive simulations. These simulations demonstrate that Improved-P4P achieves a lower cost for ISPs and a better performance for P2P applications than native P2P. Moreover, compared with P4P, Improved-P4P reduces traffic on bottleneck links without compromising on the performance of the P2P applications. We believe that relieving of pressure on bottleneck links hold great significance especially in extreme settings. Improved-P4P performs steadily in different swarm sizes, proving that it is scalable and easy to deploy.

Keywords

  • Subgradient Method
  • P2P
  • Traffic Engineering
  • Cooperative Model
  • Dual Function

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-53959-6_9
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-53959-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karagiannis, T., Broido, A., Brownlee, A., Claffy, K.C., Faloutsos, M.: Is P2P dying or just hiding. In: Global Telecommunications Conference, pp. 1532–1538. IEEE Press, New York (2004)

    Google Scholar 

  2. Steinmetz, R., Wehrle, K. (eds.): Peer-to-Peer Systems and Applications. LNCS, vol. 3485. Springer, Heidelberg (2005)

    Google Scholar 

  3. Keralapura, R., Taft, N., Chuah, C., Iannaccone, G.: Can ISPs take the heat from overlay networks. In: Proceedings of HotNets III, pp. 8–15 (2004)

    Google Scholar 

  4. Aggarwal, V., Feldmann, A., Scheideler, C.: Can ISPs and P2P users cooperate for improved performance. In: ACM SIGCOMM Computer Communication Review, pp. 31–40. ACM Press, New York (2007)

    Google Scholar 

  5. Aggarwal, V., Bender, S., Feldmann, A., Wichmann, A.: Methodology for estimating network distances of gnutella neighbors. In: Proceedings of the Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications, pp. 219–223 (2004)

    Google Scholar 

  6. Xie, H., Yang, Y.R., Krishnamurthy, A., Liu, Y.G.: P4P: Provider portal for applications. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 351–362. ACM Press, New York (2008)

    CrossRef  Google Scholar 

  7. Jiang, W., Zhang, R., Rexford, J., Chiang, M.: Cooperative content distribution and traffic engineering in an ISP network. In: Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, pp. 239–250. ACM Press, New York (2009)

    Google Scholar 

  8. Karagiannis, T., Rodriguez, P., Papagiannaki, K.: Should internet service providers fear peer-assisted content distribution. In: Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement, pp. 63–76. ACM Press, New York (2005)

    Google Scholar 

  9. Seetharaman, S., Ammar, M.: Characterizing and mitigating inter-domain policy violations in overlay routes. In: Proceedings of the 2006 14th IEEE International Conference, pp. 259–268. IEEE Press, New York (2006)

    Google Scholar 

  10. Palomar, D.P., Chiang, M.: Alternative distributed algorithms for network utility maximization: Framework and applications. IEEE Transactions on Automatic Control 52(12), 2254–2269 (2007)

    CrossRef  MathSciNet  Google Scholar 

  11. Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8, 556–567 (2000)

    CrossRef  Google Scholar 

  12. Bharambe, A.R., Herley, C., Padmanabhan, V.: Analyzing and improving a BitTorrent network’s performance mechanisms. In: Proceedings of 25th IEEE International Conference on Computer Communications, pp. 1–12. IEEE Press, New York (2006)

    Google Scholar 

  13. Bindal, R., Cao, P., Chan, W., Medval, J., Suwala, G., Bates, T., Zhang, A.: Improving traffic locality in BitTorrent via biased neighbor selection. In: 26th IEEE International Conference on Distributed Computing Systems. IEEE Press, New York (2006)

    Google Scholar 

  14. PlanetLab, http://www.planet-lab.org/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Zhang, S., Liu, H. (2013). An Improved Cooperative Model of P2P and ISP. In: Su, J., Zhao, B., Sun, Z., Wang, X., Wang, F., Xu, K. (eds) Frontiers in Internet Technologies. Communications in Computer and Information Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53959-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53959-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53958-9

  • Online ISBN: 978-3-642-53959-6

  • eBook Packages: Computer ScienceComputer Science (R0)