This paper conskiers preventive load control in ATM networks. A one link performance evaluation based on onloff trafic sources is carried out. Approximative modek are derive4 and a specific admksion control algorithm based on one of the modeh is presented and the obtained transfer eficiency is derived. A Flow Enforcement function to supervise each connection is suggested and the correspondence between modelling parameters, flow enforcement parameters and parameters used by the admission control algorithm is considered
Abstract-This paper characterizes four measurement algorithms for flow enforcement in ATM networks. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletrafflc theory and partly on signal processing theory, is carried out. It is suggested to use the RMS measurement bandwidth to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewaltype Connection using the four algorithms. The corresponding hardware demands are estimated and compared.
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.
customersupport@researchsolutions.com
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.