Abstract
The Manhattan Street Network (MSN) merged as a powerful two-connected network, well suited to a local and metropolitan area. Routing in MSN is crucial for throughput and delay. In this article an optimal routing algorithm for MSN. OMRA, is proposed, This algorithm is general, that is, it can be easily applied to any MSN configuration, because the authors develop new equations that can convert au absolute addressing into relative addressing for any MSN configuration of any size. Based on the OMRA, we developed a new algorithm, RAA, that uses absolute addressing to find the optimal path. The OMRA shows encouraging results when it is compared to previous ones in the literature: it has a better average delay. In addition, all nodes are treated the same, and so very few calculations are made at each node and there is no need to do calculations when the RAA algorithm is used. However, a storage element to store K bytes (K is the number of nodes in the network) of information is needed at each node.
| Original language | English |
|---|---|
| Pages (from-to) | 146-153 |
| Number of pages | 8 |
| Journal | International Journal of Computers and Applications |
| Volume | 25 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2003 |
| Externally published | Yes |
Keywords
- Manhattan Street Network
- Optimal path
- Routing
- Shortest path
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Science Applications
- Computer Graphics and Computer-Aided Design