Data networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Comparing traffic engineering objective functions
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Measurement-based optimal routing on overlay architectures for unicast sessions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Performance analysis of adaptive multipath load balancing in WDM-LOBS networks
Computer Communications
Optimal multicast multichannel routing in computer networks
Computer Communications
MONTE: an implementation of an MPLS online traffic engineering tool
Proceedings of the 5th International Latin American Networking Conference
Decentralized control and optimization of networks with QoS-constrained services
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A mutualistic resource pooling architecture
Proceedings of the Re-Architecting the Internet Workshop
Computers and Operations Research
Balancing by PREFLEX: congestion aware traffic engineering
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
MicroTE: fine grained traffic engineering for data centers
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Optimal multicast multichannel routing in computer networks
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Hi-index | 0.00 |
Destination-based forwarding in traditional IP routers has not been able to take full advantage of multiple paths that frequently exist in Internet service provider networks. As a result, the networks may not operate efficiently, especially when the traffic patterns are dynamic. This paper describes a multipath adaptive traffic engineering scheme, called MATE, which is targeted for switched networks such as multiprotocol label switching networks. The main goal of MATE is to avoid network congestion by adaptively balancing the load among multiple paths based on measurement and analysis of path congestion. MATE adopts a minimalist approach in that intermediate nodes are not required to perform traffic engineering or measurements besides forwarding packets. Moreover, MATE does not impose any particular scheduling, buffer management, or a priori traffic characterization on the nodes. This paper presents an analytical model, derives a class of MATE algorithms, and proves their convergence. Several practical design techniques to implement MATE are described. Simulation results are provided to illustrate the efficacy of MATE under various network scenarios.