Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/2455| 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 | Schools: | School of Computer Engineering | Rights: | Nanyang Technological University | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
| Appears in Collections: | SCSE Theses |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| TanChoonLeng02.pdf Restricted Access | Main report | 1.96 MB | Adobe PDF | View/Open |
Page view(s) 50
536
Updated on May 7, 2025
Download(s)
5
Updated on May 7, 2025
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.