Introduction to algorithms
An optimal service policy for buffer systems
Journal of the ACM (JACM)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Loss-bounded analysis for differentiated services
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling policies for CIOQ switches
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
SIGACT news online algorithms column 4
ACM SIGACT News
Three dozen papers on online algorithms
ACM SIGACT News
Competitive weighted throughput analysis of greedy protocols on DAGs
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms (TALG)
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Competitive weighted throughput analysis of greedy protocols on DAGs
ACM Transactions on Algorithms (TALG)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Multiplexing packets with arbitrary deadlines in bounded buffers
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Bounded delay packet scheduling in a bounded buffer
Operations Research Letters
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Buffer overflow management with class segregation
Information Processing Letters
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.01 |
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied in the analysis of diverse models, one common property was evident: the analysis of input sequences composed solely of two different values is always substantially easier, and many results are known only for restricted value sequences. Motivated by this, we introduce our zero-one principle for switching networks which characterizes a wide range of algorithms for which achieving c-approximation (as well as c-competitiveness) with respect to sequences composed of 0's and 1's implies achieving c-approximation. The zero-one principle proves to be very efficient in the design of switching algorithms, and substantially facilitates their analysis. We present three applications. First, we consider the Multi-Queue QoS Switching model and design a 3-competitive algorithm, improving the result from [6]. Second, we study the Weighted Dynamic Routing problem on a line topology of length k and present a (k+1)-competitive algorithm, which improves and generalizes the results from [1,12]. As a third application, we consider the work of [11], that compares the performance of local algorithms to the global optimum in various network topologies, and generalize their results from 2-value sequences to arbitrary value sequences.