A Sensitivity Analysis based Shortest Path Tree Restoration Approach for Link-State Routing Protocols
碩士 === 國立中正大學 === 通訊工程研究所 === 97 === IS-IS and OSPF are widely used intra-domain Link-State (LS) routing protocols. They are designed to enable all the routers in the routing domain to construct their routing tables consistently and efficiently. When the link state of the network changes, those LS...
Main Authors: | Ching Jen, 曾敬任 |
---|---|
Other Authors: | Huan Chen |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/35695642074428596799 |
Similar Items
-
Shortest Path Routing Protocol Based on the Vertical Angle for Underwater Acoustic Networks
by: Meiju Li, et al.
Published: (2019-01-01) -
Shortest Path Routing Modelling, Infeasibility and Polyhedra
by: Call, Mikael
Published: (2012) -
A shortest path routing algorithm for supercube
by: LIAN, XIU-JIN, et al.
Published: (1992) -
An empirical study of the structure of the shortest path tree
by: Mindaugas Bloznelis, et al.
Published: (2008-12-01) -
On the shortest path and minimum spanning tree problems
by: Pettie, Seth
Published: (2008)