A Distributed Lookahead-N Routing Strategy for High Speed Telecommunications Networks and Its Performance

摘要

In this paper, a new end-to-end efficient routing strategy is presented. It could be applied to any digital telecommunications network including LANs and WANs. A call can be accepted if there are enough resources to support it. The routing decisions in our proposed strategy are based on real-time information, available at each node, about the status of all nodes reachable in n hops from the node under consideration. Such information is communicated among different nodes by message passing through their signaling systems. This mechanism copes with scalability constraints as well as the limited number of hops to avoid the count forever problem. Looping problem has been addressed, where a metrics are posed to eliminate any temporary or permanent loops, while the call is trying to find a path. Performance simulation results of the proposed scheme are presented.