Stability of a frame-based oldest-cell-first maximal weight matching algorithm

Input-queued cell switches employing the oldest-cell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is stable for admissible traffic conditions when executed with a scheduling speedup of 2. However, as link speeds increase, the compu...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 56; číslo 1; s. 21 - 26
Hlavní autoři:	Xike Li, Elhanany, I.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.01.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms Applied sciences Buffers Computational complexity Delay Exact sciences and technology Matching Processor scheduling Routers Scalability Scheduling Scheduling algorithm Stability Switches Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Time measurements Timing Traffic control Packet switching Scalability High density stability analysis Teletraffic switching architectures Router Scheduling Stability criterion Buffer system Algorithm Computational complexity Packet scheduling algorithms Queueing system Traffic management Traffic control Delay time Selector switch Timing
ISSN:	0090-6778, 1558-0857
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!