On-call processing delay in high speed networks
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 3 (6) , 628-639
- https://doi.org/10.1109/90.477709
Abstract
In future BISDN networks, significant burdens will be placed on the processing elements in the network since call routing and admission policies will be more computationally intensive than those in present day networks. Thus, the bottleneck in future networks is likely to shift from the communication links to the processing elements. The delays at these elements are influenced by their processing capacity and factors such as; routing algorithms, propagation delays, admission control functions, and network topology. The goal of this paper is to characterize the behavior of these factors on the call setup time and accepted call throughput. This behavior is examined for three sequential routing schemes and two flooding routing schemes under various network parameters and different forms of admission control. The results of our study indicate that processing capacity and the admission control function can affect the call setup time and accepted call throughput significantly while propagation delay does not affect these performance measures significantlyKeywords
This publication has 10 references indexed in Scilit:
- State dependent routing for multirate loss networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Reduced load approximations for multirate loss networksIEEE Transactions on Communications, 1993
- The effect of processing delay and QOS requirements in high speed networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Fast connection establishment in high speed networksPublished by Association for Computing Machinery (ACM) ,1990
- Paris: An approach to integrated high‐speed private networksInternational Journal of Communication Systems, 1988
- Blocking When Service Is Required From Several Facilities SimultaneouslyAT&T Technical Journal, 1985
- End-to-End Blocking for Circuit-Switched Networks: Polynomial Algorithms for Some Special CasesIEEE Transactions on Communications, 1983
- Recursive Formulas for the Calculation of Point-to-Point CongestionIEEE Transactions on Communications, 1980
- Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing PlanIEEE Transactions on Communications, 1980
- Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-ForwardIEEE Transactions on Communications, 1978