Burstiness-class based queuing in ATM networks supporting delay QoS bounds

We propose a burstiness-class-based queuing (B-CBQ) scheme where connections are allocated to their classes based on a “burstiness” parameter derived from the leaky bucket source specifications. We derive delay bounds for burstiness-classes on per-switch and end-to-end basis. An optimization problem is defined and solved to find the optimal number of classes in order to minimize the delay bound through a switch for a connection admitted to the lowest burstiness-class. Finally, some simulation results are provided to illustrate the behavior of a B-CBQ switch