In this paper, we cansider the ATM networks in which the Virtual Path concept is implemented. The question of how to multiplex two or more diverse traflic classes while providing different Quality of Service requirements is a very complicated, open problem. Two distint options are available: integration and segregation. In an integration approach all the W c from Merent c o~e c t i~~l s are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all C O M~O I I S . With the segregation approach the problem can be much simplified if different types of traflic are separated by assigning a VP with dedicated resources (bUgers and links). Therefore, resources may not be aciently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted co~ections exceeds the capacity of the link is evaluated with the Probability of Congestion (PC). Since the PC can be expressed as the CLP, we shall simply cany out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the New Convolution Approach. Numerical resuits are presented both to compare the required capacity and to observe which conditions under each approach are preferred.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.