Method and system for selective link state advertisement blocking over a data network area
作者： Padmadevi Pillay-Esnault
DOI:
关键词: Flooding (computer networking) 、 Routing protocol 、 Engineering 、 Distributed computing 、 Link-state routing protocol 、 Router 、 Computer network 、 Shortest path problem 、 Link-state advertisement 、 Network topology 、 Open Shortest Path First
摘要: Method and system for efficiently handling hub spoke area topologies in a data network under Open Shortest Path First (OSPF) routing protocol which provides selective blocking of Link State Advertisements (LSAs) includes selectively the broadcast or flooding LSAs from routers to other respective unless route leaking is permitted particular router, router has backdoor connection, case, full shortest path first (SPF) run may be scheduled such that amount traffic minimized SPF runs reduced.
google.com.cu 参考文章(33)
Bradley Cain, Fast path forwarding of link state advertisements using a minimum spanning tree ,(1999)
Bradley Cain, Fast path forwarding of link state advertisements using multicast addressing ,(1999)
Masato Tsukakoshi, Shigeki Morimoto, Scalable cluster-type router device and configuring method thereof ,(1998)
Bhargav R. Bellur, Fred Lambert Templin, Nathan W. Williams, D. Scott Seaton, Carla Peccolo Woodworth, James A. Arnold, Richard G. Ogier, Michael W. Frandsen, Christian A Gellrich, Mobile ad hoc extensions for the internet ,(2000)
Shantigram Jagannath, Jim Luciani, Naganand Doraswamy, Method for transmitting label switching control information using the open shortest path first opaque link state advertisement option protocol ,(1998)
Yakov Rekhter, Efficient packet forwarding arrangement for routing packets in an internetwork ,(1996)
Alexey Dimitrievich Zinin, Ian Michael Charles Shand, Optimizing flooding of information in link-state routing protocol ,(2004)
Daniel C. Tappan, Hierarchical label switching across multiple OSPF areas ,(2002)