Cart (Loading....) | Create Account
Close category search window

An Adaptive Multipath Routing Algorithm for Maximizing Flow Throughputs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shinohara, Y. ; Syst. Platforms Res. Labs., NEC Corp., Kawasaki, Japan ; Chiba, Y. ; Shimonishi, H.

In datacenter networks, as the communication intensive middleware such as Hadoop being popular, the traffic among servers is heavily increasing and its traffic patterns vary from time to time. Conventional tree network topologies and routing mechanisms with single path routing will cause congestion along oversubscribed links. Thus, load- balancing path selections are needed to alleviate congestion and improve application performance. Multipath routing algorithms can distribute traffic over diverse paths optimally than simple solutions like ECMP. They, however, request considerable computations, i.e. frequently updating the path cost tree and dynamically optimizing path selections, thus they do not adapt large scale datacenter networks. Multinomial Logit Based (MLB) routing, a lightweight multipath routing algorithm, has been proposed as a countermeasure. However, it is not always efficient against various network topologies and varying traffic patterns unless its control parameter is adaptively chosen. In this paper, we present an automatic parameter tuning method, which estimates the path cost of individual flows in the network and dynamically tunes the traffic dispersion parameter to reduce the total path cost of all flows. In our experiments with real OpenFlow switches, we exhibit that our method optimally tunes the parameter and maximize the total throughput of the flows.

Published in:

World Telecommunications Congress (WTC), 2012

Date of Conference:

5-6 March 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.