Abstract:
Congestion links can not only introduce great packet losses, but also cause significant delay flutters to paths that traverse them. However, most of current approaches ju...Show MoreMetadata
Abstract:
Congestion links can not only introduce great packet losses, but also cause significant delay flutters to paths that traverse them. However, most of current approaches just try to identify congestion links that meet end-to-end loss observations. What's worse, most of them also take no consideration of multipath routing, while which will introduce more than a single routing path between two end-hosts and can make a single-source network own a non-tree topology instead of the tree one. In this paper, we employ both end-to-end loss and delay observations to identify congestion links in a single-source network where multipath routing is enabled. We first prove that under certain topology conditions, the link delay variances in such non-tree topology can be inferred solely from end-to-end delay measurements. Then, we propose an algorithm to identify as congested a set of links, which can not only account for end-to-end path losses but also demonstrate great delay variances at the meantime. Simulation results validate the desirable performance of our proposed scheme.
Date of Conference: 27-30 June 2016
Date Added to IEEE Xplore: 18 August 2016
ISBN Information: