Network topology optimisation for data aggregation using multiple paths Online publication date: Tue, 19-Jan-2016
by Soham Das; Sartaj Sahni
International Journal of Metaheuristics (IJMHEUR), Vol. 4, No. 2, 2015
Abstract: In this paper, we develop algorithms for the data aggregation problem which arises in the context of big data applications that employ the MapReduce operation. For the case when source racks can send their data to the aggregator using multiple paths, we show that an aggregation tree topology that minimises aggregation time can be constructed in a polynomial time. We also consider the problem of constructing aggregation trees that minimise total network traffic subject to the primary constraints that the aggregation time is minimised. The heuristics for this problem is presented and the experiments show that allowing multiple paths reduces aggregation time by up to 99% related to the aggregation trees constructed using the LPT rule. This reduction in aggregation time, however, comes with up to 35% increase in total network traffic when the racks have more than two optical links and up to 98% increase in total network traffic when each rack has two optical links.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook