Project

Back to overview

Efficient and Robust Overlay Networks (ERON)

English title Efficient and Robust Overlay Networks (ERON)l
Applicant Braun Torsten
Number 117855
Funding scheme Project funding (Div. I-III)
Research institution Institut für Informatik Universität Bern
Institution of higher education University of Berne - BE
Main discipline Information Technology
Start/End 01.10.2007 - 30.09.2009
Approved amount 106'411.00
Show all

Keywords (4)

overlay networks; routing; Internet; coordinates-based round-trip-time prediction

Lay Summary (English)

Lead
Lay summary
Overlay networks on top of the Internet are gaining popularity. The reason for this is that they can be used to introduce new services not foreseen or available on the Internet. Besides providing services defined but not available in the Internet today such as multicast services, overlay networks are also used to enforce better routing paths than the ones provided by Internet routing (circumventing policy based routing of BGP), introducing new services such as service discovery, distributed file systems etc. The goal of the ERON (Efficient and Robust Overlay Networks) project is to develop an efficient peer-to-peer message routing protocol on top of the Internet protocol. For the construction of a topology aware overlay (peer-to-peer) network, we propose using a coordinates-based round-trip-time (RTT) prediction scheme such as GNP, VIVALDI, BIGBANG or ICS. Such coordinates-based RTT prediction schemes embed all hosts of an overlay network in a (virtual) n-dimensional Euclidean space such that the distances between each pair of hosts serve as good prediction of RTTs between those hosts. RTT prediction schemes extract the network topology information and map it onto host positions in a virtual space. We can exploit this property of coordinates-based RTT prediction schemes to transform the problems of finding optimal routes within an overlay network into the domain of finding the shortest path in a n-dimensional metric space. This makes solving the problem much easier, since in metric spaces there are concepts of direction and distance. We are currently developing a routing protocol for an overlay network, which exploits this idea and we are planning to further investigate the advantages topology extraction achieved by embedding hosts in metric spaces. We also aim to develop a service discovery protocol based on our overlay routing protocol that is able to locate services such as FTP mirrors, which are in the vicinity of the querying host in terms of RTT. We are also planning to develop a framework for solving network optimization problems such as finding optimal QoS paths, or maximizing bandwidth within the overlay network. The framework to be developed will be able to reduce the search space of the optimization problems only to hosts which are within given boundaries respective to RTTs.
Direct link to Lay Summary Last update: 21.02.2013

Responsible applicant and co-applicants

Employees

Name Institute

Associated projects

Number Title Start Funding scheme
109270 Efficient and Robust Overlay Networks (ERON) 01.10.2005 Project funding (Div. I-III)

-