Decentralized Network Algorithms

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Sanghavi, Sujay Rajendra

Contributors dc:contributor

• Hajek, Bruce

• Engineering, Electronics and Electrical

Language dc:language

eng

Identifier

(MiAaPQ)AAI3242983

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/80984