The throughput of data switches with and without speedup

By J. Dai, Balaji Prabhakar. Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000

453 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/de256f4b35510b8163abd29491cf6e3995074ba5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Rayadurgam Srikant
2. Ness B. Shroff
3. Devavrat Shah
4. Alexander L. Stolyar
5. Xiaojun Lin
6. Tutorial Paper
7. A. Mandelbaum
8. Hari Balakrishnan

In Hardware and Architecture

1. Hari Balakrishnan
2. Xiaojun Lin
3. Ness B. Shroff
4. Alexander L. Stolyar

Citations in the corpus

• The impact of imperfect scheduling on cross-Layer congestion control in wireless networks (2006, methodology): “The new algorithm uses Maximal Matching (MM) to compute the schedule at each time [ 31 ].”
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule (2004, background): “The set M is in fact the closure of our system's stability region M 0 , which is the set of arrival rate vectors = 1 I such that < for some (cf. Tassiulas and Ephremides 1992, McKeown et al. 1996, Dai and Prabhakar 2000, Armony and Bambos 1999, Andrews et al. 2004, Stolyar 2004).”
• The impact of imperfect scheduling on cross-layer rate control in wireless networks (2005, methodology): “The new algorithm uses Maximal Matching (MM) to compute the schedule at each time [21].”
• A tutorial on cross-layer optimization in wireless networks (2006, background): “The above policy is a natural extension of the maximal schedules considered for high-speed switches in [51], [53], and [54] and, for Bluetooth-like wireless networks, in [29].”
• Fastpass (2014, background): “From the literature on input-queued switches, it is well-known that any maximal matching provides 50% throughput guarantees [13, 3].”
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic (2004, background): “The Annals of Applied Probability 2004, Vol. 14, No. 1, 1–53 © Institute of Mathematical Statistics, 2004”
• Positive recurrence of piecewise Ornstein–Uhlenbeck processes and common quadratic Lyapunov functions (2011, background): “provides a solid mathematical foundation for He and Dai (2011), who devise an algorithm to numerically compute the stationary distribution of a piecewise OU process.”