CN110830370B - IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol - Google Patents

IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol Download PDF

Info

Publication number
CN110830370B
CN110830370B CN201911216964.9A CN201911216964A CN110830370B CN 110830370 B CN110830370 B CN 110830370B CN 201911216964 A CN201911216964 A CN 201911216964A CN 110830370 B CN110830370 B CN 110830370B
Authority
CN
China
Prior art keywords
ibgp
router
nodes
node
update
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911216964.9A
Other languages
Chinese (zh)
Other versions
CN110830370A (en
Inventor
王晓梅
李刚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian University of Posts and Telecommunications
Original Assignee
Xian University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian University of Posts and Telecommunications filed Critical Xian University of Posts and Telecommunications
Priority to CN201911216964.9A priority Critical patent/CN110830370B/en
Publication of CN110830370A publication Critical patent/CN110830370A/en
Application granted granted Critical
Publication of CN110830370B publication Critical patent/CN110830370B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/18—Loop-free operations

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses an IBGP route transmission updating method based on an OSPF protocol, which comprises the following steps: establishing IBGP peer connection in an autonomous system; each IBGP Router acquires Router IDs of all IBGP routers in the autonomous system; when the IBGP speaker has route updating, calculating the minimum spanning tree topological structure based on the OSPF link state database of the router; calculating a loop-free topological structure from the router serving as a root to the other IBGP nodes; the router establishes TCP connection with other IBGP nodes, sends a special Update message, and the other IBGP nodes receive the message and Update the routing information to finish the transmission of the routing Update by the IBGP router. The invention solves the problem of IBGP transmission route updating full connection, and solves the problems of complex network planning and router configuration and large network resource consumption in the prior art.

Description

IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol
Technical Field
The invention relates to the technical field of computer network routing, in particular to an IBGP (Internet protocol gateway protocol) transmission route updating method based on an OSPF (open shortest Path first) protocol.
Background
The BGP protocol is the most commonly used inter-domain routing protocol, and in order to prevent loops from being generated, a BGP speaker prohibits the routing information obtained from IBGP from being issued to its IBGP peer, and in order to implement the transfer of routing update information, full connectivity should be established between IBGP peers within the same autonomous system, and when the number of IBGP peers is large, the method will have a great influence on the consumption of network resources and the performance of routers.
To solve the IBGP full connection problem, the existing solutions include two types: BGP route reflection and BGP alliance.
BGP route reflection sets a route reflection group (Cluster) in an autonomous system, a route reflector is configured in the group, an IBGP peer of the route reflector is divided into a client and a non-client, IBGP connection is established between the route reflector and the client and route information is transmitted, and IBGP connection is not required to be established between the clients; full connectivity relationships must still be established between the route reflector and the non-clients, and between all non-clients.
The BGP alliance divides an autonomous system into a plurality of sub-autonomous systems, each sub-autonomous system adopts a private autonomous system number, IBGP peers inside the sub-autonomous systems adopt a full connection relation, and EBGP connection relations inside the alliance are established among the sub-autonomous systems.
Therefore, in the scheme for solving the problem of IBGP routing update full connection in the prior art, the problems of complex network planning and router configuration, large network resource consumption and serious influence on the performance of the router exist.
The above drawbacks are expected to be overcome by those skilled in the art.
Disclosure of Invention
Technical problem to be solved
In order to solve the above problems in the prior art, the present invention provides an IBGP transfer route updating method based on the OSPF protocol, which solves the problem of IBGP transfer route update full connection, and solves the problems of complex network planning and router configuration and large network resource consumption in the prior art.
(II) technical scheme
In order to achieve the purpose, the invention adopts the main technical scheme that:
an embodiment of the present invention provides an IBGP transfer route updating method based on an OSPF protocol, including the following steps:
step S100, establishing IBGP peer connection in the autonomous system;
step S200, each IBGP router acquires node information of all IBGP routers in the autonomous system;
step S300, when a certain IBGP router has route updating, the OSPF information corresponding to the router is searched, and the minimum spanning tree topological structure T is calculated by taking the IBGP router as a root1；
Step S400, generating a tree topology T with minimum1Based on the routing, the IBGP router is set as a root, and a loop-free topological structure T from the router to the rest IBGP nodes is calculated2；
Step S500, according to the loop-free topological structure T2And the IBGP router is used for transmitting the route update.
In an embodiment of the present invention, the step S100 further includes:
within the autonomous system, an IBGP peer connection is established, rather than establishing an IBGP peer full connection. If no loop exists in the routing between the IBGP peers in the topology, the routing update is feasible to be directly transmitted between the IBGP peers, and the establishment of full connection between the IBGP peers is unnecessary. The measure can solve the problems of complex network planning and router configuration and high network resource consumption in the prior art.
In an embodiment of the present invention, the step S200 includes:
step S210, each IBGP router expands the neighbor relation table and increases the information of all IBGP nodes in the autonomous system;
step S220, each IBGP router modifies the Keepalive message, and the following two parts of contents are added in the Keepalive message: the number of the IBGP routers in all the IBGP node parts in the neighbor relation table and the Router ID of the IBGP Router corresponding to the IBGP routers;
step S230, periodically sending the modified Keepalive message to a neighbor node to maintain a neighbor relation;
step S240, each IBGP router receives a Keepalive message transmitted by a neighbor IBGP node;
step S250, comparing Router IDs of the IBGP routers in the Keepalive message with all IBGP nodes in the neighbor relation table of the IBGP routers in sequence, if no matching entry exists in the neighbor relation table, adding the entry in the neighbor relation table, and if a matching entry exists, updating the entry;
step S260, go to step S220.
In an embodiment of the present invention, the step S300 further includes:
the routers operating OSPF protocol maintain the link state database in the autonomous system, generate a topology weighted directed graph by using the link state database, and calculate the minimum spanning tree topology T by taking the IBGP router as the root1。
In an embodiment of the present invention, the step S400 further includes:
obtaining all node information of non-IBGP router in the autonomous system by using link state database maintained by OSPF protocol, and generating tree topology structure T in minimum1On the basis, the IBGP router is set as a root, and non-IBGP router nodes which do not influence the accessibility of the root router to all IBGP routers are deleted, namely a loop-free topological structure T is obtained2；
The process of deleting the non-IBGP router nodes is as follows: and logically deleting a certain non-IBGP router node, testing the accessibility of the root router to all IBGP routers, deleting the non-IBGP router node if the node is accessible, and reserving the non-IBGP router node if the node is inaccessible, wherein the processes are repeated until all the non-IBGP router nodes are tested.
In an embodiment of the present invention, the step S500 includes:
step S510, according to the loop-free topological structure T2Establishing TCP connection between the root IBGP router with the route update and other IBGP nodes;
step S520, route updating information is sent through a special Update message;
and step S530, the other IBGP nodes receive the message and update the routing information, so that the IBGP router transmits the routing update.
In an embodiment of the present invention, the special Update packet in step S520 further includes:
the special Update message and the ordinary Update message are different in that the ordinary Update message is only sent between IBGP peers, the special Update message can be sent between different IBGP nodes, and the special Update message is not limited between the IBGP peers and is used for realizing the rapid transmission of the route Update data to each IBGP node in the autonomous system.
(III) advantageous effects
The invention has the beneficial effects that: based on the link state database of the OSPF protocol, a loop-free topological structure from the IBGP router to other IBGP nodes is calculated, and the problem that the IBGP transmits route updating full connection for preventing route loop is solved. Meanwhile, the invention transmits the route update to be automatically completed by the IBGP router without configuration, thereby solving the problems of complex network planning and router configuration and large network resource consumption in the prior art.
Drawings
Fig. 1 is a flowchart of an IBGP delivery route updating method based on the OSPF protocol according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating how each IBGP router obtains node information of all IBGP routers in the autonomous system according to an embodiment of the present invention;
fig. 3 is a flowchart illustrating an implementation of IBGP router to transmit route updates by a ring-less topology according to an embodiment of the present invention.
Detailed Description
For the purpose of better explaining the present invention and to facilitate understanding, the present invention will be described in detail by way of specific embodiments with reference to the accompanying drawings.
All technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
In the related embodiment of the invention, an IBGP transmission route updating method based on an OSPF protocol is provided, a loop-free topological structure from an IBGP router to other IBGP nodes is calculated based on a link state database of the OSPF protocol, and the problem of IBGP transmission route updating full connection for preventing route loop is solved. Meanwhile, the invention transmits the route update to be automatically completed by the IBGP router without configuration, thereby solving the problems of complex network planning and router configuration and large network resource consumption in the prior art.
Fig. 1 is a flowchart of an IBGP delivery route updating method based on the OSPF protocol according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:
as shown in fig. 1, step S100, inside the autonomous system, an IBGP peer connection is established;
as shown in fig. 1, in step S200, each IBGP router acquires node information of all IBGP routers in the autonomous system;
as shown in fig. 1, in step S300, when a certain IBGP router has a route update, the OSPF information corresponding to the router is searched, and the minimum spanning tree topology T is calculated by taking the IBGP router as a root1；
As shown in fig. 1, in step S400,with minimum spanning tree topology T1Based on the routing, the IBGP router is set as a root, and a loop-free topological structure T from the router to the rest IBGP nodes is calculated2；
As shown in FIG. 1, step S500 is performed according to a ring-free topology T2And the IBGP router is used for transmitting the route update.
The specific implementation of the steps of the embodiment shown in fig. 1 is described in detail below:
in step S100, an IBGP peer connection is established inside the autonomous system.
In an embodiment of the present invention, the step S100 further includes:
within the autonomous system, an IBGP peer connection is established, rather than establishing an IBGP peer full connection. If no loop exists in the routing between the IBGP peers in the topology, the routing update is feasible to be directly transmitted between the IBGP peers, and the establishment of full connection between the IBGP peers is unnecessary. The measure can solve the problems of complex network planning and router configuration and high network resource consumption in the prior art.
In step S200, each IBGP router acquires node information of all IBGP routers within the autonomous system.
Fig. 2 is a flowchart of each IBGP router obtaining information of all IBGP router nodes in the autonomous system in an embodiment of the present invention. As shown in fig. 2, in an embodiment of the present invention, the step S200 includes:
step S210, each IBGP router expands the neighbor relation table and increases the information of all IBGP nodes in the autonomous system;
step S220, each IBGP router modifies the Keepalive message, and the following two parts of contents are added in the Keepalive message: the number of the IBGP routers in all the IBGP node parts in the neighbor relation table and the Router ID of the IBGP Router corresponding to the IBGP routers;
step S230, periodically sending the modified Keepalive message to a neighbor node to maintain a neighbor relation;
step S240, each IBGP router receives a Keepalive message transmitted by a neighbor IBGP node;
step S250, comparing Router IDs of the IBGP routers in the Keepalive message with all IBGP nodes in the neighbor relation table of the IBGP routers in sequence, if no matching entry exists in the neighbor relation table, adding the entry in the neighbor relation table, and if a matching entry exists, updating the entry;
step S260, go to step S220.
In step S300, when a certain IBGP router has a route update, the OSPF information corresponding to the router is searched, and the minimum spanning tree topology T is calculated by taking the IBGP router as a root1。
In an embodiment of the present invention, the step S300 further includes:
the routers operating OSPF protocol maintain the link state database in the autonomous system, generate a topology weighted directed graph by using the link state database, and calculate the minimum spanning tree topology T by taking the IBGP router as the root1。
In step S400, the tree topology T is generated with minimum1Based on the routing, the IBGP router is set as a root, and a loop-free topological structure T from the router to the rest IBGP nodes is calculated2；
In an embodiment of the present invention, the step S400 further includes:
obtaining all node information of non-IBGP router in the autonomous system by using link state database maintained by OSPF protocol, and generating tree topology structure T in minimum1On the basis, the IBGP router is set as a root, and non-IBGP router nodes which do not influence the accessibility of the root router to all IBGP routers are deleted, namely a loop-free topological structure T is obtained2；
The process of deleting the non-IBGP router nodes is as follows: and logically deleting a certain non-IBGP router node, testing the accessibility of the root router to all IBGP routers, deleting the non-IBGP router node if the node is accessible, and reserving the non-IBGP router node if the node is inaccessible, wherein the processes are repeated until all the non-IBGP router nodes are tested.
In step S500, according to acyclicTopological structure T2And the IBGP router is used for transmitting the route update.
Fig. 3 is a flowchart illustrating an implementation of IBGP router to transmit route updates by a ring-less topology according to an embodiment of the present invention.
As shown in fig. 3, in an embodiment of the present invention, the step S500 includes:
step S510, according to the loop-free topological structure T2Establishing TCP connection between the root IBGP router with the route update and other IBGP nodes;
step S520, route updating information is sent through a special Update message;
and step S530, the other IBGP nodes receive the message and update the routing information, so that the IBGP router transmits the routing update.
In an embodiment of the present invention, the special Update packet in step S520 further includes:
the special Update message and the ordinary Update message are different in that the ordinary Update message is only sent between IBGP peers, the special Update message can be sent between different IBGP nodes, and the special Update message is not limited between the IBGP peers and is used for realizing the rapid transmission of the route Update data to each IBGP node in the autonomous system.
In summary, the method provided in the embodiment of the present invention calculates the loop-free topology structure from the IBGP router to the other IBGP nodes based on the link state database of the OSPF protocol, and solves the problem that the IBGP transmits the route update full connection to prevent the routing loop. Meanwhile, the invention transmits the route update to be automatically completed by the IBGP router without configuration, thereby solving the problems of complex network planning and router configuration and large network resource consumption in the prior art.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.

Claims (1)

1. An IBGP route update transmission method based on an OSPF protocol is characterized by comprising the following steps:
step S100, establishing IBGP peer connection instead of establishing IBGP peer full connection in the autonomous system;
step S200, each IBGP router acquires node information of all IBGP routers in the autonomous system, and the method comprises the following steps: each IBGP router expands the neighbor relation table and increases the information of all IBGP nodes in the autonomous system; each IBGP router modifies a Keepalive message, and the number of the IBGP routers in all IBGP node parts in the neighbor relation table and the RouterID corresponding to the IBGP routers are increased in the Keepalive message; periodically sending the modified Keepalive message to a neighbor node to maintain a neighbor relation; each IBGP router receives a Keepalive message transmitted by a neighbor IBGP node; comparing the RouterID of the IBGP router in the Keepalive message with all IBGP nodes in the neighbor relation table of the IBGP router in sequence, if no matching entry exists in the neighbor relation table, adding the entry in the neighbor relation table, and if a matching entry exists, updating the entry;
step S300, when a certain IBGP router has route updating, the OSPF information corresponding to the router is searched, and the minimum spanning tree topological structure T is calculated by taking the IBGP router as a root1；
Step S400, generating a tree topology T with minimum1Based on the routing, the IBGP router is set as a root, and a loop-free topological structure T from the router to the rest IBGP nodes is calculated2The method comprises the following steps: obtaining all node information of non-IBGP router in the autonomous system by using link state database maintained by OSPF protocol, and generating tree topology structure T in minimum1On the basis of the above formula IThe BGP router is set as a root, and non-IBGP router nodes which do not influence the accessibility of the root router to all IBGP routers are deleted, namely a loop-free topological structure T is obtained2(ii) a The process of deleting the non-IBGP router nodes is as follows: logically deleting a certain non-IBGP router node, then testing the accessibility of the root router to all IBGP routers, if the node is accessible, deleting the non-IBGP router node, if the node is inaccessible, reserving the non-IBGP router node, and repeating the process until all the non-IBGP router nodes are tested;
step S500, according to the loop-free topological structure T2Establishing TCP connection between the root IBGP router with the route update and other IBGP nodes; sending route updating information through a special Update message; and the other IBGP nodes receive the message and update the routing information, so that the IBGP router transmits the routing update.
CN201911216964.9A 2019-12-03 2019-12-03 IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol Active CN110830370B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911216964.9A CN110830370B (en) 2019-12-03 2019-12-03 IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911216964.9A CN110830370B (en) 2019-12-03 2019-12-03 IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol

Publications (2)

Publication Number Publication Date
CN110830370A CN110830370A (en) 2020-02-21
CN110830370B true CN110830370B (en) 2021-12-10

Family

ID=69543437

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911216964.9A Active CN110830370B (en) 2019-12-03 2019-12-03 IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol

Country Status (1)

Country Link
CN (1) CN110830370B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112671654B (en) * 2020-12-28 2022-09-27 北京东土军悦科技有限公司 Routing information updating method, device, equipment and medium and OSPF network

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101252488A (en) * 2008-04-15 2008-08-27 中国科学院计算技术研究所 Multi self-governing system router level topology processing system and method
CN101483610A (en) * 2009-02-26 2009-07-15 迈普（四川）通信技术有限公司 Route updating method for link state routing protocol
US8089968B2 (en) * 2004-12-29 2012-01-03 Cisco Technology, Inc. Automatic prioritization of BGP next-hop in IGP convergence
US8861340B1 (en) * 2012-03-12 2014-10-14 Juniper Networks, Inc. Fast reroute using maximally redundant trees
CN105591937A (en) * 2015-09-30 2016-05-18 杭州华三通信技术有限公司 Network topology information acquisition method and device
CN106385364A (en) * 2016-09-05 2017-02-08 杭州华三通信技术有限公司 Route updating method and device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9331910B2 (en) * 2013-06-19 2016-05-03 Cumulus Networks, Inc. Methods and systems for automatic generation of routing configuration files
CN108924011A (en) * 2018-08-14 2018-11-30 赛尔网络有限公司 Monitoring system, relevant device, method and medium for OSPF+ Routing Protocol

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8089968B2 (en) * 2004-12-29 2012-01-03 Cisco Technology, Inc. Automatic prioritization of BGP next-hop in IGP convergence
CN101252488A (en) * 2008-04-15 2008-08-27 中国科学院计算技术研究所 Multi self-governing system router level topology processing system and method
CN101483610A (en) * 2009-02-26 2009-07-15 迈普（四川）通信技术有限公司 Route updating method for link state routing protocol
US8861340B1 (en) * 2012-03-12 2014-10-14 Juniper Networks, Inc. Fast reroute using maximally redundant trees
CN105591937A (en) * 2015-09-30 2016-05-18 杭州华三通信技术有限公司 Network topology information acquisition method and device
CN106385364A (en) * 2016-09-05 2017-02-08 杭州华三通信技术有限公司 Route updating method and device

Also Published As

Publication number Publication date
CN110830370A (en) 2020-02-21

Similar Documents

Publication Publication Date Title
US7978708B2 (en) Automatic route tagging of BGP next-hop routes in IGP
US6704795B1 (en) Technique for reducing consumption of router resources after BGP restart
US7436838B2 (en) Automatic prioritization of BGP next-hop in IGP
EP2911348A1 (en) Control device discovery in networks having separate control and forwarding devices
WO2017148425A1 (en) Border gateway protocol for communication among software defined network controllers
US20130254415A1 (en) Routing requests over a network
US10084558B2 (en) Cross-domain clock synchronization method, device and system and computer storage medium
JP2017028698A (en) Traffic switching method, device, and system
US8667174B2 (en) Method and system for survival of data plane through a total control plane failure
KR20140043778A (en) Method and node for supporting routing via inter as path
CN111598564B (en) Block chain node connection establishment method, device and equipment
CN103209108A (en) Dynamic virtual private network (DVPN)-based route generation method and equipment
WO2017084448A1 (en) Network system and network operating method
CN101155119B (en) Method and device for confirming boundary node of autonomous system and its path computing method
WO2013078776A1 (en) Establishing a label distribution protocol ldp remote neighbor relationship
CN103825826A (en) Method and device for implementing dynamic routing
US8811226B2 (en) Management of routing topology in a network
CN110830370B (en) IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol
US20190273633A1 (en) Link state packet transmission method and routing node
CN104994019A (en) Horizontal direction interface system for SDN controller
US20210218663A1 (en) Automatic route reflector configuration system
Jingjing et al. The deployment of routing protocols in distributed control plane of SDN
Zhang et al. Survivable path computation in PCE-based multi-domain networks
CN109617776A (en) The method and system of software defined network controller based on distributed hash table
JP2010199882A (en) Communication system, path computation device, path computation method and program

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant