|Home \ Graduation Activities \ Post-Graduation Page||Login|
Topology Management for Unstructured Overlay Networks
The peer-to-peer paradigm has emerged as a viable way to overcome the limitations of the client-server model namely, in terms of scalability, fault-tolerance, and even operational costs. This paradigm has gained signiﬁcant popularity in the context of ﬁle sharing applications, such as Napster, Emule, Gnutella, and more recently BitTorrent. In order to ensure the scalability of these solutions, many peer-to-peer services operate on top of unstructured overlay networks, which are logical networks deployed at the application level, that establish random neighboring associations among participants of the system. Although the random nature of these overlays is useful for many peer-to-peer services. On the other hand, it is known that the topology of these overlays has a severe impact on the performance of these services; it is therefore interesting to bias the construction and/or the usage of unstructured overlays. This document presents a Thesis proposal that focuses on techniques to manage the topology of unstructured overlay networks that, while preserving the random nature and low overhead that characterizes such overlays, are able to satisfy some relaxed constraints over the topology in order to beneﬁt the operation of speciﬁc services. The document identiﬁes the main problem to be addressed by the Thesis, and provides a survey on relevant concepts that are at the core of the Thesis topic. Existing approaches to address the problem are also discussed. Finally, this document identiﬁes the main contributions and results to be expected from the Thesis, and presents the progress performed so far. Additionally, it identiﬁes a set of milestones to be achieved before the delivery of the Thesis, and proposes a coarse calendar for completing these milestones.
Start Date: 2007-03-01
End Date: 2011-01-05
Post-Graduation Student / Researcher / Professor: