DocumentCode
3219516
Title
The new MSMPS Packet Scheduling Algorithm for VOQ Switches
Author
Danilewicz, Grzegorz ; Dziuba, Marcin
Author_Institution
Commun. & Comput. Networks, Poznan Univ. of Technol., Poznan, Poland
fYear
2012
fDate
18-20 July 2012
Firstpage
1
Lastpage
5
Abstract
In this article we present the new algorithm Maximal Size Matching with Permanent Selection (MSMPS). This algorithm offers high efficiency with minimal MTD (Mean Time Delay). This algorithm based on permanent connections between inputs and outputs. When at least two connections without packets to send are found (empty connections), algorithm tries to convert them into better matching with the longest VOQ from the available. Simulations confirm that for large load our algorithm provides better efficiency than other algorithms.
Keywords
packet switching; queueing theory; scheduling; MSMPS packet scheduling; VOQ switches; maximal size matching; mean time delay; minimal MTD; permanent selection; Computer architecture; Fabrics; Load modeling; Scheduling; Scheduling algorithms; Signal processing algorithms; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Systems, Networks & Digital Signal Processing (CSNDSP), 2012 8th International Symposium on
Conference_Location
Poznan
Print_ISBN
978-1-4577-1472-6
Type
conf
DOI
10.1109/CSNDSP.2012.6292793
Filename
6292793
Link To Document