skip to main content
short-paper

Powering down for energy efficient peer-to-peer file distribution

Published:21 December 2011Publication History
Skip Abstract Section

Abstract

Peer to peer (P2P) techniques can reduce the time for file distribution, yet require peers to stay ON to assist others download. We study the total time that peers need to be ON to distribute a file from a server to a set of peers. We show that a P2P system optimized for energy effciency can consume half the energy of one optimized to minimize download time, with minimal additional delay. To achieve this, peers finish in increasing order of upload capacity and behave selfishly, turning off as soon as they finish downloading. We show that the optimal solution is complex, even for as few as three peers, and advocate heuristics for large networks.

References

  1. Y. Agarwal, S. Hodges, R. Chandra, J. Scott, P. Bahl, and R. Gupta. Somniloquy: Augmenting network interfaces to reduce PC energy usage. In Proc. Usenix NSDI, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Australian Computer Society. Carbon and Computers in Australia. 2010.Google ScholarGoogle Scholar
  3. J. Blackburn and K. Christensen. A simulation study of a new green bittorrent. In ICC Workshops, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  4. C. Chang, T. Ho, M. Effros, M. Medard, and B. Leong. Issues in peer-to-peer networking: A coding optimization approach. In IEEE Int. Symp. Network Coding (NetCod), pages 1--6, June 2010.Google ScholarGoogle ScholarCross RefCross Ref
  5. G. Ezovski, A. Tang, and L. L. H. Andrew. Minimizing average finish time in P2P networks. In Proc. IEEE INFOCOM, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Kumar and K. Ross. Peer-assisted file distribution: The minimum distribution time. In Proc. IEEE HotWeb, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  7. M. Lingjun and K.-S. Lui. Scheduling in P2P file distribution { on reducing the average distribution time. In IEEE Consumer Commun. Netw. Conf. (CCNC), pages 521--522, Jan. 2008.Google ScholarGoogle Scholar
  8. M. Lingjun, P.-S. Tsang, and K.-S. Lui. Improving file distribution performance by grouping in peer-to-peer networks. IEEE Trans. Netw. Serv. Manag., 6(3):149--162, Sept. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Mehyar. Distributed Averaging and Effcient File Sharing on Peer-to-Peer Networks. PhD thesis, California Institute of Technology, 2006.Google ScholarGoogle Scholar
  10. M. Mehyar, G. WeiHsin, S. H. Low, M. Effros, and T. Ho. Optimal strategies for effcient peer-to-peer file sharing. In Proc. IEEE ICASSP, 2007.Google ScholarGoogle Scholar
  11. J. Mundinger, R. Weber, and G. Weiss. Optimal scheduling of peer-to-peer file dissemination. J. Scheduling, 11:105--120, April 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Prajna, Papachristodoulou, and P. A. Parrilo. Introducing SOSTOOLS: a general purpose sum of squares programming solver. In Proc. CDC, 2001.Google ScholarGoogle Scholar
  13. A. Sucevic, L. L. H. Andrew, and T. T. T. Nguyen. Minimising peer on-time for energy effcient peer-to-peer file distribution. Online. Available: http://www.caia.swin.edu.au/cv/landrew/pubs/MinOnTime.pdf.Google ScholarGoogle Scholar
  14. P.-S. Tsang, X. Meng, and K.-S. Lui. A novel grouping strategy for reducing average distribution time in P2P file sharing. In IEEE Int. Conf. Commun (ICC), pages 1--5, May 2010.Google ScholarGoogle ScholarCross RefCross Ref
  15. Y. Wu, Y. C. Hu, J. Li, and P. A. Chou. The delay region for P2P file transfer. In Proc. Int. Symp. Info. Th. (ISIT), pages 834--838, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 39, Issue 3
    December 2011
    163 pages
    ISSN:0163-5999
    DOI:10.1145/2160803
    Issue’s Table of Contents

    Copyright © 2011 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 21 December 2011

    Check for updates

    Qualifiers

    • short-paper

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader