Title :
Performance analysis of ATM routing with nonlinear equivalent capacity: symmetric case
Author :
Aswakul, C. ; Barria, J.
Author_Institution :
Dept. of Electr. & Electron. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK
fDate :
6/23/1905 12:00:00 AM
Abstract :
This paper presents a performance analysis of ATM routing with nonlinear equivalent capacity in symmetric and fully connected network. The conventional dynamic alternative routing (DAR) is extended to the environment of multiple services with nonlinear equivalent capacity. This extension uses the trunk reservation policy and dynamic service/route separation. The analytical model of generalized DAR is formulated by a reduced-load approximation and then solved by a linear approximation model and traffic grouping. The analytical results are found to be in good agreement with 95% confidence interval of discrete-event simulations. To solve the analytical model, the required time complexity is O(CS) and the space complexity is O(S), where C is the link capacity and S is the number of capacity-guaranteed services. Best-effort services are also considered in the comparison of the generalized DAR when the connection admission control (CAC) is based on either nonlinear equivalent capacity or standard peak-rate assignment. The reported numerical results suggest that the CAC with nonlinear equivalent capacity can increase the total mean revenue rate of the generalized DAR by up to (90 - 450)% for the scenarios of single capacity-guaranteed service and (50 - 100)% for the scenarios of three capacity-guaranteed services
Keywords :
approximation theory; asynchronous transfer mode; channel capacity; computational complexity; discrete event simulation; telecommunication congestion control; telecommunication network routing; telecommunication traffic; ATM routing; CAC; analytical model; best-effort services; capacity-guaranteed services; confidence interval; connection admission control; discrete-event simulations; dynamic alternative routing; dynamic service/route separation; fully connected network; generalized DAR; linear approximation model; link capacity; mean revenue rate; multiple services; nonlinear equivalent capacity; peak-rate assignment; performance analysis; reduced-load approximation; space complexity; symmetric network; time complexity; traffic grouping; trunk reservation policy; Analytical models; Asynchronous transfer mode; Computer aided software engineering; Discrete event simulation; Educational institutions; Linear approximation; Performance analysis; Routing; Terminology; Traffic control;
Conference_Titel :
Computer Communications and Networks, 2001. Proceedings. Tenth International Conference on
Conference_Location :
Scottsdale, AZ
Print_ISBN :
0-7803-7128-3
DOI :
10.1109/ICCCN.2001.956232