Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
A router architecture for real-time point-to-point networks
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Approximations for the disjoint paths problem in high-diameter planar networks
Journal of Computer and System Sciences
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Competitive weighted throughput analysis of greedy protocols on DAGs
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The network as a storage device: dynamic routing with bounded buffers
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
A survey of buffer management policies for packet switches
ACM SIGACT News
An O(log n)-competitive online centralized randomized packet-routing algorithm for lines
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Online packet-routing in grids with bounded buffers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
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 finite or infinite), and each edge has capacity C≥1. To the best of our knowledge this is the first work to study time-constrained scheduling in a setting when buffers can be of limited size. We give approximation algorithms that achieve (expected) approximation ratio of O(max{log*n--log*B,1}+max{log*Σ-log*C,1}), where n is the length of the line, and Σ is the maximum slack a message can have (the slack is the number of time steps a message can be idle and still arrive within its deadline). A special case of our setting is the setting of buffers of unlimited capacity and edge capacities 1, which has been previously studied by Adler et al. [2]. For this case our results considerably improve upon previous results: Via a slight modification of our algorithms we also obtain an approximation ratio of O(min{log*n,log*Σ,log*M}) (where M is the number of messages in the instance), which is a significant improvement upon the results of Adler et al.