Stability of a frame-based maximal weight matching algorithm with transfer speedup

It has been shown that maximal size matching algorithms for input-queued switches are stable under any admissible traffic conditions with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density swit...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE communications letters Ročník 9; číslo 10; s. 942 - 944
Hlavní autoři:	Xike Li, Elhanany, I.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.10.2005 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Applied sciences Computational complexity Delay Exact sciences and technology Impedance matching Packet switching Processor scheduling Scalability Scheduling algorithm Stability Switches Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Traffic control Packet switching Lyapunov stability analysis High density Lyapunov method Teletraffic switching architectures Router Scheduling Stability criterion Buffer system Algorithm Computational complexity Packet scheduling algorithms Simulation Queueing system Traffic management Algorithm complexity Traffic control Lyapunov stability Delay time Selector switch Timing
ISSN:	1089-7798, 1558-2558
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!

Buďte první, kdo okomentuje tento záznam!