Traffic management mechanism for fast arbitrations with QoS parameters

Arbitration between various contenders using given priority parameters is difficult to implement in hardware. We present a solution that solves this problem with minimal hardware. The solution presented is simple, fair, starvation-free, and fast. A contention resolving technique, called binary tree...

Full description

Saved in:
Bibliographic Details
Published inGLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Vol. 7; pp. 3867 - 3872 vol.7
Main Authors Golla, P., Damm, G., Ozugur, T.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Admission control
Binary trees
Classification tree analysis
Communication system traffic control
Hardware
Innovation management
Scheduling algorithm
Switches
Technological innovation
Traffic control
Online AccessGet full text

Cover

More Information
Summary:Arbitration between various contenders using given priority parameters is difficult to implement in hardware. We present a solution that solves this problem with minimal hardware. The solution presented is simple, fair, starvation-free, and fast. A contention resolving technique, called binary tree arbitration, is taken as a basis for implementing a "weighted fair" contention resolution technique that picks among "n" contenders, which could translate to flows, packets/cells, or connections. The extensions are priority and embedded binary tree arbitrations. Theoretical formulations of these techniques are presented. The results of their comparisons to software and hardware simulations, to show their relative conformance, are also presented.
ISBN:9780780379749
0780379748
DOI:10.1109/GLOCOM.2003.1258955