Peer-to-Peer File Sharing Based on Network Coding

Network coding is a promising enhancement of routing to improve network throughput and provide high reliability. It allows a node to generate output messages by encoding its received messages. Peer-to-peer networks are a perfect place to apply network coding due to two reasons: the topology of a pee...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the International Conference on Distributed Computing Systems s. 168 - 175
Hlavní autoři: Min Yang, Yuanyuan Yang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2008
Témata:
Encoding
file sharing
multicast
Network coding
Network topology
Peer to peer computing
peer-to-peer networks
Receivers
Relays
Servers
Topology
web-based applications
ISSN:1063-6927
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Network coding is a promising enhancement of routing to improve network throughput and provide high reliability. It allows a node to generate output messages by encoding its received messages. Peer-to-peer networks are a perfect place to apply network coding due to two reasons: the topology of a peer-to-peer network is constructed arbitrarily, thus it is easy to tailor the topology to facilitate network coding; the nodes in a peer-to-peer network are end hosts which can perform more complex operations such as decoding and encoding than simply storing and forwarding messages. In this paper, we propose a scheme to apply network coding to peer-to-peer file sharing which employs a peer-to-peer network to distribute files resided in a web server or a file server. The scheme exploits a special type of network topology called combination network. It is proved that combination networks can achieve unbounded network coding gain measured by the ratio of network throughput with network coding to that without network coding. The scheme encodes a file into multiple messages and divides peers into multiple groups with each group responsible for relaying one of the messages. The encoding scheme is designed to satisfy the property that any subset of the messages can be used to decode the original file as long as the size of the subset is sufficiently large. To meet this requirement, we first define a deterministic linear network coding scheme which satisfies the desired property, then we connect peers in the same group to flood the corresponding message, and connect peers in different groups to distribute messages for decoding. Moreover, the scheme can be readily extended to support topology awareness to further improve system performance in terms of throughput, reliability and link stress. Our simulation results show that the new scheme can achieve 15%-20% higher throughput than Narada which does not employ network coding. In addition, it achieves good reliability and robustness to link failure or churn.
AbstractList Network coding is a promising enhancement of routing to improve network throughput and provide high reliability. It allows a node to generate output messages by encoding its received messages. Peer-to-peer networks are a perfect place to apply network coding due to two reasons: the topology of a peer-to-peer network is constructed arbitrarily, thus it is easy to tailor the topology to facilitate network coding; the nodes in a peer-to-peer network are end hosts which can perform more complex operations such as decoding and encoding than simply storing and forwarding messages. In this paper, we propose a scheme to apply network coding to peer-to-peer file sharing which employs a peer-to-peer network to distribute files resided in a web server or a file server. The scheme exploits a special type of network topology called combination network. It is proved that combination networks can achieve unbounded network coding gain measured by the ratio of network throughput with network coding to that without network coding. The scheme encodes a file into multiple messages and divides peers into multiple groups with each group responsible for relaying one of the messages. The encoding scheme is designed to satisfy the property that any subset of the messages can be used to decode the original file as long as the size of the subset is sufficiently large. To meet this requirement, we first define a deterministic linear network coding scheme which satisfies the desired property, then we connect peers in the same group to flood the corresponding message, and connect peers in different groups to distribute messages for decoding. Moreover, the scheme can be readily extended to support topology awareness to further improve system performance in terms of throughput, reliability and link stress. Our simulation results show that the new scheme can achieve 15%-20% higher throughput than Narada which does not employ network coding. In addition, it achieves good reliability and robustness to link failure or churn.
Author Min Yang
Yuanyuan Yang
Author_xml – sequence: 1
  surname: Min Yang
  fullname: Min Yang
  organization: Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY
– sequence: 2
  surname: Yuanyuan Yang
  fullname: Yuanyuan Yang
  organization: Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY
