A uniform randomized routing algorithm.

Given a set of routes between pairs of sites over a communication network, the traffic load of a link measures the number of routes using it. We analyze traffic load for some randomized local routing algorithms, some of which assume geometric information on the network. We also propose a uniform ran...

Full description

Bibliographic Details
Main Author:	Contreras, Felipe.
Other Authors:	Stojmenovic, Ivan
Format:	Others
Published:	University of Ottawa (Canada) 2009
Subjects:	Computer Science.
Online Access:	http://hdl.handle.net/10393/6222 http://dx.doi.org/10.20381/ruor-11148

id	ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-6222
record_format	oai_dc
spelling	ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-62222018-01-05T19:04:18Z A uniform randomized routing algorithm. Contreras, Felipe. Stojmenovic, Ivan, Computer Science. Given a set of routes between pairs of sites over a communication network, the traffic load of a link measures the number of routes using it. We analyze traffic load for some randomized local routing algorithms, some of which assume geometric information on the network. We also propose a uniform randomized routing algorithm generating uniform distributed routes between a pair of sites where only source, destination and current neighbor information are available. 2009-03-23T13:04:26Z 2009-03-23T13:04:26Z 2002 2002 Thesis Source: Dissertation Abstracts International, Volume: 64-01, Section: B, page: 0282. 9780612764316 http://hdl.handle.net/10393/6222 http://dx.doi.org/10.20381/ruor-11148 94 p. University of Ottawa (Canada)
collection	NDLTD
format	Others
sources	NDLTD
topic	Computer Science.
spellingShingle	Computer Science. Contreras, Felipe. A uniform randomized routing algorithm.
description	Given a set of routes between pairs of sites over a communication network, the traffic load of a link measures the number of routes using it. We analyze traffic load for some randomized local routing algorithms, some of which assume geometric information on the network. We also propose a uniform randomized routing algorithm generating uniform distributed routes between a pair of sites where only source, destination and current neighbor information are available.
author2	Stojmenovic, Ivan,
author_facet	Stojmenovic, Ivan, Contreras, Felipe.
author	Contreras, Felipe.
author_sort	Contreras, Felipe.
title	A uniform randomized routing algorithm.
title_short	A uniform randomized routing algorithm.
title_full	A uniform randomized routing algorithm.
title_fullStr	A uniform randomized routing algorithm.
title_full_unstemmed	A uniform randomized routing algorithm.
title_sort	uniform randomized routing algorithm.
publisher	University of Ottawa (Canada)
publishDate	2009
url	http://hdl.handle.net/10393/6222 http://dx.doi.org/10.20381/ruor-11148
work_keys_str_mv	AT contrerasfelipe auniformrandomizedroutingalgorithm AT contrerasfelipe uniformrandomizedroutingalgorithm
_version_	1718599763092307968

A uniform randomized routing algorithm.

Similar Items