Data networks
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
ATM: theory and application
Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Traffic Engineering with MPLS
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
Non-convex optimization and rate control for multi-class services in the Internet
IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
An interior point penalty method for utility maximization problems in OFDMA networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An interior point penalty method for utility maximization problems in OFDMA networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Design of fair weights for heterogeneous traffic scheduling in multichannel wireless networks
IEEE Transactions on Communications
Stochastic TCP friendliness: Expanding the design space of TCP-friendly traffic control protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Throughput-smoothness tradeoff in preventing competing TCP from starvation
Computer Communications
| Hi-index | 0.00 |
In best-effort networks, fairness has been used as a criterion to guide the design of traffic controls. The notion of fairness has evolved over time, from simple equality to a form of equality modulated by the user's need (e.g. max-min and proportional fairness). However, fairness has always been defined on a per-user basis for a deterministic workload. In this paper, we argue that we must redefine the notion of fairness when we study traffic controls for the co-existence of elastic and inelastic traffics. Our results indicate that subjecting inelastic flows to fairness congestion control on a per-flow basis does not necessarily maximize the network's utility. Instead, inelastic flows may follow their own form of traffic control, such as admission control (without congestion control). At the aggregate level, our results indicate that it still makes sense to maintain a balance between elastic and inelastic traffic. In order to support our arguments, we develop a methodology for comparing different traffic controls for given utility functions and different workloads, both deterministic and stochastic.