Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
Teletraffic Technologies in ATM Networks
Teletraffic Technologies in ATM Networks
International Journal of Network Management
| Hi-index | 0.00 |
The throughput optimality ofpriority management strategies in a single buffer has been studiedfor a general aggregate arrival law. The tight upper bounds found are useful to understand optimality in utilization of specific priority schemes such as push-out buffer (POB) and partial buffer sharing (PBS).This paper further focuses on the maximum allowable load pmaa versus the priority mix (Y for a PBS and a random push-out buffer (R POB) of size K for a wide variety of arrival processes. The role of priorities in a special type of bursty arrivals, the compound Poisson process with constant burst length and random priority assignment within the burst, is found to be less pronounced than that ofpure' Poisson arrivals. On the other hand, the results for ON- OFF cell arrivals modeled by a MMPP(2), MMPP(3), and higher order Markov Modulated Processes closely follow the behaviour of the maximum allowable load in the R POB with Poisson arrivals, howeven scaled to lower loads. The results indicate that the priority mix distribution within the aggregate arrival flow inJluences the shape of pmaz(o)- curve more than the aggregate arrival distribution itself