Deterministic, reduced-visibility inter-domain forwarding

Strowes, S.D. and Perkins, C. (2009) Deterministic, reduced-visibility inter-domain forwarding. In: Proceedings of the 5th international student workshop on Emerging networking experiments and technologies, Rome, Italy, December, 2009, pp. 9-10. (doi:10.1145/1658997.1659003)

Full text not currently available from Enlighten.

Publisher's URL: http://dx.doi.org/10.1145/1658997.1659003

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.

Item Type:Conference Proceedings
Additional Information:ISBN: 978-1-60558-751-6
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Perkins, Dr Colin
Authors: Strowes, S.D., and Perkins, C.
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record