- author = "Francesc Comellas and Cristina Dalfo",
- title = "Optimal Broadcasting in 2-Dimensional Manhattan Street Networks",
- booktitle = "Parallel and Distributed Computing and Networks - 2005",
- year = "2005",
- editor = "T. Fahringer and M. H. Hamza",
- volume = "246",
- pages = "135--140",
- address = "Innsbruck, Austria",
- month = feb # " 15-17",
- publisher = "Acta Press",
- keywords = "genetic algorithms, genetic programming, Manhattan Street Networks, broadcasting, communication networks",
- ISBN = "0-88986-468-3",
- ISSN = "1027-2666",
-
URL = "
http://www.actapress.com/Abstract.aspx?paperId=19188",
-
URL = "http://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=287",
-
URL = "
https://pdfs.semanticscholar.org/67cf/692b7fe9ccd29d9932709d3d51ebd833c2b4.pdf",
- size = "6 pages",
- 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. Previous work on these networks has been mainly devoted to the study of the average distance and point-to-point routing schemes. Here we provide an algorithm which broadcasts optimally in a 2-dimensional M N Manhattan Street Network (M and N even).",
-
notes = "Comparison with GP results
Department of Mathematics Applications IV, Universitat Politecnica de Catalunya, EPSC, Avda. Canal Olimpic s/n, Castelldefels (Barcelona), Catalonia, Spain",
