Treffer: A distributed QoS scheduler for smoothing output traffic of input buffered switches

Title:
A distributed QoS scheduler for smoothing output traffic of input buffered switches
Authors:
CHOY, Man-Ting, LEE, Tony T
Source:
NETWORKING 2006 (networking technologies, services, protocols)Lecture notes in computer science. :256-267
Publisher Information:
Berlin; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 14 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité calcul, Computational complexity, Complejidad computación, Contrôle accès, Access control, Entrée sortie, Input output, Entrada salida, Gestion trafic, Traffic management, Gestión tráfico, Lissage, Smoothing, Alisamiento, Ordonnancement, Scheduling, Reglamento, Qualité service, Service quality, Calidad servicio, Retard borné, Bounded delay, Retardo limitado, Système réparti, Distributed system, Sistema repartido, Système tampon, Buffer system, Sistema amortiguador, Temps attente, Waiting time, Tiempo espera
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Information Engineering, The Chinese University of Hong Kong, Hong-Kong
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19008111
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19008111
Database:
PASCAL Archive

Weitere Informationen

To provide stringent service guarantees such as latency and backlog bounds for input-buffered switches, a set of scheduling algorithm and admission control strategy is proposed. This set of traffic control strategy is primarily based on a single-server scheduling algorithm called Smoothed Round Robin (SRR). SRR possesses a number of advantages which are very attractive to the implementation of input buffered switch. SRR is on order O(1) which requires minimal computational complexity. Secondly, SRR gives good delay bounds and fairness performance for each session. Thirdly, SRR can decompose a sequence into fixed size groups. In this way, by maintaining a SRR scheduler in each output port, scheduling can be performed in a distributed manner which largely reduces the complexity of the algorithm.