Conference proceeding
A new low-delay matching algorithm for input-queued switches
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005, v 2005, pp 457-462
2005
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
This paper presents a randomized algorithm, called degree-sequenced matching (DSM), for scheduling packets in an input-queued switch. Previously known high-throughput, randomized algorithms implicitly prioritize the matching of ports with larger degrees and causes longer delays at the low-degree ports. Our algorithm, however, achieves a lower average delay but without compromising the throughput. The DSM algorithm sorts nodes based on their node-degrees and begin each iteration of the algorithm by matching the lowest degree nodes. Using real gateway traffic traces as well as synthetically generated traffic, we present simulation results showing that DSM achieves a low average delay, while still achieving near maximum throughput.
Metrics
2 Record Views
Details
- Title
- A new low-delay matching algorithm for input-queued switches
- Creators
- M Hosaagrahara - Drexel UniversityH Sethu - Drexel University
- Publication Details
- Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005, v 2005, pp 457-462
- Publisher
- IEEE
- Resource Type
- Conference proceeding
- Language
- English
- Web of Science ID
- WOS:000234639500067
- Scopus ID
- 2-s2.0-33748342551
- Other Identifier
- 991019312442204721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Information Systems
- Telecommunications