Grant: Discovery Grants Program - Individual
University of Waterloo
$22,000.00
Routing algorithms and protocols in current and future telecommunication networks
EF 2014-15
Résumé
Communication networks play a fundamental role in every-day life. In the last few decades, the world has seen a tremendous growth of telecommunication services and infrastructure and an additional increase is forecasted by major telecommunication companies in the coming years. Since modern life crucially relies on telecommunication networks able to route traffic demands quickly and properly, the design and the implementation of effective routing algorithms is a fundamental research area with a high technological and economic impact. How can we use novel algorithmic theory to provide effective and reliable routing of traffic in current and future networks? The investigation of this question, both from a theoretical and from an applied point of view, is the long-term goal of this project.The short-term goals are twofold. On the theoretical side, I plan to develop new complexity and approximation results for hot research topics such as routing problems under traffic demand uncertainty, or single-source unsplittable flow problems. On the applied side, I plan to focus on how to efficiently implement particular routings in networks ruled by fixed routing protocols of high relevance in the telecommunication industry.With this project, I plan to build up a highly visible team that contributes to this field, at the interface of applied mathematics, computer science and telecommunication engineering. Most of the questions and problems addressed in this proposal, although being of fundamental mathematical nature, are motivated by real-world routing problems in telecommunication. Therefore, I expect the results and methods developed in this project to have a direct impact on practical problem solving.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
418671-2012
Name nom
Sanità, Laura
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
22000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
3
Nb partie
5
Application title
Routing algorithms and protocols in current and future telecommunication networks
Keyword
NSERC
Application summary
Communication networks play a fundamental role in every-day life. In the last few decades, the world has seen a tremendous growth of telecommunication services and infrastructure and an additional increase is forecasted by major telecommunication companies in the coming years. Since modern life crucially relies on telecommunication networks able to route traffic demands quickly and properly, the design and the implementation of effective routing algorithms is a fundamental research area with a high technological and economic impact. How can we use novel algorithmic theory to provide effective and reliable routing of traffic in current and future networks? The investigation of this question, both from a theoretical and from an applied point of view, is the long-term goal of this project.The short-term goals are twofold. On the theoretical side, I plan to develop new complexity and approximation results for hot research topics such as routing problems under traffic demand uncertainty, or single-source unsplittable flow problems. On the applied side, I plan to focus on how to efficiently implement particular routings in networks ruled by fixed routing protocols of high relevance in the telecommunication industry.With this project, I plan to build up a highly visible team that contributes to this field, at the interface of applied mathematics, computer science and telecommunication engineering. Most of the questions and problems addressed in this proposal, although being of fundamental mathematical nature, are motivated by real-world routing problems in telecommunication. Therefore, I expect the results and methods developed in this project to have a direct impact on practical problem solving.