General Information
    • ISSN: 1793-8201 (Print), 2972-4511 (Online)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta, Assoc. Prof. Engin Maşazade
    • Managing Editor: Ms. Mia Hu
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • Average Days from Submission to Acceptance: 192 days
    • E-mail:
    • Journal Metrics:
    • SCImago Journal & Country Rank
Prof. Mehmet Sahinoglu
Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2012 Vol.5(2): 383-387 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2013.V5.714

Context-Aware Replica Placement in Peer-to-Peer Overlay Networks

Mohammad H. Al Shayeji, M. D. Samrajesh, Saud Abdulaziz Al-Behairy, and Khalid Assaf Al-Enazi

Abstract—The high demand for rich on-line media content such as Video-On-Demand (VOD) has lead to a rapid increase in internet congestion. Today peer-to-peer overlay networks play a key role in content delivery. Replication in P2P networks can significantly reduce congestion and minimize access time. However, the challenge is to decide on which content to replicate, where to place replicas, which replica to replace and which replica is to be designated as the primary copy. The current distribution and delivery of content can be improved by making replica content placements, replacement and management context aware. In this paper we propose a context-aware replica placement algorithm that reduces access time by placing multiple copies of content at various strategic locations using a number of context-aware parameters; we also present a replica replacement algorithm considering the size of the content as well as other important factors. Moreover, we propose a primary copy assignment algorithm that minimizes the content update overhead by choosing the right replica as the primary copy. Our discussions and comparative study with other algorithms shows that the proposed algorithm is effective.

Index Terms—Access latency, overlay networks, peer-to-peer (P2P), replica placement.

The authors are with the Computer Engineering Department, Kuwait University, Kuwait (e-mail:,


Cite: Mohammad H. Al Shayeji, M. D. Samrajesh, Saud Abdulaziz Al-Behairy, and Khalid Assaf Al-Enazi, "Context-Aware Replica Placement in Peer-to-Peer Overlay Networks," International Journal of Computer Theory and Engineering vol. 5, no. 2, pp. 383-387, 2013.

Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.