An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry. Kwon, G. & Ryu, K. D. 01/2003 2003. ![An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Many Peer-to-Peer (P2P) file sharing systems have been proposed to take advantage of high scalability and abundant resources at end-user machines. Previous approaches adopted either simple flooding or routing with complex structures, such as Distributed HashingTables (DHT). However, these approaches did not consider the heterogeneous nature of the machines and the hierarchy of networks on the Internet. This paper presents Peer-to-peer Asymmetric file Sharing System(PASS), a novel approach to P2P file sharing, which accounts for the different capabilities and network locations of the participating machines. Our system selects only a portion of high-capacity machines(supernodes) for routing support, and organizes the network by using location information. We show that our key-coverage based directory replication improves the file search performance to a small constant number of routing hops, regardless of the network size.
@conference {Kwon:2003:EPF:827273.829221,
title = {An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry},
booktitle = {SAINT{\textquoteright}03. Proceedings of the 2003 Symposium on Applications and the Internet},
series = {SAINT {\textquoteright}03},
year = {2003},
month = {01/2003},
pages = {226{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Orlando, Florida, USA},
abstract = {Many Peer-to-Peer (P2P) file sharing systems have been proposed to take advantage of high scalability and abundant resources at end-user machines. Previous approaches adopted either simple flooding or routing with complex structures, such as Distributed HashingTables (DHT). However, these approaches did not consider the heterogeneous nature of the machines and the hierarchy of networks on the Internet. This paper presents Peer-to-peer Asymmetric file Sharing System(PASS), a novel approach to P2P file sharing, which accounts for the different capabilities and network locations of the participating machines. Our system selects only a portion of high-capacity machines(supernodes) for routing support, and organizes the network by using location information. We show that our key-coverage based directory replication improves the file search performance to a small constant number of routing hops, regardless of the network size.},
keywords = {asymmetry, hierarchy, P2P, pass, peer-to-peer asymmetric file sharing system, peer-to-peer networking},
isbn = {0-7695-1872-9},
doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2003.1183054},
url = {http://dl.acm.org/citation.cfm?id=827273.829221},
author = {Kwon, Gisik and Ryu, Kyung D.}
}
Downloads: 0
{"_id":"aWYApFD6kqRcB5zRi","bibbaseid":"kwon-ryu-anefficientpeertopeerfilesharingexploitinghierarchyandasymmetry-2003","downloads":0,"creationDate":"2018-07-03T04:50:29.188Z","title":"An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry","author_short":["Kwon, G.","Ryu, K. D."],"year":2003,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry","booktitle":"SAINT\\textquoteright03. Proceedings of the 2003 Symposium on Applications and the Internet","series":"SAINT \\textquoteright03","year":"2003","month":"01/2003","pages":"226\\textendash","publisher":"IEEE Computer Society","organization":"IEEE Computer Society","address":"Orlando, Florida, USA","abstract":"Many Peer-to-Peer (P2P) file sharing systems have been proposed to take advantage of high scalability and abundant resources at end-user machines. Previous approaches adopted either simple flooding or routing with complex structures, such as Distributed HashingTables (DHT). However, these approaches did not consider the heterogeneous nature of the machines and the hierarchy of networks on the Internet. This paper presents Peer-to-peer Asymmetric file Sharing System(PASS), a novel approach to P2P file sharing, which accounts for the different capabilities and network locations of the participating machines. Our system selects only a portion of high-capacity machines(supernodes) for routing support, and organizes the network by using location information. We show that our key-coverage based directory replication improves the file search performance to a small constant number of routing hops, regardless of the network size.","keywords":"asymmetry, hierarchy, P2P, pass, peer-to-peer asymmetric file sharing system, peer-to-peer networking","isbn":"0-7695-1872-9","doi":"http://doi.ieeecomputersociety.org/10.1109/SAINT.2003.1183054","url":"http://dl.acm.org/citation.cfm?id=827273.829221","author":[{"propositions":[],"lastnames":["Kwon"],"firstnames":["Gisik"],"suffixes":[]},{"propositions":[],"lastnames":["Ryu"],"firstnames":["Kyung","D."],"suffixes":[]}],"bibtex":"@conference {Kwon:2003:EPF:827273.829221,\n\ttitle = {An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry},\n\tbooktitle = {SAINT{\\textquoteright}03. Proceedings of the 2003 Symposium on Applications and the Internet},\n\tseries = {SAINT {\\textquoteright}03},\n\tyear = {2003},\n\tmonth = {01/2003},\n\tpages = {226{\\textendash}},\n\tpublisher = {IEEE Computer Society},\n\torganization = {IEEE Computer Society},\n\taddress = {Orlando, Florida, USA},\n\tabstract = {Many Peer-to-Peer (P2P) file sharing systems have been proposed to take advantage of high scalability and abundant resources at end-user machines. Previous approaches adopted either simple flooding or routing with complex structures, such as Distributed HashingTables (DHT). However, these approaches did not consider the heterogeneous nature of the machines and the hierarchy of networks on the Internet. This paper presents Peer-to-peer Asymmetric file Sharing System(PASS), a novel approach to P2P file sharing, which accounts for the different capabilities and network locations of the participating machines. Our system selects only a portion of high-capacity machines(supernodes) for routing support, and organizes the network by using location information. We show that our key-coverage based directory replication improves the file search performance to a small constant number of routing hops, regardless of the network size.},\n\tkeywords = {asymmetry, hierarchy, P2P, pass, peer-to-peer asymmetric file sharing system, peer-to-peer networking},\n\tisbn = {0-7695-1872-9},\n\tdoi = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2003.1183054},\n\turl = {http://dl.acm.org/citation.cfm?id=827273.829221},\n\tauthor = {Kwon, Gisik and Ryu, Kyung D.}\n}\n","author_short":["Kwon, G.","Ryu, K. D."],"key":"Kwon:2003:EPF:827273.829221","id":"Kwon:2003:EPF:827273.829221","bibbaseid":"kwon-ryu-anefficientpeertopeerfilesharingexploitinghierarchyandasymmetry-2003","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=827273.829221"},"keyword":["asymmetry","hierarchy","P2P","pass","peer-to-peer asymmetric file sharing system","peer-to-peer networking"],"downloads":0},"search_terms":["efficient","peer","peer","file","sharing","exploiting","hierarchy","asymmetry","kwon","ryu"],"keywords":["asymmetry","hierarchy","p2p","pass","peer-to-peer asymmetric file sharing system","peer-to-peer networking"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}