Article ID: | iaor20063 |
Country: | Netherlands |
Volume: | 163 |
Issue: | 2 |
Start Page Number: | 482 |
End Page Number: | 502 |
Publication Date: | Jun 2005 |
Journal: | European Journal of Operational Research |
Authors: | Zionts Stanley, Ramesh R., Vroblefski Mark |
Keywords: | queues: applications, heuristics, networks |
In this paper, we develop a unified framework for approximation of the performance of general telecommunication networks based on a decomposition strategy. The method is an extension of the work presented earlier. The algorithms assume finite buffer space at each switch, state-dependent arrival rates of data packets, and general service time distribution at the switches. Two methods of buffer space allocation at the switches, and two congestion control mechanisms are modeled. The proposed algorithms have been extensively tested against simulation values. The results show that the proposed framework yields robust, reliable and accurate estimates of network performance measures, such as throughput, number of packets in the system, and switch and link utilization. The computation time required is minimal. The unified framework presents a useful set of tools for telecommunication network designers in evaluating numerous network designs.