Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fair end-to-end window-based congestion control
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
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end congestion control for the internet: delays and stability
IEEE/ACM Transactions on Networking (TON)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Calculating the flow level performance of balanced fairness in tree networks
Performance Evaluation
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
On light and heavy traffic approximations of balanced fairness
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Dimensioning of wireless mesh networks with flow-level QoS requirements
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Flow-optimized random access for wireless multihop networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Flow-optimized random access for wireless multihop networks
Performance Evaluation
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Resource pooling in congested networks: proportional fairness and product form
Queueing Systems: Theory and Applications
Utility optimization in congested queueing networks: invited presentation, extended abstract
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Approximating flow throughput in complex data networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Internet data flow characterization and bandwidth sharing modelling
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Routing games for traffic engineering
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Insensitive, maximum stable allocations converge to proportional fairness
Queueing Systems: Theory and Applications
Optimal load balancing in insensitive data networks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
A framework for resource dimensioning in GPON access networks
International Journal of Network Management
| Hi-index | 0.00 |
While Erlang's formula has helped engineers to dimension telephone networks for over 80 years, such a three-way "performance-demand-capacity" relationship is still lacking for data networks. It may be argued that the enduring success of Erlang's formula is essentially due to its simplicity: the call blocking rate does not depend on the distribution of call duration but on overall demand only. In this paper, we consider data networks and characterize those capacity allocations which have the same insensitivity property, in the sense that performance of data transfers does not depend on precise traffic characteristics such as the distribution of data volume but on overall demand only. We introduce the notion of "balanced fairness" and prove some key properties satisfied by this insensitive allocation. It is shown notably that the performance of balanced fairness is always better than that obtained if flows are transmitted in a "store and forward" fashion, allowing simple formula applying to the latter to be used as a conservative evaluation for network design and provisioning purposes.