Grant: Discovery Grants Program - Individual
University of Toronto
$26,000.00
Towards an overlay network architecture
FY 2013-14
Summary
Self-organizing overlay networks have emerged as a powerful new paradigm for deploying network services on a large scale, yet the full potential of this technology remains largely unexplored. This project will advance the state-of-the-art of self-organizing virtual overlay networks and show that design principles for self-organizing networks can be evolved into a blueprint for a new protocol architecture for future communication networks and services. We will develop algorithms and protocols for a network architecture that is entirely based on the principles of self-organizing overlay networks. Using analytical methods, simulation, and measurements of testbed implementations we will provide new insights into the capabilities and limitations of self-organizing networks. A key challenge addressed in this project is the development of algorithms and protocols that can maintain a connected overlay graph in the presence of multiple heterogeneous substrate networks. To show that self-organizing networks can deliver high delay and throughput performance at the lower layers of the system architecture, we propose the development of an `overlay switch' with hardware support for self-organizing overlay network protocols. We will explore algorithms that enable overlay networks to scale to millions of nodes. In addition, we will devise and evaluate algorithms for overlay networks that result in an efficient use of network resources. A second thrust of this research program is the advancement of the stochastic network calculus, a new theory for the evaluation of delay and throughput performance of existing networks, as well as future networks that may be different from the networks and protocols used today. We will investigate applications of the stochastic network calculus techniques to gain insights into the scaling properties of network delays, develop better bandwidth estimation methods, and improve feedback-based congestion control algorithms.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
311718-2010
Name nom
Liebeherr, Jorg
Department département
Electrical & Computer Engineering
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2010
Award amount
26000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2508
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications networks
Research subject fr
Réseaux de télécommunications
Partie
4
Nb partie
5
Application title
Towards an overlay network architecture
Keyword
NSERC
Application summary
Self-organizing overlay networks have emerged as a powerful new paradigm for deploying network services on a large scale, yet the full potential of this technology remains largely unexplored. This project will advance the state-of-the-art of self-organizing virtual overlay networks and show that design principles for self-organizing networks can be evolved into a blueprint for a new protocol architecture for future communication networks and services. We will develop algorithms and protocols for a network architecture that is entirely based on the principles of self-organizing overlay networks. Using analytical methods, simulation, and measurements of testbed implementations we will provide new insights into the capabilities and limitations of self-organizing networks. A key challenge addressed in this project is the development of algorithms and protocols that can maintain a connected overlay graph in the presence of multiple heterogeneous substrate networks. To show that self-organizing networks can deliver high delay and throughput performance at the lower layers of the system architecture, we propose the development of an `overlay switch' with hardware support for self-organizing overlay network protocols. We will explore algorithms that enable overlay networks to scale to millions of nodes. In addition, we will devise and evaluate algorithms for overlay networks that result in an efficient use of network resources. A second thrust of this research program is the advancement of the stochastic network calculus, a new theory for the evaluation of delay and throughput performance of existing networks, as well as future networks that may be different from the networks and protocols used today. We will investigate applications of the stochastic network calculus techniques to gain insights into the scaling properties of network delays, develop better bandwidth estimation methods, and improve feedback-based congestion control algorithms.