Abstract
SummaryAs peer‐to‐peer networks gather and share large sets of computing resources, their aggregate energy consumption is an important problem to be addressed, given the economic and environmental impact of energy production and use. This is particularly true for file sharing peer‐to‐peer networks, considered the vast number of nodes participating to these systems. To address such problem, this paper proposes a peer‐to‐peer file sharing model organized in two logical layers. The lower layer is composed of a set of peers providing the files to be shared. The upper layer includes a set of super peers organized to form a distributed hash table, whose purpose is indexing files and peers, including their availability status. Following a sleep‐and‐wake approach, energy saving is achieved by letting peers cyclically switch between normal and sleep modes, where the time passed in normal mode by a peer depends on the number of files it provides. An energy‐saving algorithm and an associated file search and retrieval strategy are proposed within this model. Simulation results show that more than 50% of energy can be saved using the proposed model and that more than 80% of file downloads start with no additional delay compared with a network in which all peers are always powered on. Copyright © 2014 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.