Priority queue schedulers with approximate sorting in output-buffered switches.

All recently proposed packet-scheduling algorithms for output-buffered switches that support quality-of-service (QoS) transmit packets in some priority order, e.g., according to deadlines, virtual finishing times, eligibility times, or other time stamps that are associated with a packet. Since maint...

ver descrição completa

Detalhes bibliográficos
Publicado no:	IEEE Journal on selected areas in communications 17, 6 (1999).
Autor principal:	Liebeherr, J.
Formato:	Artigo
Idioma:	inglês
Assuntos:	EDF scheduler. FIFO queues. MPEG video. QoS. Approximate sorting. Earliest-deadline-first scheduler. Output-buffered switch. Output-buffered switches. Overhead. Packet-scheduling algorithms. Prioritized first-in/first-out queues. Priority order. Priority queue schedulers. Quality-of-service. Sorted priority queue. Worst-case delays.