Article thumbnail

Deterministic, reduced-visibility inter-domain forwarding

By S.D. Strowes and C. Perkins

Abstract

Inter-domain forwarding state is growing at a super-linear rate, rendering older routers obsolete and increasing the cost of replacement. A reduction of state will alleviate this problem. In this paper, we outline a new reduced-state inter-domain forwarding mechanism. We carefully drop portions of the advertised forwarding state using a utility measure for prefixes based on the length of the prefix and the path length to its origin. A deterministic forwarding algorithm uses the resulting partial view. The graph of connections between autonomous systems is shallow, offering many viable paths for data flows, a property we aim to use to achieve minimal detrimental effect on delay and AS path stretch

Publisher: 'Association for Computing Machinery (ACM)'
Year: 2009
DOI identifier: 10.1145/1658997.1659003
OAI identifier: oai:eprints.gla.ac.uk:43145
Provided by: Enlighten
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.