Premium
A single‐server priority queueing‐location model
Author(s) -
Batta Rajan,
Larson Richard C.,
Odoni Amedeo R.
Publication year - 1988
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230180202
Subject(s) - computer science , queueing theory , layered queueing network , node (physics) , location model , tree (set theory) , function (biology) , service (business) , sensitivity (control systems) , mathematical optimization , computer network , operations research , mathematics , structural engineering , economy , evolutionary biology , electronic engineering , engineering , economics , biology , mathematical analysis
This paper considers the problem of locating a single server on a network, relaxing the assumption that the server is always available for service, and explicitly accounting for queueing. The resulting queueing‐location model allows for an arbitrary number of priority classes. Properties of the objective function are developed and algorithms presented for obtaining the optimal location on tree and cyclic networks. Sensitivity analysis with respect to the average arrival rate of calls is investigated. A numerical example is presented to illustrate the results of this paper. The major conclusions of the paper include: (a) the optimal location need not be at a node of the network, (b) the optimal location changes as a function of the arrival rate of calls into the system, (c) the optimal location is usually different from that obtained by grouping all calls into one priority class.