Topological routing is a table free alternative to traditional routing methods. It is specially well suited for organized network interconnection schemes. Topological routing algorithms correspond to the type O(1), constant complexity, being very attractive for large scale networks. It has been proposed for many topologies and this work compares the algorithms for three degree three topologies using a more analytical approach than previous studies.
|Tidsskrift||Image Processing & Communications|
|Status||Udgivet - dec. 2009|