Context-Aware Replica Placement in Peer-to-Peer Overlay Networks
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...
Gespeichert in:
Veröffentlicht in: | International Journal of Computer Theory and Engineering 2013-04, Vol.5 (2), p.383-387 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 387 |
---|---|
container_issue | 2 |
container_start_page | 383 |
container_title | International Journal of Computer Theory and Engineering |
container_volume | 5 |
creator | Shayeji, Mohammad H. Al Samrajesh, M. D. Al-Behairy, Saud Abdulaziz Al-Enazi, Khalid Assaf |
description | 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. |
doi_str_mv | 10.7763/IJCTE.2013.V5.714 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1440371950</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3093944541</sourcerecordid><originalsourceid>FETCH-LOGICAL-c700-9cab940a0416adc7f9478b46ba82216aee5671bbf93885cef97f7eb4c1bec27b3</originalsourceid><addsrcrecordid>eNotkMFLwzAYxXNQcMz9Ad4KnlPzNWnT3Bxl6mS4IWXXkMSvUO3amXTO_fdrnacHj8d7jx8hd8BiKTP-sHwtykWcMODxNo0liCsyAak4zQfvhsxCqC0DlqkEsmRCHouu7fG3p_Oj8Ri9476pnYk2jXG4w7aP6jbaIHrad3TUaP2DvjGn6A37Y-e_wi25rkwTcPavU1I-Lcriha7Wz8tivqJOMkaVM1YJZpiAzHw4WSkhcysya_JkOGIQ00yCtZXieZ46rJSsJFrhwKJLpOVTcn-p3fvu-4Ch15_dwbfDogYhGJegUjak4JJyvgvBY6X3vt4Zf9LA9IhH_-HRIx69TfWAh58BlUpaGQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1440371950</pqid></control><display><type>article</type><title>Context-Aware Replica Placement in Peer-to-Peer Overlay Networks</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Shayeji, Mohammad H. Al ; Samrajesh, M. D. ; Al-Behairy, Saud Abdulaziz ; Al-Enazi, Khalid Assaf</creator><creatorcontrib>Shayeji, Mohammad H. Al ; Samrajesh, M. D. ; Al-Behairy, Saud Abdulaziz ; Al-Enazi, Khalid Assaf</creatorcontrib><description>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.</description><identifier>ISSN: 1793-8201</identifier><identifier>DOI: 10.7763/IJCTE.2013.V5.714</identifier><language>eng</language><publisher>Singapore: IACSIT Press</publisher><ispartof>International Journal of Computer Theory and Engineering, 2013-04, Vol.5 (2), p.383-387</ispartof><rights>Copyright IACSIT Press Apr 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c700-9cab940a0416adc7f9478b46ba82216aee5671bbf93885cef97f7eb4c1bec27b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27929,27930</link.rule.ids></links><search><creatorcontrib>Shayeji, Mohammad H. Al</creatorcontrib><creatorcontrib>Samrajesh, M. D.</creatorcontrib><creatorcontrib>Al-Behairy, Saud Abdulaziz</creatorcontrib><creatorcontrib>Al-Enazi, Khalid Assaf</creatorcontrib><title>Context-Aware Replica Placement in Peer-to-Peer Overlay Networks</title><title>International Journal of Computer Theory and Engineering</title><description>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.</description><issn>1793-8201</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNotkMFLwzAYxXNQcMz9Ad4KnlPzNWnT3Bxl6mS4IWXXkMSvUO3amXTO_fdrnacHj8d7jx8hd8BiKTP-sHwtykWcMODxNo0liCsyAak4zQfvhsxCqC0DlqkEsmRCHouu7fG3p_Oj8Ri9476pnYk2jXG4w7aP6jbaIHrad3TUaP2DvjGn6A37Y-e_wi25rkwTcPavU1I-Lcriha7Wz8tivqJOMkaVM1YJZpiAzHw4WSkhcysya_JkOGIQ00yCtZXieZ46rJSsJFrhwKJLpOVTcn-p3fvu-4Ch15_dwbfDogYhGJegUjak4JJyvgvBY6X3vt4Zf9LA9IhH_-HRIx69TfWAh58BlUpaGQ</recordid><startdate>20130401</startdate><enddate>20130401</enddate><creator>Shayeji, Mohammad H. Al</creator><creator>Samrajesh, M. D.</creator><creator>Al-Behairy, Saud Abdulaziz</creator><creator>Al-Enazi, Khalid Assaf</creator><general>IACSIT Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130401</creationdate><title>Context-Aware Replica Placement in Peer-to-Peer Overlay Networks</title><author>Shayeji, Mohammad H. Al ; Samrajesh, M. D. ; Al-Behairy, Saud Abdulaziz ; Al-Enazi, Khalid Assaf</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c700-9cab940a0416adc7f9478b46ba82216aee5671bbf93885cef97f7eb4c1bec27b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shayeji, Mohammad H. Al</creatorcontrib><creatorcontrib>Samrajesh, M. D.</creatorcontrib><creatorcontrib>Al-Behairy, Saud Abdulaziz</creatorcontrib><creatorcontrib>Al-Enazi, Khalid Assaf</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International Journal of Computer Theory and Engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shayeji, Mohammad H. Al</au><au>Samrajesh, M. D.</au><au>Al-Behairy, Saud Abdulaziz</au><au>Al-Enazi, Khalid Assaf</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Context-Aware Replica Placement in Peer-to-Peer Overlay Networks</atitle><jtitle>International Journal of Computer Theory and Engineering</jtitle><date>2013-04-01</date><risdate>2013</risdate><volume>5</volume><issue>2</issue><spage>383</spage><epage>387</epage><pages>383-387</pages><issn>1793-8201</issn><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.</abstract><cop>Singapore</cop><pub>IACSIT Press</pub><doi>10.7763/IJCTE.2013.V5.714</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1793-8201 |
ispartof | International Journal of Computer Theory and Engineering, 2013-04, Vol.5 (2), p.383-387 |
issn | 1793-8201 |
language | eng |
recordid | cdi_proquest_journals_1440371950 |
source | EZB-FREE-00999 freely available EZB journals |
title | Context-Aware Replica Placement in Peer-to-Peer Overlay Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-11T16%3A26%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Context-Aware%20Replica%20Placement%20in%20Peer-to-Peer%20Overlay%20Networks&rft.jtitle=International%20Journal%20of%20Computer%20Theory%20and%20Engineering&rft.au=Shayeji,%20Mohammad%20H.%20Al&rft.date=2013-04-01&rft.volume=5&rft.issue=2&rft.spage=383&rft.epage=387&rft.pages=383-387&rft.issn=1793-8201&rft_id=info:doi/10.7763/IJCTE.2013.V5.714&rft_dat=%3Cproquest_cross%3E3093944541%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1440371950&rft_id=info:pmid/&rfr_iscdi=true |