Abstract
Overlay networks are logical abstraction on a physical network (underlay) where each overlay node corresponds to a specific underlay node and overlay links correspond to paths on the underlay. The use of network layer information for constructing overlay networks can greatly improve their performance. Knowledge of underlay properties such as available bandwidths, loss rates and topology can help in efficient construction, maintenance and optimization of overlays which have to provide service guarantees. In absence of any support from the network core, it becomes necessary to infer those properties by performing end-to-end measurements on the network. We develop probing techniques which infer information about the structure of the underlay and use it for construction of fault-tolerant overlay networks. Algorithms and measurement techniques for the same are presented together with the experimental findings.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cui, W., Stoica, I., Katz, R.: Backup path allocation based on a correlated link failure probability model in overlay networks. In: Proceedings of 10th IEEE International Conference on Network Protocols, 2002, pp. 236–245 (2002)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: INFOCOM (2002)
Han, J., Watson, D., Jahanian, F.: Topology aware overlay networks. IEEE INFOCOM (2005)
Wang, L., Griffioen, J., Calvert, K., Shi, S.: Passive inference of path correlation. In: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video, pp. 36–41 (2004)
Mills, D.: Internet Time Synchronization: The Network Time Protocol. In: Yang, Z., Anthony Marsland, T. (eds.) Global States and Time in Distributed Systems. IEEE Computer Society Press, Los Alamitos (1994)
Bolot, J.: End-to-end packet delay and loss behavior in the internet. ACM SIGCOMM Computer Communication Review 23, 289–298 (1993)
Carter, R., Crovella, M.: Measuring bottleneck link speed in packet-switched networks. Performance evaluation 27, 297–318 (1996)
Lai, K., Baker, M.: Measuring link bandwidths using a deterministic model of packet delay. SIGCOMM, 283–294 (2000)
Mah, B.: Estimating bandwidth and other network properties. Internet Statistics and Metrics Analysis (2000)
Harfoush, K., Bestavros, A., Byers, J.: Measuring bottleneck bandwidth of targeted path segments. In: INFOCOM (2003)
Fei, T., Tao, S., Gao, L., Guerin, R.: How to select a good alternate path in large peer-to-peer systems. IEEE INFOCOM (2001)
Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. ACM Press, New York (2001)
Andersen, D.G., Snoeren, A.C., Balakrishnan, H.: Best-path vs. multi-path overlay routing. In: Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement. ACM, New York (2003)
Coates, M., Castro, R., Nowak, R., Gadhiok, M., King, R., Tsang, Y.: Maximum likelihood network topology identification from edge-based unicast measurements. In: Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 11–20 (2002)
Chen, Y., Bindel, D., Song, H., Katz, R.: An algebraic approach to practical and scalable overlay network monitoring. ACM SIGCOMM Computer Communication Review 34, 55–66 (2004)
Patidar, M.: Constructing underlay-aware fault tolerant overlay networks. In: Dual Degree Dissertation Department of Computer Science And Engineering IIT Bombay (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellur, U., Patidar, M. (2010). On Using Network Tomography for Overlay Availability. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)