2026-09-18T17:37:10Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/80984 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Hajek, Bruce Sanghavi, Sujay Rajendra 2015-09-25T20:09:06Z 2015-09-25T20:09:06Z 10000-01-01 2006 2006 In the second part of this dissertation we investigate the problem of disseminating a large file to a large network of users. The file is divided into pieces, and different pieces are initially uploaded to different users. The users then exchange pieces to complete their individual collections. In such networks, a crucial task is piece selection: users must decide which piece to request from their neighbors based only on local information. We characterize the performance of several piece selection algorithms, and also develop algorithms that ensure efficient dissemination of all pieces to all users. Made available in DSpace on 2015-09-25T20:09:06Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3242983.pdf: 2518506 bytes, checksum: 3707e14fdae6bdd53f10073b424eeffa (MD5) Previous issue date: 2006 Embargo set by: Seth Robbins for item 82266 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 108 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006. http://hdl.handle.net/2142/80984 (MiAaPQ)AAI3242983 eng Engineering, Electronics and Electrical Decentralized Network Algorithms text Electrical and Computer Engineering Electrical and Computer Engineering University of Illinois at Urbana-Champaign Dissertation Ph.D.