Abstract
Network tomography aims to obtain network characteristics by end-to-end measurements. Most works carried out in the past focused on the methods and methodologies to identify some of the characteristics, such as loss rate, delay distribution, etc. which are typical static statistical variables showing long-term network behaviors. In contrast to the previous works, we in this paper turn our attention to dynamic characteristics, e.g. transition probability of each link, which unveil the temporal correlation of traffic flows. Those dynamic characteristics could be more important than those static ones since the temporal information can be used in prediction. Apart from that, those characteristics are essential to many other issues, including the models used in network tomography. To identify transition probabilities by end-to-end measurements and in a real-time manner is a challenging task although the problem can be formulated by a hidden Markov model (HMM). Instead of using Baum-Welch algorithm to identify the transition probabilities because it needs a long execution time, we propose a new method that consider the correlations observed by receivers to obtain the transition probabilities in a simple and real-time manner. The proposed method is equal to a closed form solution that makes it a candidate for real-time network control.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Zhu, W., Geng, Z.: A bottom up inference of loss rate. Computer Communications 28 (2005)
Liang, G., Yu, B.: Maximum pseudo likelihood estimation in network tomography. IEEE trans. on Signal Processing 51(8) (2003)
Coates, M., Hero, A., Nowak, R., Yu, B.: Internet tomography. IEEE Signal Processing Magazine 19(3) (2002)
Cáceres, R., Duffield, N.G., Horowitz, J., Towsley, D.: Multicast-based inference of network-internal loss characteristics. IEEE Trans. on Information Theory 45 (1999)
Zhu, W.: Using Bayesian Networks on Network Tomography. Computer Communications 26(2) (2003)
Barford, P., Bestavros, A., Bradley, A., Crovella, M.: Changes in web client access patterns characteristics and caching implications. Technical report, Boston University (1998)
Felix: Independent monitoring for network survivality. Technical report, ftp://ftp.bellcore.com/pub/mwg/felix/index.html
Ipma: Internet performance measurement and analysis. Technical report, http://www.merit.edu/ipma
Mahdavi, J., Paxson, V., Adams, A., Mathis, M.: Creating a scalable architecture for internet measurement. In: INET 1998 (1998)
Surveyor. Technical report, http://io.advanced.org/surveyor
Cáceres, R., Duffield, N.G., Moon, S.B., Towsley, D.: Inference of Internal Loss Rates in the MBone. In: IEEE/ISOC Global Internet 1999 (1999)
Cáceres, R., Duffield, N.G., Moon, S.B., Towsley, D.: Inferring link-level performance from end-to-end multicast measurements. Technical report, University of Massachusetts (1999)
Harfoush, K., Bestavros, A., Byers, J.: Robust identification of shared losses using end-to-end unicast probes. Technical Report BUCS-2000-013, Boston University (2000)
Coates, M., Nowak, R.: Unicast network tomography using EM algorthms. Technical Report TR-0004, Rice University (September 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, W. (2005). Bottom Up Algorithm to Identify Link-Level Transition Probability. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_42
Download citation
DOI: https://doi.org/10.1007/11534310_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)