Abstract
“How well connected is the network?” This is one of the most fundamental questions one would ask when facing the challenge of designing a communication network. Three major notions of connectivity have been considered in the literature, but in the context of traditional (single-layer) networks, they turn out to be equivalent. This paper introduces a model for studying the three notions of connectivity in multi-layer networks. Using this model, it is easy to demonstrate that in multi-layer networks the three notions may differ dramatically. Unfortunately, in contrast to the single-layer case, where the values of the three connectivity notions can be computed efficiently, it has been recently shown in the context of WDM networks (results that can be easily translated to our model) that the values of two of these notions of connectivity are hard to compute or even approximate in multi-layer networks. The current paper shed some positive light into the multi-layer connectivity topic: we show that the value of the third connectivity notion can be computed in polynomial time and develop an approximation for the construction of well connected overlay networks.
Supported in part by a France-Israel cooperation grant (“Mutli-Computing” project) from the France Ministry of Science and Israel Ministry of Science, by the Technion Cordon center for System Engineering, and by the ISF.
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
Bar-Ilan, J., Kortsarz, G., Peleg, D.: Generalized submodular cover problems and applications. Theor. Comput. Sci. 250(1-2), 179–200 (2001)
Cisco IOS Software Releases 12.0 S. Mpls traffic engineering: Shared risk link groups (srlg), http://www.cisco.com/en/US/docs/ios/12_0s/feature/guide/fs29srlg.html
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press (2001)
Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.-E.: Shared risk resource group: Complexity and approximability issues. Parallel Processing Letters 17(2), 169–184 (2007)
Dinic, E.A.: Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Math Doklady 11, 1277–1280 (1970)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248–264 (1972)
Elias, P., Feinstein, A., Shannon, C.: A note on the maximum flow through a network. IEEE Transactions on Information Theory 2(4), 117–119 (1956)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Grotschel, M., Lovasz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Combinatorica (1981)
Hastad, J.: Clique is hard to approximate within n 1 − ε. In: IEEE Annual Symposium on Foundations of Computer Science, p. 627 (1996)
Kleinberg, J., Tardos, E.: Algorithm Design. Addison Wesley (2006)
Lee, K., Modiano, E., Lee, H.-W.: Cross-layer survivability in wdm-based networks. IEEE/ACM Transactions on Networking 19(4), 1000–1013 (2011)
Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10(95-115), 5 (1927)
Network Protection Website. Network protection techniques, network failure recovery, network failure events, http://www.network-protection.net/shared-risk-link-group-srlg/
Ramamurthy, S., Mukherjee, B.: Survivable wdm mesh networks. part i-protection. In: Proceedings of IEEE Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, vol. 2, pp. 744–751 (March 1999)
White Paper, Cisco Systems Inc. Policy-based routing (1996), http://www.cisco.com/warp/public/cc/pd/iosw/tech/plicy_wp.pdf
Wolsey, L.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385–393 (1982) 10.1007/BF02579435
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emek, Y., Fraigniaud, P., Korman, A., Kutten, S., Peleg, D. (2012). Notions of Connectivity in Overlay Networks. In: Even, G., Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2012. Lecture Notes in Computer Science, vol 7355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31104-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31104-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31103-1
Online ISBN: 978-3-642-31104-8
eBook Packages: Computer ScienceComputer Science (R0)