Efficient routing algorithms for anycast routing

Efficient routing algorithms for anycast routing

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 algori...

Full description

Bibliographic Details
Main Author: Tan, Choon Leng.
Other Authors: Low, Chor Ping
Format: Thesis
Published: 2008
Subjects:
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Online Access:http://hdl.handle.net/10356/2455

Internet

http://hdl.handle.net/10356/2455

Similar Items