Abstract
A new scheduling algorithm is proposed to improve on existing algorithms designed for input-queued ATM switches. By assigning a session weight according to its queue length normalised by its rate and using maximum weight matching to obtain a match, the proposed algorithm can avoid starvation of slow sessions, thus providing good delay properties as well as fair services, and at the same time reducing traffic burstiness.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1826-1827 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 34 |
| Issue number | 19 |
| DOIs | |
| State | Published - Sep 17 1998 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering