Dragos, Radu-Calin and Collier, Martin (2006) Heart-like fair queuing algorithms (HLFQA). In: ISCN 2006 - International Symposium on Computer Networks, 16-18 June 2006, Istanbul, Turkey. ISBN 1-4244-0491-6
Abstract
We propose a new family of fair, work conserving traffic scheduling mechanisms that imitate the behavior of the human heart in the cardiovascular system. The algorithms have MAX (where MAX is the maximum packet size) fairness and O(log N) complexity and thus compare favorably with existing algorithms. The algorithms are simple enough to be implemented in hardware
Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Event Type: | Conference |
| Refereed: | Yes |
| Uncontrolled Keywords: | computational complexity; packet switching; queueing theory; scheduling; telecommunication traffic; |
| Subjects: | Engineering > Telecommunication |
| DCU Faculties and Centres: | DCU Faculties and Schools > Faculty of Engineering and Computing > School of Electronic Engineering |
| Published in: | Proceedings of the 2006 International Symposium on Computer Networks. . Institute of Electrical and Electronics Engineers. ISBN 1-4244-0491-6 |
| Publisher: | Institute of Electrical and Electronics Engineers |
| Official URL: | http://dx.doi.org/10.1109/ISCN.2006.1662534 |
| Copyright Information: | ©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| ID Code: | 15514 |
| Deposited On: | 19 Jul 2010 15:07 by DORAS Administrator . Last Modified 19 Jul 2018 14:51 |
Documents
Full text available as:
Preview |
PDF
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
2MB |
Downloads
Downloads
Downloads per month over past year
Archive Staff Only: edit this record