Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Dynamic multi-path routing: asymptotic approximation and simulations
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Decentralized optimal traffic engineering in the internet
ACM SIGCOMM Computer Communication Review
A Class of End-to-End Congestion Control Algorithms for the Internet
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
Adaptive algorithms for feedback-based flow control in high-speed, wide-area ATM networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Distributed control and resource marking using best-effort routers
IEEE Network: The Magazine of Global Internetworking
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
An integrated, distributed traffic control strategy for the future internet
Proceedings of the 2006 SIGCOMM workshop on Internet network management
End-to-end optimal algorithms for integrated QoS, traffic engineering, and failure recovery
IEEE/ACM Transactions on Networking (TON)
Network utility maximization for triple-play services
Computer Communications
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A simple framework of utility max-min flow control using sliding mode approach
IEEE Communications Letters
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
A network rate management protocol with TCP congestion control and fairness for all
Computer Networks: The International Journal of Computer and Telecommunications Networking
Convergence conditions for decentralized optimal traffic engineering in connectionless networks
IEEE Transactions on Communications
Demand-oblivious routing: distributed vs. centralized approaches
INFOCOM'10 Proceedings of the 29th conference on Information communications
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems
Journal of Network and Computer Applications
| Hi-index | 0.01 |
In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family "steers" the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the "right" control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.