Please use this identifier to cite or link to this item:
|Title:||Efficient routing algorithms for anycast routing||Authors:||Tan, Choon Leng.||Keywords:||DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks||Issue Date:||2002||Abstract:||In this research project, we proposed three anycast routing heuristics: the shortest widest path routing algorithm (SWP), the widest shortest path routing algorithm (WSP), and the max-min matching routing algorithm (MMRA). The SWP and WSP are found to have better performance than the existing algorithms. The MMRA is able to achieve a high probability of find feasible solution whenever one exists.||URI:||http://hdl.handle.net/10356/2455||Rights:||Nanyang Technological University||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.