Sciweavers

SPAA
2009
ACM

Approximation algorithms for time-constrained scheduling on line networks

14 years 4 months ago
Approximation algorithms for time-constrained scheduling on line networks
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a deadline. The goal of an algorithm is to maximize the number of packets that arrive to their destinations by their respective deadlines, given the network constraints. We consider the line network, and a setting where each node has a buffer of size B packets (where B can be fi
Harald Räcke, Adi Rosén
Added 25 Nov 2009
Updated 25 Nov 2009
Type Conference
Year 2009
Where SPAA
Authors Harald Räcke, Adi Rosén
Comments (0)