Premium
Topological network design of state‐dependent queueing networks
Author(s) -
Smith J. MacGregor
Publication year - 1996
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/(sici)1097-0037(199608)28:1<55::aid-net7>3.0.co;2-c
Subject(s) - queueing theory , layered queueing network , computer science , state (computer science) , network planning and design , topology (electrical circuits) , mathematical optimization , state dependent , regular polygon , theoretical computer science , mathematics , computer network , algorithm , mathematical economics , combinatorics , geometry
Topological network design (TND) problems often contain nodes and arcs where the stochastic flows of customers, occupants, and messages are state‐dependent. A Gilbert‐Steiner problem is formulated using a convex cost function to design networks where state‐dependent flows occur. The properties of the problem along with an algorithm, complexity analysis, and experimental results for two example applications—one an open queueing network model and the other a closed queueing network model—are presented. © 1996 John Wiley & Sons, Inc.