Stochastic Networks Theory and Applications

The theory of stochastic networks is an important and rapidly developing research area, driven in part by important industrial applications in the design and control of modern communications and manufacturing networks. This volume is a collections of invited papers written by some of the leading researchers in this field, and provides a comprehensive survey of current research and the very latest developments. With contributions from most of the world's foremost researchers the areas covered include the mathematical modelling and the optimal control of queueing and loss networks, and the statistical modelling and analysis of network data. Also containing a comprehensive and up-to-date bibliography of the statistical literature on long-range dependence and self-similarity in network traffic and other scientific and engineering applications this book will suit researchers, research institutes and industry throughout the world.

1 - Convergence to equilibria for fluid models of FIFO and processor sharing queueing networks
2 - Optimal draining of fluid re-entrant lines: some solved examples
3 - On the approximation of queueing networks in heavy traffic
4 - The BIGSTEP approach to flow management in stochastic processing networks
5 - Queue lengths and departures at single-server resources
6 - Large deviations of stationary reflected Brownian motions
7 - Limit theorems for workload input models
8 - Notes on effective bandwidths
9 - Traffic characterisation and effective bandwidths for broadband network traces
10 - Nonparametric estimation for quantities of interest in queues
11 - The asymptotic behaviour of large loss networks
12 - Admission controls for loss networks with diverse routing
13 - On load balancing in Erlang networks
14 - Analysing system behaviour on different timescales
15 - Optimal returns and suboptimality bounds for systems satisfying generalised conservation laws
16 - Approximate solutions for open networks with breakdowns and repairs
17 - Stationary ergodic Jackson networks: results and counter-examplesFrancois Baccelli, Serguei Foss, and Jean Mairesse
18 - The Cesaro limit of departures from certain ./GI/1 queueing tandems
19 - The Poisson-independence hypothesis for infintely-growing fully-connected packet-switching networks
20 - A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks