IDRP protocol analysis: storage complexity

Authors:
Yakov Rekhter
Affiliations:
-
Venue:
ACM SIGCOMM Computer Communication Review
Year:
1992

Citing 2
Cited 1

New methods to color the vertices of a graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

QoS based routeing for ATM networks

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

IDRP is an inter-domain routing protocol that is based on the path-vector routing algorithm. This paper analysis storage complexity of the protocol and suggests possible local techniques for reducing it.