Cost effective file replication in P2P file sharing systems
The peer-to-peer file sharing systems is the sharing of files without the interference of the central server. The sharing of files is in need of file replication due to the increase of hot spots. For example, if many clients request the same file to the server at a time, then the server gets overloa...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 952 |
---|---|
container_issue | |
container_start_page | 948 |
container_title | |
container_volume | |
creator | Jeyasheeli, P. Golda Rajashree, L. |
description | The peer-to-peer file sharing systems is the sharing of files without the interference of the central server. The sharing of files is in need of file replication due to the increase of hot spots. For example, if many clients request the same file to the server at a time, then the server gets overloaded and cannot respond to all the clients. In this situation file replication is needed to get the response with less delay. Current file replication methods replicate files in all nodes or any two end points which in turn results in underutilized replicas. Though file replication takes place in server side, client side and query path solve some problems in current methods but it has high cost of overhead due to more replicas and underutilized replicas. This paper presents an efficient file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. This can be achieved by selecting hot spots, frequent requesters as replica nodes, dynamically adapting to non uniform and time varying file popularity. Simulation results demonstrate the efficiency and effectiveness of this algorithm in comparison with other approaches. |
doi_str_mv | 10.1109/ICCEET.2012.6203898 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6203898</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6203898</ieee_id><sourcerecordid>6203898</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-55441c787937ff23b9657748a790337b6b024bce874ba5c64a546051802d59b3</originalsourceid><addsrcrecordid>eNo1j81KAzEUhSMiqHWeoJu8wNSb35vgSoZRCwULdl-S8UYj02mZDELfXqHt2Ry-s_jgMDYXsBAC_OOyadp2s5Ag5MJKUM67K3YvtEUFUki4ZpVHd2EhbllVyg_8B0E6DXfsqdmXiVNK1E35l3jKPfGRDn3uwpT3A88DX8v1aS_fYczDFy_HMtGuPLCbFPpC1bln7OOl3TRv9er9ddk8r-rsYaqN0Vp06NArTEmq6K1B1C6gB6Uw2ghSx44c6hhMZ3Uw2oIRDuSn8VHN2PxkzUS0PYx5F8bj9vxW_QFRbkar</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Cost effective file replication in P2P file sharing systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jeyasheeli, P. Golda ; Rajashree, L.</creator><creatorcontrib>Jeyasheeli, P. Golda ; Rajashree, L.</creatorcontrib><description>The peer-to-peer file sharing systems is the sharing of files without the interference of the central server. The sharing of files is in need of file replication due to the increase of hot spots. For example, if many clients request the same file to the server at a time, then the server gets overloaded and cannot respond to all the clients. In this situation file replication is needed to get the response with less delay. Current file replication methods replicate files in all nodes or any two end points which in turn results in underutilized replicas. Though file replication takes place in server side, client side and query path solve some problems in current methods but it has high cost of overhead due to more replicas and underutilized replicas. This paper presents an efficient file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. This can be achieved by selecting hot spots, frequent requesters as replica nodes, dynamically adapting to non uniform and time varying file popularity. Simulation results demonstrate the efficiency and effectiveness of this algorithm in comparison with other approaches.</description><identifier>ISBN: 9781467302111</identifier><identifier>ISBN: 1467302112</identifier><identifier>EISBN: 1467302120</identifier><identifier>EISBN: 9781467302104</identifier><identifier>EISBN: 1467302104</identifier><identifier>EISBN: 9781467302128</identifier><identifier>DOI: 10.1109/ICCEET.2012.6203898</identifier><language>eng</language><publisher>IEEE</publisher><subject>distributed hash table ; file replication ; file sharing ; Maintenance engineering ; Peer to peer computing ; peer to peer systems ; Servers</subject><ispartof>2012 International Conference on Computing, Electronics and Electrical Technologies (ICCEET), 2012, p.948-952</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6203898$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6203898$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jeyasheeli, P. Golda</creatorcontrib><creatorcontrib>Rajashree, L.</creatorcontrib><title>Cost effective file replication in P2P file sharing systems</title><title>2012 International Conference on Computing, Electronics and Electrical Technologies (ICCEET)</title><addtitle>ICCEET</addtitle><description>The peer-to-peer file sharing systems is the sharing of files without the interference of the central server. The sharing of files is in need of file replication due to the increase of hot spots. For example, if many clients request the same file to the server at a time, then the server gets overloaded and cannot respond to all the clients. In this situation file replication is needed to get the response with less delay. Current file replication methods replicate files in all nodes or any two end points which in turn results in underutilized replicas. Though file replication takes place in server side, client side and query path solve some problems in current methods but it has high cost of overhead due to more replicas and underutilized replicas. This paper presents an efficient file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. This can be achieved by selecting hot spots, frequent requesters as replica nodes, dynamically adapting to non uniform and time varying file popularity. Simulation results demonstrate the efficiency and effectiveness of this algorithm in comparison with other approaches.</description><subject>distributed hash table</subject><subject>file replication</subject><subject>file sharing</subject><subject>Maintenance engineering</subject><subject>Peer to peer computing</subject><subject>peer to peer systems</subject><subject>Servers</subject><isbn>9781467302111</isbn><isbn>1467302112</isbn><isbn>1467302120</isbn><isbn>9781467302104</isbn><isbn>1467302104</isbn><isbn>9781467302128</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j81KAzEUhSMiqHWeoJu8wNSb35vgSoZRCwULdl-S8UYj02mZDELfXqHt2Ry-s_jgMDYXsBAC_OOyadp2s5Ag5MJKUM67K3YvtEUFUki4ZpVHd2EhbllVyg_8B0E6DXfsqdmXiVNK1E35l3jKPfGRDn3uwpT3A88DX8v1aS_fYczDFy_HMtGuPLCbFPpC1bln7OOl3TRv9er9ddk8r-rsYaqN0Vp06NArTEmq6K1B1C6gB6Uw2ghSx44c6hhMZ3Uw2oIRDuSn8VHN2PxkzUS0PYx5F8bj9vxW_QFRbkar</recordid><startdate>201203</startdate><enddate>201203</enddate><creator>Jeyasheeli, P. Golda</creator><creator>Rajashree, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201203</creationdate><title>Cost effective file replication in P2P file sharing systems</title><author>Jeyasheeli, P. Golda ; Rajashree, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-55441c787937ff23b9657748a790337b6b024bce874ba5c64a546051802d59b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>distributed hash table</topic><topic>file replication</topic><topic>file sharing</topic><topic>Maintenance engineering</topic><topic>Peer to peer computing</topic><topic>peer to peer systems</topic><topic>Servers</topic><toplevel>online_resources</toplevel><creatorcontrib>Jeyasheeli, P. Golda</creatorcontrib><creatorcontrib>Rajashree, L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jeyasheeli, P. Golda</au><au>Rajashree, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Cost effective file replication in P2P file sharing systems</atitle><btitle>2012 International Conference on Computing, Electronics and Electrical Technologies (ICCEET)</btitle><stitle>ICCEET</stitle><date>2012-03</date><risdate>2012</risdate><spage>948</spage><epage>952</epage><pages>948-952</pages><isbn>9781467302111</isbn><isbn>1467302112</isbn><eisbn>1467302120</eisbn><eisbn>9781467302104</eisbn><eisbn>1467302104</eisbn><eisbn>9781467302128</eisbn><abstract>The peer-to-peer file sharing systems is the sharing of files without the interference of the central server. The sharing of files is in need of file replication due to the increase of hot spots. For example, if many clients request the same file to the server at a time, then the server gets overloaded and cannot respond to all the clients. In this situation file replication is needed to get the response with less delay. Current file replication methods replicate files in all nodes or any two end points which in turn results in underutilized replicas. Though file replication takes place in server side, client side and query path solve some problems in current methods but it has high cost of overhead due to more replicas and underutilized replicas. This paper presents an efficient file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. This can be achieved by selecting hot spots, frequent requesters as replica nodes, dynamically adapting to non uniform and time varying file popularity. Simulation results demonstrate the efficiency and effectiveness of this algorithm in comparison with other approaches.</abstract><pub>IEEE</pub><doi>10.1109/ICCEET.2012.6203898</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9781467302111 |
ispartof | 2012 International Conference on Computing, Electronics and Electrical Technologies (ICCEET), 2012, p.948-952 |
issn | |
language | eng |
recordid | cdi_ieee_primary_6203898 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | distributed hash table file replication file sharing Maintenance engineering Peer to peer computing peer to peer systems Servers |
title | Cost effective file replication in P2P file sharing systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T13%3A41%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Cost%20effective%20file%20replication%20in%20P2P%20file%20sharing%20systems&rft.btitle=2012%20International%20Conference%20on%20Computing,%20Electronics%20and%20Electrical%20Technologies%20(ICCEET)&rft.au=Jeyasheeli,%20P.%20Golda&rft.date=2012-03&rft.spage=948&rft.epage=952&rft.pages=948-952&rft.isbn=9781467302111&rft.isbn_list=1467302112&rft_id=info:doi/10.1109/ICCEET.2012.6203898&rft_dat=%3Cieee_6IE%3E6203898%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1467302120&rft.eisbn_list=9781467302104&rft.eisbn_list=1467302104&rft.eisbn_list=9781467302128&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6203898&rfr_iscdi=true |