Don't optimize existing protocols, design optimizable protocols
ACM SIGCOMM Computer Communication Review
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
On improving the efficiency and manageability of NotVia
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
User-directed routing: from theory, towards practice
Proceedings of the 3rd international workshop on Economics of networked systems
Distributed network utility maximization in wireless networks with a bounded number of paths
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Measuring the utility/path diversity trade off in multipath protocols
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Multipath protocol for delay-sensitive traffic
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Interactions of intelligent route control with TCP congestion control
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Cooperative interdomain traffic engineering using Nash bargaining and decomposition
IEEE/ACM Transactions on Networking (TON)
Do next generation networks need path diversity?
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Network resource allocation for competing multiple description transmissions
IEEE Transactions on Communications
Demand-oblivious routing: distributed vs. centralized approaches
INFOCOM'10 Proceedings of the 29th conference on Information communications
QoS Stochastic Traffic Engineering for the wireless support of real-time streaming applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimum delay load-balancing via nonparametric regression and no-regret algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic engineering with semiautonomous users: a game-theoretic perspective
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.07 |
In the Internet today, traffic engineering is performed assuming that the offered traffic is inelastic. In reality, end hosts adapt their sending rates to network congestion, and network operators adapt the routing to the measured traffic. This raises the question of whether the joint system of congestion control (transport layer) and routing (network layer) is stable and optimal. Using the established optimization models for TCP and traffic engineering as a basis, we find the joint system can be stabilized and often maximizes aggregate user utility. We prove that both stability and optimality of the joint system can be guaranteed for sufficiently elastic traffic simply by tuning the cost function used for traffic engineering. Then, we present a new algorithm that adapts on a smaller timescale to changes in traffic distribution and is more robust to large traffic bursts. Uniting the network and transport layers in a multi-layer approach, this algorithm, distributed adaptive traffic engineering (DATE), jointly optimizes the goals of end users and network operators and reacts quickly to avoid bottlenecks. Simulations demonstrate that DATE converges quickly