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

• Type: Conference
• Year: 2009
• Where: SPAA
• Authors: Harald Räcke, Adi Rosén
• Keywords: Communication Network, Network Constraints, Parallel Computing, Respective Deadlines, SPAA 2009