Scientific Programming

Scientific Programming / 2013 / Article
Special Issue

Selected Papers from Super Computing 2012

View this Special Issue

Open Access

Volume 21 |Article ID 746524 |

Kiril Dichev, Fergal Reid, Alexey Lastovetsky, "Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms", Scientific Programming, vol. 21, Article ID 746524, 14 pages, 2013.

Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms


In the area of network performance and discovery, network tomography focuses on reconstructing network properties using only end-to-end measurements at the application layer. One challenging problem in network tomography is reconstructing available bandwidth along all links during multiple source/multiple destination transmissions. The traditional measurement procedures used for bandwidth tomography are extremely time consuming. We propose a novel solution to this problem. Our method counts the fragments exchanged during a BitTorrent broadcast. While this measurement has a high level of randomness, it can be obtained very efficiently, and aggregated into a reliable metric. This data is then analyzed with state-of-the-art algorithms, which correctly reconstruct logical clusters of nodes interconnected by high bandwidth, as well as bottlenecks between these logical clusters. Our experiments demonstrate that the proposed two-phase approach efficiently solves the presented problem for a number of settings on a complex grid infrastructure.

Copyright © 2013 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Order printed copiesOrder

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.