Data networks
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Overview of the MetaRing architecture
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic
IEEE/ACM Transactions on Networking (TON)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Dynamic Max-Min fairness in ring networks
Cluster Computing
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
ACM SIGCOMM Computer Communication Review
Counter-intuitive throughput behaviors in networks under end-to-end control
IEEE/ACM Transactions on Networking (TON)
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
IEEE Communications Magazine
General weighted fairness and its support in explicit rate switch algorithms
Computer Communications
| Hi-index | 0.24 |
In networking, it is often required to quantify by how much one protocol is fairer than another and how certain parameter setting and/or protocol enhancements improve fairness. This paper provides a framework to evaluate the fairness of various protocols in a general telecommunications network. Within this framework, there are two key components: (1) a benchmark and (2) a single dimension metric. We suggest to use the max-min fairness bandwidth allocation as the benchmark and the Euclidean distance between any bandwidth allocation under any protocol and the max-min bandwidth allocation as the metric. Explicitly, we provide a method to compare the fairness of two sets of bandwidth allocation under two different protocols for a given network by using this metric. On the basis of this new framework, we evaluate the fairness of FAST TCP and TCP Reno relative to the max-min fairness criteria. The distance between the max-min fair allocation and allocations based on each of the two protocols is measured using the Euclidian norm. We derive explicit expressions for these distances for a general network and compare the fairness of these two protocols by using their corresponding utility functions. Finally, we numerically demonstrate how this method can be applied to compare the fairness of FAST TCP and TCP Reno for a ''Parking Lot'' linear network and for the NSFNET Backbone network. In addition to merely a comparison between protocols, such numerical results can provide guidelines for better choice of parameters to make a protocol fairer in a given scenario.