Diurnal availability for peer-to-peer systems
Ensuring content availability in a persistent manner is essential for providing any consistent service over peer-to-peer (P2P) systems. This paper introduces an efficient protocol, called DATA, to design highly available P2P systems irrespective of peer uptime and churn. Our approach utilizes the di...
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 | 623 |
---|---|
container_issue | |
container_start_page | 619 |
container_title | |
container_volume | |
creator | Shahriar, N. Sharmin, M. Ahmed, R. Rahman, M. M. Boutaba, R. Mathieu, B. |
description | Ensuring content availability in a persistent manner is essential for providing any consistent service over peer-to-peer (P2P) systems. This paper introduces an efficient protocol, called DATA, to design highly available P2P systems irrespective of peer uptime and churn. Our approach utilizes the diurnal pattern of globally dispersed peers to develop a grouping strategy where each group aims to ensure 24 × 7 data availability within the group. Simulation results reveal that our protocol converges fast and ensures high availability for each group with minimal overhead. |
doi_str_mv | 10.1109/CCNC.2012.6181140 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6181140</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6181140</ieee_id><sourcerecordid>6181140</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a883a08ff9ef57d124ab37eefc05bee83fc52d602187dd032ed1119ade3bb2323</originalsourceid><addsrcrecordid>eNo1j81Kw0AURkdUsNY8gLjJC0y8P5nOZCnRqlB0o-CuTDp3YCS1JROFvL2K9WwOZ_PBp9QlQoUIzXXbPrUVAVK1QIdYw5E6x9pYS2Dx7VgVjXX_DXyiZsSMunGGzlSR8zv8YIFcbWdK36bP4cP3pf_yqfdd6tM4lXE3lHuRQY87_esyT3mUbb5Qp9H3WYqD5-p1effSPujV8_1je7PSCa0ZtXeOPbgYG4nGBqTad2xF4gZMJ-I4bgyFBRA6GwIwSUDExgfhriMmnqurv90kIuv9kLZ-mNaHt_wNvMFF-A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Diurnal availability for peer-to-peer systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Shahriar, N. ; Sharmin, M. ; Ahmed, R. ; Rahman, M. M. ; Boutaba, R. ; Mathieu, B.</creator><creatorcontrib>Shahriar, N. ; Sharmin, M. ; Ahmed, R. ; Rahman, M. M. ; Boutaba, R. ; Mathieu, B.</creatorcontrib><description>Ensuring content availability in a persistent manner is essential for providing any consistent service over peer-to-peer (P2P) systems. This paper introduces an efficient protocol, called DATA, to design highly available P2P systems irrespective of peer uptime and churn. Our approach utilizes the diurnal pattern of globally dispersed peers to develop a grouping strategy where each group aims to ensure 24 × 7 data availability within the group. Simulation results reveal that our protocol converges fast and ensures high availability for each group with minimal overhead.</description><identifier>ISSN: 2331-9852</identifier><identifier>ISBN: 9781457720703</identifier><identifier>ISBN: 1457720701</identifier><identifier>EISBN: 145772071X</identifier><identifier>EISBN: 9781457720710</identifier><identifier>EISBN: 9781457720697</identifier><identifier>EISBN: 1457720698</identifier><identifier>DOI: 10.1109/CCNC.2012.6181140</identifier><language>eng</language><publisher>IEEE</publisher><subject>Availability ; Equations ; Internet ; Peer to peer computing ; Protocols ; Redundancy ; Vectors</subject><ispartof>2012 IEEE Consumer Communications and Networking Conference (CCNC), 2012, p.619-623</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/6181140$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6181140$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Shahriar, N.</creatorcontrib><creatorcontrib>Sharmin, M.</creatorcontrib><creatorcontrib>Ahmed, R.</creatorcontrib><creatorcontrib>Rahman, M. M.</creatorcontrib><creatorcontrib>Boutaba, R.</creatorcontrib><creatorcontrib>Mathieu, B.</creatorcontrib><title>Diurnal availability for peer-to-peer systems</title><title>2012 IEEE Consumer Communications and Networking Conference (CCNC)</title><addtitle>CCNC</addtitle><description>Ensuring content availability in a persistent manner is essential for providing any consistent service over peer-to-peer (P2P) systems. This paper introduces an efficient protocol, called DATA, to design highly available P2P systems irrespective of peer uptime and churn. Our approach utilizes the diurnal pattern of globally dispersed peers to develop a grouping strategy where each group aims to ensure 24 × 7 data availability within the group. Simulation results reveal that our protocol converges fast and ensures high availability for each group with minimal overhead.</description><subject>Availability</subject><subject>Equations</subject><subject>Internet</subject><subject>Peer to peer computing</subject><subject>Protocols</subject><subject>Redundancy</subject><subject>Vectors</subject><issn>2331-9852</issn><isbn>9781457720703</isbn><isbn>1457720701</isbn><isbn>145772071X</isbn><isbn>9781457720710</isbn><isbn>9781457720697</isbn><isbn>1457720698</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j81Kw0AURkdUsNY8gLjJC0y8P5nOZCnRqlB0o-CuTDp3YCS1JROFvL2K9WwOZ_PBp9QlQoUIzXXbPrUVAVK1QIdYw5E6x9pYS2Dx7VgVjXX_DXyiZsSMunGGzlSR8zv8YIFcbWdK36bP4cP3pf_yqfdd6tM4lXE3lHuRQY87_esyT3mUbb5Qp9H3WYqD5-p1effSPujV8_1je7PSCa0ZtXeOPbgYG4nGBqTad2xF4gZMJ-I4bgyFBRA6GwIwSUDExgfhriMmnqurv90kIuv9kLZ-mNaHt_wNvMFF-A</recordid><startdate>201201</startdate><enddate>201201</enddate><creator>Shahriar, N.</creator><creator>Sharmin, M.</creator><creator>Ahmed, R.</creator><creator>Rahman, M. M.</creator><creator>Boutaba, R.</creator><creator>Mathieu, B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201201</creationdate><title>Diurnal availability for peer-to-peer systems</title><author>Shahriar, N. ; Sharmin, M. ; Ahmed, R. ; Rahman, M. M. ; Boutaba, R. ; Mathieu, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a883a08ff9ef57d124ab37eefc05bee83fc52d602187dd032ed1119ade3bb2323</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Availability</topic><topic>Equations</topic><topic>Internet</topic><topic>Peer to peer computing</topic><topic>Protocols</topic><topic>Redundancy</topic><topic>Vectors</topic><toplevel>online_resources</toplevel><creatorcontrib>Shahriar, N.</creatorcontrib><creatorcontrib>Sharmin, M.</creatorcontrib><creatorcontrib>Ahmed, R.</creatorcontrib><creatorcontrib>Rahman, M. M.</creatorcontrib><creatorcontrib>Boutaba, R.</creatorcontrib><creatorcontrib>Mathieu, B.</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>Shahriar, N.</au><au>Sharmin, M.</au><au>Ahmed, R.</au><au>Rahman, M. M.</au><au>Boutaba, R.</au><au>Mathieu, B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Diurnal availability for peer-to-peer systems</atitle><btitle>2012 IEEE Consumer Communications and Networking Conference (CCNC)</btitle><stitle>CCNC</stitle><date>2012-01</date><risdate>2012</risdate><spage>619</spage><epage>623</epage><pages>619-623</pages><issn>2331-9852</issn><isbn>9781457720703</isbn><isbn>1457720701</isbn><eisbn>145772071X</eisbn><eisbn>9781457720710</eisbn><eisbn>9781457720697</eisbn><eisbn>1457720698</eisbn><abstract>Ensuring content availability in a persistent manner is essential for providing any consistent service over peer-to-peer (P2P) systems. This paper introduces an efficient protocol, called DATA, to design highly available P2P systems irrespective of peer uptime and churn. Our approach utilizes the diurnal pattern of globally dispersed peers to develop a grouping strategy where each group aims to ensure 24 × 7 data availability within the group. Simulation results reveal that our protocol converges fast and ensures high availability for each group with minimal overhead.</abstract><pub>IEEE</pub><doi>10.1109/CCNC.2012.6181140</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2331-9852 |
ispartof | 2012 IEEE Consumer Communications and Networking Conference (CCNC), 2012, p.619-623 |
issn | 2331-9852 |
language | eng |
recordid | cdi_ieee_primary_6181140 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Availability Equations Internet Peer to peer computing Protocols Redundancy Vectors |
title | Diurnal availability for peer-to-peer 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-06T02%3A32%3A33IST&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=Diurnal%20availability%20for%20peer-to-peer%20systems&rft.btitle=2012%20IEEE%20Consumer%20Communications%20and%20Networking%20Conference%20(CCNC)&rft.au=Shahriar,%20N.&rft.date=2012-01&rft.spage=619&rft.epage=623&rft.pages=619-623&rft.issn=2331-9852&rft.isbn=9781457720703&rft.isbn_list=1457720701&rft_id=info:doi/10.1109/CCNC.2012.6181140&rft_dat=%3Cieee_6IE%3E6181140%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=145772071X&rft.eisbn_list=9781457720710&rft.eisbn_list=9781457720697&rft.eisbn_list=1457720698&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6181140&rfr_iscdi=true |