Optimising OSPF Database by Intra-Area Summarization: A New Approach

With the growing demand of communication, the need for networking is increasing day by day. Networking being the backbone of computer industry faces the greatest challenge. Factors like cost, time and memory size utilization are always the bottle neck for this industry. Various methods are available for dealing this problem. Protocols like EIGRP, OSPF, RIP, BGP, etc. are used in industry for establishing a network nowadays. These protocols have different working methods but the primary goal of all these routing protocols is the same. The aim is to calculate a path with a least cost so as to send traffic (both data and voice) via that path. This paper suggests and purposes a new technique for OSPF protocol working, for saving the database size and reducing routing table size resulting in better convergence time