Abstract
We present two new scheduling algorithms, the Maximal Matching with Random Selection (MMRS) and the Maximal Matching with Round-Robin Selection (MMRRS). These algorithms provide high throughput and fair access in a packet switch that uses multiple input queues. They are based on finding a maximal matching between input and output ports without iterations. Simulations performed show that for large load these algorithms perform better than other iterative algorithms. © Springer-Verlag 2004.
Cite
CITATION STYLE
Baranowska, A., & Kabaciński, W. (2004). The new packet scheduling algorithms for VOQ switches. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 711–716. https://doi.org/10.1007/978-3-540-27824-5_95
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