BookMark eNotjE1Lw0AUAFdowbbm6MlL_kDie_v1do8arRaKCtVz2SRvdbEmkhTEf29ETwPDMEsx6_qOhThHKBHBX26qm2pXSgBXGnkiMk8OyHqjkKSeiQWCVYX1kuZiOVXkwUpDpyIbx1QDGqfQSrUQ-MQ8FMe--GW-TgfOd29hSN1rfh1GbvO-yx_4-NUP73nVt5M_E_MYDiNn_1yJl_Xtc3VfbB_vNtXVtkhI5lhYjg0G48DH4NBF1myJWEMNkWwkP1WNVzq2vgbro8KGuAFoyUStOaiVuPj7Jmbefw7pIwzfe228cQ7VDz3aRvM
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICDCS.2008.52
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780769531724
0769531725
EndPage 175
ExternalDocumentID 4595881
Genre orig-research
GroupedDBID 23M
29G
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-6efc1a5809fa818fe4e677e40b0f76f79175c934fd9b069f31c7ec00d75f44ea3
IEDL.DBID RIE
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000263415700021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6927
IngestDate Wed Aug 27 01:32:57 EDT 2025
IsPeerReviewed false
IsScholarly true
LCCN 2007906257
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-6efc1a5809fa818fe4e677e40b0f76f79175c934fd9b069f31c7ec00d75f44ea3
PageCount 8
ParticipantIDs ieee_primary_4595881
PublicationCentury 2000
PublicationDate 2008-June
PublicationDateYYYYMMDD 2008-06-01
PublicationDate_xml – month: 06
  year: 2008
  text: 2008-June
PublicationDecade 2000
PublicationTitle Proceedings of the International Conference on Distributed Computing Systems
PublicationTitleAbbrev ICDCS
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib015831623
ssj0005863
Score 1.7828872
Snippet Network coding is a promising enhancement of routing to improve network throughput and provide high reliability. It allows a node to generate output messages...
SourceID ieee
SourceType Publisher
StartPage 168
SubjectTerms Encoding
file sharing
multicast
Network coding
Network topology
Peer to peer computing
peer-to-peer networks
Receivers
Relays
Servers
Topology
web-based applications
Title Peer-to-Peer File Sharing Based on Network Coding
URI https://ieeexplore.ieee.org/document/4595881
WOSCitedRecordID wos000263415700021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JTwMhFCa18eDJpTXu4eBRLNMBHlwdbTQxTROX9NYMzCPpZcbUqb9fmOl28OIJQgJh_1i-7z1Cboeg0DjOWTi98XBBAcms14ZZazzyQnjTkGg-X2E81tOpmXTI3UYLg4gN-QzvY7T5yy8qt4xPZQMhjdRRZ70HoFqt1nruJFKnidrZhaVWLblepUyZIWztaw5essfsraVRRr3RjleVBlRGh_-rzhHpb9V5dLLBnWPSwfKEHK7dM9DVau2RZIK4YHXFYkhHYfnTaJ455KEPAbsKWpV03LLAaVbFsvrkY_T0nj2zlYcENg-wXzOF3iW51Nz4PCCvR4EKAAW33IPyEO5i0plU-MJYroxPEwcYRqYA6YXAPD0l3bIq8YxQCTbV6LT1qIQa8rwI-6TihQXuLEo4J73YA7Ov1gjGbNX4i7-TL8lBS6yIzxVXpFsvlnhN9t1PPf9e3DQj9wvDA5Xv
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYqQIKpQIt444ERU6fxcyVQtaJElSioWxUnZ6lLgkrK78dO0sfAwuTIkq0kZ9-Xc77vDqH7vhSgU0qJ-3qjLkCRnBirNDFGW6AZs7oi0XyOZRyr2UxPWuhho4UBgIp8Bo_-svqXnxXpyh-V9RjXXHmd9b6vnNWotdarJ-AqDMSOH-ZK1PR6ERKh-3KbYbM3ip6j95pI6RVHO3VVKlgZtP93Q8eou9Xn4ckGeU5QC_JT1F4XaMDNfu2gYAKwJGVBfIsHzgFgn6DZjcFPDr0yXOQ4rnngOCr8XF30MXiZRkPS1EggCwf8JRFg0yDhimqbOOy1wEBICYwaaqWw0kVjPNUhs5k2VGgbBqkEZ5tMcssYJOEZ2suLHM4R5tKEClJlLAgm-jTJnKcUNDOSpga4vEAd_wbmX3UajHnz8Jd_d9-hw-H0bTwfj-LXK3RU0yz84cU12iuXK7hBB-lPufhe3lZW_AXIYpk4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+International+Conference+on+Distributed+Computing+Systems&rft.atitle=Peer-to-Peer+File+Sharing+Based+on+Network+Coding&rft.au=Min+Yang&rft.au=Yuanyuan+Yang&rft.date=2008-06-01&rft.pub=IEEE&rft.issn=1063-6927&rft.spage=168&rft.epage=175&rft_id=info:doi/10.1109%2FICDCS.2008.52&rft.externalDocID=4595881
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6927&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6927&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6927&client=summon