IEICE TRANSACTIONS on Communications
A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E98-B No.1 pp.201-208
- Publication Date
- 2015/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E98.B.201
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Gordana GARDASEVIC
University of Banja Luka
Soko DIVANOVIC
University of Montenegro
Milutin RADONJIC
University of Montenegro
Igor RADUSINOVIC
University of Montenegro
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Gordana GARDASEVIC, Soko DIVANOVIC, Milutin RADONJIC, Igor RADUSINOVIC, "A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 1, pp. 201-208, January 2015, doi: 10.1587/transcom.E98.B.201.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.201/_p
Copy
@ARTICLE{e98-b_1_201,
author={Gordana GARDASEVIC, Soko DIVANOVIC, Milutin RADONJIC, Igor RADUSINOVIC, },
journal={IEICE TRANSACTIONS on Communications},
title={A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm},
year={2015},
volume={E98-B},
number={1},
pages={201-208},
abstract={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.},
keywords={},
doi={10.1587/transcom.E98.B.201},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm
T2 - IEICE TRANSACTIONS on Communications
SP - 201
EP - 208
AU - Gordana GARDASEVIC
AU - Soko DIVANOVIC
AU - Milutin RADONJIC
AU - Igor RADUSINOVIC
PY - 2015
DO - 10.1587/transcom.E98.B.201
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2015
AB - 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.
ER -
English
