Optimal service and arrival rates in Jackson queueing networks

✍ Scribed by Kurt M. Bretthauer

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 141 KB
• Volume: 47
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/(sici)1520-6750(200002)47:1<1::aid-nav1>3.0.co;2-1

✦ Synopsis

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer.