Abstract
Broadcasting is the process of disseminating a message from a node of a communication network to all other nodes as quickly as possible. In this paper we consider Manhattan Street Networks (MSNs) which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. With the use of genetic programming we have generated broadcasting algorithms for 2-dimensional and 3-dimensional MSNs.
Research supported by the Ministry of Science and Technology, Spain, and the European Regional Development Fund (ERDF) under project TIC2002-00155.
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
Maxemchuk, N.F.: The Manhattan Street Network. In: Proc. of the IEEE Global Telecommunication Conf., New Orleans, LA, USA, pp. 255–261 (1985)
Khasnabish, B.: Topological properties of Manhattan Street Networks. Electronics Lett. 25, 1388–1389 (1989)
Maxemchuk, N.F.: Routing in the Manhattan Street Network. IEEE Trans. Commun. 35, 503–512 (1987)
Chung, T.Y., Agrawal, D.P.: On network characterization of and optimal broadcasting in the Manhattan Street Network. In: Proc. IEEE INFOCOM 1990, vol. 2, pp. 465–472 (1990)
Varvarigos, E.A.: Optimal communication algorithms for Manhattan Street Networks. Discrete Appl. Math. 83, 303–326 (1998)
Banerjee, S., Jain, V., Shah, S.: Regular multihop logical topologies for lightwave networks. IEEE Comm. Surveys and Tutorials, First Quarter 2(1) (1999)
Banerjee, D., Mukherjee, B., Ramamurthy, S.: The multidimensional torus: analysis of average hop distance and application as a multihop lightwave network. IEEE International Conference on Communications 3, 1675–1680 (1994)
Chung, T.Y., Agrawal, D.P.: Design and analysis of multidimensional Manhattan Street Networks. IEEE Trans. Commun. 41, 295–298 (1993)
Chartrand, G., Lesniak, L.: Graphs & Digraphs, 2nd edn., Wadworth and Brooks Cole Advanced Books and Software, Monterey, California, USA (1986)
Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Appl. Math. C-53, 79–133 (1994)
Comellas, F., Dalfó, C.: Optimal broadcasting in Manhattan Street Networks (submitted)
Comellas, F., Giménez, G.: Genetic programming to design communication algorithms for parallel architectures. Parallel Process. Lett. 8, 549–560 (1998)
Singleton, A.: Genetic Programming with C++. BYTE, pp. 171–176 (February 1994)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Comellas, F., Dalfó, C. (2004). Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks. In: Raidl, G.R., et al. Applications of Evolutionary Computing. EvoWorkshops 2004. Lecture Notes in Computer Science, vol 3005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24653-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24653-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21378-9
Online ISBN: 978-3-540-24653-4
eBook Packages: Springer Book Archive