Stojmenovic, Ivan,Contreras, Felipe.2009-03-232009-03-2320022002Source: Dissertation Abstracts International, Volume: 64-01, Section: B, page: 0282.9780612764316http://hdl.handle.net/10393/6222http://dx.doi.org/10.20381/ruor-11148Given 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.94 p.Computer Science.Thesis