Abstract
This paper describes a connection admission control (CAC) algorithm that has been developed from an underlying mathematical model of ATM buffer dynamics. The model is based on using a reflected Brownian motion representation of queue dynamics. A CAC algorithm can be developed directly from the mathematical model and will be as accurate as the underlying model. The result from the model development and the CAC's implementation is that, within the model's predictive accuracy, the CAC algorithm offers myopic-optimal loading of links. This paper emphasizes the blending of the model and CAC algorithm development. The CAC algorithm execution time is linearly dependent on the number of quality of service (QOS) classes supported by the switch; in addition, insight into the violation of existing connection QOSs is discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
