Stochastic fairness queueing
Abstract
A class of algorithms called stochastic fairness queuing is presented. The algorithms are probabilistic variants of fairness queuing. They do not require an exact mapping and thus are suitable for high-speed software or firmware implementation. The algorithms span a broad range of CPU, memory, and fairness tradeoffs. It is shown that the worst-case execution-speed stochastic fairness queuing is faster than the best-case execution speed of all of the implementations of fair queuing presented. This advantage is larger for protocols with longer addresses, e.g. the ISO protocol suite.>
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Several tests on simulated network topologies reveal that most generated RemyCCs provide a better balance between throughput and delay compared to standard TCP and its enhanced variants including TCP-Vegas, TCP-Cubic, and SFQ-CD.
“Several tests on simulated network topologies, such as cellular and data center networks, reveal that most of the generated RemyCCs provide a better balance between throughput and delay, in comparison to the standard TCP and its many enhanced variants, including TCP-Vegas, TCP-Cubic [174], and TCP-Cubic over Stochastic Fair Queuing [304] with Controlled-Delay AQM [340] (SFQ-CD).”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [304]
Cites
Congestion avoidance and control
Jacobson, V. L. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,306 · see citing works
Congestion avoidance and control
Jacobson, V. (1988) · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/52324.52356 · Cited by 4,650 · see citing works
Analysis and simulation of a fair queueing algorithm
Demers, A. J., Keshav, S., & Shenker, S. J. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,616 · see citing works
Analysis and simulation of a fair queueing algorithm
Demers, A. J., Keshav, S., & Shenker, S. J. (1989) · doi:10.1145/75246.75248 · Cited by 1,730 · see citing works
On Packet Switches with Infinite Storage
Nagle, J. (1987) · IEEE Transactions on Communications · doi:10.1109/tcom.1987.1096782 · Cited by 384 · see citing works
Congestion Avoidance in Computer Networks with a Connectionless Network LayerPreprint
Jain, R. K., Ramakrishnan, K. K., & Chiu, D. M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809094 · Cited by 164 · see citing works
A new architecture for packet switching network protocols
Zhang, L. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 152 · see citing works
A comparison of hashing schemes for address lookup in computer networks
Jain, R. K. (1992) · IEEE Transactions on Communications · doi:10.1109/26.168785 · Cited by 99 · see citing works
Voice flow control in integrated packet networks
Hayden, H. P. (1981) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 46 · see citing works
The next generation of internetworking
Parulkar, G. M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/86587.86588 · Cited by 36 · see citing works
Congestion control in BBN packet-switched networks
Robinson, J., Friedman, D., & Steenstrup, M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/86587.86592 · Cited by 19 · see citing works
High-Speed Event Counting and Classification Using a Dictionary Hash Technique.
McKenney, P. E. (1989) · Cited by 9 · see citing works
Self-citationEstimated Performance of a Gateway Routing-Table Cache.
Feldmeier, D. C. (1988) · Cited by 4 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,437 · see citing works
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,647 · see citing works
Efficient fair queuing using deficit round-robin
Shreedhar, M., & Varghese, G. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.502236 · Cited by 1,399 · see citing works
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036 · see citing works
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576 · see citing works
Efficient fair queueing using deficit round robin
Shreedhar, M., & Varghese, G. (1995) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/217382.217453 · Cited by 556 · see citing works
Hierarchical packet fair queueing algorithms
Bennett, J. C. R., & Zhang, H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649568 · Cited by 432 · see citing works
CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
Pan, R., Balaji Prabhakar, B., & Psounis, K. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832269 · Cited by 417 · see citing works
Morris, R., Kohler, E., Jannotti, J., & Kaashoek, M. F. (1999) · doi:10.1145/319151.319166 · Cited by 370 · see citing works
Efficient fair queueing using deficit round robin
Shreedhar, M., & Varghese, G. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/217391.217453 · Cited by 347 · see citing works
Controlling high-bandwidth flows at the congested router
Mahajan, R., Floyd, S., & Wetherall, D. J. (2005) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2001.992899 · Cited by 335 · see citing works
Winstein, K., & Balakrishnan, H. (2013) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2486001.2486020 · Cited by 332 · see citing works
BLUE: A New Class of Active Queue Management Algorithms
Fengy, W.-C., Kandlurz, D. D., Sahaz, D., & Shiny, K. G. (1999) · Cited by 298 · see citing works
Programmable Packet Scheduling at Line Rate
Sivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, S.-T., Agrawal, A., Balakrishnan, H., Edsall, T., Katti, S., & McKeown, N. (2016) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2934872.2934899 · Cited by 284 · see citing works
Stochastic fair blue: a queue management algorithm for enforcing fairness
Feng, W.-C., Kandlur, D. D., Saha, D., & Shin, K. G. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916648 · Cited by 263 · see citing works
Winstein, K., & Balakrishnan, H. (2013) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2534169.2486020 · Cited by 229 · see citing works
Reducing Internet Latency: A Survey of Techniques and Their Merits
Briscoe, B., Brunström, A., Petlund, A., Hayes, D. A., Ros, D., Tsang, I.-J., Gjessing, S., Fairhurst, G., Griwodz, C., & Welzl, M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2375213 · Cited by 201 · see citing works
Liu, X., Yang, X., & Lu, Y. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402981 · Cited by 180 · see citing works
TVA: A DoS-Limiting Network Architecture
Yang, X., Wetherall, D. J., & Anderson, T. E. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.914506 · Cited by 157 · see citing works
User-level internet path diagnosis
Mahajan, R., Spring, N. T., Wetherall, D. J., & Anderson, T. E. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945456 · Cited by 151 · see citing works
Approximate fairness through differential dropping
Pan, R., Breslau, L., Balaji Prabhakar, B., & Shenker, S. J. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956981.956985 · Cited by 141 · see citing works
A framework for alternate queueing: towards traffic management by PC-UNIX based routers
Cho, K. (1998) · Cited by 115 · see citing works
Goyal, P., Shah, P., Sharma, N. K., Alizadeh, M., & Anderson, T. E. (2019) · doi:10.1145/3375235.3375239 · Cited by 111 · see citing works
Programmable packet scheduling with a single queue
Yu, Z., Hu, C., Wu, J., Sun, X., Braverman, V., Chowdhury, M., Liu, Z., & Jin, X. (2021) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3452296.3472887 · Cited by 103 · see citing works
The design and implementation of network puzzles
Feng, W.-C., Kaiser, E., Feng, W., & Luu, A. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498523 · Cited by 96 · see citing works
An experimental study of the learnability of congestion control
Sivaraman, A., Winstein, K., Thaker, P., & Balakrishnan, H. (2014) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2619239.2626324 · Cited by 96 · see citing works
Defending against Distributed Denial of Service Attacks: Issues and Challenges
Gupta, B. B., Joshi, R. C., & Misra, M. (2009) · Information Security Journal A Global Perspective · doi:10.1080/19393550903317070 · Cited by 94 · see citing works
Approximating Fair Queueing on Reconfigurable Switches
Sharma, N. K., Liu, M., Atreya, K., & Krishnamurthy, A. (2018) · Networked Systems Design and Implementation · Cited by 91 · see citing works
User-level internet path diagnosis
Mahajan, R., Spring, N. T., Wetherall, D. J., & Anderson, T. E. (2003) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/945445.945456 · Cited by 89 · see citing works
Liu, X., Yang, X., & Lu, Y. (2008) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1402958.1402981 · Cited by 89 · see citing works
Control of Multiple Packet Schedulers for Improving QoS on OpenFlow/SDN Networking
Ishimori, A., Farias, F. N. N., Cerqueira, E., & Abelém, A. (2013) · European Workshop on Software Defined Networks (EWSDN) · doi:10.1109/ewsdn.2013.20 · Cited by 84 · see citing works
Random drop congestion control
Mankin, A. (1990) · ACM SIGCOMM Symposium on Communications Architectures and Protocols (SIGCOMM) · doi:10.1145/99508.99521 · Cited by 79 · see citing works
Sivaraman, A., Winstein, K., Subramanian, S., & Balakrishnan, H. (2013) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/2535771.2535796 · Cited by 78 · see citing works
Gateway Congestion Control Survey
Mankin, A., & Ramakrishnan, K. (1991) · doi:10.17487/rfc1254 · Cited by 76 · see citing works
The TCP outcast problem: exposing unfairness in data center networks
Prakash, P., Dixit, A. A., Hu, Y., & Kompella, R. R. (2012) · Purdue e-Pubs (Purdue University System) · Cited by 73 · see citing works
Netshare and stochastic netshare
Lam, V. T., Radhakrishnan, S., Pan, R., Vahdat, A. M., & Varghese, G. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2317307.2317309 · Cited by 73 · see citing works
Seelam, S., & Teller, P. J. (2007) · ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE) · doi:10.1145/1254810.1254826 · Cited by 70 · see citing works
Fairness-Driven Queue Management: A Survey and Taxonomy
Abbas, G., Halim, Z., & Abbas, Z. H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2463121 · Cited by 54 · see citing works
An experimental study of the learnability of congestion control
Sivaraman, A., Winstein, K., Thaker, P., & Balakrishnan, H. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2740070.2626324 · Cited by 54 · see citing works
Varghese, G. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888215-c28 · Cited by 53 · see citing works
The Good, the Bad and the WiFi: Modern AQMs in a residential setting
Høiland-Jørgensen, T., Hurtig, P., & Brunström, A. (2015) · Computer Networks · doi:10.1016/j.comnet.2015.07.014 · Cited by 52 · see citing works
Distributed mechanism in detecting and defending against the low-rate TCP attack
Sun, H., Lui, J. C. S., & Yau, D. K. Y. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.09.016 · Cited by 46 · see citing works
Sharing Bandwidth by Allocating Switch Buffer in Data Center Networks
Zhang, J., Ren, F., Yue, X., Shu, R., & Lin, C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.140105 · Cited by 45 · see citing works
Fighting the bufferbloat: On the coexistence of AQM and low priority congestion control
Gong, Y., Rossi, D., Testa, C., Valenti, S., & Täht, D. (2014) · Computer Networks · doi:10.1016/j.bjp.2014.01.009 · Cited by 45 · see citing works
Adaptive mean queue size and its rate of change: queue management with random dropping
Karmeshu, Patel, S., & Bhatnagar, S. (2016) · Telecommunication Systems · doi:10.1007/s11235-016-0229-4 · Cited by 42 · see citing works
Performance study of dynamic QoS management for OpenFlow-enabled SDN switches
Durner, R., Blenk, A., & Kellerer, W. (2015) · International Workshop on Quality of Service · doi:10.1109/iwqos.2015.7404730 · Cited by 41 · see citing works
Understanding CHOKe: Throughput and Spatial Characteristics
Tang, A., Wang, J., & Low, S. H. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.833162 · Cited by 40 · see citing works
Cho, K. (1999) · Cited by 33 · see citing works
Improving Internet congestion control and queue management algorithms.
Feng, W.-C., & Shin, K. G. (1999) · Cited by 32 · see citing works
Packet-size aware scheduling algorithms in guard band for time sensitive networking
Zhang, C., Wang, Y., Yao, R., Zhou, B., Cheng, L., Xu, Y., Li, X., Cheng, J., & Liu, B. (2020) · CCF Transactions on Networking · doi:10.1007/s42045-020-00031-0 · Cited by 31 · see citing works
Active Queue Management as Quality of Service Enabler for 5G Networks
Irazabal, M., López-Aguilera, E., & Demirkol, I. (2019) · European Conference on Networks and Communications · doi:10.1109/eucnc.2019.8802027 · Cited by 30 · see citing works
Dynamic Buffer Sizing and Pacing as Enablers of 5G Low-Latency Services
Irazabal, M., López-Aguilera, E., Demirkol, I., & Nikaein, N. (2020) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.3017011 · Cited by 28 · see citing works
Is the ''Law of the Jungle'' Sustainable for the Internet?
Bonald, T., Feuillet, M., & Proutière, A. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061903 · Cited by 26 · see citing works
Design and evaluation of a high-performance dynamically extensible router
Kuhns, F., DeHart, J. D., Kantawala, A., Keller, R., Lockwood, J. W., Pappu, P., Richard, D., Taylor, D. E., Parwatikar, J. K., Spitznagel, E. W., et al. (2003) · DARPA Active Networks Conference and Exposition (DANCE) · doi:10.1109/dance.2002.1003483 · Cited by 26 · see citing works
Dynamic control of RLC buffer size for latency minimization in mobile RAN
Kumar, R., Francini, A., Panwar, S. S., & Sharma, S. (2018) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2018.8377190 · Cited by 25 · see citing works
Preventing RLC Buffer Sojourn Delays in 5G
Irazabal, M., López-Aguilera, E., Demirkol, I., Schmidt, R., & Nikaein, N. (2021) · IEEE Access · doi:10.1109/access.2021.3063769 · Cited by 25 · see citing works
TC-RAN: A Programmable Traffic Control Service Model for 5G/6G SD-RAN
Irazabal, M., & Nikaein, N. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3336162 · Cited by 25 · see citing works
Evaluating CoDel, PIE, and HRED AQM techniques with load transients
Järvinen, I., & Kojo, M. (2014) · Conference on Local Computer Networks · doi:10.1109/lcn.2014.6925768 · Cited by 25 · see citing works
Active Queue Management for Flow Fairness and Stable Queue Length
Kim, J.-H., Yoon, H., & Yeom, I. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.104 · Cited by 25 · see citing works
Kuhn, N., Lochin, E., & Mehani, O. (2014) · doi:10.1145/2630088.2630094 · Cited by 24 · see citing works
Controlling queuing delays for real-time communication
Carlucci, G., Cicco, L. D., & Mascolo, S. (2018) · ACM SIGCOMM Computer Communication Review · doi:10.1145/3243157.3243158 · Cited by 24 · see citing works
A Survey on Congestion Control
Subramani, B., & Chandra, E. (2010) · Global Journal of Computer Science and Technology · Cited by 24 · see citing works
PIPO: Efficient Programmable Scheduling for Time Sensitive Networking
Zhang, C., Chen, Z., Song, H., Yao, R., Xu, Y., Wang, Y., Ji, M., & Liu, B. (2021) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp52444.2021.9651944 · Cited by 23 · see citing works
Tang, A., Wang, J., & Low, S. H. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208664 · Cited by 23 · see citing works
Fighting the bufferbloat: On the coexistence of AQM and low priority congestion control
Gong, Y., Rossi, D., Testa, C., Valenti, S., & Taht, M. D. (2013) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2013.6567153 · Cited by 22 · see citing works
Boosting TCP & QUIC Performance in mmWave, Terahertz, and Lightwave Wireless Networks: A Survey
Khorov, E., Krasilov, A., Susloparov, M., & Kong, L. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3301820 · Cited by 21 · see citing works
On the Future of Congestion Control for the Public Internet
Brown, L., Ananthanarayanan, G., Katz-Bassett, E., Krishnamurthy, A., Ratnasamy, S., Schapira, M., & Shenker, S. J. (2020) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/3422604.3425939 · Cited by 21 · see citing works
DeepQoS: Core-Stateless Hierarchical QoS in Programmable Switches
Fejes, F., Nádas, S., Gombos, G., & Laki, S. (2022) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2022.3152017 · Cited by 20 · see citing works
Achieving Per-Flow Fairness and High Utilization With Limited Priority Queues in Data Center
Liu, J., Huang, J., Li, Z., Li, Y., Wang, J., & He, T. (2022) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2022.3172749 · Cited by 20 · see citing works
Mitigating congestion based DoS attacks with an enhanced AQM technique
Bedi, H. S., Roy, S., & Shiva, S. G. (2014) · Computer Communications · doi:10.1016/j.comcom.2014.09.002 · Cited by 20 · see citing works
Receiver-Side TCP Countermeasure to Bufferbloat in Wireless Access Networks
Im, H., Joo, C., Lee, T., & Bahk, S. (2015) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2015.2483494 · Cited by 20 · see citing works
Towards Fine-Grained and Practical Flow Control for Datacenter Networks
Li, W., Zeng, C., Hu, J., & Chen, K. (2023) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp59255.2023.10355582 · Cited by 19 · see citing works
Global synchronization protection for bandwidth sharing TCP flows in high-speed links
Lautenschlaeger, W., & Francini, A. (2015) · IEEE International Conference on High Performance Switching and Routing (HPSR) · doi:10.1109/hpsr.2015.7483103 · Cited by 19 · see citing works
The New AQM Kids on the Block: Much Ado About Nothing?
Khademi, N., Ros, D., & Welzl, M. (2013) · NORA - Norwegian Open Research Archives · Cited by 19 · see citing works
Approximate fair dropping for variable length packets
Psounis, K., Pan, R., & Balaji Prabhakar, B. (2001) · IEEE Micro · doi:10.1109/40.903061 · Cited by 18 · see citing works
A stochastic approximation approach to active queue management
Bhatnagar, S., Patel, S., & Karmeshu (2017) · Telecommunication Systems · doi:10.1007/s11235-017-0377-1 · Cited by 18 · see citing works
Stochastic RED and Its Applications
Chen, S., Zhou, Z., & Bensaou, B. (2007) · International Conference on Communications · doi:10.1109/icc.2007.1053 · Cited by 18 · see citing works
Comparison and analysis of the revenue-based adaptive queuing models
Sayenko, A., Hämäläinen, T., Joutsensalo, J., & Kannisto, L. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.09.002 · Cited by 17 · see citing works
Priority Queues with Fractional Service for Tiered Delay QoS
Chang, G., & Lee, C. (2015) · Future Internet · doi:10.3390/fi8010001 · Cited by 17 · see citing works
Fighting the bufferbloat: On the coexistence of AQM and low priority congestion control
Gong, Y., Rossi, D., Testa, C., Valenti, S., & Taht, M. D. (2013) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2013.6562885 · Cited by 17 · see citing works
Queue management for short-lived TCP flows in backbone routers
Kantawala, A., & Turner, J. (2003) · Globecom · doi:10.1109/glocom.2002.1189057 · Cited by 17 · see citing works
Link-Coupled TCP for 5G networks
Beshay, J. D., Nasrabadi, A. T., Prakash, R., & Francini, A. (2017) · International Workshop on Quality of Service · doi:10.1109/iwqos.2017.7969170 · Cited by 16 · see citing works
Fair and efficient router congestion control
Gao, X., Jain, K. K., & Schulman, L. J. (2004) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/982792.982948 · Cited by 16 · see citing works
Fairness and Performance Isolation: an Analysis of Disk Scheduling Algorithms
Seelam, S., & Teller, P. J. (2006) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/clustr.2006.311899 · Cited by 16 · see citing works
An assessment of state and lookup overhead in routers
Estrin, D. L., & Mitzel, D. J. (1992) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1992.263523 · Cited by 16 · see citing works
Adaptive scheduling algorithm for media-optimized traffic management in software defined networks
Pop, F., Dobre, C., Comăneci, D., & Kołodziej, J. (2014) · Computing · doi:10.1007/s00607-014-0406-9 · Cited by 15 · see citing works
CKRM: Class-based Prioritized Resource Control in Linux
Franke, H., Nagar, S., Choi, J.-H., Kravetz, M., Seetharaman, C., Kashyap, V. K., Singhvi, N., Kaplan, S. F., Zheng, H., & Kong, J. A. (2003) · Cited by 15 · see citing works
Packet Scheduling for Link-Sharing and Quality of Service Support in Wireless Local Area Networks
Wischhof, L. (2001) · Open Scholarship Institutional Repository (Washington University in St. Louis) · doi:10.7936/k7kk9949 · Cited by 15 · see citing works
An Approach to Support Traffic Classes in IP Networks
Quadros, G., Alves, A., Monteiro, E., & Boavida, F. (2000) · Lecture notes in computer science · doi:10.1007/3-540-39939-9_23 · Cited by 15 · see citing works
Defeating Network Jitter for Virtual Machines
Cheng, L., Wang, C., & Di, S. (2011) · IEEE/ACM International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc.2011.19 · Cited by 14 · see citing works
Towards approximate fair bandwidth sharing via dynamic priority queuing
Cascone, C., Bonelli, N., Bianchi, L., Capone, A., & Sansò, B. (2017) · IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) · doi:10.1109/lanman.2017.7972168 · Cited by 14 · see citing works
Enhancing Fairness for Approximate Weighted Fair Queueing With a Single Queue
Chen, W., Tian, Y., Yu, X., Zheng, B., & Zhang, X. (2024) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2024.3399212 · Cited by 13 · see citing works
Virtual 802.11 wireless networks with guaranteed throughout sharing
Katsalis, K., Choumas, K., Korakis, T., & Tassiulas, L. (2015) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2015.7405619 · Cited by 13 · see citing works
Evaluation of the impact of packet drops due to AQM over capacity limited paths
Grigorescu, E., Kulatunga, C., & Fairhurst, G. (2013) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2013.6733658 · Cited by 13 · see citing works
Design and Implementation of the Traffic Control Module in ns-3
Imputato, P., & Avallone, S. (2016) · Workshop on ns-3 (WNS3) · doi:10.1145/2915371.2915382 · Cited by 12 · see citing works
Enabling router-assisted congestion control on the Internet
Flores, M., Wenzel, A., & Kuzmanovic, A. (2016) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2016.7784442 · Cited by 12 · see citing works
Chen, J., Subramanian, L., Iyengar, J. R., & Ford, B. (2014) · European Conference on Computer Systems · doi:10.1145/2592798.2592819 · Cited by 12 · see citing works
Maximum and asymptotic UDP throughput under CHOKe
Wang, J., Tang, A., & Low, S. H. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781038 · Cited by 12 · see citing works
Achieving High Utilization for Approximate Fair Queueing in Data Center
Liu, J., Huang, J., Jiang, N., Li, W., & Wang, J. (2020) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs47774.2020.00099 · Cited by 12 · see citing works
FQ-PIE Queue Discipline in the Linux Kernel: Design, Implementation and Challenges
Ramakrishnan, G., Bhasi, M., Saicharan, V., Monis, L., Patil, S. D., & Tahiliani, M. P. (2019) · IEEE LCN Symposium on Emerging Topics in Networking (LCN Symposium) · doi:10.1109/lcnsymposium47956.2019.9000684 · Cited by 11 · see citing works
- Authors
- McKenney, P. E.
- Affiliations
- SRI International (US)
- Corresponding author
- McKenney, P.E.
- Venue
- Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-04
- Pages
- 733-740
- OpenAlex
- W2146430517
- Cited by
- 273
- References
- 13
- Citations by year
- 2026: 5 · 2025: 3 · 2024: 4 · 2023: 9 · 2022: 7 · 2021: 7 · 2020: 5 · 2019: 8 · 2018: 15 · 2017: 14 · 2016: 14 · 2015: 22 · 2014: 16 · 2013: 11 · 2012: 9
- FWCI
- 9.07
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Conference on Computer Communications (INFOCOM) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
- Social Sciences › Business, Management and Accounting › Management Information Systems › Advanced Queuing Theory Analysis
- Keywords
- fair queuing, probabilistic scheduling, firmware implementation, network protocols
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
