A practical scheduling algorithm to achieve 100% throughput in input-queued switches

Input queueing is becoming increasingly used for high-bandwidth switches and routers. In previous work, it was proved that it is possible to achieve 100% throughput for input-queued switches using a combination of virtual output queueing and a scheduling algorithm called LQF However, this is only a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annual Joint Conference of the IEEE Computer and Communications Societies Ročník 2; s. 792 - 799 vol.2
Hlavní autoři: Mekkittikul, A., McKeown, N.
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE 1998
Témata:
Aggregates
Bandwidth
Control systems
Fabrics
Hardware
Packet switching
Reflection
Scheduling algorithm
Switches
Throughput
ISBN:0780343832, 9780780343832
ISSN:0743-166X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Input queueing is becoming increasingly used for high-bandwidth switches and routers. In previous work, it was proved that it is possible to achieve 100% throughput for input-queued switches using a combination of virtual output queueing and a scheduling algorithm called LQF However, this is only a theoretical result: LQF is too complex to implement in hardware. We introduce a new algorithm called longest port first (LPF), which is designed to overcome the complexity problems of LQF, and can be implemented in hardware at high speed. By giving preferential service based on queue lengths, we prove that LPF can achieve 100% throughput.
Bibliografie:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:0780343832
9780780343832
ISSN:0743-166X
DOI:10.1109/INFCOM.1998.665102