Computer networks: a systems approach
Computer networks: a systems approach
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
Network optimization and control
Foundations and Trends® in Networking
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
IEEE Transactions on Information Theory
An architectural view of game theoretic control
ACM SIGMETRICS Performance Evaluation Review
Operations Research
Hi-index | 0.00 |
The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixed route, and the objective is to maximize the total system throughput under some concept of fairness, subject to capacity constraints of the links used. This problem is well studied under the framework of network utility maximization and has led to several different distributed congestion control schemes. However, this idea of value does not capture the fact that flows might associate value, not just with throughput, but with link-quality metrics such as packet delay, jitter and so on. The traditional congestion control problem is redefined to include individual source preferences. It is assumed that degradation in link quality seen by a flow adds up on the links it traverses, and the total utility is maximized in such a way that the quality degradation seen by each source is bounded by a value that it declares. Decoupling source-dissatisfaction and link-degradation through an "effective capacity" variable, a distributed and provably optimal resource allocation algorithm is designed, to maximize system utility subject to these quality constraints. The applicability of our controller in different situations is illustrated, and results are supported through numerical examples.