Data networks
Duality and other results for M/G/1 and Gl/M/1 queues, via a new ballot theorem
Mathematics of Operations Research
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Connection-level analysis and modeling of network traffic
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
On the characteristics and origins of internet flow rates
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE/ACM Transactions on Networking (TON)
A Flow Table-Based Design to Approximate Fairness
HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
Controlling High-Bandwidth Flows at the Congested Router
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding Internet traffic streams: dragonflies and tortoises
IEEE Communications Magazine
Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing
IEEE Journal on Selected Areas in Communications
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
Minimizing the overhead in implementing flow-aware networking
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Performance comparison of Flow Aware Networking (FAN) architectures under GridFTP traffic
Proceedings of the 2008 ACM symposium on Applied computing
Exact GPS simulation and optimal fair scheduling with logarithmic complexity
IEEE/ACM Transactions on Networking (TON)
Removing exponential backoff from TCP
ACM SIGCOMM Computer Communication Review
Evaluation of Flow-Aware Networking (FAN) architectures under GridFTP traffic
Future Generation Computer Systems
From packets to XLFrames: sand and rocks for transfer of mice and elephants
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Opportunistic link overbooking for resource efficiency under per-flow service guarantee
IEEE Transactions on Communications
On the impact of TCP and per-flow scheduling on internet performance
INFOCOM'10 Proceedings of the 29th conference on Information communications
A flow-aware MAC protocol for a passive optical metropolitan area network
Proceedings of the 23rd International Teletraffic Congress
Approximate fairness through limited flow list
Proceedings of the 23rd International Teletraffic Congress
FIFO Service with Differentiated Queueing
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Flow Oriented Approaches to QoS Assurance
ACM Computing Surveys (CSUR)
Internet and the Erlang formula
ACM SIGCOMM Computer Communication Review
Passive online RTT estimation for flow-aware routers using one-way traffic
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Admission control in Flow-Aware Networking (FAN) architectures under GridFTP traffic
Optical Switching and Networking
On the impact of TCP and per-flow scheduling on internet performance
IEEE/ACM Transactions on Networking (TON)
Recursive design of hardware priority queues
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
An on-demand queue management architecture for a programmable traffic manager
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
QFQ: efficient packet scheduling with tight guarantees
IEEE/ACM Transactions on Networking (TON)
On the performance of bandwidth and storage sharing in information-centric networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Despite its well-known advantages, per-flow fair queueing has not been deployed in the Internet mainly because of the common belief that such scheduling is not scalable. The objective of the present paper is to demonstrate using trace simulations and analytical evaluations that this belief is misguided. We show that although the number of flows in progress increases with link speed, the number that needs scheduling at any moment is largely independent of this rate. The number of such active flows is a random process typically measured in hundreds even though there may be tens of thousands of flows in progress. The simulations are performed using traces from commercial and research networks with quite different traffic characteristics. Analysis is based on models for balanced fair statistical bandwidth sharing and applies properties of queue busy periods to explain the observed behaviour.