Amortized efficiency of list update and paging rules
Communications of the ACM
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Online computation and competitive analysis
Online computation and competitive analysis
Bounded latency scheduling scheme for ATM cells
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Loss-bounded analysis for differentiated services
Journal of Algorithms
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Providing qos guarantees in input-buffered crossbar switches with speedup
Providing qos guarantees in input-buffered crossbar switches with speedup
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the speedup required for combined input- and output-queued switching
Automatica (Journal of IFAC)
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
Rate vs. buffer size: greedy information gathering on the line
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
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)
Rate vs. buffer size--greedy information gathering on the line
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Combined input and output queued (CIOQ) architectures with a moderate fabric speedup S 1 have come to play a major role in the design of high performance switches. The switch policy that controls such switches must consist of two components. A buffer management policy that controls admission to buffers, and a scheduling policy that is responsible for the transfer of packets from input butters to output buffers. The goal of the switch policy is to maximize the throughput of the switch. When all packets have a uniform value (or importance), this corresponds to the number of packets sent from the switch. When packets have variable values, this corresponds to the total value of the sent packets.We derive a number of scheduling policies for CIOQ switches and analyze their throughput using competitive analysis. We thus give for these policies a uniform throughput guarantee, regardless of specific traffic patterns. For the case of packets with uniform values we present a switch policy that is 3-competitive for any speedup. For the case of packets with variable values we propose two switch policies. One achieves a competitive ratio of 4S, and the other achieves a competitive ratio of 8 rain(k, 2 ⌈logα⌉), where k is the number of distinct packet values and α is the ratio between the largest and the smallest value.