APA (7th ed.) Citation

Zhao, C., & Lin, X. (2011). On the queue-overflow probabilities of a class of distributed scheduling algorithms. Computer networks (Amsterdam, Netherlands : 1999), 55(1), 343-355. https://doi.org/10.1016/j.comnet.2010.08.007

Chicago Style (17th ed.) Citation

Zhao, Can, and Xiaojun Lin. "On the Queue-overflow Probabilities of a Class of Distributed Scheduling Algorithms." Computer Networks (Amsterdam, Netherlands : 1999) 55, no. 1 (2011): 343-355. https://doi.org/10.1016/j.comnet.2010.08.007.

MLA (9th ed.) Citation

Zhao, Can, and Xiaojun Lin. "On the Queue-overflow Probabilities of a Class of Distributed Scheduling Algorithms." Computer Networks (Amsterdam, Netherlands : 1999), vol. 55, no. 1, 2011, pp. 343-355, https://doi.org/10.1016/j.comnet.2010.08.007.