## Abstract

In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonie with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (<7t,pj) where <TJ is the bucket size (or burstiness) and p; is the leaky rate. Compared with the totally isolated scheme where connection i is allocated a bandwidth r, = max{-4f,pj} (d; is the delay bound requirement of connection i), the DM/ARR algorithm has a better performance in the sense that it has a larger admission region. We prove that, among all possible scheduling algorithms that satisfy the delay bound requirements of established connections, DM/ARR results in the minimum output burstiness. This is important because a smaller burstiness implies a smoother traffic and thus the receiver (or next switch node in a multihop network) can handle it more easily. Numerical results show that the admission region of the DM/ARR algorithm is close to that of the earliest deadline first [1] algorithm. A packetized version is studied for ATM networks.

Original language | English |
---|---|

Pages (from-to) | 1834-1841 |

Number of pages | 8 |

Journal | IEICE Transactions on Communications |

Volume | E82-B |

Issue number | 11 |

State | Published - 1 Jan 1999 |

## Keywords

- Admission control
- Burstiness
- Quality of service
- Scheduling