In this paper, we examine the problem of packet scheduling in a single-hop multichannel system, with the goal of minimizing the average message waiting time. Such an objective function represents the delay incurred by the users before receiving the desired data. We show that the problem of finding a schedule with minimum message waiting time is NP-complete, by means of polynomial time reduction of the time table design problem to our problem. We present also several heuristics that result in outcomes very close to the optimal ones. We compare these heuristics by means of extensive simulations.
|Autori:||Martelli, F; Bonuccelli, MAURIZIO ANGELO|
|Titolo:||Minimum Message Waiting Time Scheduling in Distributed Systems|
|Anno del prodotto:||2013|
|Appare nelle tipologie:||1.1 Articolo in rivista|