A Simplified Flooding Phase Scheme Based on OSPF Routing Protocol
draft-wu-lsr-simplified-00
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Mingzhen Wu , Ying Zhou , Liang Wang , Yuyin Ma | ||
Last updated | 2024-09-20 (Latest revision 2024-03-19) | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This distributed routing protocol aims to facilitate information exchange and path calculation between routers to ensure efficient data transmission in the network. Each router initializes adjacency matrices, neighbor tables, routing tables, and flood flags during setup. In operation, routers periodically broadcast Hello packets to update neighbor tables and detect changes in neighbor relationships, broadcasting update packets accordingly. Nodes receiving update packets process them based on flood flags, optimizing network performance through scheduled flood flag resets, controlling link occupancy rates, and utilizing Dijkstra's algorithm to compute shortest paths when adjacency matrices are complete, storing results in routing tables for optimal path selection.
Authors
Mingzhen Wu
Ying Zhou
Liang Wang
Yuyin Ma
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)