A self-clocked fair queueing scheme for broadband applications

DMCA

A self-clocked fair queueing scheme for broadband applications (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by S. Jamaloddin Golestani

Venue:	Proceedings of IEEE INFOCOM’94
Citations:	444 - 0 self

BibTeX

@INPROCEEDINGS{Golestani94aself-clocked,
    author = {S. Jamaloddin Golestani},
    title = {A self-clocked fair queueing scheme for broadband applications},
    booktitle = {Proceedings of IEEE INFOCOM’94},
    year = {1994},
    pages = {636--646}
}

OpenURL

Abstract

A n ef ic ient fa i r queueing scheme which is feasi-ble f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a self-contained manner, eliminating the need f o r the hypo-thetical fluid-flow reference sys tem used in the present state of art and thereby removing the associated com-putational complexity. The scheme i s based on the adoption of an internally generated virtual time as the index of work progress, hence the name self-clocked fair queueing. W e prove that the scheme possesses the desired fairness property and i s nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged ses-sions is newer more than two t imes the corresponding figure in any packet-based queueing system. 1

Keyphrases

self-clocked fair broadband application feasi-ble broadband implementation self-contained manner define fairness hypo-thetical fluid-flow reference sys tem ef ic ient fa t performance normalized service maximum permissible disparity packet-based queueing system present state corresponding figure virtual time work progress desired fairness property com-putational complexity

DMCA