Abstract
It is critical to obtain accurate network information for network management and the improvement of network service quality. Network measurement is an efficient method to obtain such information. Now the network measurement models and algorithms have become a research hot spot; and the core problem is how to cut down the cost of device deployment and reduce the effects caused by measurement. In this paper, we discuss the problem of measure station selection and measure assignment in active IP network, and propose a greedy algorithm to select stations and a method based on link usage cost to assign measures. Simulation results show that our method is efficient in station selection and measure assignment.
This work was supported in part by the 973 project of China (2007CB310703), Fok Ying Tong Education Foundation (111069).
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.
References
Zhang, H., Fang, B.: Internet measurement and analysis. Journal of Software 14(1), 110–116 (2003)
Cai, Z., Liu, F., et al: Network measurement model and its optimization algorithm. Journal of Software 19(2), 419–431 (2008)
Adler, M., Bu, T., Sitaraman, B., Towsley, D.: Tree layout for Internet network characterizations in multicast networks. In: Proc. of the NGC 2001, pp. 189–204. Springer, Heidelberg (2001)
Breitbart, Y., Dragan, F., Gobjuka, H.: Effective network monitoring. In: Proc. of the IEEE ICCCN 2004, pp. 394–399. IEEE Communication Society, Los Alamitos (2004)
Bejerano, Y., Rastogi, R.: Robust monitoring of link delays and faults in IP networks. IEEE/ACM Transactions On Networking 14(5) (2006)
Kumar, R., Kaur, J.: Efficient beacon placement for network tomography. In: Proc. of the ACM SIGCOMM IMC, pp. 181–186. ACM Press, New York (2004)
Nguyen, H., Thiran, P.: Active measurement for multiple link failures diagnosis in IP networks, pp. 185–194. Springer, Heidelberg (2004)
Horton, J., Lopez-Ortiz, A.: On the number of distributed measurement points for network tomography. In: Proc. of the ACM SIGCOMM IMC, pp. 204–209. ACM Press, New York (2003)
Breitbart, Y., Chan, C.Y., Garofalakis, M., Rastogi, R., Silberschatz, A.: Efficiently monitoring bandwidth and latency in IP networks. In: Proc. of the IEEE INFOCOM 2001, pp. 933–942. IEEE Communication Society, Los Alamitos (2001)
Walz, J., Levine, B.: A hierarchical multicast monitoring scheme. In: Proc. of the NGC on Networked Group Communication, pp. 105–116. ACM Press, New York (2000)
Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: On the placement of Internet instrumentation. In: Proc. of the IEEE INFOCOM 2000, pp. 295–304. IEEE Communication Society, Los Alamitos (2000)
Bartal, Y.: Probabilistic approximation of metric space and its algorithmic applications. In: Proc. of the 37th Annual IEEE Symp. on Foundations of Computer Science, pp. 184–193. IEEE Communication Society, Los Alamitos (1996)
Magoni, D.: Network topology analysis and internet modelling with Nem. International Journal of Computers and Applications 27(4), 252–259 (2005)
Waxman, B.M.: Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeng, Y., Cheng, L., Huang, T., Li, Z. (2009). An Algorithm for the Measure Station Selection and Measure Assignment in the Active IP Network Measurement. In: Hong, C.S., Tonouchi, T., Ma, Y., Chao, CS. (eds) Management Enabling the Future Internet for Changing Business and New Computing Services. APNOMS 2009. Lecture Notes in Computer Science, vol 5787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04492-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-04492-2_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04491-5
Online ISBN: 978-3-642-04492-2
eBook Packages: Computer ScienceComputer Science (R0)