Dynamic load balancing without packet reordering
Top Cited Papers
- 20 March 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 37 (2), 51-62
- https://doi.org/10.1145/1232919.1232925
Abstract
Copyright © 2007 ACM, Inc.Matthew RoughaKeywords
This publication has 21 references indexed in Scilit:
- Walking the tightropePublished by Association for Computing Machinery (ACM) ,2005
- Estimating loss rates with TCPACM SIGMETRICS Performance Evaluation Review, 2003
- Path selection and bandwidth allocation in MPLS networksPerformance Evaluation, 2003
- Best-path vs. multi-path overlay routingPublished by Association for Computing Machinery (ACM) ,2003
- The effect of packet reordering in a backbone link on application throughputIEEE Network, 2002
- Optimizing OSPF/IS-IS weights in a changing worldIEEE Journal on Selected Areas in Communications, 2002
- On making TCP more robust to packet reorderingACM SIGCOMM Computer Communication Review, 2002
- The Eifel algorithmACM SIGCOMM Computer Communication Review, 2000
- Packet reordering is not pathological network behaviorIEEE/ACM Transactions on Networking, 1999
- End-to-end Internet packet dynamicsIEEE/ACM Transactions on Networking, 1999