CN110581806A - method, device and equipment for automatically segmenting network and storage medium - Google Patents

method, device and equipment for automatically segmenting network and storage medium Download PDF

Info

Publication number
CN110581806A
CN110581806A CN201810593784.1A CN201810593784A CN110581806A CN 110581806 A CN110581806 A CN 110581806A CN 201810593784 A CN201810593784 A CN 201810593784A CN 110581806 A CN110581806 A CN 110581806A
Authority
CN
China
Prior art keywords
network
bier
scale
subnet
maximum
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.)
Granted
Application number
CN201810593784.1A
Other languages
Chinese (zh)
Other versions
CN110581806B (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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201810593784.1A priority Critical patent/CN110581806B/en
Priority to PCT/CN2019/081206 priority patent/WO2019237800A1/en
Publication of CN110581806A publication Critical patent/CN110581806A/en
Application granted granted Critical
Publication of CN110581806B publication Critical patent/CN110581806B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/64Routing or path finding of packets in data switching networks using an overlay routing layer

Landscapes

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

Abstract

The invention discloses a method, a device, equipment and a storage medium for automatically segmenting a network, which relate to the technical field of network communication, and the method comprises the following steps: acquiring a bit index display based on traffic engineering to copy the maximum network scale supported by the BIER-TE network; determining the total network scale of the BIER network according to the topological information of the BIER-TE network; determining whether the BIER-TE network meets a network segmentation condition or not according to the total network scale and the maximum network scale; and if the BIER-TE network meets the network segmentation condition, segmenting the BIER-TE network. The embodiment of the invention segments the BIER-TE network, so that the total network scale of each sub-network obtained by segmentation is not larger than the maximum network scale, and the message can be ensured to be forwarded to the output node of the network.

Description

method, device and equipment for automatically segmenting network and storage medium
Technical Field
The present invention relates to the field of network communication technologies, and in particular, to a method, an apparatus, a device, and a storage medium for automatically splitting a network.
Background
The BIER-TE forwarding method comprises the steps of introducing a BIER-TE controller layer on the basis of a BIER (Bit Index Explicit Replication-based Traffic Engineering) forwarding framework, issuing a forwarding table through a controller, calculating an optimal path by using a path algorithm, and forwarding a message in an Explicit hop-by-hop mode. The method overcomes the defects that the BIER message forwarding path is not optimal and is difficult to adapt to the path updating caused by topology change, and simultaneously ensures that the network flow control is more flexible.
In a multicast scenario, multicast traffic is transmitted in a BIER-TE network, and a specific BIER header needs to be encapsulated on the basis of an MPLS (Multi-Protocol Label Switching) packet, where the specific header carries a BitString (BIT string), and each BP (bitbit) in the BitString identifies one or more adjacent points. And the intermediate network forwarding node forwards and copies the message according to the BitString. When the forwarding node receives the multicast message, the BIT of the BitString in the message is searched and the message is forwarded to one or more corresponding adjacent points. Different bitstrings need to be forwarded in different messages, one BitString corresponds to one < SD, BSL, SI >, where all BPs belong to a group < SD, BSL, SI >, SD is sub-domain of BIER, BSL is BitStringLength of encapsulation header, SI is subset Identifier (Set Identifier), and the sub-domain SD can be divided into multiple subsets and identified by SI. A multicast stream needs to pass through a plurality of adjacent points from an Ingress node (i.e., an Ingress node) to each Egress node (i.e., an Egress node), so that in BIER-TE, BPs allocated to all adjacent points passing through a route from a BFIR (Bit-Forwarding Ingress Router) to a BFER (Bit-Forwarding Egress Router) must exist in one < SD, BSL, SI > at the same time, so as to ensure that a packet is forwarded to the BFER in one BitString.
The network scale is small, the calculated network scale is smaller than the maximum value of the BSL, and the BP distributed by all adjacent points passing from the BFIR to a certain BFER can be ensured to exist in < SD, BSL and SI >. No solution is given if the network size is large and larger than the maximum maxBSL value supported by the network.
Disclosure of Invention
according to the method, the device, the equipment and the storage medium for automatically segmenting the network provided by the embodiment of the invention, the network with larger scale can be automatically segmented in the multicast network based on the BIER-TE, so that the segmented subnet scale is smaller than the maxBSL value, and the problems in the BIER-TE are solved.
The method for automatically segmenting the network provided by the embodiment of the invention comprises the following steps:
Acquiring the maximum network scale supported by the BIER-TE network;
Determining the total network scale of the BIER network according to the topological information of the BIER-TE network;
determining whether the BIER-TE network meets a network segmentation condition or not according to the total network scale and the maximum network scale;
and if the BIER-TE network meets the network segmentation condition, segmenting the BIER-TE network.
The device for automatically segmenting the network provided by the embodiment of the invention comprises the following components:
The acquisition module is used for acquiring the maximum network scale supported by the BIER-TE network;
the determining module is used for determining the total network scale of the BIER network according to the topological information of the BIER-TE network;
The judging module is used for determining whether the BIER-TE network meets the network segmentation condition or not according to the total network scale and the maximum network scale;
And the segmentation module is used for segmenting the BIER-TE network if the BIER-TE network meets the network segmentation condition.
The device for automatically segmenting the network provided by the embodiment of the invention comprises: a processor, and a memory coupled to the processor; the memory stores a program of auto-segmenting network operable on the processor, and the program of auto-segmenting network implements the steps of the method of auto-segmenting network described above when executed by the processor.
the computer storage medium stores a program for automatically segmenting a network, and the program for automatically segmenting the network realizes the steps of the method for automatically segmenting the network when being executed by a processor.
The embodiment of the invention segments the BIER-TE network, so that the total network scale of each sub-network obtained by segmentation is not larger than the maximum network scale, and the message can be ensured to be forwarded to the output node of the network.
Drawings
Fig. 1 is a schematic flowchart of a method for automatically segmenting a network according to an embodiment of the present invention;
Fig. 2 is a schematic block diagram of an apparatus for automatically splitting a network according to an embodiment of the present invention;
Fig. 3 is a schematic block diagram of an apparatus for automatically splitting a network according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of BIER-TE system architecture provided by the embodiment of the present invention;
Fig. 5 is a schematic diagram of a BIER-TE multicast subnet segmentation flow provided by an embodiment of the present invention;
Fig. 6 is a schematic processing flow diagram of BIER-TE multicast node change according to the embodiment of the present invention;
Fig. 7 is a schematic flowchart of automatically splitting a network when the BIER-TE total network specification is 455 according to an embodiment of the present invention;
fig. 8 is a schematic flowchart of automatically splitting a network when the BIER-TE total network specification is 143 according to an embodiment of the present invention;
fig. 9 is a schematic flowchart of automatically splitting a network when a total network size of a business network of BIER-TE provided in the embodiment of the present invention is 624;
Fig. 10 is a schematic processing flow diagram when 4 egress nodes are added to the BIER-TE network according to the embodiment of the present invention.
Detailed Description
the main embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
fig. 1 is a schematic flowchart of a method for automatically segmenting a network according to an embodiment of the present invention, where as shown in fig. 1, the method includes the steps of:
Step S101: and acquiring the maximum network scale supported by the BIER-TE network.
In one embodiment, the BIER-TE controller obtains the upper specified maximum network size, i.e., the maxBSL value (maximum BSL), through the northbound interface.
in another embodiment, the BIER-TE controller obtains the maximum network size negotiated between BIER-TE network nodes, i.e., the maxBSL value (maximum BSL), through the southbound interface.
Step S102: and determining the total network scale of the BIER network according to the topological information of the BIER-TE network.
The topology information of the BIER-TE network includes node information (i.e., the number of nodes) and link information (i.e., the number of links).
in one embodiment, the BIER-TE controller determines the number of BPs to be allocated of the BIER-TE network according to the node information and the link information, and determines the total network size of the BIER network according to the number of BPs and a preset expansion factor. For example, the BIER-TE controller adds the number of nodes and the number of links to obtain the number of BPs, and then multiplies the number of BPs by the expansion factor to obtain the total network size.
Step S103: and determining whether the BIER-TE network meets a network segmentation condition or not according to the total network scale and the maximum network scale.
And if the total network scale is larger than the maximum network scale, the BIER-TE controller determines that the BIER-TE network meets the network segmentation condition. For example, the total network size of the BIER-TE network is 134, the maximum network size is 128, and at this time, 134 is greater than 128, so that the network segmentation condition is satisfied.
step S104: and if the BIER-TE network meets the network segmentation condition, segmenting the BIER-TE network.
The BIER-TE controller first divides the egress nodes of the BIER-TE network into N groups (e.g., equally divided into N groups), where N is an integer greater than 1, e.g., 2, 3, 4, etc. And then according to the optimal paths from the entry nodes of the BIER-TE network to the N groups of exit nodes, the BIER-TE network is divided into N sub-networks, namely the BIER-TE controller integrates the sub-networks according to the nodes and links related to the optimal paths. Wherein, the ingress node and the egress node of the BIER-TE network refer to the BFIR and the BFER of the multicast traffic when the BIER-TE network transmits, respectively. In an embodiment, the value of N is 2, that is, the output nodes are divided into two groups and then subjected to segmentation judgment and segmentation processing.
In one embodiment, after obtaining the subnet, the BIER-TE controller allocates resources to the subnet if the subnet does not satisfy the network splitting condition. In practice, the total network size of each subnet is calculated in the same manner as step S102, and if the total network size of each subnet is smaller than or equal to the maximum network size, the bit string length BSL that is not smaller than and closest to the total network size of each subnet is selected for each subnet, and BP and < SD, BSL, SI > are assigned to the nodes and links of each subnet.
in one embodiment, after obtaining the subnet, the BIER-TE controller needs to segment the subnet if the subnet meets the network segmentation condition. During implementation, the total network scale of each subnet is calculated in the same manner as step S102, and then the subnets with the total network scale larger than the maximum network scale are segmented until the total network scale of any one subnet obtained by segmentation is smaller than or equal to the maximum network scale.
the BIER-TE controller in this embodiment ensures that the total network size of each subnet is not larger than the maximum network size through network segmentation, so that each node and each link in the subnet can allocate a BP, and the allocated BPs belong to the same < SD, BSL, SI >.
After the network segmentation is finished and the BP is distributed, the BIER-TE controller can also carry out corresponding adjustment according to the change condition of the BFER.
In one embodiment, when the BFER of the BIER-TE network is decreased, the BIER-TE controller integrates the subnet from which the BFER has been deleted into a new subnet not including the BFER, determines a decreased node and link compared with two subnets before and after the BFER is decreased (i.e., the subnet before the BFER is decreased and the new subnet after the BFER is decreased), and recovers the BP allocated for the decreased node and link.
In one embodiment, when an egress node of the BIER-TE network is added, the BIER-TE controller determines the actual network size of the subnet of the added egress node according to the topology information of the subnet of the added egress node, for example, the node number and the link number of the subnet of the added egress node are added to obtain the actual network size. And if the actual network scale of the sub-network with the added nodes is larger than or equal to the maximum network scale, segmenting the sub-network with the added nodes. If the actual network scale of the subnet with the added node is smaller than the maximum network scale and smaller than or equal to the previously selected BSL, it indicates that the amount of the remaining BPs is sufficient, and at this time, the BSL is not changed, and the BP is only allocated to the newly added node and link in the subnet with the added node. If the actual network scale of the sub-network with the added node is smaller than the maximum network scale and larger than the previously selected BSL, the BIER-TE controller determines to segment the sub-network with the added node or select a new BSL for the sub-network with the added node according to the total network scale of the sub-network with the added node and the maximum network scale. The BSL selected previously is the BSL selected for each subnet whose total network size is smaller than or equal to the maximum network size, for example, the BSL selected for each subnet whose total network size obtained by dividing the BIER-TE network is smaller than or equal to the maximum network size.
It will be understood by those skilled in the art that all or part of the steps in the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, and the program may be stored in a computer readable storage medium.
The present invention may also provide a storage medium having stored thereon a program for automatically segmenting a network, the program for automatically segmenting a network implementing the steps of the method for automatically segmenting a network described above when executed by a processor. The storage medium may include ROM/RAM, magnetic disk, optical disk, and U disk.
Fig. 2 is a schematic block diagram of an apparatus for automatically splitting a network according to an embodiment of the present invention, and as shown in fig. 2, the apparatus includes:
an obtaining module, configured to obtain a maximum network scale supported by the BIER-TE network, and implement step S101 in fig. 1.
and a determining module, configured to determine a total network size of the BIER network according to the topology information of the BIER-TE network, so as to implement step S102 in fig. 1.
And the judging module is used for determining whether the BIER-TE network meets the network segmentation condition according to the total network scale and the maximum network scale, and realizing the step S103 in the figure 1.
And a segmentation module, configured to segment the BIER-TE network if the BIER-TE network meets a network segmentation condition, so as to implement step S104 in fig. 1.
In an embodiment, when the BFER of the BIER-TE network increases or decreases, corresponding adjustment may be performed through cooperation of the modules, for example, network segmentation is performed again, BP is allocated to the newly added node, and the previously allocated BP and BSL are recovered.
Fig. 3 is a schematic block diagram of an apparatus for automatically splitting a network according to an embodiment of the present invention, and as shown in fig. 3, the apparatus for automatically splitting a network includes: a processor, and a memory coupled to the processor; the memory stores a program of auto-segmenting network operable on the processor, and the program of auto-segmenting network implements the steps of the method of auto-segmenting network described above when executed by the processor.
the embodiment of the invention carries out network segmentation when the network scale (namely the total network scale) is larger than the maximum maxBSL value (namely the maximum network scale), and calculates the proper BSL value, so that the BP of the same path belongs to a group of < SD, BSL, SI >.
Fig. 4 is a schematic diagram of a BIER-TE system architecture provided in an embodiment of the present invention, and as shown in fig. 4, an upper layer multicast stream is connected to a controller through a northbound interface (e.g., RESTful API) to perform multicast stream configuration, query, and the like. The lower layer Forwarding device BFR (Bit-Forwarding Router) is connected with the controller through protocols such as southbound interface (e.g. Netconf/Restconf/Yang) and the like, collects the topology information of the device and issues a Forwarding table and BitString. In FIG. 1, src is the source and rcv is the sink receiver.
the embodiment of the invention collects the network topology through the southbound interface of the controller, calculates the network scale after the network is stable, if the network scale is larger than the preset maxBSL value, the network is divided into a plurality of sub-networks, and selects a proper BSL value for the sub-networks respectively, the SI of each sub-network is different, the SD is the determined value configured to the controller by the upper layer, and then allocates BP to the sub-network nodes and links, and all BP of the same sub-network belong to a group of < SD, BSL, SI >. The network topology may be a full network topology, a user-specified topology, or a traffic-related topology. The preset maxBSL value may be specified by an upper layer user, or may be a supported maximum maxBSL value negotiated between devices.
The method for automatically cutting the subnet comprises the following steps:
The node and link numbers in the actual network collected by the controller through the southbound interface are respectively M and N, and the BP number required to be distributed by the whole network is the sum of the two, namely M + N. In view of the network capacity expansion requirement, assuming that the capacity expansion factor is K (generally, a recommended empirical value of 0.3), the total network size S (i.e., BP number) can be calculated by the following equation:
(M + N) × (K +1) formula (1)
the preset maximum BSL value is maxBSL, and if S is greater than maxBSL, subnet segmentation is required. The controller divides the received one or more multicast egress nodes BFERs into two groups, respectively calculates the optimal path from the two groups of ingress nodes to the egress nodes, and integrates to obtain two sub-networks, wherein the two sub-networks respectively comprise all nodes and links from the ingress nodes to the two groups of egress nodes. The two sub-networks are obtained after one-time segmentation, then the scales of the two sub-networks are respectively calculated as S1 and S2 by using a formula (1), and are compared with a preset maxBSL value, if the scale of the sub-networks is smaller than the preset maxBSL value, the BSL of the sub-networks is determined to be a value which is larger than or equal to and closest to S1 or S2 (the BSL can only be selected from the following values: 64, 128, 256, 512, 1024, 2048 and 4096); if the size of a certain subnet (assuming the subnet S1) is larger than the preset maxBSL value, the subnet is continuously segmented by the method, iterative segmentation is carried out until the size of the subnet is smaller than the preset maxBSL value, and the BSL value which is larger than or equal to and closest to the network size of the subnet is selected for each segmented subnet.
fig. 5 is a schematic diagram of a BIER-TE multicast subnet segmentation flow provided in the embodiment of the present invention, as shown in fig. 5, the steps are as follows:
Step 201: the controller collects node information and topology structure of the BIER network through the southbound interface.
step 202: the controller receives BIER configuration related information such as Domain (a collection of forwarding devices supporting BIER control protocol interaction), Sub-Domain, MPLS label range through a northbound interface, and receives an ingress router (BFIR) and an egress router (BFER) of a multicast stream concerned by multicast traffic, which may be one or more, and acquires a preset BSL value from a southbound or northbound direction.
Step 203: the controller calculates the sum M + N of the number of the nodes and the links according to the collected topological information, and adds a capacity expansion factor, and the total network scale is calculated as S by using a formula (1); if the network is traffic related, the traffic related network node and link sizes are calculated.
Step 204: the controller compares the calculated S value with a preset maxBSL value, if S is greater than maxBSL, the processing is continued, otherwise, the step 207 is executed.
Step 205: the controller divides the BFERs multicast in the network into two groups, respectively calculates the optimal path from the BFIR to the two groups of BFERs, and all nodes and links passed by the two groups of paths are combined to form two sub-networks.
Step 206: the controller calculates the network scale S of the two subnets according to the formula (1), compares the network scale S with a preset maxBSL value, and if S of a certain subnet is greater than maxBSL, goes to step 205, otherwise continues processing.
Step 207: the controller selects a BSL value greater than or equal to and closest to S for the subnets, with SI values for each subnet selected differently.
Step 208: the controller allocates BP and belonged < SD, BSL, SI > for the nodes and links of the sub-networks according to the BSL value calculated by each sub-network.
The subnet segmentation method of the embodiment is simple, and only BFERs need to be segmented by a 2-segment method, and nodes of the whole network do not need to be segmented.
Fig. 6 is a schematic processing flow diagram of a BIER-TE multicast egress node change according to an embodiment of the present invention, as shown in fig. 6, after subnet segmentation is completed and a BP is allocated, if there is a change in the multicast egress node BFER, the allocated BP needs to be recovered for the reduced BFER, and a new BP is allocated for the increased BFER, which includes the following steps:
step 301: the multicast egress node BFER changes.
Step 302: and if the number of BFERs is increased, turning to step 304, otherwise, continuing processing.
Step 303: and the subnet corresponding to the reduced BFER removes the reduced BFERs, recalculates the paths from the BFIR to the remaining BFERs and integrates a new subnet, and compared with the subnet integrated before, the BP distributed by the reduced nodes and links is recovered, and the step 314 is switched.
Step 304: if the user specifies that the newly added BFERs are added into a certain subnet, the processing is continued, otherwise, the step 313 is executed.
step 305: the BFERs are added into a user-specified subnet, paths are recalculated from the BFIR to new BFERs, the new subnet is integrated, and the new network size S (namely the actual network size) is calculated by using the formula (2).
Step 306: and comparing the calculated network scale S with maxBSL, if S is less than maxBSL, continuing processing, otherwise, turning to the step 311.
step 307: if the network size is larger than the BSL value calculated before the subnet, if so, the process continues, otherwise, go to step 312.
Step 308: the network size of the new subnet is recalculated to S1 (i.e., the total network size) using equation (1).
Step 309: if the new network size S1 is smaller than maxBSL, if yes, the process continues, otherwise, go to step 311.
step 310: the BSL is reselected for the subnet, the BP is reallocated for all nodes and links in the subnet, the previously allocated BSL and BP are reclaimed, go to step 314.
Step 311: the subnet is partitioned by the subnet partitioning method of fig. 5, BSL is calculated and BP is allocated for the new subnet, go to step 314.
step 312: the subnet has enough remaining BP to allocate BP to the newly added node and link, the new subnet integrated by BFERs is added and compared with the subnet before the new addition, BP is allocated to the added node and link increment, BSL is unchanged, go to step 314.
step 313: and selecting a subnet with the minimum BSL in the network, adding the newly added BFERs into the BFERs group of the subnet, recalculating paths from the BFIR to the new BFERs group, integrating the new subnet, calculating the new network scale S by using the formula (2), and turning to the step 306.
step 314: and (5) the multicast BIER changes and the BP processing is finished.
the formula for calculating the network scale is as follows:
S-M + N formula (2)
It can be seen that equation (1) is used to calculate the network size after considering the capacity expansion requirement, i.e., the total network size. Equation (2) is used to calculate the network size after the BFER change, i.e., the actual network size after the BFER change.
the new subnet is formed based on the subnet fitted by the shortest path from the BFIR to the BFERs, with the least BP occupation and the shortest traffic path.
The BSL of this embodiment is 2 to the power of n, and when so segmented, the optimal BSL is closest to maxBSL.
fig. 7 is a schematic diagram of a process of automatically splitting a network when the BIER-TE total network specification is 455, where a maxBSL value preset in the BIER network is obtained from an upper-layer user, and the network is a full-network topology, as shown in fig. 7, the process is as follows:
step 401: the controller collects node information and topology structure of the BIER network through the southbound interface, wherein the sum of the number of nodes and the number of links is 350.
step 402: the controller receives and configures BIER related information such as Domain, Sub-Domain, MPLS label range and the like through a northbound interface, the Sub-Domain value configured by the node is 1, and the supported maximum maxBSL value is 256; and receiving the multicast BFIR and BFERs configuration at the same time, wherein the number of BFERs is 60.
step 403: the controller calculates the network size S as 350 × 1+0.3 (455) according to equation (1).
Step 404: the network size S value 455 is greater than the preset maxBSL value 256, and network segmentation is required.
Step 405: the multicast BFERs are divided into two groups, each group has 30 BFERs, the optimal path from each group of the ingress node to the egress node is calculated respectively, the nodes and links passed by the two groups of paths are combined to form a subnet, and the two subnets are a subnet 1 and a subnet 2 respectively.
Step 406: the controller calculates the network scales S of the two subnets, and assuming that the scale of the subnet 1 is 260 greater than the preset maxBSL value 256 and the scale of the subnet 2 is 200 less than the preset maxBSL value 256, the subnet 1 needs to be divided again.
Step 407: and dividing the 30 BFERs multicast in the subnet 1 into 2 groups again, wherein each group comprises 15, calculating the optimal path from each group of the input node to the output node, merging the nodes and links passed by the two groups of paths into one subnet, and totally two subnets, namely a subnet 3 and a subnet 4.
step 408: the controller respectively calculates the network scales S of the two subnets, and assuming that the scale of the subnet 3 is 190 smaller than the preset maxBSL value 256 and the scale of the subnet 4 is 120 smaller than the preset maxBSL value 256, subnet segmentation is not required.
Step 409: after the network is split, 3 subnets are formed, namely subnet 2, subnet 3 and subnet 4, BSL values selected by the controller for the subnets are 256, 256 and 128, respectively, and SI values are 1,2 and 3, respectively.
Step 410: the controller allocates BP and the belonged < SD, BSL, SI > to the nodes and links of the sub-networks according to the BSL value calculated by each sub-network, and the triplets of the three sub-networks are <1,256,1>, <1,256,2> and <1,128,3>, respectively.
Fig. 8 is a schematic flow chart of automatically segmenting a network when the rule number of the BIER-TE total network is 143 according to the embodiment of the present invention, where a preset BSL value in the BIER network is a maximum maxBSL supported by negotiation between devices, and the network is a full network topology, as shown in fig. 8, the flow is as follows:
Step 501: the controller collects node information and topology structure of the BIER network through the southbound interface, wherein the sum of the number of nodes and the number of links is 110.
Step 502: the controller receives and configures BIER related information such as Domain, Sub-Domain, MPLS label range and the like through the northbound interface, the Sub-Domain value configured by the node is 1, and simultaneously receives the BFIR and BFERs configuration of multicast, the number of BFERs is 16, and the southbound interface receives the maximum supported maxBSL value negotiated among the devices and is 128.
Step 503: the controller calculates the network size S to be 110 x (1+0.3) 143 according to the topology and the capacity expansion factor.
Step 504: the network size S value 143 is greater than the preset maxBSL value 128, and network segmentation is required.
Step 505: the multicast BFERs are divided into two groups, each group has 8 BFERs, the optimal path from each group of the ingress node to the egress node is calculated respectively, all nodes and links passed by the two groups of paths are combined to form a subnet, and the two subnets are a subnet 1 and a subnet 2 respectively.
Step 506: the controller calculates the network scales S of the two subnets, and assuming that the scale of the subnet 1 is 69 smaller than the preset maxBSL value 128 and the scale of the subnet 2 is 89 smaller than the preset maxBSL value 128, the subnet segmentation is not required.
Step 507: after the network is split, 2 subnets are formed, namely subnet 1 and subnet 2, the BSL values selected by the controller for the subnets are both 128, and the SI values are 1 and 2, respectively.
Step 508: the controller allocates BP and the belonged < SD, BSL, SI > to the nodes and links of the sub-networks according to the BSL value calculated by each sub-network, and the triplets of the two sub-networks are <1,128,1> and <1,128,2> respectively.
fig. 9 is a schematic flowchart of automatically splitting a network when the total network size of a BIER-TE service network provided by the embodiment of the present invention is 624, where the BIER network is related to a service, as shown in fig. 9, the flow is as follows:
step 601: the controller collects node information and topology structure of the BIER network through the southbound interface, wherein the sum of the number of nodes and the number of links is 900.
step 602: the controller receives and configures BIER related information such as Domain, Sub-Domain, MPLS label range and the like through the northbound interface, the Sub-Domain value configured by the node is 1, and simultaneously receives the BFIR and BFERs configuration of multicast, the number of BFERs is 40, and the supporting maximum maxBSL value negotiated among devices received by the southbound interface is 512.
Step 603: the controller calculates the optimal path according to multicast BFIR and BFERs, integrates the number of nodes and links of the service-related network into 480, and calculates the size S of the service network into 480 × 1+0.3 (624) according to formula (1).
Step 604: the network size S value 624 is greater than the preset maxBSL value 512, and network segmentation is required.
Step 605: the multicast BFERs are divided into two groups, each group has 20 BFERs, the optimal path from each group of the ingress node to the egress node is calculated respectively, all nodes and links passed by the two groups of paths are combined to form a subnet, and the two subnets are a subnet 1 and a subnet 2 respectively.
step 606: the controller respectively calculates the network scales S of the two subnets, and assuming that the scale of the subnet 1 is 251 smaller than the preset maxBSL value 512 and the scale of the subnet 2 is 320 smaller than the preset maxBSL value 512, the subnet segmentation is not required.
step 607: after the network is split, 2 subnets are formed, namely subnet 1 and subnet 2, BSL values selected by the controller for the subnets are 256 and 512, and SI values are 1 and 2, respectively.
step 608: the controller allocates BP and belonged < SD, BSL, SI > to the nodes and links of the sub-networks according to the BSL value calculated by each sub-network, and the triplets of the two sub-networks are <1,256,1> and <1,512,2> respectively.
Fig. 10 is a schematic view of a processing flow when 4 egress nodes are added to the BIER-TE network according to the embodiment of the present invention, where the BIER network has already split the subnets according to the multicast in the embodiment of fig. 8, BSL calculation and BP allocation have been completed, the number of multicast egress nodes is increased by 4, and the multicast egress nodes are assigned to join the subnet 1, as shown in fig. 10, the processing flow is as follows:
Step 601: the number of BFERs of BIER-TE multicast is changed.
Step 602: multicast adds 4 BFERs.
Step 603: the user specifies that the newly added BFERs be added to subnet 1.
Step 604: adding the newly added 4 BFERs into 8 BFERs groups segmented by the subnet 1, wherein the total number of BFERs is 12, recalculating paths from multicast input nodes to 12 output nodes, integrating a new subnet 1-1, and calculating the network scale S of the new subnet 1-1 by using a formula (2), wherein S is assumed to be 70;
Step 605: the network size S value 70 is less than the maxBSL value 128 and less than the BSL value 128 calculated before subnet 1;
step 606: subnet 1 has enough BP left to allocate to the newly added nodes and links, new subnet S1-1 compares with subnet 1, the more nodes and links need to allocate BP, and allocates BP to these nodes and links incrementally, where the triplet is <1,128,1>, and BSL is unchanged, and is 128.
In summary, the embodiments of the present invention have the following technical effects:
The embodiment of the invention carries out network segmentation when the total network scale of the BIER-TE network is larger than the maximum network scale, and calculates the proper BSL value, so that the BP of the same path belongs to a group of < SD, BSL, SI >, and the message is ensured to be forwarded to the BFER of the subnet in a BitString.
Although the present invention has been described in detail hereinabove, the present invention is not limited thereto, and various modifications can be made by those skilled in the art in light of the principle of the present invention. Thus, modifications made in accordance with the principles of the present invention should be understood to fall within the scope of the present invention.

Claims (11)

1. A method for automatically segmenting a network is characterized by comprising the following steps:
acquiring a bit index display based on traffic engineering to copy the maximum network scale supported by the BIER-TE network;
determining the total network scale of the BIER network according to the topological information of the BIER-TE network;
Determining whether the BIER-TE network meets a network segmentation condition or not according to the total network scale and the maximum network scale;
And if the BIER-TE network meets the network segmentation condition, segmenting the BIER-TE network.
2. The method of claim 1, wherein the step of obtaining the maximum network size supported by the BIER-TE network comprises:
and acquiring the maximum network scale specified by an upper layer through a northbound interface, or acquiring the maximum network scale negotiated among nodes through a southbound interface.
3. the method of claim 2, wherein the topology information of the BIER-TE network includes node information and link information, and wherein determining the total network size of the BIER network from the topology information of the BIER-TE network comprises:
determining the number of bits BP to be allocated of the BIER-TE network according to the node information and the link information;
And determining the total network scale of the BIER network according to the BP quantity and a preset capacity expansion factor.
4. The method of claim 3, wherein determining whether the BIER-TE network satisfies a network slicing condition based on the total network size and the maximum network size comprises:
And if the total network scale is larger than the maximum network scale, determining that the BIER-TE network meets the network segmentation condition.
5. The method of claim 4, wherein the splitting the BIER-TE network if the BIER-TE network satisfies a network splitting condition comprises:
Dividing the output nodes of the BIER-TE network into N groups, wherein N is an integer greater than 1;
The BIER-TE network is divided into N sub-networks according to the optimal paths from the inlet nodes of the BIER-TE network to N groups of outlet nodes respectively;
Segmenting the subnets with the total network scale larger than the maximum network scale until the total network scale of any subnet obtained by segmentation is smaller than or equal to the maximum network scale;
If the total network size of each of the subnets is less than or equal to the maximum network size, selecting a bit string length BSL that is not less than and closest to the total network size of each of the subnets for each of the subnets, and allocating a BP to the nodes and links of each of the subnets.
6. The method of claim 5, wherein N is 2.
7. The method according to any one of claims 2 to 6, wherein after the performing the segmentation on the BIER-TE network if the BIER-TE network satisfies the network segmentation condition, the method further comprises:
When the number of the outbound nodes of the BIER-TE network is reduced, integrating the subnet with the deleted outbound nodes into a new subnet without the outbound nodes;
And comparing the subnet before the reduction of the exit node with the new subnet obtained after the reduction of the exit node, determining the reduced nodes and links, and recovering the BP distributed to the reduced nodes and links.
8. The method according to any one of claims 2 to 6, wherein after the performing the segmentation on the BIER-TE network if the BIER-TE network satisfies the network segmentation condition, the method further comprises:
When the output node of the BIER-TE network is increased, determining the actual network scale of the subnet with the increased output node according to the topology information of the subnet with the increased output node;
If the actual network scale of the sub-network with the added nodes is larger than or equal to the maximum network scale, the sub-network with the added nodes is segmented;
If the actual network scale of the sub-network with the added node is smaller than the maximum network scale and smaller than or equal to the BSL selected previously, allocating BP for the newly added node and link in the sub-network with the added node;
And if the actual network scale of the sub-network with the added node is smaller than the maximum network scale and larger than the previously selected BSL, determining to segment the sub-network with the added node or select a new BSL for the sub-network with the added node according to the total network scale of the sub-network with the added node and the maximum network scale.
9. An apparatus for automatically segmenting a network, comprising:
The acquisition module is used for acquiring the maximum network scale supported by the BIER-TE network copied by the bit index display based on the traffic engineering;
the determining module is used for determining the total network scale of the BIER network according to the topological information of the BIER-TE network;
the judging module is used for determining whether the BIER-TE network meets the network segmentation condition or not according to the total network scale and the maximum network scale;
And the segmentation module is used for segmenting the BIER-TE network if the BIER-TE network meets the network segmentation condition.
10. An apparatus for automatically splitting a network, the apparatus comprising: a processor, and a memory coupled to the processor; the memory has stored thereon a program of automatically segmenting a network, executable on the processor, which when executed by the processor implements the steps of the method of automatically segmenting a network as claimed in any one of claims 1 to 8.
11. A computer storage medium characterized by storing a program for automatically splitting a network, which when executed by a processor implements the steps of the method for automatically splitting a network according to any one of claims 1 to 8.
CN201810593784.1A 2018-06-11 2018-06-11 Method, device and equipment for automatically segmenting network and storage medium Active CN110581806B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201810593784.1A CN110581806B (en) 2018-06-11 2018-06-11 Method, device and equipment for automatically segmenting network and storage medium
PCT/CN2019/081206 WO2019237800A1 (en) 2018-06-11 2019-04-03 Method for automatically partitioning network, apparatus, device, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810593784.1A CN110581806B (en) 2018-06-11 2018-06-11 Method, device and equipment for automatically segmenting network and storage medium

Publications (2)

Publication Number Publication Date
CN110581806A true CN110581806A (en) 2019-12-17
CN110581806B CN110581806B (en) 2022-02-25

Family

ID=68809440

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810593784.1A Active CN110581806B (en) 2018-06-11 2018-06-11 Method, device and equipment for automatically segmenting network and storage medium

Country Status (2)

Country Link
CN (1) CN110581806B (en)
WO (1) WO2019237800A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112511319A (en) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 Information notification method, message forwarding method, message eliminating method, device, equipment and medium

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11705983B2 (en) * 2021-03-22 2023-07-18 Cisco Technology, Inc. Efficient BIER forwarding over varying BSL domain using header stitching
CN115022241B (en) * 2022-05-31 2023-06-09 烽火通信科技股份有限公司 BIER automatic configuration and BSL management method and device

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150131658A1 (en) * 2013-09-17 2015-05-14 Cisco Technology, Inc. Equal Cost Multi-path With Bit Indexed Explicit Replication
CN105556899A (en) * 2013-09-17 2016-05-04 思科技术公司 Bit indexed explicit replication
US20160127142A1 (en) * 2014-11-04 2016-05-05 Telefonaktiebolaget L M Ericsson (Publ) Explicit block encoding of multicast group membership information with bit index explicit replication (bier)
CN106341327A (en) * 2015-07-08 2017-01-18 中兴通讯股份有限公司 BIER (Bit Indexed Explicit Replication) message transmission method and system
US20170142006A1 (en) * 2013-09-17 2017-05-18 Cisco Technology, Inc. Migration support for bit indexed explicit replication
CN107770070A (en) * 2016-08-17 2018-03-06 中兴通讯股份有限公司 A kind of method, apparatus and system of information transfer
CN107968750A (en) * 2016-10-20 2018-04-27 中兴通讯股份有限公司 Message transmitting method, device and node
US20180131532A1 (en) * 2016-11-09 2018-05-10 Cisco Technology, Inc. Area-specific broadcasting using bit indexed explicit replication

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101945033B (en) * 2009-07-08 2014-08-13 中兴通讯股份有限公司 Method, device and system for merging/dividing traffic engineering domain
CN107623630B (en) * 2016-07-13 2021-04-06 中兴通讯股份有限公司 Bit index explicit copy information transfer method and device
US10135756B2 (en) * 2016-08-30 2018-11-20 Cisco Technology, Inc. Transparent and efficient multi-destination TCP communications based on bit indexed explicit replication
CN107872385B (en) * 2017-10-11 2020-10-23 中国电子科技集团公司第三十研究所 SDN network routing calculation and control method

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150131658A1 (en) * 2013-09-17 2015-05-14 Cisco Technology, Inc. Equal Cost Multi-path With Bit Indexed Explicit Replication
CN105556899A (en) * 2013-09-17 2016-05-04 思科技术公司 Bit indexed explicit replication
US20170142006A1 (en) * 2013-09-17 2017-05-18 Cisco Technology, Inc. Migration support for bit indexed explicit replication
US20160127142A1 (en) * 2014-11-04 2016-05-05 Telefonaktiebolaget L M Ericsson (Publ) Explicit block encoding of multicast group membership information with bit index explicit replication (bier)
CN106341327A (en) * 2015-07-08 2017-01-18 中兴通讯股份有限公司 BIER (Bit Indexed Explicit Replication) message transmission method and system
CN107770070A (en) * 2016-08-17 2018-03-06 中兴通讯股份有限公司 A kind of method, apparatus and system of information transfer
CN107968750A (en) * 2016-10-20 2018-04-27 中兴通讯股份有限公司 Message transmitting method, device and node
US20180131532A1 (en) * 2016-11-09 2018-05-10 Cisco Technology, Inc. Area-specific broadcasting using bit indexed explicit replication

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112511319A (en) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 Information notification method, message forwarding method, message eliminating method, device, equipment and medium

Also Published As

Publication number Publication date
WO2019237800A1 (en) 2019-12-19
CN110581806B (en) 2022-02-25

Similar Documents

Publication Publication Date Title
EP3817446B1 (en) Method and apparatus for creating network slices
EP3208977B1 (en) Data forwarding method, device and system in software-defined networking
CN109391478B (en) Multicast service control method and device and computer readable storage medium
CN111654438B (en) Method, controller and system for establishing forwarding path in network
CN110581806B (en) Method, device and equipment for automatically segmenting network and storage medium
CN110855542B (en) Management method, system and device for transmission network slice
EP3402133A1 (en) Method and device for establishing virtual private network
KR101457317B1 (en) Prioritization of routing information updates
CN102281193B (en) Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network
CN113923125B (en) Tolerance analysis method and device for multi-service flow converged communication in industrial heterogeneous network
CN114205282B (en) SRv6 Policy scheduling method, system, router and controller
CN108347376A (en) A kind of method, apparatus and system of adjustment forward-path
CN106487558A (en) A kind of method and apparatus realizing the scalable appearance of access device
CN105992297A (en) SDN-based connection management and forwarding control method and related equipment
CN103260094B (en) A kind of method for routing, the notification method of routing policy and corresponding device
CN107005834A (en) The method and apparatus of data processing
US11968121B2 (en) Control apparatus, control method and program
CN117118886A (en) Message forwarding method, head-end equipment, controller, equipment and storage medium
CN111464440A (en) Communication method and device
EP3832952A1 (en) Method and apparatus for dividing internal gateway protocol domain in network
CN107071856A (en) A kind of node cut-in method of channel wireless radio multi Mesh network
CN107959610B (en) Method for determining virtual network topological structure and operator edge equipment
CN111464441A (en) Communication method and device
CN115550256A (en) BIER multicast slicing method based on SDN, storage medium and electronic equipment
CN107295038A (en) A kind of method and device for setting up interface group

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