Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up.
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling algorithms has mainly focused on maximum weight matching scheduling algorithms. It is known that maximum weight matching...
| Τόπος έκδοσης: | Computer communication review. 36, 3 (2006). |
|---|---|
| Κύριος συγγραφέας: | |
| Μορφή: | Άρθρο |
| Γλώσσα: | English |
| Θέματα: |