Abstract
The connectivity of a communications network can often be enhanced if the nodes are able, at some expense, to form links using an external network. In this paper, we consider the problem of how to obtain a prescribed level of connectivity with a minimum number of nodes connecting to the external network.
Let D = (V,A) be a digraph. A subset X of vertices in V may be chosen, the so-called external vertices. An internal path is a normal directed path in D; an external path is a pair of internal paths p 1=v 1 ⋯ v s , p 2=w 1 ⋯ w t in D such that v s and w 1 are external vertices ( the idea is that v 1 can contact w t along this path using an external link from v t to w 1 ). Then (D,X) is externally-k-arc-strong if for each pair of vertices u and v in V, there are k arc-disjoint paths ( which may be internal or external ) from u to v.
We present polynomial algorithms that, given a digraph D and positive integer k, will find a set of external vertices X of minimum size subject to the requirement that (D,X) must be externally-k-arc-strong.
Research supported by EPSRC MathFIT grant no. GR/R83514/01.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Diestel, R.: Graph Theory. Springer, New York (1997)
van den Heuvel, J., Johnson, M.: The External Network Problem with vertex-connectivity requirements (in preparation)
Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. J. of Algorithms 17, 424–446 (1994)
Ito, H., Ito, M., Itatsu, Y., Uehara, H., Yokohama, M.: Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 338–349. Springer, Heidelberg (2000)
Ito, H., Makino, K., Arata, K., Honami, S., Itatsu, Y., Fujishige, S.: Source location problem with flow requirements in directed networks. Optimization Methods and Software 18, 427–435 (2003)
Nagamochi, H., Ishii, T., Ito, H.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Info. Process Letters 80, 287–294 (2001)
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
van den Heuvel, J., Johnson, M. (2005). The External Network Problem with Edge- or Arc-Connectivity Requirements. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_11
Download citation
DOI: https://doi.org/10.1007/11527954_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27873-3
Online ISBN: 978-3-540-31860-6
eBook Packages: Computer ScienceComputer Science (R0)