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...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
出版: |
2008
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/2455 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|