IDEAS home Printed from https://ideas.repec.org/a/bjb/journl/v15y2026i2p1695-1699.html

Efficient Routing Using the Open Shortest Path First (OSPF) Protocol

Author

Listed:
  • Renuka Sunil Kapare

    (Department of Computer Science)

  • Dr. D.Y. Pati

    (Department of Computer Science)

Abstract

Open Shortest Path First (OSPF) is a widely deployed link-state Interior Gateway Protocol (IGP) designed for routing IP packets within a single Autonomous System (AS). This report details the methodology of implementing OSPF, highlighting its mechanism of building a topological map of the network and using Dijkstra’s Shortest Path First (SPF) algorithm to calculate optimal routes. Key aspects such as LSA flooding, neighbor adjacency formation, and multi-area design are examined. Results indicate OSPF provides fast convergence, efficient path determination, and loop-free topology, making it ideal for large enterprise networks.

Suggested Citation

  • Renuka Sunil Kapare & Dr. D.Y. Pati, 2026. "Efficient Routing Using the Open Shortest Path First (OSPF) Protocol," International Journal of Latest Technology in Engineering, Management & Applied Science, International Journal of Latest Technology in Engineering, Management & Applied Science (IJLTEMAS), vol. 15(2), pages 1695-1699, February.
    • Handle: RePEc:bjb:journl:v:15:y:2026:i:2:p:1695-1699
    as

    Download full text from publisher

    File URL: https://www.ijltemas.in/submission/online/article/view/4267/5756
    Download Restriction: no
    File URL: https://www.ijltemas.in/submission/online/article/view/4267/5757
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bjb:journl:v:15:y:2026:i:2:p:1695-1699. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dr. Pawan Verma (email available below). General contact details of provider: https://www.ijltemas.in/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.