A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Independent sets with domination constraints
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Theoretical Computer Science
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
Competitive buffer management with packet dependencies
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Stateless Distributed Gradient Descent for Positive Linear Programs
SIAM Journal on Computing
Peer-assisted texture streaming in metaverses
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Performing dynamically injected tasks on processes prone to crashes and restarts
DISC'11 Proceedings of the 25th international conference on Distributed computing
Competitive router scheduling with structured data
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Overflow management with multipart packets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.