| 摘要 |
A routing logic means is proposed for adaptive and distributed routing in packet switching networks. This routing logic means makes an accurate routing choice needing only minimal signalling overhead. This is achieved by combining only local delay information with less dynamic topological information, such as the hop distance to the destination node, into a third cost value and making the routing decision based on this third cost value. This is achieved by only taking into account the delay incured over a first portion of a possible path, the remaining second portion being accounted for via the hop distance represented by it. <IMAGE> |
