Article ID: | iaor20052607 |
Country: | Netherlands |
Volume: | 159 |
Issue: | 1 |
Start Page Number: | 207 |
End Page Number: | 218 |
Publication Date: | Nov 2004 |
Journal: | European Journal of Operational Research |
Authors: | Kim Yeong-Dae, Choi Seong-Hoon |
Keywords: | networks: path, simulation: applications |
In this paper, we develop algorithms for reallocating paths of available bit rate (ABR) services in an asynchronous transfer mode (ATM) switch network. ATM traffic control for fair share bandwidth allocation is usually performed under the assumption that paths of all services in a switch network are fixed. However, each connection may have multiple paths from an ingress queue to an egress queue since most ATM switch networks have the structure of the multistage interconnection network of switch elements. Therefore, paths already established for ABR connections may have to be changed to enhance throughput of the switch, if the ATM switch has the capability of adjusting paths of ABR connections while they are being served. We present three algorithms, in which throughput for ABR connections is estimated to decide whether or not paths of the connections should be changed. These algorithms are compared with an existing traffic management algorithm through simulation experiments. Results of the experiments show that the suggested algorithms give higher throughput in terms of the number of transmitted ABR cells without increasing the delay time of ABR services as well as quality of service (QoS) guaranteed services or decreasing the number of transmitted cells of QoS guaranteed services.