Corpus ID: 10110446

Optimal Broadcasting in 2-Dimensional Manhattan Street Networks

@inproceedings{Comellas2005OptimalBI,
  title={Optimal Broadcasting in 2-Dimensional Manhattan Street Networks},
  author={Francesc Comellas and Cristina Dalf{\'o}},
  booktitle={Parallel and Distributed Computing and Networks},
  year={2005}
}
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… Expand
The Multidimensional Manhattan Network
TLDR
The n-dimensional Manhattan network Mn is formally defined and some of its structural properties are studied, and it is shown that Mn is a Cayley digraph, which can be seen as a subgroup of the n-dim version of the wallpaper group pgg. Expand
Approximation Algorithms for Broadcasting in Simple Graphs with Intersecting Cycles
Broadcasting is an information dissemination problem in a connected network in which one node, called the originator, must distribute a message to all other nodes by placing a series of calls alongExpand
Heuristic Algorithms For Broadcasting In Cactus Graphs
Broadcasting is an information dissemination problem in a connected network, in which one node, called the originator, disseminates a message to all other nodes by placing a series of calls along theExpand
Multidimensional Manhattan Street Networks
TLDR
It is shown that the n-dimensional Manhattan street network M_n is a Cayley digraph, which can be seen as a subgroup of the $n-dimensional version of the wallpaper group $pgg$, which induces a useful new representation of $M_n$ that can be applied to design a local (shortest-path) routing algorithm and to study some other metric properties, such as the diameter. Expand
The spectra of Manhattan street networks
The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing,Expand
The spectra of Manhattan street networks
The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing,Expand
Manhattan Product of Digraphs
We review the Manhattan product of digraphs from the viewpoint of spectral analysis and obtain some preliminary formulae. As an example, the spectmm of the Manhattan product of the directed pathExpand
Estudi i disseny de grans xarxes d'interconnexió: modularitat i comunicació
Normalment les grans xarxes d'interconnexio o de comunicacions estan dissenyades utilitzant tecniques de la teoria de grafs. Aquest treball presenta algunes contribucions a aquest tema. Concretament,Expand

References

SHOWING 1-10 OF 12 REFERENCES
Optimal communication algorithms for Manhattan Street networks
TLDR
The mean internodal distance and the saturation throughput of the Manhattan Street network are evaluated, and a simple shortest path routing algorithm is presented for this topology and an edge-disjoint Hamiltonian cycles are constructed. Expand
On network characterization of and optimal broadcasting in the Manhattan Street Network
  • T. Chung, D. Agrawal
  • Computer Science
  • Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration
  • 1990
The authors introduce the tilted-tree concept to obtain a closed-form solution for the average distance and diameter. A simple distributed algorithm for optimal broadcasting in Manhattan StreetExpand
Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks
TLDR
Manhattan Street Networks are considered, which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. Expand
Routing in the Manhattan Street Network
TLDR
Several distributed routing rules are investigated that take advantage of the regular structure of the Manhattan Street Network, and two procedures are described that allow the network to adapt to node or link failures. Expand
Design and analysis of multidimensional Manhattan street networks
TLDR
The proposed MMSN is shown to possess better performance parameters than the MSN topology and to be able to be extended to a multidimensional MSN by a simple edge division operation. Expand
Topological properties of Manhattan street networks
TLDR
The letter is concerned with the determination of the minimum mean internode distances (MIMINDs) and the topology z-transforms, T(z), of two different types of MSN. Expand
Methods and problems of communication in usual networks
TLDR
A survey of existing methods of communication in usual networks, particularly the complete network, the ring, the torus, the grid, the hypercube, the cube connected cycles, the undirected de Bruijn graph, the stargraph, the shuffle-exchange graph, and the butterfly graph. Expand
The multidimensional torus: analysis of average hop distance and application as a multihop lightwave network
TLDR
The authors provide a closed-form, analytical formula for the average hop distance in a three-dimensional torus network with unidirectional links, and hypothesize an approximate result for higher dimensions. Expand
Genetic Programming to Design Communication Algorithms for Parallel Architectures
TLDR
A new way of producing broadcasting schemes using genetic programming is described, which has proven successful by easily finding optimal algorithms for several well-known families of networks and has indeed generated a new scheme for butterflies that improves the known upper bound for the broadcasting time of these networks. Expand
Regular multihop logical topologies for lightwave networks
TLDR
This article provides brief descriptions of these regular logical network topologies and a comparative study of their various performance metrics, e.g., average hop distance, network utilization, routing, fault tolerance, and scalability. Expand
...
1
2
...