A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Packet loss effects on MPEG video sent over the public Internet
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Independent sets with domination constraints
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
Competitive buffer management with packet dependencies
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A survey of buffer management policies for packet switches
ACM SIGACT News
Buffer management for aggregated streaming data with packet dependencies
INFOCOM'10 Proceedings of the 29th conference on Information communications
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Competitive router scheduling with structured data
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We study an abstract setting, where the basic information units (called ''superpackets'') do not fit into a single packet, and are therefore spread over multiple packets. We assume that a superpacket is useful only if the number of its delivered packets is above a certain threshold. Our focus of attention is communication link ingresses, where large arrival bursts result in dropped packets. The algorithmic question we address is which packets to drop so as to maximize goodput. Specifically, suppose that each superpacket consists of k packets, and that a superpacket can be reconstructed if at most @b.k of its packets are lost, for some given parameter 0=0. Finally, we present some simulation results that demonstrate that the behavior of our algorithm in practice is far better than our worst-case analytical bounds.