Analysis of Communication Networks: Call Centres, Traffic and Performance ( Fields Institute Communications )

Publication series :Fields Institute Communications

Author: David R. McDonald;Stephen R. E. Turner  

Publisher: American Mathematical Society‎

Publication year: 2000

E-ISBN: 9781470430528

P-ISBN(Hardback):  9780821819913

Subject: TN91 通信

Keyword: 暂无分类

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Analysis of Communication Networks: Call Centres, Traffic and Performance

Description

This volume consists of the proceedings of the Workshop on Analysis and Simulation of Communication Networks held at The Fields Institute (Toronto). The workshop was divided into two main themes, entitled ”Stability and Load Balancing of a Network of Call Centres” and “Traffic and Performance". The call center industry is large and fast-growing. In order to provide top-notch customer service, it needs good mathematical models. The first part of the volume focuses on probabilistic issues involved in optimizing the performance of a call center. While this was the motivating application, many of the papers are also applicable to more general distributed queueing networks. The second part of the volume discusses the characterization of traffic streams and how to estimate their impact on the performance of a queueing system. The performance of queues under worst-case traffic flows or flows with long bursts is treated. These studies are motivated by questions about buffer dimensioning and call admission control in ATM or IP networks. This volume will serve researchers as a comprehensive, state-of-the-art reference source on developments in this rapidly expanding field.

Chapter

Title page

Contents

Preface

Predicting response times in processor-sharing queues

Bilingual server call centres

On dynamic scheduling of a parallel server system with complete resource pooling

Dynamic scheduling for queueing networks derived from discrete-review policies

Large derviations for join the shorter queue

Comparing load balancing algorithms for distributed queueing networks

Estimating tail probabilities in queues via extremal statistics

Extremal traffic and worst-case performance for queues with shaped arrivals

Long range dependence of inputs and outputs of some classical queues

On ‘catastrophic’ behavior of queueing networks

Back Cover

The users who browse this book also browse


No browse record.