A deadline and minimal overhead scheduling algorithm for the WiMax logical scheduler (invited paper)

We present an algorithm for scheduling of packets according to deadline. The algorithm minimizes the total long-run overhead by clustering packets from the same Connection, under the constraint of minimal packet lost. We specify the core algorithm, as well as a number of additional requirements. We...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Mandelbrod, Matan
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Base stations Clustering algorithms Delay Electronic mail Jitter Paper technology Quality of service Resource management Scheduling algorithm WiMAX
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!