New Approaches to Routing for Large-Scale Data Networks (1999)
| Citations: | 6 - 0 self |
BibTeX
@TECHREPORT{Chen99newapproaches,
author = {Johnny Chen},
title = {New Approaches to Routing for Large-Scale Data Networks},
institution = {},
year = {1999}
}
Years of Citing Articles
OpenURL
Abstract
This thesis develops new routing methods for large-scale, packet-switched data networks such as the Internet. The methods developed increase network performance by considering routing approaches that take advantage of more available network resources than do current methods. Two approaches are explored: dynamic metric and multipath routing. Dynamic metric routing provides paths that change dynamically in response to network traffic and congestion, thereby increasing network performance because data travel less congested paths. The second approach, multipath routing, provides multiple paths between nodes and allows nodes to use these paths to best increase their network performance. Nodes in this environment achieve increased performance through aggregating the resources of multiple paths. This thesis implements and analyzes algorithms for these two routing approaches. The first approach develops hybrid-Scout, a dynamic metric routing algorithm that calculates independent and selective dynamic metric paths. These two calculation properties are key to reducing routing costs and avoiding routing instabilities, two difficulties commonly experienced







