An efficient network-switch scheduling for real-time applications |
| |
| Authors: | Caimu Tang Chronopoulos A.T. Yaprak E. |
| |
| Affiliation: | Comput. Sci. Dept., Univ. of Southern California, Los Angeles, CA, USA; |
| |
| Abstract: | Bursts consist of a varying number of asynchronous transfer mode cells corresponding to a datagram. Here, we generalized weighted fair queueing to a burst-based algorithm with preemption. The new algorithm enhances the performance of the switch service for real-time applications, and it preserves the quality of service guarantees. We study this algorithm theoretically and via simulations. |
| |
| Keywords: | |
|
|
