CN111935012B - OSPF protocol-based enterprise network IP address convergence method and system - Google Patents
OSPF protocol-based enterprise network IP address convergence method and system Download PDFInfo
- Publication number
- CN111935012B CN111935012B CN202010938596.5A CN202010938596A CN111935012B CN 111935012 B CN111935012 B CN 111935012B CN 202010938596 A CN202010938596 A CN 202010938596A CN 111935012 B CN111935012 B CN 111935012B
- Authority
- CN
- China
- Prior art keywords
- network
- router
- convergence
- determining
- route
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5007—Internet protocol [IP] addresses
-
- 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/12—Shortest path evaluation
-
- 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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an enterprise network IP address convergence method and system based on an OSPF protocol, which comprises the following steps: acquiring the requirements of network access equipment; determining a routing entry a needing to be configured through an algorithm; determining a routing entry a' which needs to be configured on average by each router; optimizing the number c of terminals configured in each subnet; and finally, determining the network segment of the converged route and issuing the network segment to the OSPF network. The convergence method can obtain the network bit number of the convergence network segment through an algorithm, can obtain a more reasonable convergence network segment, improves the convergence time of the OSPF network, reduces the time of a core router for calculating the shortest path under the condition of ensuring uninterrupted service during engineering, can ensure the expansibility, flexibility and hierarchy of the network, and can also avoid the condition of network waste.
Description
Technical Field
The invention relates to the technical field of network communication, in particular to an enterprise network IP address convergence method and system based on an OSPF protocol.
Background
At present, the internet of a plurality of large enterprises is gradually evolved from a smaller internet, and the problem of unreasonable IP address allocation is increasingly highlighted while the enterprises are developed.
The unplanned IP address allocation brings great difficulty to smooth convergence of IP addresses, and the most effective method is to re-plan an IP address allocation strategy according to the existing enterprise scale and development plan. But this approach is somewhat impractical in view of the costs associated with re-planning and reconstruction and the economic loss of service interruption during the project.
Disclosure of Invention
The invention aims to provide an enterprise network IP address convergence method and system based on an OSPF protocol, which can improve the convergence time of the OSPF network, reduce detailed routing entries of the network under the condition of ensuring uninterrupted service during engineering and achieve the aim of reducing the routing calculation time of a router.
In order to achieve the above object, a first aspect of the present invention provides an enterprise network IP address convergence method based on an OSPF protocol, including the following steps:
step 1: acquiring the requirements of network access equipment;
step 2: acquiring a logical relation between route aggregation and router processing time shortening through a Dijkstra algorithm, and determining the range of a parameter a according to the logical relation, wherein a represents the total quantity of route entries required to be configured;
step 3, determining the quantity a' of route entries which are averagely required to be configured by each router for M routers by combining the quantity which needs to be repeatedly configured on all routers when each static router is configured;
step 4, optimizing the number c of terminals of each subnet based on the number a' of the routing entries which need to be configured averagely by each router;
step 5, based on the terminal number c of each subnet determined in the step 4, judging that the minimum value of c is in [2 ]b-1,2b]Thereby determining the number of host bits b configured for each subnet, thereby determining the number of network bits of the aggregated route to be 32-b;
and 6, performing AND operation on the network digits obtained in the step 5 and all routing entries in the enterprise network, determining a network segment of the converged routing, and distributing the determined converged routing configuration to the OSPF network.
According to a second aspect of the present invention, an enterprise network IP address convergence system based on OSPF protocol is further provided, which includes:
a requirement acquisition module for acquiring the requirement of the network access equipment, wherein the number of the terminals of m subnets in the enterprise is set as n1、n2、n3、n4...nmThe router has M sets, and the processing time of the router is improved by N times;
the configuration module is used for acquiring the logical relation between route aggregation and router processing time shortening through a Dijkstra algorithm, and determining the range of a parameter a according to the logical relation, wherein a represents the total quantity of route entries required to be configured;
the correcting module is used for determining the number a' of route entries which are averagely required to be configured by each router for M routers in combination with the number of repeated configurations which need to be carried out on all routers when each static router is configured;
the optimization module is used for optimizing the number c of terminals of each subnet based on the number a' of routing entries which need to be configured on average by each router;
for judging that the minimum value of c is located at [2 ] based on the determined number of terminals c per subnetb-1,2b]The subnet aggregation determining module is used for determining the number b of the host bits configured for each subnet, and accordingly determining the number of the network bits of the aggregated route to be 32-b;
and the convergence configuration module is used for carrying out AND operation on all the routing entries in the enterprise network based on the obtained network digits, determining the network segments of the convergence routing and issuing the determined convergence routing configuration to the OSPF network.
The traditional IP address convergence method based on the OSPF network only considers the service scale and performs IP address convergence by virtue of personal experience of engineers. The convergence method has the advantages that the influence of artificial factors is large, objective evaluation indexes are absent, and the method is easy to appear: (1) the convergence is too detailed, and the calculation burden of the router is increased. (2) The convergence is too general, and the IP address is wasted.
The convergence method provided by the invention comprehensively considers the service scale and the number of the routers, and simultaneously introduces the factors of the influence of Dijkstra algorithm in the OSPF routing protocol on the router calculation and the optimization target to determine the IP address convergence, and optimizes the router to calculate the OSPF routing burden while meeting the service requirement, thereby reducing the calculation burden of the router caused by the routing oscillation and finally achieving the purpose of improving the network stability.
It should be understood that all combinations of the foregoing concepts and additional concepts described in greater detail below can be considered as part of the inventive subject matter of this disclosure unless such concepts are mutually inconsistent. In addition, all combinations of claimed subject matter are considered a part of the presently disclosed subject matter.
The foregoing and other aspects, embodiments and features of the present teachings can be more fully understood from the following description taken in conjunction with the accompanying drawings. Additional aspects of the present invention, such as features and/or advantages of exemplary embodiments, will be apparent from the description which follows, or may be learned by practice of specific embodiments in accordance with the teachings of the present invention.
Drawings
The drawings are not intended to be drawn to scale. In the drawings, each identical or nearly identical component that is illustrated in various figures may be represented by a like numeral. For purposes of clarity, not every component may be labeled in every drawing. Embodiments of various aspects of the present invention will now be described, by way of example, with reference to the accompanying drawings, in which:
fig. 1 is a schematic flow chart of an implementation of an exemplary embodiment of the present invention.
Detailed Description
In order to better understand the technical content of the present invention, specific embodiments are described below with reference to the accompanying drawings.
In this disclosure, aspects of the present invention are described with reference to the accompanying drawings, in which a number of illustrative embodiments are shown. Embodiments of the present disclosure are not necessarily intended to include all aspects of the invention. It should be appreciated that the various concepts and embodiments described above, as well as those described in greater detail below, may be implemented in any of numerous ways, as the disclosed concepts and embodiments are not limited to any one implementation. In addition, some aspects of the present disclosure may be used alone, or in any suitable combination with other aspects of the present disclosure.
Referring to fig. 1, an enterprise network IP address convergence method based on the OSPF protocol according to an embodiment of the present invention generally includes the following steps:
step 1: acquiring the requirement of network access equipment, wherein the number of terminals of m subnets in an enterprise is set to be n respectively1、n2、n3、n4...nmThe router has M sets, and the processing time of the router is improved by N times;
step 2: acquiring a logical relation between route aggregation and router processing time shortening through a Dijkstra algorithm, and determining the range of a parameter a according to the logical relation, wherein a represents the total quantity of route entries required to be configured;
step 3, determining the number a' of route entries which are averagely required to be configured by each router for M routers by combining the number which needs to be repeatedly configured on all routers when each static router is configured;
step 4, optimizing the number c of terminals of each subnet based on the determined number a' of routing entries which need to be configured on average by each router;
step 5, based on the terminal number c of each subnet determined in the step 4, judging that the minimum value of c is in [2 ]b-1,2b]Thereby determining the number of host bits b configured for each subnet, thereby determining the number of network bits of the aggregated route to be 32-b;
and 6, performing AND operation on the network digits obtained in the step 5 and all routing entries in the enterprise network, determining a network segment of the converged routing, and distributing the determined converged routing configuration to the OSPF network, so that the routing calculation time of the network is reduced, and the overall performance of the network is improved.
Wherein the step 2 is configured to determine the number a of the total routing entries to be configured by:
wherein, in order
Representing the running time of Dijkstra algorithm and the number n of the top points, the time spent by a core router to run OSPF protocol to obtain the shortest path is
(ii) a The network is converged, and the number of IP network segments after m sub-networks are converged is k respectively1、k2、k3、k4…kmIf the number of routing entries to be configured is a, the time taken is：
The pre-convergence time cost is expressed as
The time spent after convergence is
(ii) a Therefore, under the condition that the processing time of the router is improved by N times, the maximum value of a is
。
In the embodiment of the invention
A function representing the run time and the number of vertices n of the Dijkstra algorithm. The simplest implementation of Dijkstra's algorithm is to store the set Q of all vertices with a linked list or array, so the operation of searching for the smallest element in Q only requires a linear search for all elements in Q. Thus, the router route computation time can be expressed by Dijkstra algorithm as
. And calculating the logical relation between the route convergence and the shortening of the processing time of the router through a Dijkstra algorithm, and comparing the running time before and after the convergence to obtain the range of the quantity a of the configured route entries.
It is assumed that the network is converged, and the number of the IP network segments after m areas are converged is k1、k2、k3、k4…kmIf the number of routing entries is a, the time is the same
The time before convergence is set to
The time spent after convergence is
The time ratio of (A) to (B) is:
setting:
then:
it can be found that:
namely, it is
：
The processing time of the router set according to the requirement is increased by N times, and a is at most
And (3) strips.
Based on the maximum number of the routes to be configured, wherein in step 3, the routes are repeatedly configured on all the routers according to the need of configuring one static route, and for M routers, the number a' of the route entries required to be configured on average by each router satisfies:
in step 4, since each subnet segment of the converged geology has a segment address and a broadcast address, of which 2 addresses are unavailable, the IP numbers of m subnets (also corresponding to areas) are respectively:
(n1+2)、(n2+2)、(n3+2)、(n4+2)…(nm+2)
thus, the number of terminals per subnet c is optimized as follows:
since a' satisfies
Therefore, by combining the value of the terminal number c, the following can be obtained:
wherein, the step 5 specifically comprises the following steps:
taking the minimum value of the terminal quantity c obtained in the step 4, and judging that the terminal quantity c is in [2 ]b-1,2b]Wherein the value of b is an integer, in particular by a logarithmic operation, i.e.:
the value of the host number c satisfies
Thus, combining the values of b, the following can be obtained:
thereby 32-b can be obtained as the number of network bits, i.e. the number of subnet mask bits.
In the above scheme of the present invention, the scale of the routing table in the router can be reduced through the route aggregation to save the memory, and the time required for the IP to analyze the routing table to find out the path to the remote network is shortened. On one hand, the route convergence method can realize the rapid convergence of IP addresses according to the requirements of enterprise users under the condition of ensuring the normal operation of the service, and a network segment for route convergence is obtained; on the other hand, the general convergence method can consider the expansibility of the network, reserve more IP addresses or network segments, but is influenced by various factors, and network resources are not applied for a long time, so that the address space is not sufficiently utilized.
The implementation of the above process will be described in more detail below with reference to engineering implementation as an example.
The enterprise is divided into 8 areas, the number of hosts in the 8 areas is 100000, the IP addresses of the hosts are in 132.254.0.0-132.255.255.255 network segments, the IP of the enterprise needs to be rapidly converged, and the route calculation time of a router is prolonged.
The company has 1000 routers to increase processing time by 10000 times.
Obtained by the method
So that the number of drive terminals c ranges from [2 ]6，27]Thereby determining b = 7.
In order to meet the requirement of rapid convergence, the network bit number is 7, and every 128 host IPs are converged into a network segment.
The enterprise can distribute host computers with the IP number of 217-1=131071, and the number of the network segments actually distributed is 131071/128=1024
The practical improvement of the processing capacity of the route calculation is
Basically meeting the lifting requirement, and the fluctuation is within 5 percent.
The aggregation network segments are allocated as follows:
132.254.0.0/32-132.254.0.127/32
132.254.0.128/32-132.254.0.255/32
132.254.1.0/32-132.254.1.127/32
132.254.1.128/32-132.254.1.255/32
132.254.2.0/32-132.254.2.127/32
132.254.2.128/32-132.254.2.255/32
132.254.3.0/32-132.254.3.127/32
132.254.3.128/32-132.254.3.255/32
132.255.255.0/32-132.255.255.127/32
132.255.255.128/32-132.255.255.255/32
although the present invention has been described with reference to the preferred embodiments, it is not intended to be limited thereto. Those skilled in the art can make various changes and modifications without departing from the spirit and scope of the invention. Therefore, the protection scope of the present invention should be determined by the appended claims.
Claims (2)
1. An enterprise network IP address convergence method based on OSPF protocol is characterized by comprising the following steps:
step 1: acquiring the requirement of network access equipment, wherein the number of terminals of m subnets in an enterprise is set to be n respectively1、n2、n3、n4...nmThe router has M sets, and the processing time of the router is improved by N times;
step 2: acquiring a logical relation between route aggregation and router processing time shortening through a Dijkstra algorithm, and determining the range of a parameter a according to the logical relation, wherein a represents the total quantity of route entries required to be configured;
step 3, determining the number a' of route entries which are averagely required to be configured by each router for M routers by combining the number which needs to be repeatedly configured on all routers when each static router is configured;
step 4, optimizing the number c of terminals of each subnet based on the determined number a' of routing entries which need to be configured on average by each router;
step 5, based on the terminal number c of each subnet determined in the step 4, judging that the minimum value of c is in [2 ]b-1,2b]Thereby determining the number of host bits b configured for each subnet, thereby determining the number of network bits of the aggregated route to be 32-b;
step 6, performing AND operation on the network digits obtained in the step 5 and all routing entries in the enterprise network, determining a network segment of the converged routing, and distributing the determined converged routing configuration to the OSPF network;
wherein the step 2 is configured to determine the number a of the total routing entries to be configured by:
wherein, in order
To representThe running time and the number of the top points n of the Dijkstra algorithm are functions, and the time spent by a core router to run an OSPF protocol to obtain the shortest path is
(ii) a The network is converged, and the number of IP network segments after m sub-networks are converged is k respectively1、k2、k3、k4…kmIf the number of routing entries to be configured is a, the time taken is:
the pre-convergence time cost is expressed as
The time spent after convergence is
(ii) a Therefore, under the condition that the processing time of the router is improved by N times, the maximum value of a is
；
In step 3, the number a' of route entries that each router needs to configure on average satisfies:
in step 4, the number c of terminals in each subnet is optimized as follows:
the specific processing of step 5 comprises the following steps:
taking the minimum value of the terminal quantity c obtained in the step 4, and judging that the terminal quantity c is in [2 ]b-1,2b]Wherein b has a value ofIntegers, specifically by logarithmic operations, i.e.:
2. an enterprise network IP address convergence system based on OSPF protocol, comprising:
a requirement acquisition module for acquiring the requirement of the network access equipment, wherein the number of the terminals of m subnets in the enterprise is set as n1、n2、n3、n4...nmThe router has M sets, and the processing time of the router is improved by N times;
the configuration module is used for acquiring the logical relation between route aggregation and router processing time shortening through a Dijkstra algorithm, and determining the range of a parameter a according to the logical relation, wherein a represents the total quantity of route entries required to be configured;
the correcting module is used for determining the number a' of route entries which are averagely required to be configured by each router for M routers in combination with the number of repeated configurations which need to be carried out on all routers when each static router is configured;
the optimization module is used for optimizing the number c of terminals of each subnet based on the number a' of routing entries which need to be configured on average by each router;
for judging that the minimum value of c is located at [2 ] based on the determined number of terminals c per subnetb-1,2b]The subnet aggregation determining module is used for determining the number b of the host bits configured for each subnet, and accordingly determining the number of the network bits of the aggregated route to be 32-b;
the convergence configuration module is used for carrying out AND operation on all routing entries in the enterprise network based on the obtained network digits, determining a network segment of a convergence route and issuing the determined convergence route configuration to the OSPF network;
wherein the configuration module is configured to determine the number a of routing entries to be configured by:
wherein, in order
Representing the running time of Dijkstra algorithm and the number n of the top points, the time spent by a core router to run OSPF protocol to obtain the shortest path is
(ii) a The network is converged, and the number of IP network segments after m sub-networks are converged is k respectively1、k2、k3、k4…kmIf the number of routing entries to be configured is a, the time taken is:
the pre-convergence time cost is expressed as
The time spent after convergence is
(ii) a Therefore, under the condition that the processing time of the router is improved by N times, the maximum value of a is
；
Wherein, the number a' of the route entries which need to be configured by each router on average satisfies:
the terminal number c of each subnet is optimized as follows:
wherein the subnet aggregation determination module is configured to determine the number of network bits of the aggregated route and the number of host bits configured for each subnet as follows:
taking the minimum value of the terminal number c determined by the optimization module and judging that the terminal number c is in [2 ]b-1,2b]Wherein the value of b is an integer, in particular by a logarithmic operation, i.e.:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010938596.5A CN111935012B (en) | 2020-09-09 | 2020-09-09 | OSPF protocol-based enterprise network IP address convergence method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010938596.5A CN111935012B (en) | 2020-09-09 | 2020-09-09 | OSPF protocol-based enterprise network IP address convergence method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111935012A CN111935012A (en) | 2020-11-13 |
| CN111935012B true CN111935012B (en) | 2020-12-11 |
Family
ID=73309882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010938596.5A Active CN111935012B (en) | 2020-09-09 | 2020-09-09 | OSPF protocol-based enterprise network IP address convergence method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111935012B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106100990A (en) * | 2016-06-06 | 2016-11-09 | 中国电子科技集团公司第三十研究所 | A kind of communication network various dimensions resources regulation method and system based on SDN framework |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227405B (en) * | 2008-02-18 | 2011-12-07 | 中兴通讯股份有限公司 | Route assemblage method and system |
| US8130643B2 (en) * | 2009-04-07 | 2012-03-06 | Cisco Technology, Inc. | System and method for controlling a data transfer over a network |
| CN101562573B (en) * | 2009-04-22 | 2011-07-13 | 中兴通讯股份有限公司 | Method and system for aggregating route items |
| CN105024867A (en) * | 2014-04-15 | 2015-11-04 | 吴峥 | Network equipment state detection method and apparatus |
| CN106953683B (en) * | 2017-04-13 | 2020-04-07 | 重庆金美通信有限责任公司 | Route realization method suitable for large-scale dynamic networking based on MF-TDMA satellite channel |
-
2020
- 2020-09-09 CN CN202010938596.5A patent/CN111935012B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106100990A (en) * | 2016-06-06 | 2016-11-09 | 中国电子科技集团公司第三十研究所 | A kind of communication network various dimensions resources regulation method and system based on SDN framework |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111935012A (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10574567B2 (en) | Modeling a border gateway protocol network | |
| CN102055817B (en) | Method for gathering homologous address beam and homologous gathering network route system | |
| Krioukov et al. | On compact routing for the internet | |
| EP3005620B1 (en) | A method and system of bandwidth-aware service placement for service chaining | |
| Bressoud et al. | Optimal configuration for BGP route selection | |
| Mechtri et al. | VNF placement and chaining in distributed cloud | |
| US20060083247A1 (en) | Prefix lookup using address-directed hash tables | |
| CN103404090B (en) | The improved system of the variable-size table structure of the table lookup method scattered for load when being applied to forwarding data in a network and method | |
| US20160173404A1 (en) | Method to jointly select cloud computing and network services and associated device | |
| US10009254B2 (en) | Calculation of a lowest cost path | |
| CN104717304A (en) | CDN-P2P (Content Distribution Network-Peer-to-Peer) content optimizing selecting system | |
| JPH07177143A (en) | Link metric assignment method | |
| US9135833B2 (en) | Process for selecting compressed key bits for collision resolution in hash lookup table | |
| CN112965824A (en) | Message forwarding method and device, storage medium and electronic equipment | |
| CN109327401B (en) | Flow scheduling method and system of SDN (software defined network) | |
| CN103001892B (en) | Based on network resource allocation method and the system of cloud computing | |
| CN110417777B (en) | Optimized method and device for communication between microservices | |
| CN114513449B (en) | Intra-domain routing optimization method and system | |
| US20200036634A1 (en) | Hybrid routing table for routing network traffic | |
| CN111935012B (en) | OSPF protocol-based enterprise network IP address convergence method and system | |
| CN104539537B (en) | A kind of method for searching route and device | |
| JP3970448B2 (en) | Information relay method and apparatus | |
| CN117319168A (en) | Service processing method, electronic device and storage medium | |
| Zhang et al. | A practical traffic control scheme with load balancing based on PCE architecture | |
| JP5036752B2 (en) | INTERNETWORK APPARATUS AND METHOD FOR CONVERTING LOCAL ADDRESS COMMUNICATION PORT NUMBER USED WITH LOCAL ADDRESS AND EACH LOCAL ADDRESS AND GLOBAL ADDRESS AND COMMUNICATION PORT NUMBER IN A GLOBAL ADDRESS USED WITH GLOBAL ADDRESS |
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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Building 10, No.19, ningshuang Road, Yuhuatai District, Nanjing City, Jiangsu Province, 210000 Patentee after: Jiahuan Technology Co.,Ltd. Address before: Building 10, No.19, ningshuang Road, Yuhuatai District, Nanjing City, Jiangsu Province, 210000 Patentee before: Nanjing Jiahuan Technology Co., Ltd |