Inter-server coordinated scheduling is a mechanism for dowstream nodes to increase or decrease a packet's priority according to the congestion incurred at upstream nodes. In this paper, we derive an end-to-end schedulability condition for a broad class of coordinated schedulers that includes \CJVC\ and CEDF. In contrast to previous approaches, our technique purposely allows flows to violate their local priority indexes while still providing an end-to-end delay bound. We show that under a simple priority assignment scheme, coordinated schedulers can outperform \WFQ\ schedulers, while replacing per-flow scheduling operations with a simple coordination rule. Finally, we illustrate the performance advantages of coordination through numerical examples and simulation experiments.
%0 Book Section
%1 Li2001743
%A Li, Chengzhi
%A Knightly, Edward W.
%B Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7
%D 2001
%E Jorge Moreira de Souza, Nelson L.S. da Fonseca
%E de Souza e Silva, Edmundo A.
%I Elsevier
%K itc itc17
%P 743 - 756
%R http://dx.doi.org/10.1016/S1388-3437(01)80166-9
%T Schedulability criterion and performance analysis of coordinated schedulers
%V 4
%X Inter-server coordinated scheduling is a mechanism for dowstream nodes to increase or decrease a packet's priority according to the congestion incurred at upstream nodes. In this paper, we derive an end-to-end schedulability condition for a broad class of coordinated schedulers that includes \CJVC\ and CEDF. In contrast to previous approaches, our technique purposely allows flows to violate their local priority indexes while still providing an end-to-end delay bound. We show that under a simple priority assignment scheme, coordinated schedulers can outperform \WFQ\ schedulers, while replacing per-flow scheduling operations with a simple coordination rule. Finally, we illustrate the performance advantages of coordination through numerical examples and simulation experiments.
@incollection{Li2001743,
abstract = {Inter-server coordinated scheduling is a mechanism for dowstream nodes to increase or decrease a packet's priority according to the congestion incurred at upstream nodes. In this paper, we derive an end-to-end schedulability condition for a broad class of coordinated schedulers that includes \CJVC\ and CEDF. In contrast to previous approaches, our technique purposely allows flows to violate their local priority indexes while still providing an end-to-end delay bound. We show that under a simple priority assignment scheme, coordinated schedulers can outperform \WFQ\ schedulers, while replacing per-flow scheduling operations with a simple coordination rule. Finally, we illustrate the performance advantages of coordination through numerical examples and simulation experiments. },
added-at = {2016-07-12T14:53:52.000+0200},
author = {Li, Chengzhi and Knightly, Edward W.},
biburl = {https://www.bibsonomy.org/bibtex/2e23cbcce49c09ecc02e3fae201e556ea/itc},
booktitle = {Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7},
doi = {http://dx.doi.org/10.1016/S1388-3437(01)80166-9},
editor = {Jorge Moreira de Souza, Nelson L.S. da Fonseca and de Souza e Silva, Edmundo A.},
interhash = {a453fd420583bc95e6c39fe7c1b975db},
intrahash = {e23cbcce49c09ecc02e3fae201e556ea},
issn = {1388-3437},
keywords = {itc itc17},
pages = {743 - 756},
publisher = {Elsevier},
series = {Teletraffic Science and Engineering },
timestamp = {2020-04-30T18:17:29.000+0200},
title = {Schedulability criterion and performance analysis of coordinated schedulers },
volume = 4,
year = 2001
}