Abstract
The paper deals with the problem of modeling a k-regular topology over an existing network architecture by establishing virtual point-to-point communication paths, referred to as k-routing. We consider the question of the existence and minimisation of edge spread of k-routings with bounded edge load in undirected networks. Efficient algorithms are presented for determining minimal k-routings with edge load 1 and for certain cases with edge load 2. On the negative side, the problems of finding a 6-routing with load 2 and of minimising a 2-routing with load 2 are proven to be NP-hard (though the latter is approximable within 7/6). The results imply the NP-hardness of the well known all-to-all routing problem for bounded edge load.
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
De Bontridder, K.M.J., Haldórsson, B.V., Haldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Programming 98, 477–491 (2003)
Beauquier, B.: All-to-all communication in some wavelength-routed all-optical networks. Networks 33, 179–187 (1999)
Beauquier, B., Bermond, J.C., Gargano, L., Hell, P., Pèrennes, S., Vaccaro, U.: Graph problems arising from wavelength routing in all-optical networks. In: Proc. WOCS 1997, Geneve, Switzerland (1997)
Beauquier, B., Pèrennes, S., Syska, M.: Efficient Access to Optical Bandwidth Routing and Grooming in WDM Networks: state-of-the-art survey, CRESCCO report IST-2001-33135, Universite de Nice-Sophia Antipolis, France (2002)
Bermond, J.C., Gargano, L., Perennes, S., Rescigno, A.A., Vaccaro, U.: Efficient collective communication in optical networks. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 574–585. Springer, Heidelberg (1996)
Białogrodzki, J.: Path Coloring and Routing in Graphs. In: Kubale, M. (ed.) Graph Colorings. Contemporary Mathematics series 352, pp. 139–152. AMS, Providence (2004)
Choplin, S., Narayanan, L., Opatrny, J.: Two-Hop Virtual Path Layout in Tori. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 69–78. Springer, Heidelberg (2004)
Chung, F.R.K., Coman, E.G., Reiman, M.I., Simon, B.E.: The forwarding index of communication networks. IEEE Trans. on Inf. Theory 33, 224–232 (1987)
Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoret. Comp. Sci. 255, 33–50 (2001)
Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. 1st ACM-SIAM SODA, pp. 434–443 (1990)
Green, P.E.: Fiber-optic networks. Prentice-Hall, New Jersey (1992)
Małafiejski, M., Żyliński, P.: Weakly cooperative guards in grids. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3480, pp. 647–656. Springer, Heidelberg (2005)
Raghavan, R., Upfal, E.: Efficient routing in all-optical networks. In: Proc. 26th ACM STOC, pp. 134–143 (1994)
Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80–91 (1954)
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
Kosowski, A., Małafiejski, M., Żyliński, P. (2005). On Bounded Load Routings for Modeling k-Regular Connection Topologies. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_62
Download citation
DOI: https://doi.org/10.1007/11602613_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)