Fetching the paper…
Reading the bibliography…
Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch.
R. A. Fisher and F. Yates,
1938
Earlier work this paper cites.
D. Blackwell, “On an equation of wald,”
1946
Earlier work this paper cites.
M. L. Balinski and R. E. Gomory, “A primal method for the assignment and transportation problems,”
1964
Earlier work this paper cites.
B. Hajek, “Hitting-time and occupation-time bounds implied by drift analysis with applications,”
1982
Earlier work this paper cites.
L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,”
1992
Earlier work this paper cites.
L. Tassiulas, “Linear complexity algorithms for maximum throughput in radio networks and input queued switches,” in
1998
Earlier work this paper cites.
N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100% throughput in an input-queued switch,”
1999
Earlier work this paper cites.
N. McKeown, “The islip scheduling algorithm for input-queued switches,”
1999
Earlier work this paper cites.
D. Shah and M. Kopikare, “Delay bounds for approximate maximum weight matching algorithms for input queued switches,” in
2002
Earlier work this paper cites.
D. Shah, P. Giaccone, and B. Prabhakar, “Efficient randomized algorithms for input-queued switch scheduling,”
2002
Earlier work this paper cites.
C.-S. Chang, D.-S. Lee, and Y.-S. Jou, “Load balanced birkhoff-von neumann switches, part i: One-stage buffering,”
2002
Cited alongside, same era.
P. Giaccone, B. Prabhakar, and D. Shah, “Randomized scheduling algorithms for high-aggregate bandwidth switches,”
2003
Cited alongside, same era.
A. L. Stolyar
2004
Cited alongside, same era.
M. J. Neely, E. Modiano, and Y.-S. Cheng, “Logarithmic delay for
2007
Cited alongside, same era.
J. Dattorro,
2010
Cited alongside, same era.
D. Shah, J. N. Tsitsiklis, and Y. Zhong, “Optimal scaling of average queue sizes in an input-queued switch: an open problem,”
2011
Cited alongside, same era.
D. Shah, N. S. Walton, and Y. Zhong, “Optimal queue-size scaling in switched networks,”
2014
Later among the works it cites.
R. Srikant and L. Ying,
2014
Later among the works it cites.
S. T. Maguluri and R. Srikant, “Heavy traffic queue length behavior in a switch under the maxweight algorithm,”
2016
Later among the works it cites.
S. T. Maguluri, S. K. Burle, and R. Srikant, “Optimal heavy-traffic queue length scaling in an incompletely saturated switch,” in
2016
Later among the works it cites.
D. Shah, J. N. Tsitsiklis, and Y. Zhong, “On queue-size scaling for input-queued switches,”
2016
Later among the works it cites.
Y. Lu, S. Maguluri, M. Squillante, T. Suk, and X. Wu, “An optimal scheduling policy for the 2 x 2 input-queued switch with symmetric arrival rates,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Duan and H.-H. Su, “A scaling algorithm for maximum weight matching in bipartite graphs,” in
2012
Cited alongside, same era.
G. M. Ziegler,
2012
Cited alongside, same era.
M. Alizadeh, S. Yang, M. Sharif, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker, “pFabric: Minimal near-optimal datacenter transport,”
2013
Cited alongside, same era.
J. Perry, A. Ousterhout, H. Balakrishnan, D. Shah, and H. Fugal, “Fastpass: a centralized" zero-queue" datacenter network,” in
2014
Cited alongside, same era.
2018
Later among the works it cites.
2019
Later among the works it cites.
D. Hurtado-Lange and S. T. Maguluri, “Heavy-traffic analysis of queueing systems with no complete resource pooling,” 2019
2019
Later among the works it cites.
J. Xu and Y. Zhong, “Improved queue-size scaling for input-queued switches via graph factorization,” in
2019
Later among the works it cites.