## Frontiers in Queueing: Models and Applications in Science and EngineeringQueueing systems and networks are being applied to many areas of technology today, including telecommunications, computers, satellite systems, and traffic processes. This timely book, written by 26 of the most respected and influential researchers in the field, provides an overview of fundamental queueing systems and networks as applied to these technologies. Frontiers in Queueing: Models and Applications in Science and Engineering was written with more of an engineering slant than its predecessor, Advances in Queueing: Theory, Methods, and Open Problems. The earlier book was primarily concerned with methods, and was more theoretically oriented. This new volume, meant to be a sequel to the first book, was written by scientists and queueing theorists whose expertise is in technology and engineering, allowing readers to answer questions regarding the technicalities of related methods from the earlier book. Each chapter in the book surveys the classes of queueing models and networks, or the applied methods in queueing, and is followed by a discussion of open problems and future research directions. The discussion of these future trends is especially important to novice researchers, students, and even their advisors, as it provides the perspectives of eminent scientists in each area, thus showing where research efforts should be focused. Frontiers in Queueing: Models and Applications in Science and Engineering also includes applications to vital areas of engineering and technology, specifically, telecommunications, computers and computer networks, satellite systems, traffic processes, and more applied methods such as simulation, statistics, and numerical methods. All researchers, from students to advanced professionals, can benefit from the sound advice and perspective of the contributors represented in this book. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

i Stability ii Queue Lengths Hi Waiting Times | 20 |

1997 by CRC Press | 35 |

Progress in 19901994 | 119 |

ProductForm Loss Networks | 147 |

Sojourn Time Distributions in NonProduct Queueing Networks | 197 |

Stochastic Geometry Models of Mobile Communication Networks | 227 |

Fractal Queueing Models | 245 |

Stochastic Modeling of Traffic Processes | 271 |

Fluid Models for Single Buffer Systems | 321 |

Computational Methods in Queueing | 341 |

Statistical Analysis of Queueing Systems | 351 |

Perturbation Analysis for Control and Optimization of Queueing | 395 |

Polynomial Time Algorithms for Estimation of Rare Events | 421 |

Parametric Estimation of Tail Probabilities for the SingleServer | 449 |

463 | |

### Common terms and phrases

algorithm analysis Appl applications approximation arrival process assume asymptotic autocorrelation batch blocking probabilities Boxma buffer burstiness busy period computational congestion consider cycle defined denote derivative Dshalalow Engset equations Erlang estimator event exponential exponential distribution Falin finite fluid formula fractal function given independent INFOCOM input interarrival limited long-range dependence loss networks loss station M/G/1 queue Markov chain Markov process Markovian Math mean waiting measure method node normalization constant number of customers observed obtain optimal parameter performance perturbation point processes Poisson process polling systems Prob queue length queueing models queueing networks queueing process Queueing Sys queueing systems Queueing Theory random variables recursive regenerative retrial queue route sample path Section self-similar sequence service rate service time distribution simulation single server single-server sojourn stationary distribution statistical Stoch stochastic processes Subsection techniques Teletraffic Theorem tion traffic intensity traffic models traffic processes vacation variance vector workload