Locally-optimal deflection routing in the Bidirectional Manhattan Network
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 458-464 vol.2
- https://doi.org/10.1109/infcom.1990.91282
Abstract
A class of shortest-path distributed-routing techniques is presented, and the authors show a locally optimal solution under uniform traffic assumptions. It is argued that, as the number of nodes grows to infinity, the throughput tends to the limit represented by the maximum throughput attainable with the store-and-forward technique and infinite queueing storage. The results obtained show the suitability, as far as the throughput is concerned, of meshed networks using packet switching without storing packets at nodes. The routing techniques investigated perform similarly. At least one of these is simple enough to be implemented with very-fast circuitry, able to cope with the speed foreseen in future metropolitan-area networks (MANs).Keywords
This publication has 3 references indexed in Scilit:
- Packet-switching network architectures for very-high-speed servicePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Routing in the Manhattan Street NetworkIEEE Transactions on Communications, 1987
- On Distributed Communications NetworksIEEE Transactions on Communications, 1964