Hybrid link-state, path-vector routing

Authors:
M. Abdul Alim;Timothy G. Griffin
Affiliations:
University of Cambridge, Cambridge, UK;University of Cambridge, Cambridge, UK
Venue:
Proceedings of the Sixth Asian Internet Engineering Conference
Year:
2010

Citing 7
Cited 0

Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols

Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
BRITE: Universal Topology Generation from a User''s Perspective

BRITE: Universal Topology Generation from a User''s Perspective
HLP: a next generation inter-domain routing protocol

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A Model of Internet Routing Using Semi-modules

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
The stratified shortest-paths problem

COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Path Problems in Networks

Path Problems in Networks
Traffic engineering with traditional IP routing protocols

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traffic engineering in Internet backbones can be improved by off-line optimization algorithms that automatically configure link weights used by routing protocols. However, with existing protocols large networks often require some type of partitioning in order to scale the routing protocol, and these partitions actually complicate the metrics to the extent that link-weight optimization is no longer practical. In this paper we study how an algebraic specification of a path problem can be naturally decomposed into simpler subproblems where each sub-problem can then be solved independently without changing the global metric being used network-wide. In addition, we go on to study four possible combinations of link-state and distance-vector mechanisms in this setting. In particular, we attempt to clarify the tradeoffs between fast convergence of link-state and low space requirements of distance-vector. The results provide a framework for analyzing existing mechanisms and for designing more reliable and robust routing protocols.