Randomized algorithms
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
SIAM Journal on Computing
Providing qos guarantees in input-buffered crossbar switches with speedup
Providing qos guarantees in input-buffered crossbar switches with speedup
The inherent queuing delay of parallel packet switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On the speedup required for combined input- and output-queued switching
Automatica (Journal of IFAC)
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
On the speedup required for work-conserving crossbar switches
IEEE Journal on Selected Areas in Communications
Randomized scheduling algorithms for high-aggregate bandwidth switches
IEEE Journal on Selected Areas in Communications
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in short, PPS) in which a demultiplexing algorithm sends cells, arriving at rate R on N input-ports, through one of K intermediate slower switches, operating at rate rR.This paper presents lower bounds on the average queuing delay introduced by the PPS relative to an optimal work-conserving FCFS switch, for demultiplexing algorithms that does not have full and immediate information about the switch status. The bounds hold even if the algorithm is randomized.These lower bounds are shown to be asymptotically optimal through a new methodology for analyzing the maximal relative queuing delay; this clearly upper bounds their average relative queuing delay. The methodology is used to devise a new algorithm that relies on slightly out-dated global information on the switch status. It is also used to provide, for the first time, a complete proof of the maximum relative queuing delay provided by the fractional traffic dispatch [19, 22] algorithm.