An optimal service policy for buffer systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Loss-bounded analysis for differentiated services
Journal of Algorithms
Scheduling policies for CIOQ switches
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Nearly optimal FIFO buffer management for two packet classes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Improved Competitive Performance Bounds for CIOQ Switches
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms (TALG)
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A survey of buffer management policies for packet switches
ACM SIGACT News
Rate vs. buffer size--greedy information gathering on the line
ACM Transactions on Algorithms (TALG)
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Hi-index | 0.00 |
The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most general model that has been investigated is the standard CIOQ (Combined Input and Output Queued) switch architecture with internal fabric speedup S ≥ 1. CIOQ switches, that comprise the backbone of packet routing networks, are N × N switches controlled by a switching policy that incorporates two components: Admission control and scheduling. An admission control strategy is essential to determine the packets stored in the FIFO queues in input and output ports, while the scheduling policy conducts the transfer of packets through the internal fabric, from input ports to output ports. The online problem of maximizing the total weighted throughput of CIOQ switches was recently investigated by Kesselman and Rosén [2003]. They presented two different online algorithms for the general problem that achieve non-constant competitive ratios (linear in either the speedup or the number of distinct values, or logarithmic in the value range). We introduce the first constant-competitive algorithm for the general case of the problem, with arbitrary speedup and packet values. Specifically, our algorithm is 8-competitive, and is also simple and easy to implement.