Simulation and Analysis of OSPFv2 DR Election Based on GNS

DOI

10.2991/citcs.2012.131How to use a DOI?

Keywords

OSPF; DR; BDR; DR Election; GNS

Abstract

Designated Router (DR) is the key for the quality of an Open Shortest Path First (OSPF) network and it enables a reduction in the number of adjacencies, which in turn reduces the amount of routing protocol traffic and the size of the Link State Database (LSDB). In this paper, we analyze the principle of OSPFv2?s DR election algorithm and carry out the simulation based on GNS3. The simulation can provide a reference for building an OSPF network. In the simulations, we focus on two types of DR Election process: Normal DR Election and DR re-election. Experimental results show that the election of DR and BDR can reduce the amount of OSPF traffic and ensure an orderly transition from Backup Designated Router to Designated Router. However, through the simulation we also learn that lots of unnecessary DR election operations are executed, which consume the routers? CPU resource and occupy their processing time. To improve the election algorithm, we offer several modifications. We detach and subdivide the NeighborChange event that invokes the election algorithm into more specific granularity. Through these measures, the DR election algorithm is expected to dispense with the extra election, reduce network convergence speed, and thereby improve network performance.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaohua Li
AU  - Jian Xu
AU  - Juan Nie
AU  - Chengkui Guo
AU  - Xiangang Zhao
PY  - 2012/11
DA  - 2012/11
TI  - Simulation and Analysis of OSPFv2 DR Election Based on GNS
BT  - Proceedings of the 2012 National Conference on Information Technology and Computer Science
PB  - Atlantis Press
SP  - 510
EP  - 513
SN  - 1951-6851
UR  - https://doi.org/10.2991/citcs.2012.131
DO  - 10.2991/citcs.2012.131
ID  - Li2012/11
ER  -