{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/16485"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/16485","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Analysis of P2P file transferring system by stochastic queue models","abstract":"Distributed protocols for peer-to-peer (P2P) file sharing over the Internet have been highly successful in recent years. The idea is that files to be shared are broken into pieces. As new peers enter the system, they strive to obtain a complete collection from other peers and from a seed. In this thesis we focus on studying a P2P file transferring network by a stochastic queue model. After presenting a general stochastic model, we discuss three cases obtained by specializing the general model using three different choices of parameter values and selection strategies. In the first case, we deal with a simple model under a fixed peer selection strategy, and identify a problem that might occur when the rate of distribution of pieces is not large enough. The similar problem exists when we consider the second and the third cases where the uniform random peer selection strategy is applied. The problem is that, when the distribution of pieces from either the seed or external arrivals is not large enough, the system will work poorly. There may be symmetry breaking --- with one piece becoming very rare --- that makes the system unstable.","abstract_html":"Distributed protocols for peer-to-peer (P2P) file sharing over the Internet have been highly successful in recent years. The idea is that files to be shared are broken into pieces. As new peers enter the system, they strive to obtain a complete collection from other peers and from a seed. In this thesis we focus on studying a P2P file transferring network by a stochastic queue model. After presenting a general stochastic model, we discuss three cases obtained by specializing the general model using three different choices of parameter values and selection strategies. In the first case, we deal with a simple model under a fixed peer selection strategy, and identify a problem that might occur when the rate of distribution of pieces is not large enough. The similar problem exists when we consider the second and the third cases where the uniform random peer selection strategy is applied. The problem is that, when the distribution of pieces from either the seed or external arrivals is not large enough, the system will work poorly. There may be symmetry breaking --- with one piece becoming very rare --- that makes the system unstable.","abstract_has_math":false,"creators":["Zhu, Ji"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Hajek, Bruce"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-06-22T19:37:26Z","date_published":"2010-06-22T19:37:26Z","updated_at":"2026-07-22T22:25:09Z","subjects":["Peer-to-peer (P2P)","Queue model","File transferring","one club","stability"],"languages":["en"],"rights":["Copyright 2010 Ji Zhu"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/16485","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hajek, Bruce"]},{"key":"dc:creator","label":"Author","values":["Zhu, Ji"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-06-22T19:37:26Z","2010-5"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Peer-to-peer (P2P)","Queue model","File transferring","one club","stability"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Ji Zhu"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/16485"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Distributed protocols for peer-to-peer (P2P) file sharing over the Internet have been highly successful in recent years. The idea is that files to be shared are broken into pieces. As new peers enter the system, they strive to obtain a complete collection from other peers and from a seed. In this thesis we focus on studying a P2P file transferring network by a stochastic queue model. After presenting a general stochastic model, we discuss three cases obtained by specializing the general model using three different choices of parameter values and selection strategies. In the first case, we deal with a simple model under a fixed peer selection strategy, and identify a problem that might occur when the rate of distribution of pieces is not large enough. The similar problem exists when we consider the second and the third cases where the uniform random peer selection strategy is applied. The problem is that, when the distribution of pieces from either the seed or external arrivals is not large enough, the system will work poorly. There may be symmetry breaking --- with one piece becoming very rare --- that makes the system unstable.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-04-07T23:33:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Zhu_Ji.tex: 84211 bytes, checksum: 907be4ae7d3fed52d73a42b406906bc4 (MD5) Zhu_Ji.pdf: 2992644 bytes, checksum: 99182858e716f02edc5839705ed86419 (MD5)","Made available in DSpace on 2010-06-22T19:37:26Z (GMT). No. of bitstreams: 3 Zhu_Ji.tex: 84211 bytes, checksum: 907be4ae7d3fed52d73a42b406906bc4 (MD5) Zhu_Ji.pdf: 2992644 bytes, checksum: 99182858e716f02edc5839705ed86419 (MD5) license.txt: 4054 bytes, checksum: af325d06dd5f32b631c314fa31ab584f (MD5)"]},{"key":"dc:title","label":"Title","values":["Analysis of P2P file transferring system by stochastic queue models"]}]}],"canonical_facts":{"dc:contributor":["Hajek, Bruce"],"dc:creator":["Zhu, Ji"],"dc:date":["2010-06-22T19:37:26Z","2010-5"],"dc:description":["Distributed protocols for peer-to-peer (P2P) file sharing over the Internet have been highly successful in recent years. The idea is that files to be shared are broken into pieces. As new peers enter the system, they strive to obtain a complete collection from other peers and from a seed. In this thesis we focus on studying a P2P file transferring network by a stochastic queue model. After presenting a general stochastic model, we discuss three cases obtained by specializing the general model using three different choices of parameter values and selection strategies. In the first case, we deal with a simple model under a fixed peer selection strategy, and identify a problem that might occur when the rate of distribution of pieces is not large enough. The similar problem exists when we consider the second and the third cases where the uniform random peer selection strategy is applied. The problem is that, when the distribution of pieces from either the seed or external arrivals is not large enough, the system will work poorly. There may be symmetry breaking --- with one piece becoming very rare --- that makes the system unstable.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-04-07T23:33:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Zhu_Ji.tex: 84211 bytes, checksum: 907be4ae7d3fed52d73a42b406906bc4 (MD5) Zhu_Ji.pdf: 2992644 bytes, checksum: 99182858e716f02edc5839705ed86419 (MD5)","Made available in DSpace on 2010-06-22T19:37:26Z (GMT). No. of bitstreams: 3 Zhu_Ji.tex: 84211 bytes, checksum: 907be4ae7d3fed52d73a42b406906bc4 (MD5) Zhu_Ji.pdf: 2992644 bytes, checksum: 99182858e716f02edc5839705ed86419 (MD5) license.txt: 4054 bytes, checksum: af325d06dd5f32b631c314fa31ab584f (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/16485"],"dc:language":["en"],"dc:rights":["Copyright 2010 Ji Zhu"],"dc:subject":["Peer-to-peer (P2P)","Queue model","File transferring","one club","stability"],"dc:title":["Analysis of P2P file transferring system by stochastic queue models"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:09Z"}