A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm

Gordana GARDASEVIC  Soko DIVANOVIC  Milutin RADONJIC  Igor RADUSINOVIC  

Publication
IEICE TRANSACTIONS on Communications   Vol.E98-B   No.1   pp.201-208
Publication Date: 2015/01/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E98.B.201
Type of Manuscript: PAPER
Category: Network
Keyword: 
Dual Crosspoint Queued switch,  Quality of Service,  Largest Weighted Occupancy First scheduling algorithm,  latency,  cell loss probability,  

Full Text: PDF(1.1MB)
>>Buy this Article


Summary: 
Support of incoming traffic differentiation and Quality of Service (QoS) assurance is very important for the development of high performance packet switches, capable of separating traffic flows. In our previous paper, we proposed the implementation of two buffers at each crosspoint of a crossbar fabric that leads to the Dual Crosspoint Queued (DCQ) switch. Inside DCQ switch, one buffer is used to store the real-time traffic and the other for the non-real-time traffic. We also showed that the static priority algorithms can provide the QoS only for the real-time traffic due to their greedy nature that gives the absolute priority to that type of traffic. In order to overcome this problem, in our paper we propose the DCQ switch with the Largest Weighted Occupancy First scheduling algorithm that provides the desired QoS support for both traffic flows. Detailed analysis of the simulation results confirms the validity of proposed solution.