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

Saved in:

Bibliographic Details
Main Author:	Tan, Choon Leng.
Other Authors:	Low, Chor Ping
Format:	Theses and Dissertations
Published:	2008
Subjects:	DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Online Access:	http://hdl.handle.net/10356/2455
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University

id	sg-ntu-dr.10356-2455
record_format	dspace
spelling	sg-ntu-dr.10356-24552023-03-04T00:31:54Z Efficient routing algorithms for anycast routing Tan, Choon Leng. Low, Chor Ping School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks 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. Master of Philosophy 2008-09-17T09:03:25Z 2008-09-17T09:03:25Z 2002 2002 Thesis http://hdl.handle.net/10356/2455 Nanyang Technological University application/pdf
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
topic	DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
spellingShingle	DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks Tan, Choon Leng. Efficient routing algorithms for anycast routing
description	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.
author2	Low, Chor Ping
author_facet	Low, Chor Ping Tan, Choon Leng.
format	Theses and Dissertations
author	Tan, Choon Leng.
author_sort	Tan, Choon Leng.
title	Efficient routing algorithms for anycast routing
title_short	Efficient routing algorithms for anycast routing
title_full	Efficient routing algorithms for anycast routing
title_fullStr	Efficient routing algorithms for anycast routing
title_full_unstemmed	Efficient routing algorithms for anycast routing
title_sort	efficient routing algorithms for anycast routing
publishDate	2008
url	http://hdl.handle.net/10356/2455
_version_	1759853033328476160

Efficient routing algorithms for anycast routing

Similar Items