Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Ottawa

$23,000.00

Performance of queueing networks

FY 2006-07

Summary
Complex manufacturing plants or telecommunication networks may be modelled as queueing networks.  Orders or packets progress from node to node and wait in queues to obtain service. The performance of the network is usually measured by the throughput or the rate at which orders or packets successfully travers the network. Other considerations include the rarity of network overloads and the mean time to transit the network. My first project involves a constructive large deviation theory for estimating the probability of rare events like network overload.  Rare events need a mathematical investigation since simulation can only generate such events with a lot of computational effort.  I am interested in the state of the network at the moment of overload since one can use this as the starting point for investigating a proposed overload recovery algorithm.  I am also interested in rare events in multitype networks and polling networks which defy current large deviations analysis. My second project involves a mean field analysis of the Internet protocols. We have described the evolution of the histogram of all the transmission window sizes of the sources transmitting through a bottleneck router.  The theoretical distribution has been confirmed by network measurement.  We want to use our tools to investigate some proposed control protocols.  The analysis also raises interesting questions about network turbulence.  There may simultaneous exist a fluid regime where HTTP sources transmit files without loss as well as a lossy regime with periodic burst of packet losses.  These regimes may be viewed as metastable states of a Markov chain.  Since the theory of large deviations for measure (or histogram) valued processes is incomplete we have lots of scope for new mathematical discoveries as well as interesting applications.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
4551-2006
Name nom
McDonald, David
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
23000
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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
804
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
Communication systems and services (planning, organization, services)
Area of application fr
Systèmes et services de communications (planification, organisation et services)
Research subject code
3008
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Applied probability
Research subject fr
Probabilité appliquée
Partie
1
Nb partie
5
Application title
Performance of queueing networks
Keyword
NA
Application summary
Complex manufacturing plants or telecommunication networks may be modelled as queueing networks.  Orders or packets progress from node to node and wait in queues to obtain service. The performance of the network is usually measured by the throughput or the rate at which orders or packets successfully travers the network. Other considerations include the rarity of network overloads and the mean time to transit the network. My first project involves a constructive large deviation theory for estimating the probability of rare events like network overload.  Rare events need a mathematical investigation since simulation can only generate such events with a lot of computational effort.  I am interested in the state of the network at the moment of overload since one can use this as the starting point for investigating a proposed overload recovery algorithm.  I am also interested in rare events in multitype networks and polling networks which defy current large deviations analysis. My second project involves a mean field analysis of the Internet protocols. We have described the evolution of the histogram of all the transmission window sizes of the sources transmitting through a bottleneck router.  The theoretical distribution has been confirmed by network measurement.  We want to use our tools to investigate some proposed control protocols.  The analysis also raises interesting questions about network turbulence.  There may simultaneous exist a fluid regime where HTTP sources transmit files without loss as well as a lossy regime with periodic burst of packet losses.  These regimes may be viewed as metastable states of a Markov chain.  Since the theory of large deviations for measure (or histogram) valued processes is incomplete we have lots of scope for new mathematical discoveries as well as interesting applications.