Optimal communication algorithms for Manhattan Street networks

DOI10.1016/S0166-218X(97)00116-9zbMath0905.90071MaRDI QIDQ1392541

Emmanouel A. Varvarigos

Publication date: 11 January 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

shortest path routingsaturation throughputManhattan Street networkmean internodal distance

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (2)

The Multidimensional Manhattan Network ⋮ The spectra of Manhattan street networks

Cites Work

• Unnamed Item
• Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Data communication in parallel architectures
• Sharp approximate models of deflection routing in mesh networks
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Optimal communication algorithms for Manhattan Street networks