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/mu...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Scientific Programming |
Online Access: | http://dx.doi.org/10.3233/SPR-130366 |
id |
doaj-ee56cea9c21e4880b4f3710be1ab2414 |
---|---|
record_format |
Article |
spelling |
doaj-ee56cea9c21e4880b4f3710be1ab24142021-07-02T07:15:54ZengHindawi LimitedScientific Programming1058-92441875-919X2013-01-01213-4799210.3233/SPR-130366Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering AlgorithmsKiril Dichev0Fergal Reid1Alexey Lastovetsky2School of Computer Science and Informatics, University College Dublin, Dublin, IrelandSchool of Computer Science and Informatics, University College Dublin, Dublin, IrelandSchool of Computer Science and Informatics, University College Dublin, Dublin, IrelandIn 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.http://dx.doi.org/10.3233/SPR-130366 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Kiril Dichev Fergal Reid Alexey Lastovetsky |
spellingShingle |
Kiril Dichev Fergal Reid Alexey Lastovetsky Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms Scientific Programming |
author_facet |
Kiril Dichev Fergal Reid Alexey Lastovetsky |
author_sort |
Kiril Dichev |
title |
Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms |
title_short |
Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms |
title_full |
Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms |
title_fullStr |
Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms |
title_full_unstemmed |
Efficient and Reliable Network Tomography in Heterogeneous Networks Using Bittorrent Broadcasts and Clustering Algorithms |
title_sort |
efficient and reliable network tomography in heterogeneous networks using bittorrent broadcasts and clustering algorithms |
publisher |
Hindawi Limited |
series |
Scientific Programming |
issn |
1058-9244 1875-919X |
publishDate |
2013-01-01 |
description |
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. |
url |
http://dx.doi.org/10.3233/SPR-130366 |
work_keys_str_mv |
AT kirildichev efficientandreliablenetworktomographyinheterogeneousnetworksusingbittorrentbroadcastsandclusteringalgorithms AT fergalreid efficientandreliablenetworktomographyinheterogeneousnetworksusingbittorrentbroadcastsandclusteringalgorithms AT alexeylastovetsky efficientandreliablenetworktomographyinheterogeneousnetworksusingbittorrentbroadcastsandclusteringalgorithms |
_version_ |
1721336311744299008 |