Universidad de Castilla-La Mancha
 
Departamento de Sistemas Informáticos





 
Technical Report
 
Código: DIAB-06-02-1
Fecha Publicación: 16-02-2006
Título: Decoupling the bandwidth and latency bounding for table-based schedulers
Detalle: The provision of Quality of Service (QoS) in computing and communication environments is currently the focus of much discussion and research in industry and academia. A key component for networks with QoS support is the output scheduling algorithm. Some of the latest network technology proposals define scheduling algorithms that use an arbitration table to select the next packet to be transmitted. These table-based schedulers are simple to implement and can offer good latency bounds. However, they face the problem of bounding the bandwidth and latency assignments. Moreover, this kind of scheduler does not work properly with variable packet sizes. In this paper, we propose a methodology to decouple the bandwidth and latency assignments. We also propose a new table-based scheduler, which we call Deficit Table (DTable), that works properly with variable packet sizes. This work has been submitted to the International Conference on Parallel Processing (ICPP'2006)



 
Autores
 
Autor Detalles
MARTINEZ MORAIS, RAUL
ALFARO CORTES, FRANCISCO JOSÉ
SÁNCHEZ GARCÍA, JOSÉ LUIS



 
Ficheros
 
Fichero Bytes Detalles
TR_ICPP06.pdf 369.5K

 

Sindicación     Sindicación     Sindicación
Curso: 2017-18
© Departamento de Sistemas Informáticos
ESII - Avda. de España s/n
02071 Albacete
Tfno: 967 59 92 00 - Fax: 967 59 92 24

aviso legal