ABSTRACT
Network tomography establishes linear relationships between the characteristics of individual links and those of end-to-end paths. It has been proved that these relationships can be used to infer the characteristics of links from end-to-end measurements, provided that links are not correlated, i.e., the status of one link is independent from the status of other links.
In this paper, we consider the problem of identifying link characteristics from end-to-end measurements when links are "correlated," i.e., the status of one link may depend on the status of other links. There are several practical scenarios in which this can happen; for instance, if we know the network topology at the IP-link or at the domain-link level, then links from the same local-area network or the same administrative domain are potentially correlated, since they may be sharing physical links, network equipment, even management processes.
We formally prove that, under certain well defined conditions, network tomography works when links are correlated, in particular, it is possible to identify the probability that each link is congested from end-to-end measurements. We also present a practical algorithm that computes these probabilities. We evaluate our algorithm through extensive simulations and show that it is accurate in a variety of realistic congestion scenarios.
- Boston University Representative Internet Topology Generator. http://www.cs.bu.edu/brite/.Google Scholar
- A. Adams, T. Bu, T. Friedman, J. Horowitz, D. Towstey, R. Caceres, N. Duffield, F. L. Presti, S. B. Moon, and V. Paxson. The Use of End-to-end Multicast Measurements for Characterizing Internal Network Behavior. IEEE Communications Magazine, May 2000. Google ScholarDigital Library
- V. Arya, N. Duffield, and D. Veitch. Temporal Delay Tomography. In Proceedings of the IEEE INFOCOM Conference, 2008.Google ScholarCross Ref
- T. Bu, N. Duffield, F. L. Presti, and D. Towsley. Network Tomography on General Topologies. In Proceedings of the ACM SIGMETRICS Conference, 2002. Google ScholarDigital Library
- R. Caceres, N. G. Duffield, J. Horowitz, and D. Towsley. Multicast-based Inference of Network-Internal Loss Characteristics. IEEE Transactions on Information Theory, 45:2462--2480, 1999. Google ScholarDigital Library
- J. Cao, D. Davis, S. V. Wiel, and B. Yu. Time-Varying Network Tomography: Router Link Data. Journal of the American Statistical Association, 95(452):1063--1075, Dec. 2000.Google ScholarCross Ref
- A. Chen, J. Cao, and T. Bu. Network Tomography: Identifiability and Fourier Domain Estimation. In Proceedings of the IEEE INFOCOM Conference, 2007.Google ScholarDigital Library
- M. Coates and R. Nowak. Network Loss Inference Using Unicast End-to-End Measurement. In Proceedings of the ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management, 2000.Google Scholar
- N. Duffield, F. L. Presti, V. Paxson, and D. Towsley. Inferring Link Loss Using Striped Unicast Probes. In Proceedings of the IEEE INFOCOM Conference, 2001.Google ScholarCross Ref
- N. G. Duffield. Network Tomography of Binary Network Performance Characteristics. IEEE Transactions on Information Theory, 52(12):5373--5388, December 2006. Google ScholarDigital Library
- H. X. Nguyen and P. Thiran. Network Loss Inference with Second Order Statistics of End-to-End Flows. In Proceedings of the IEEE Internet Measurement Conference (IMC), 2007. Google ScholarDigital Library
- H. X. Nguyen and P. Thiran. The Boolean Solution to the Congested IP Link Location Problem: Theory and Practice. In Proceedings of the IEEE INFOCOM Conference, 2007.Google ScholarDigital Library
- V. N. Padmanabhan, L. Qiu, and H. J. Wang. Server-based Inference of Internet Performance. In Proceedings of the IEEE INFOCOM Conference, 2003.Google Scholar
- H. Singhal and G. Michailidis. Identifiability of Flow Distributions from Link Measurements with Applications to Computer Networks. Inverse Problems, 23:1821--1850, 2007.Google ScholarCross Ref
- J. Sommers, P. Barford, N. Duffield, and A. Ron. Accurate and Efficient SLA Compliance Monitoring. In Proceedings of the ACM SIGCOMM Conference, 2007. Google ScholarDigital Library
- H. H. Song, L. Qiu, and Y. Zhang. NetQuest: A Flexible Framework for Large-Scale Network Measurement. In Proceedings of the ACM SIGMETRICS Conference, 2006. Google ScholarDigital Library
- Y. Tsang, M. Coates, and R. Nowak. Passive Network Tomography Using the EM Algorithms. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2001. Google ScholarDigital Library
- Y. Vardi. Network Tomography: Estimating Source-Destination Traffic Intensities. Journal of the American Statistical Association, 91:365--377, 1996.Google ScholarCross Ref
- Y. Zhao, Y. Chen, and D. Bindel. Toward Unbiased End-to-End Network Diagnosis. In Proceedings of the ACM SIGCOMM Conference, 2006. Google ScholarDigital Library
Index Terms
- Network tomography on correlated links
Recommendations
Simple network performance tomography
IMC '03: Proceedings of the 3rd ACM SIGCOMM conference on Internet measurementIn network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations must be arranged at the packet level, e.g., using multicast probes or ...
Hierarchical Encryption in WDM Optical Network Links
ITCC '05: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02In telecommunication networks and in computer grid networks, a significant ongoing research is in a technology known as Wavelength Division Multiplexing (WDM), which is capable to transport more than 1 Tbps aggregate traffic over a single fiber. However,...
A photonic network on chip with CDMA links
VDAT'12: Proceedings of the 16th international conference on Progress in VLSI Design and TestCurrently, photonic network on chips utilize dense wavelength division multiplexing by modulating multiple high bandwidth wavelength channels from an on-chip broadband LASER source. We use adaptive Code Division Multiple Access techniques with the above ...
Comments