Centralized link-scope configuration of an internet protocol (IP) network
作者： Balázs Peter Gerö , Attila Rajmund Nohl , Gábor Tóth , Gergely Molnar
DOI:
关键词: Open Shortest Path First 、 Distributed computing 、 Node (networking) 、 Disjoint sets 、 Internet protocol suite 、 Topology (electrical circuits) 、 Computer network 、 Graph (abstract data type) 、 Link (geometry) 、 Internet Protocol 、 Mathematics
摘要: A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An network includes at least one station, set nodes, and communication links between the nodes station nodes. Preferably, an Open Shortest Path First (OSPF) topology graph is prepared, target to be configured identified. The are then classified into N disjoint subsets, T 1 -T . each subset parallel, starting with sequentially handling one-by-one. may by removing non-target that not OSPF graph, building LinkGraph determine dependencies remaining LinkTree classify subsets based upon links.
lens.org 参考文章(4)
Roshan Sequeira, P. Krishnan, Tejas Naik, Ganesan Ramu, Sequencing of Configuration Operations for IP Networks usenix large installation systems administration conference. pp. 265- 274 ,(2000)
Tejas Naik, Ganesan Ramu, Subrata Mazumdar, P. Krishnan, Method to sequence changes for IP network configuration ,(2000)
Stephen Schleimer, Clare Chu, Method and apparatus for determining a layer 2 path in a switched network ,(2000)
Mehryar Garakani, Method of determining a data link path in a managed network ,(2000)