Grant: Discovery Grants Program - Individual
University of Waterloo
$30,000.00
Complex interacting networks and systems: Models, analysis, and algorithms
EF 2016-17
Résumé
Complex systems and networks such as the internet, wireless networks, the cloud, and social networks, are comprised of large numbers of interacting entities (users and resources) that interact in a random way that determine their functionality and the macroscopic behavior of the overall system. To manage the complexity of networks and systems we need to understand their dynamic as well as emergent behavior in order to design algorithms for their stable, efficient, and secure operation as well as for providing user experience. The systems of today are vastly different in scale and the basic issues are not simply traffic issues. The methodologies required are therefore very different that go beyond classical queueing models, optimization, and resource allocation. Since the systems are large in terms of users, resources, and are spatially distributed we need to understand the issues of local vs. global behavior and the design of distributed algorithms that do not require too much information. The research will aim at understanding the impact of heterogeneity and the size and population of resources and how these can be used to characterize the performance.
The research will concern itself with the issues of complexity and the stochastic behavior of such networks and systems. The aim is to address the main problems that impact stability and performance. The goal is the design of simple efficient and distributed algorithms for user experience and system efficiency. The techniques will draw upon stochastic networks, generalized voter models, mean field or McKean-Vlasov analysis, randomized algorithms, random graphs especially the spectral theory, and bandit processes.
The research will be pursued with the following principal application thrusts: 1) Wireless networks, 2) Social networks and security, 3) Network performance and algorithms , and 4) Cloud computing and applications. The aim is to study the interplay between size and emergent behavior, while using averaging to devise simple algorithms for resource optimization and providing predictable performance to both users and operators.
In each of the constituent application areas the research contributions will be in models, their analysis with performance being the focus, and the design of distributed and randomized algorithms for scalability without sacrificing efficiency. The aim is to develop the theoretical frameworks necessary for the design of robust and stable algorithms that will allow resource allocation and optimization. A key component is the training research students to acquire wider variety of tools and techniques that are necessary to deal with the new problems that are not part of classical training which will lead to new courses and monographs. The research likely to enrich the constituent fields from where the tools will be drawn namely stochastic networks, bandit processes, randomized algorithms and graphical models.
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
RGPIN-2015-05218
Name nom
Mazumdar, Ravi
Department département
Electrical & Computer Engineering - Electrical & Computer Engineering
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2016
Competition year année de concours
2015
Award amount
30000
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
2
Nb partie
5
Application title
Complex interacting networks and systems: Models, analysis, and algorithms
Keyword
NSERC
Application summary
Complex systems and networks such as the internet, wireless networks, the cloud, and social networks, are comprised of large numbers of interacting entities (users and resources) that interact in a random way that determine their functionality and the macroscopic behavior of the overall system. To manage the complexity of networks and systems we need to understand their dynamic as well as emergent behavior in order to design algorithms for their stable, efficient, and secure operation as well as for providing user experience. The systems of today are vastly different in scale and the basic issues are not simply traffic issues. The methodologies required are therefore very different that go beyond classical queueing models, optimization, and resource allocation. Since the systems are large in terms of users, resources, and are spatially distributed we need to understand the issues of local vs. global behavior and the design of distributed algorithms that do not require too much information. The research will aim at understanding the impact of heterogeneity and the size and population of resources and how these can be used to characterize the performance.
The research will concern itself with the issues of complexity and the stochastic behavior of such networks and systems. The aim is to address the main problems that impact stability and performance. The goal is the design of simple efficient and distributed algorithms for user experience and system efficiency. The techniques will draw upon stochastic networks, generalized voter models, mean field or McKean-Vlasov analysis, randomized algorithms, random graphs especially the spectral theory, and bandit processes.
The research will be pursued with the following principal application thrusts: 1) Wireless networks, 2) Social networks and security, 3) Network performance and algorithms , and 4) Cloud computing and applications. The aim is to study the interplay between size and emergent behavior, while using averaging to devise simple algorithms for resource optimization and providing predictable performance to both users and operators.
In each of the constituent application areas the research contributions will be in models, their analysis with performance being the focus, and the design of distributed and randomized algorithms for scalability without sacrificing efficiency. The aim is to develop the theoretical frameworks necessary for the design of robust and stable algorithms that will allow resource allocation and optimization. A key component is the training research students to acquire wider variety of tools and techniques that are necessary to deal with the new problems that are not part of classical training which will lead to new courses and monographs. The research likely to enrich the constituent fields from where the tools will be drawn namely stochastic networks, bandit processes, randomized algorithms and graphical models.