Performance evaluation of a dynamic priority mechanism for the p/sub i/-persistent protocol for metropolitan area networks

The p/sub i/-persistent protocol, a probabilistic scheduling that is suitable for multiple-access communication applications requiring large bandwidth over very long distances, is considered. A dynamic control algorithm for the multipriority p/sub i/-persistent protocol that makes it possible to adapt to changing network conditions in a fully distributed manner is presented. Through a simulation model, the performance of the dynamic algorithm under various changing network scenarios is studied, and the ability of the protocol to provide the desired quality of service to each priority class of traffic is demonstrated.<
>