DocumentCode
941164
Title
Approximating performance measures for public services
Author
Berman, Oded ; Vasudeva, Sandeep
Author_Institution
Joseph L. Rotman Sch. of Manage., Univ. of Toronto, Ont., Canada
Volume
35
Issue
4
fYear
2005
fDate
7/1/2005 12:00:00 AM
Firstpage
583
Lastpage
591
Abstract
This paper deals with estimating performance measures, such as average response time for spatially distributed networks. Demands are generated stochastically at the nodes and the service units are stationed at service centers when available. Whenever a call arrives, a service unit will travel to the call´s location. When there are no available servers, the call will enter an infinite capacity queue at that node. The service units will travel from node to node serving the calls and return to the service center only when there are no more calls waiting. In most cases, exact models are too complicated to analyze. This paper presents approximations which are tested using simulation and found to give good results.
Keywords
distributed processing; network servers; public administration; queueing theory; service industries; average response time; performance measures approximation; public services; queueing system; service units; spatially distributed network; Cities and towns; Delay; Hypercubes; Layout; Network servers; Nonlinear equations; Poisson equations; Roads; Testing; Time measurement; Hypercube model; location; minimizing response time; multifacility; multiserver; queueing;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
Publisher
ieee
ISSN
1083-4427
Type
jour
DOI
10.1109/TSMCA.2005.850607
Filename
1453705
Link To Document