Abstract

Security in link state routing protocols is a feature that is both desirable and costly. This paper examines the cost of security and presents two techniques for efficient and secure processing of link state updates. The first technique is geared towards a relatively stable internetwork environment while the second is designed with a more volatile environment in mind. 1 Introduction It is hardly necessary to motivate the need for security in a large, distributed internetwork environment. Since routing is a critical internetwork function, security of routing protocols is of the utmost importance. This has been widely recognized by the designers of many existing routing protocols. Sound security, however, often comes at a high price. Naturally, it is desirable to minimize the associated costs. This paper concentrates on reducing the costs of security in link state routing protocols. We begin with a brief discussion of current security methods (Section 2) and an overview of the general s...

Citations