Show simple item record

dc.contributor.authorChen, Johnny
Druschel, Peter
Subramanian, Devika
dc.date.accessioned 2017-08-02T22:03:43Z
dc.date.available 2017-08-02T22:03:43Z
dc.date.issued 1998-11-18
dc.identifier.urihttps://hdl.handle.net/1911/96497
dc.description.abstract We present a new routing algorithm to compute paths within a network using dynamic link metrics. Dynamic link metrics are cost metrics that depend on a link's dynamic characteristics, e.g., the congestion on the link. Our algorithm is destination-initiated: the destination initiates a global path computation to itself using dynamic link metrics. All other destinations that do not initiate this dynamic metric computation use paths that are calculated and maintained by a traditional routing algorithm using static link metrics. Analysis of Internet packet traces show that a high percentage of network traffic is destined for a small number of networks. Because our algorithm is destination-initiated, it achieves maximum performance at minimum cost when it only recomputes dynamic metric paths to these selected "hot" destination networks. This selective approach to route recomputation reduces many of the problems (principally route oscillations) associated with calculating all routes simultaneously. We compare the routing efficiency and end-to-end performance of our algorithm against those of traditional algorithms using dynamic link metrics. The results of our experiments show that our algorithm can provide higher network performance at a significantly lower routing cost under conditions that arise in real networks. The effectiveness of the algorithm stems from the independent, time-staggered recomputation of important paths using dynamic metrics, allowing for splits in congested traffic that cannot be made by traditional routing algorithms.
dc.format.extent 27 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title A New Approach to Routing With Dynamic Metrics
dc.type Technical report
dc.date.note November 18, 1998
dc.identifier.digital TR98-321
dc.type.dcmi Text
dc.identifier.citation Chen, Johnny, Druschel, Peter and Subramanian, Devika. "A New Approach to Routing With Dynamic Metrics." (1998) https://hdl.handle.net/1911/96497.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record