CN106331186B - The method and apparatus for distributing internet protocol address - Google Patents
The method and apparatus for distributing internet protocol address Download PDFInfo
- Publication number
- CN106331186B CN106331186B CN201510337394.4A CN201510337394A CN106331186B CN 106331186 B CN106331186 B CN 106331186B CN 201510337394 A CN201510337394 A CN 201510337394A CN 106331186 B CN106331186 B CN 106331186B
- Authority
- CN
- China
- Prior art keywords
- polymerizable
- collection
- multicast group
- address
- node
- 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
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000009826 distribution Methods 0.000 claims description 23
- 238000010586 diagram Methods 0.000 description 8
- 239000012141 concentrate Substances 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000006835 compression Effects 0.000 description 5
- 238000007906 compression Methods 0.000 description 5
- 238000003860 storage Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 2
- 239000004148 curcumin Substances 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 239000004173 sunset yellow FCF Substances 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000006116 polymerization reaction Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000002151 riboflavin Substances 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
- H04L61/00—Network arrangements, protocols or services for addressing or naming
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention provides a kind of methods and apparatus for distributing internet protocol address.The described method includes: determining multiple collection of equal value of multiple switch according to multicast solicitation message;Multiple polymerizable collection are determined according to the multiple collection of equal value, wherein whole multicast groups of the polymerizable concentration can be polymerized to a forwarding-table item;For each Multicast Group Assignment IP address of the multiple polymerizable concentration, wherein identical for the multiple polymerizable minimum prefix for concentrating k-th of polymerizable IP address for concentrating each Multicast Group Assignment, k is the integer not less than 1.Therefore, the multicast group of each polymerizable concentration can be compressed and is known as a forwarding-table item, improve the scalability of multicast.
Description
Technical field
The present invention relates to information technology fields, and more particularly, to the method and apparatus of distribution IP address.
Background technique
Unicast, multicast and broadcast are that Internet protocol (English: Internet Protocol, abbreviation: IP) network data passes
Three kinds of defeated modes.Unicast is that point to point network connection is realized between sender and each recipient, if a sender
Transmit identical data to multiple recipients simultaneously, it is also necessary to replicate more parts of identical data packets accordingly, this will to sender with
Carry out heavy burden.Broadcast refers to the broadcast data packet in IP subnet, and all hosts inside subnet will all receive these numbers
According to packet, broadcast means that network delivers a data packet to each host of subnet, no matter whether these hosts wish to receive
The data packet, however the data that broadcast mode is sent will be not across subnet.
Multicast solves the problems, such as unicast low efficiency and broadcast not across subnet, and multicast source sends primary information, multicast
Router is that multicast packet establishes tree route by multicast routing protocol, and the information being passed is in fork on the road as far as possible
Just start to replicate and distribute, therefore multicast can save a large amount of network bandwidth, reduce the load of network.Multicasting technology is mainly answered
Used in fields such as online video meeting, online video program requests.
However, causing the scalability of multicast poor since the forwarding-table item between multiple multicast groups is difficult to compress, so that group
It broadcasts and is difficult to large-scale application.In contrast, during sending unicast, IP address that similar host or port assignment arrive
It is general also close, thus unicast address it is adjacent list item it is very high a possibility that corresponding ports are identical on an interchanger, can gather
Conjunction property is strong.However, this characteristic is often not present in multicast group address, two multicast groups forward port phase on same interchanger
Same list item, possible practical multicast group address difference farther out, can not be compressed into a forwarding-table item.
Summary of the invention
The embodiment of the present invention provides a kind of method and apparatus for distributing IP address, can be improved the scalability of multicast.
In a first aspect, providing a kind of method for distributing internet protocol address, comprising: according to multicase control information,
Determine multiple collection of equal value of multiple switch, wherein i-th of interchanger in the multiple interchanger corresponds at least one equivalence
Collection, j-th of collection of equal value that at least one described equivalence is concentrated includes M multicast group, and each multicast group exists in the M multicast group
There are forwarding-table items on i-th of interchanger, and in the M multicast group each multicast group in i-th of interchanger
Forwarding port it is identical, i, j, M be respectively be not less than 1 integer;Multiple polymerizable collection are determined according to the multiple collection of equal value,
In, j-th of collection of equal value of the multiple collection of equal value includes at least one polymerizable collection, whole multicast groups of the polymerizable concentration
It can be polymerized to a forwarding-table item;For each Multicast Group Assignment IP address of the multiple polymerizable concentration, wherein for institute
It is identical to state multiple polymerizable minimum prefixes for concentrating k-th of polymerizable IP address for concentrating each Multicast Group Assignment, k be not less than
1 integer.
With reference to first aspect, in the first possible implementation of the first aspect, described according to the multiple equivalence
Collection determines multiple polymerizable collection, comprising: according to j-th of i-th of interchanger collection of equal value, determine it is described at least one can gather
Intersection, so that the number of the polymerizable collection is minimum on the most interchanger of the number of corresponding polymerizable collection.
With reference to first aspect or the first possible implementation of first aspect, second in first aspect are possible
It is described that multiple polymerizable collection are determined according to the multiple collection of equal value, comprising: to determine on i-th of interchanger in implementation
The multicast group for belonging to q-th of polymerizable collection is not belonging to first of polymerizable collection, wherein first of polymerizable collection is described i-th
The polymerizable collection that any one is different from described q-th polymerizable collection on a interchanger, q are the integer not less than 1.
The possible implementation of second with reference to first aspect, in the third possible implementation of first aspect,
It is described that multiple polymerizable collection are determined according to the multiple collection of equal value, comprising: q-th of polymerizable collection and r-th of polymerizable collection
Meet any one following relationship, wherein r-th of polymerizable collection is that the multiple polymerizable concentrate is different from the q
The aggregate set of a aggregate set: q-th of polymerizable collection is the subset of described r-th polymerizable collection;Or it is described r-th it is polymerizable
Collection is the subset of described q-th polymerizable collection;Or q-th of polymerizable collection and described r-th polymerizable collection it is complete non-intersecting,
Wherein, r is the integer not less than 1.
With reference to first aspect or first aspect first to the third possible implementation, at the 4th kind of first aspect
It is described to distribute IP address for the multiple polymerizable collection, comprising: to determine the multiple polymerizable collection in the possible implementation of kind
Between topological relation;According to the topological relation, the multiple polymerizable minimum prefix for concentrating each polymerizable collection is determined
Size;It is each polymerizable concentration according to the multiple polymerizable minimum prefix size for concentrating each polymerizable collection
Each Multicast Group Assignment IP address.
The 4th kind of possible implementation with reference to first aspect, in the 5th kind of possible implementation of first aspect,
Topological relation between the multiple polymerizable collection of determination, comprising: determine the multiple polymerizable collection according to following rule
Each of polymerizable position of the collection in the topological relation: the polymerizable collection of u-th of the multiple polymerizable concentration is institute
State the proper subclass of the corresponding polymerizable collection of father node of u-th of polymerizable collection;And the child node of u-th of polymerizable collection is corresponding
Polymerizable collection be described u-th polymerizable collection proper subclass, wherein u is integer not less than 1.
The 4th kind with reference to first aspect or the 5th kind of possible implementation, in the 6th kind of possible reality of first aspect
In existing mode, each Multicast Group Assignment IP address for the multiple polymerizable concentration, comprising: calculated using following formula
The minimum prefix size M of the corresponding polymerizable collection of t-th of leaf node in the topological relationt:Its
In, NtFor the multicast group number that the corresponding polymerizable collection of t-th of leaf node includes, t is the integer not less than 1;Utilize with
Lower formula calculates the minimum prefix size M of the corresponding polymerizable collection of s-th of nonleaf node in the topological relations:Wherein, NsFor any one height for being not present in s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of node, n are the number for the child node that s-th of nonleaf node includes, MpFor
P-th child node in the n child node, s, p are respectively the integer for being not less than 1.
The 6th kind of possible implementation with reference to first aspect, in the 7th kind of possible implementation of first aspect
In, each Multicast Group Assignment IP address for the multiple polymerizable concentration, comprising: according to root section in the nonleaf node
The minimum prefix size of point, determines the minimum prefix of the IP address of the root node;V-th of non-root section from the nonleaf node
In the IP address of the corresponding father node of point, minimum prefix size is selected to be equal to the corresponding polymerizable collection of v-th of non-root node
Minimum prefix size IP address, the IP address as the corresponding polymerizable collection of v-th of non-root node;According to described
The IP address of the corresponding polymerizable collection of v non-root node is each of corresponding polymerizable collection of v-th of non-root node
Broadcast a group distribution IP address, wherein v is the integer not less than 1.
With reference to first aspect or first to the 7th kind of possible implementation of first aspect, at the 8th kind of first aspect
In possible implementation, the method also includes: obtain the multicase control information, wherein the multicase control information packet
It includes: the corresponding number of each multicast group, the multiple friendship in multicast application information that multiple users submit, the multiple multicast group
Forwarding-table item on the multiple interchanger of each interchanger of changing planes corresponding interchanger number, each multicast group and
Forwarding port of each multicast group on the multiple interchanger.
Second aspect provides a kind of equipment for distributing internet protocol address, comprising: the first determination unit, described the
One determination unit is used to determine multiple collection of equal value of multiple switch according to multicase control information, wherein the multiple interchanger
In i-th of interchanger correspond at least one equivalence collection, j-th of collection of equal value that at least one described equivalence is concentrated includes M group
Broadcast group, in the M multicast group each multicast group on i-th of interchanger there are forwarding-table item, and the M multicast
Each multicast group is identical in the forwarding port of i-th of interchanger in group, i, j, and M is respectively the integer for being not less than 1;Second really
Order member, second determination unit are used to determine multiple polymerizable collection according to the multiple collection of equal value, wherein the multiple etc.
The collection of equal value of j-th of valence collection includes at least one polymerizable collection, and whole multicast groups of the polymerizable concentration can be polymerized to
One forwarding-table item;Allocation unit, each Multicast Group Assignment IP that the allocation unit is used for as the multiple polymerizable concentration
Address, wherein for the multiple polymerizable minimum prefix for concentrating k-th of polymerizable IP address for concentrating each Multicast Group Assignment
Identical, k is the integer not less than 1.
In conjunction with second aspect, in the first possible implementation of the second aspect, second determination unit is specific
For: according to j-th of i-th of interchanger collection of equal value, at least one described polymerizable collection is determined, so that corresponding gather
On the most interchanger of the number of intersection, the number of the polymerizable collection is minimum.
In conjunction with the possible implementation of the first of second aspect or second aspect, second in second aspect is possible
In implementation, second determination unit is specifically also used to: being determined and is belonged to q-th of polymerizable collection on i-th of interchanger
Multicast group be not belonging to first of polymerizable collection, wherein it is described first it is polymerizable collection be any one on i-th of interchanger
Different from the polymerizable collection of described q-th polymerizable collection, q is the integer not less than 1.
In conjunction with second of possible implementation of second aspect, in the third possible implementation of second aspect
In, second determination unit is specifically also used to: determining that described q-th polymerizable collection is enough lower with r-th of polymerizable be filled with
It anticipates a kind of relationship, wherein r-th of polymerizable collection is that the multiple polymerizable concentrate is different from q-th of aggregate set
Aggregate set: q-th of polymerizable collection is the subset of described r-th polymerizable collection;Or r-th of polymerizable collection is described the
The subset of q polymerizable collection;Or q-th of polymerizable collection and described r-th polymerizable collection it is completely non-intersecting, wherein r is not
Integer less than 1.
In conjunction with second aspect or second aspect first to the third possible implementation, at the 4th kind of first aspect
In possible implementation, the allocation unit is specifically used for: determining the topological relation between the multiple polymerizable collection;According to
The topological relation determines the multiple polymerizable minimum prefix size for concentrating each polymerizable collection;According to it is the multiple can
The minimum prefix size of each polymerizable collection in aggregate set is each Multicast Group Assignment IP of each polymerizable concentration
Location.
In conjunction with the 4th kind of possible implementation of second aspect, in the 5th kind of possible implementation of second aspect
In, the allocation unit is specifically also used to: determining that the polymerizable collection of each of the multiple polymerizable concentration exists according to following rule
Position in the topological relation: the polymerizable collection of u-th of the multiple polymerizable concentration is the father of described u-th polymerizable collection
The proper subclass of the corresponding polymerizable collection of node;And the corresponding polymerizable collection of child node of u-th of polymerizable collection is the u
The proper subclass of a polymerizable collection, wherein u is the integer not less than 1.
In conjunction with the 4th kind of second aspect or the 5th kind of possible implementation, in the 6th kind of possible reality of second aspect
In existing mode, the allocation unit is specifically also used to: it is corresponding to calculate t-th of leaf node in the topological relation using following formula
Polymerizable collection minimum prefix size Mt:Wherein, NtFor t-th of leaf node is corresponding can
The multicast group number that aggregate set includes, t are the integer not less than 1;It is non-using s-th in the following formula calculating topological relation
The minimum prefix size M of the corresponding polymerizable collection of leaf nodes:Wherein, NsFor
It is not present in the multicast group number of the corresponding polymerizable concentration of any one child node of s-th of nonleaf node, n is described
The number for the child node that s-th of nonleaf node includes, MpFor p-th child node in the n child node, s, p are respectively not
Integer less than 1.
In conjunction with the 6th kind of possible implementation of second aspect, in the 7th kind of possible implementation of second aspect
In, the allocation unit is specifically also used to: according to the minimum prefix size of root node in the nonleaf node, determining described section
The minimum prefix of the IP address of point;From in the nonleaf node in the IP address of the corresponding father node of v-th of non-root node, selection
Minimum prefix size is equal to the IP address of the minimum prefix size of the corresponding polymerizable collection of v-th of non-root node, as institute
State the IP address of the corresponding polymerizable collection of v-th of non-root node;According to the IP of the corresponding polymerizable collection of v-th of non-root node
Address, be the corresponding polymerizable concentration of v-th of non-root node each Multicast Group Assignment IP address, wherein v be not less than
1 integer.
In conjunction with first to the 7th kind of possible implementation of second aspect or second aspect, the equipment further include: obtain
Unit is taken, the acquiring unit is for obtaining the multicase control information, wherein the multicase control information includes: multiple use
It is multicast application information that family is submitted, the corresponding number of each multicast group in the multiple multicast group, every in the multiple interchanger
Forwarding-table item on the multiple interchanger of the corresponding interchanger number of a interchanger, each multicast group and described each
Forwarding port of the multicast group on the multiple interchanger.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines multiple polymerizable collection, for the IP of multiple polymerizable each Multicast Group Assignments for concentrating any one polymerizable concentration
The minimum prefix of address is identical, therefore all multicast groups of any one polymerizable concentration can be aggregated to a forwarding-table item
In.Therefore, the method and apparatus of distribution IP address provided by the invention can be improved the scalability of multicast.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, will make below to required in the embodiment of the present invention
Attached drawing is briefly described, it should be apparent that, drawings described below is only some embodiments of the present invention, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is a kind of schematic flow chart of the method for distribution IP address of the embodiment of the present invention.
Fig. 2 is a kind of topological relation schematic diagram of polymerizable collection of another embodiment of the present invention.
Fig. 3 is a kind of topological relation schematic diagram of polymerizable collection of another embodiment of the present invention.
Fig. 4 is a kind of schematic block diagram of the equipment of distribution IP address of the embodiment of the present invention.
Fig. 5 is a kind of structural block diagram of the equipment of distribution IP address of the embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiment is a part of the embodiments of the present invention, rather than whole embodiments.Based on this hair
Embodiment in bright, those of ordinary skill in the art's every other reality obtained without making creative work
Example is applied, all should belong to the scope of protection of the invention.
Fig. 1 shows a kind of schematic flow chart of the method for distribution internet protocol address of the embodiment of the present invention,
This method 100 can be executed by controller.As shown in Figure 1, this method 100 includes:
110, according to multicast solicitation message, determine multiple collection of equal value of multiple switch, wherein the in multiple switch
I interchanger corresponds at least one equivalence collection, and j-th of collection of equal value which concentrates includes M multicast group, the M
There are forwarding-table items on i-th of interchanger for each multicast group in a multicast group, and each multicast group exists in the M multicast group
The forwarding port of i-th of interchanger is identical, i, j, and M is respectively the integer for being not less than 1.
120, multiple polymerizable collection are determined according to multiple collection of equal value, wherein j-th of collection of equal value of multiple collection of equal value includes extremely
A few polymerizable collection, the multicast group of polymerizable concentration can be polymerized to a forwarding-table item;
130, it is each Multicast Group Assignment IP address of multiple polymerizable concentrations, wherein be multiple polymerizable concentration kth
The minimum prefix of a polymerizable IP address for concentrating each Multicast Group Assignment is identical, and k is the integer not less than 1.
In step 110, specifically, multiple switch refers to the data center network institute obtained by multicase control information
Some interchangers, wherein multiple to refer to no less than two, i-th of interchanger in multiple switch can be indicated multiple
Any one interchanger in interchanger, which, which corresponds at least one equivalence collection, indicates any one interchanger
At least one corresponding equivalence collection, further, j-th of set representations of equal value on i-th of interchanger are on i-th of interchanger
Any one equivalence collection, any one multicast group is all in this i-th exchange in the M multicast group that j-th of collection of equal value includes
There are forwarding-table items on machine, and j-th of equivalence collects forwarding end of any one multicast group for including on i-th of interchanger
Mouth is identical.In other words, which there are forwarding-table item and will forward port one identical on the same interchanger
Or multiple multicast groups are divided into a collection of equal value.
In the step 120, specifically, multiple j-th concentrated of equal value collection of equal value (concentrate any one by namely multiple equivalences
A collection of equal value) it include at least one polymerizable collection, the multicast group of polymerizable concentration may be compressed to the same forwarding-table item, because
This equivalence collection is potential polymerizable collection, and polymerizable collection is desirable to obtain multicast group set, in order to by be in step 130 can
The identical IP address of Multicast Group Assignment minimum prefix in aggregate set, so that one or more multicast group pressures in the polymerizable collection
Contracting is in the same forwarding-table item, so as to realize cast communication.
It in step 130, specifically, is k-th of polymerizable collection (i.e. multiple polymerizable any one polymerizable collection of concentration)
Each of broadcast group and to distribute minimum prefix an identical IP address, wherein that is, the one of any one polymerizable concentration
The minimum prefix for the IP address that a or multiple Multicast Group Assignments obtain is identical, the minimum prefix of the IP address of each multicast group
Identical includes two layers of meaning: the minimum prefix size of the IP address of each multicast group is identical, i.e., the IP address of each multicast group
Mask-length is identical;Also, the IP address prefix of the IP address mask-length same section of each multicast group is identical.
Specifically, for example, k-th of polymerizable concentrate includes four multicast groups, then for the IP of this four Multicast Group Assignments
Address is respectively as follows: 230.0.0.1,230.0.0.2,230.0.0.3 and 230.0.0.4;In another example k-th of polymerizable concentration packet
Include three multicast groups, then the IP address for these three Multicast Group Assignments is respectively as follows: 230.0.0.1,230.0.0.2 and
It 230.0.0.4, is one available IP address of only one Multicast Group Assignment, it should be appreciated that above-mentioned IP address numerical value as M=1
It is only exemplary, the invention is not limited thereto.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines polymerizable collection, is the minimum prefix phase of the IP address of each Multicast Group Assignment of any one polymerizable concentration
Together, therefore all multicast groups of any one polymerizable concentration can be aggregated in a forwarding-table item.Therefore, the present invention mentions
The method and apparatus of the distribution IP address of confession can be improved the scalability of multicast.
Optionally, as one embodiment of the invention, multiple polymerizable collection are determined according to multiple collection of equal value, comprising: according to
The collection of equal value of j-th of i-th interchanger, determine at least one polymerizable collection, so that the number of corresponding polymerizable collection is most
On interchanger, the number of polymerizable collection is minimum.
Specifically, can be determined in multiple switch on i-th interchanger by quadratic programming, multicast group with it is polymerizable
Mapping relations between collection, comprising: a polymerizable collection is established to each group of concentration of equal value each on i-th interchanger,
By on the target polymerization collection interchanger most there are number, the quantity of polymerizable collection is minimized as optimization aim, thus really
Fixed polymerizable collection further after establishing mapping relations by quadratic programming, deletes extra polymerizable collection, i.e., in deletion
Hold for empty polymerizable collection.
Optionally, as one embodiment of the invention, multiple polymerizable collection are determined according to multiple collection of equal value, comprising: determine
The multicast group for belonging to q-th of polymerizable collection on i-th of interchanger is not belonging to first of polymerizable collection, wherein first of polymerizable collection
It is the polymerizable collection that any one is different from q-th of polymerizable collection on i-th of interchanger.Specifically, for a multicast group, such as
It belongs to q-th of polymerizable collection to fruit, then it can only belong to the polymerizable collection of the only one, it cannot on other polymerizable collection
Occur.
Optionally, as one embodiment of the invention, multiple polymerizable collection are determined according to multiple collection of equal value, comprising: q-th
Polymerizable collection is enough any one lower relationship with r-th of polymerizable be filled with, wherein r-th of polymerizable collection is multiple polymerizable collection
In be different from q-th of aggregate set aggregate set: q-th it is polymerizable collection be r-th of polymerizable collection subset;Or r-th polymerizable
Collection is the subset of q-th of polymerizable collection;Or q-th of polymerizable collection and described r-th polymerizable collection it is complete non-intersecting, wherein r is
Integer not less than 1.
In other words, any two it is polymerizable between there are one of following two relationships: one of them it is polymerizable collection be another
The subset of an outer polymerizable collection;Or two aggregate sets are completely disjoint.
Optionally, as one embodiment of the invention, for multiple polymerizable collection distribution IP address, comprising: determine it is multiple can
Topological relation between aggregate set;According to topological relation, determine that multiple polymerizable minimum prefixes for concentrating each polymerizable collection are big
It is small;According to multiple polymerizable minimum prefix sizes for concentrating each polymerizable collection, for each of described each polymerizable collection
Broadcast a group distribution IP address.
Specifically, after the polymerizable collection of one or more in determining multiple switch on each interchanger, it is thus necessary to determine that
Topological relation between all polymerizable collection, the IP address of each multicast group is distributed according to the topological relation, so as to will be every
The multicast group in an aggregate set on platform interchanger is aggregated in a forwarding-table item.It is opened up for example, can construct and meet this
The prefix trees of relationship are flutterred, each node corresponds to a polymerizable collection in non-root node in the prefix trees, by for the prefix trees
Leaf node and the corresponding polymerizable collection of nonleaf node determine the minimum prefix of corresponding IP address, so as to be gathered by all
Topological relation between intersection, for each Multicast Group Assignment IP address to a polymerizable concentration.
It should be understood that leaf node refers to the node there is no child node, nonleaf node refers to the node there are child node, i.e., non-
Leaf node must be some child node father node.
Optionally, as one embodiment of the invention, the topological relation between multiple polymerizable collection is determined, comprising: according to
Following rule determines position of the polymerizable collection of each of multiple polymerizable concentrations in topological relation: the of multiple polymerizable concentrations
U polymerizable collection are the proper subclass of the corresponding polymerizable collection of father node of u-th of polymerizable collection;And the son of u-th of polymerizable collection
The corresponding polymerizable collection of node is the proper subclass of u-th of polymerizable collection, wherein u is the integer not less than 1.
Specifically, u-th of polymerizable collection is multiple polymerizable any one polymerizable collection of concentration.Therefore, in other words, will
Each of all polymerizable collection are polymerizable to collect the suitable position for being inserted into prefix trees, and it is polymerizable which meets this
Collection is the proper subclass of the corresponding polymerizable collection of its father node, and the corresponding polymerizable collection of all child nodes of the polymerizable collection is this
The proper subclass of polymerizable collection.
Optionally, as one embodiment of the invention, IP address is distributed for multiple polymerizable collection, comprising: open from leaf node
Begin, the minimum prefix size of the corresponding polymerizable collection of the bottom-up each nonleaf node of determination, wherein minimum prefix size namely
Mask-length.
It optionally, is each Multicast Group Assignment IP address of multiple polymerizable concentrations, packet as one embodiment of the invention
It includes: calculating the minimum prefix size M of the corresponding polymerizable collection of t-th of leaf node in topological relation using following formulat:Wherein, NtThe multicast group number for including for the corresponding polymerizable collection of t-th of leaf node;
The minimum prefix size of the corresponding polymerizable collection of s-th of nonleaf node in topological relation is calculated using following formula
Ms:Wherein, NsFor any one height section for being not present in s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of point, n are the number for the child node that s-th of nonleaf node includes, MpFor n son section
P-th child node in point, s, p are respectively the integer for being not less than 1.
Specifically, t-th of leaf node is any one node in all leaf nodes of prefix trees, and leaf node is come
It says, the corresponding polymerizable collection of the leaf node is determined according to the corresponding polymerizable number for collecting the multicast group for including of the leaf node
Minimum prefix size, in order to distribute IP address according to for the polymerizable collection.For example, one includes the polymerizable of two multicast groups
Collection, i.e. Nt=2, then Mt=31, the minimum prefix size of the as polymerizable collection distribution is 31;For another example one includes one
The polymerizable collection of multicast group, i.e. Nt=1, then Mt=32, the minimum prefix size of the as polymerizable collection distribution is 32.Ying Li
Solution, the numerical value of the example above are only exemplary, and the invention is not limited thereto.
Specifically, s-th of nonleaf node is any one node in all nonleaf nodes of prefix trees, to nonleaf node
For, not only root is also wanted according to the corresponding polymerizable number for collecting the multicast group for including of each child node of the nonleaf node
According to the multicast group number of the corresponding polymerizable concentration of any one child node for being not present in the nonleaf node, the n omicronn-leaf is determined
The minimum prefix size of node.
Specifically, for example, s-th nonleaf node there are two child node t1And t2, Mt1=31, Mt2=32, it is not present in this
Two child node t1And t2The multicast group number N of corresponding polymerizable concentrations=1, then M can be calculateds=30, i.e. s
The minimum prefix size of a nonleaf node is 30, that is, mask-length is 30, polymerizable concentration corresponding to s-th of nonleaf node
The minimum prefix size of each multicast group be 30, therefore can be the IP address minimum prefix phase of each Multicast Group Assignment
Together, thus s-th of nonleaf node it is corresponding it is polymerizable can be with one forwarding-table item of boil down to.
Optionally, as one embodiment of the invention, each Multicast Group Assignment for the multiple polymerizable concentration
IP address, comprising: according to the minimum prefix size of root node in nonleaf node, determine the minimum prefix of the IP address of root node;
From in the IP address of the corresponding father node of v-th of non-root node, the minimum prefix size of selection is equal to v-th in the nonleaf node
The IP address of the minimum prefix size of the corresponding polymerizable collection of non-root node, as the corresponding polymerizable collection of v-th of non-root node
IP address;It is that q-th of non-root node is corresponding polymerizable according to the IP address of the corresponding polymerizable collection of q-th of non-root node
The each Multicast Group Assignment IP address concentrated, wherein v is the integer not less than 1.
Specifically, in the topological tree constructed according to topological relation, the nonleaf node positioned at top is root node, is determined
The process of the IP address of the corresponding polymerizable collection of each node is as follows: since root node, the top-down each node pair of determination
The IP address prefix for the polymerizable collection answered.
Further, specifically, the minimum prefix size of available root node is calculated according to method as described above,
One section of mask-length is selected to be equal to the IP address of the minimum prefix size of the root node from available multicast address, as the root
The IP address of node, it should be appreciated that the IP address of the root node is the identical IP address of one section of lowest address prefix.
It further, specifically, can be from the IP of the corresponding father node of the non-root node to any one non-root node
In address, minimum prefix size is selected with being equal to one section of IP of the minimum prefix size of the corresponding polymerizable collection of the non-root node
The minimum prefix of location, each multicast group of polymerizable concentration in the non-root node is identical, therefore the polymerizable collection can be with boil down to
One forwarding-table item.
Optionally, as one embodiment of the invention, this method further include: obtain multicase control information, wherein group Broadcast Control
Information processed includes: multicast application information, the corresponding number of each multicast group, Duo Gejiao in multiple multicast groups that multiple users submit
The corresponding interchanger number of each interchanger of changing planes, forwarding-table item and each multicast of each multicast group in multiple switch
Forwarding port of the group in multiple switch.
Specifically, the multicast application information that multiple users submit includes multicast group address, multicast of each user's application
Group sender's host address, multicast group recipient's host;Further, controller can obtain all from data center network
Interchanger and its number and each multicast group are in the forwarding-table item on each interchanger and the forwarding end on each interchanger
Mouth set.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines polymerizable collection, is the minimum prefix phase of the IP address of each Multicast Group Assignment of any one polymerizable concentration
Together, therefore all multicast groups of any one polymerizable concentration can be aggregated in a forwarding-table item.Therefore, the present invention mentions
The method and apparatus of the distribution IP address of confession can be improved the scalability of multicast.
It optionally, is each each multicast of equal value concentrated according to multicase control information as one embodiment of the invention
Group all establishes a polymerizable collection, establishes mapping relations by quadratic programming, shown in detailed process such as formula (1) to (9):
Minimize maxS (1)
Such as above formula (1) to (9), wherein on the most interchanger of the polymerizable collection of maxS expression non-empty, the polymerizable collection of non-empty
Forwarding table scale after quantity, that is, maximum compression;
xijkmIndicate whether m-th of multicast group belongs to k-th of polymerizable collection of j-th of collection of equal value of i-th of interchanger;
CijIndicate j-th of collection of equal value on i-th interchanger;
OiIndicate the cluster set being not present on i-th of interchanger;
EiIndicate the number of equal value collected on i-th of interchanger;
nijIndicate the polymerizable collection number of j-th of collection of equal value on i-th of interchanger;
MijkWhether k-th of polymerizable collection for indicating j-th of collection of equal value on i-th of interchanger is empty;
MiIndicate the polymerizable collection number of non-empty (forwarding table scale after compression) on i-th of interchanger.
Formula (1) indicates optimization aim, minimizes on the most interchanger of the polymerizable collection of non-empty, the number of the polymerizable collection of non-empty
Amount;
Formula (2) is used to constrain xijkmValue range: 0 represent be not belonging to, 1 represent belong to.
Formula (3) is indicated for m-th of multicast group, if it is appeared in some equivalence collection on the i-th interchanger,
It has to appear on the polymerizable collection of only one equivalence collection;
Formula (4) is indicated cannot on the polymerizable collection for the collection of equal value that it is not belonging at other for above-mentioned m-th of multicast group
Occur;
Formula (5) is indicated for m-th of multicast group, if any one collection of equal value that it is not present on interchanger, that
It at most occurs primary on all polymerizable collection of the interchanger;
Formula (6) defines Mijk;
Formula (7) defines Mi;
Formula (8) defines maxS;
Formula (9) constrains the relationship on different interchangers between polymerizable collection,
Constraint formula (9) is the core content of this planning.This embodies a characteristic of prefix compression.For two interchangers
On the polymerizable collection E of any twoijkAnd Epqr, the inclusion relation between them may are as follows:
A.EijkIt is EpqrSubset B.EpqrIt is EijkSubset C.EijkAnd EpqrIt is completely non-intersecting
The restriction of above-mentioned relation be because prefix compression in, some prefix or the ground all comprising another prefix
Location or any address not comprising another prefix, therefore, three max of constraint formula (9) respectively correspond three kinds of relationships above
One kind.
This quadratic programming is solved, the corresponding pass on our available every interchanger between group and polymerizable collection
System, i.e., after the forwarding table compression of every interchanger should which remaining list item, which group these list items should respectively correspond again
Group.
Specifically, as one embodiment of the invention, table 1 respectively illustrates the respective multicast on interchanger 0 and interchanger 1
Control information, including multicast group #, the forwarding port of each multicast group, and according to the forwarding port of each multicast group and table
The collection of equal value that item divides.
Table 1
According to the formula of above-mentioned quadratic programming, the polymerizable situation that will be obtained on every interchanger is gathered positioned at same
The minimum prefix of the IP address of the Multicast Group Assignment of intersection is identical, therefore can be compressed in the same forwarding-table item.Further,
By all non-emptys obtained by quadratic programming it is polymerizable collection be combined, remove the duplicate polymerizable collection of content, will obtain as
Lower result: having polymerizable collection (1,2,4,7), (0,3), (5) on interchanger 0, have on interchanger 1 polymerizable collection (5,6),
(1,2)、(7)。
Further, by building interchanger 0 and interchanger 1 on multiple polymerizable collection topological relation, for it is multiple can
Each polymerizable collection distributes IP address in aggregate set.
Specifically, there can be the prefix trees of topological relation by creating, determine the IP address of each polymerizable collection, step
It is as follows:
1. one set including all multicast groups of building, the root node as above-mentioned prefix trees;
2. any one polymerizable collection of all polymerizable concentrations is inserted into prefix trees, which meets: the polymerizable collection
It is the proper subclass of its father node, all child nodes of the polymerizable collection are all its proper subclass;
3. the prefix trees with topological relation will be obtained by step 1 and 2, as a result as shown in Figure 2.Fig. 2 is this hair
The schematic diagram of the topological relation of the polymerizable collection of bright embodiment.As shown in Fig. 2, including following multicast group in root node: 0,1,2,
3,4,5,6,7;The child node of root node is respectively E010: (1,2,4,7), E101: (5,6) and E000(0,3);Leaf node is respectively
E100: (1,2), E110: (7) and E020: (5).
4. determining the corresponding minimum prefix size (mask-length) of each polymerizable collection bottom-uply since leaf node
The minimum prefix size of the corresponding polymerizable collection of t-th of leaf node in the topological relation is calculated using following formula
Mt:Wherein, NtFor the multicast group number that the corresponding polymerizable collection of t-th of leaf node includes, t
For the integer not less than 1;
The minimum prefix for calculating the corresponding polymerizable collection of s-th of nonleaf node in the topological relation using following formula is big
Small Ms:Wherein, NsTo be not present in any one of s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of a child node, n are the number for the child node that s-th of nonleaf node includes,
MpFor p-th child node in the n child node, s, p are respectively the integer for being not less than 1.
Specifically, such as E100: (1,2), E110: (7), respectively obtaining minimum prefix size is 31 and 32, then right
In their node E010: for (1,2,4,7) corresponding polymerizable collection, the minimum prefix for calculating polymerizable collection (1,2,4,7) is big
Small is 30.It should be understood that the minimum prefix size of available each polymerizable collection according to the method described above, for brevity, herein
It repeats no more.
5. since root node, the minimum prefix of the IP address of the top-down each polymerizable collection of determination:
The minimum prefix of the IP address of root node can select one section of mask-length to be equal to root from available multicast address
The IP address of node minimum prefix size, the IP address as root node;
It is non-that the IP address prefix of non-root node can select one section of mask-length to be equal to this from the IP address of its father node
The IP address of the minimum prefix size of root node, the IP address as the non-root node.
6. finally obtain the IP address situation for each Multicast Group Assignment as shown in figure 3, Fig. 3 embodiment of the present invention one kind
The topological relation schematic diagram of polymerizable collection.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines polymerizable collection, is the minimum prefix phase of the IP address of each Multicast Group Assignment of any one polymerizable concentration
Together, therefore all multicast groups of any one polymerizable concentration can be aggregated in a forwarding-table item.Therefore, the present invention mentions
The method and apparatus of the distribution IP address of confession can be improved the scalability of multicast.
Above in conjunction with the method that Fig. 1 to Fig. 3 describes distribution IP address in detail, distribution IP is discussed in detail below with reference to Fig. 4
The equipment of address.
Fig. 4 is a kind of schematic block diagram of the equipment of distribution IP address of the embodiment of the present invention.The equipment 400 includes:
First determination unit 410, the first determination unit 410 are used to determine multiple switch according to multicase control information
Multiple collection of equal value, wherein i-th of interchanger in multiple switch corresponds at least one equivalence collection, at least one equivalence is concentrated
J-th of collection of equal value include M multicast group, in M multicast group each multicast group on i-th of interchanger there are forwarding-table item,
And each multicast group is identical in the forwarding port of i-th of interchanger in M multicast group, i, j, M be respectively be not less than 1 it is whole
Number;
Second determination unit 420, the second determination unit are used to determine multiple polymerizable collection according to multiple collection of equal value, wherein
J-th of collection of equal value of multiple collection of equal value includes at least one polymerizable collection, and whole multicast groups of polymerizable concentration can be polymerize
For a forwarding-table item;
Allocation unit 430, each Multicast Group Assignment IP address that allocation unit 430 is used for as multiple polymerizable concentrations,
In, identical for multiple polymerizable minimum prefixes for concentrating k-th of polymerizable IP address for concentrating each Multicast Group Assignment, k is not
Integer less than 1.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines polymerizable collection, is the minimum prefix phase of the IP address of each Multicast Group Assignment of any one polymerizable concentration
Together, therefore all multicast groups of any one polymerizable concentration can be aggregated in a forwarding-table item.Therefore, the present invention mentions
The method and apparatus of the distribution IP address of confession can be improved the scalability of multicast.
Optionally, as one embodiment of the invention, the second determination unit 420 is specifically used for: according to i-th interchanger
J-th of collection of equal value, determines at least one polymerizable collection, so that on the most interchanger of the number of corresponding polymerizable collection, it is described
The number of polymerizable collection is minimum.Optionally, as one embodiment of the invention, the second determination unit 420 is specifically also used to: being determined
The multicast group for belonging to q-th of polymerizable collection on i-th of interchanger is not belonging to first of polymerizable collection, wherein first of polymerizable collection
It is the polymerizable collection that any one is different from q-th of polymerizable collection on i-th of interchanger, q is the integer not less than 1.
Optionally, as one embodiment of the invention, the second determination unit 420 is specifically also used to: determine q-th it is polymerizable
Collection is enough any one lower relationship with r-th of polymerizable be filled with, wherein r-th of polymerizable collection is that multiple polymerizable concentrations are different
In the aggregate set of j-th of aggregate set:
Q-th of polymerizable collection is the subset of r-th of polymerizable collection;Or
R-th of polymerizable collection is the subset of q-th of polymerizable collection;Or
Q-th of polymerizable collection and r-th of polymerizable collection are completely non-intersecting, wherein r is the integer not less than 1.
Optionally, as one embodiment of the invention, allocation unit 430 is specifically used for: determining between multiple polymerizable collection
Topological relation;According to topological relation, multiple polymerizable minimum prefix sizes for concentrating each polymerizable collection are determined;According to multiple
The polymerizable minimum prefix size for concentrating each polymerizable collection is each Multicast Group Assignment IP address of each polymerizable concentration.
Optionally, as one embodiment of the invention, allocation unit 430 is specifically also used to: more according to following rule determination
Position of the polymerizable collection of each of a polymerizable concentration in topological relation:
The polymerizable collection of u-th of multiple polymerizable concentrations is the corresponding polymerizable collection of father node of u-th of polymerizable collection
Proper subclass;And the corresponding polymerizable collection of child node of u-th of polymerizable collection is the proper subclass of u-th of polymerizable collection, wherein u is
Integer not less than 1.
Optionally, as one embodiment of the invention, allocation unit 430 is specifically also used to: being opened up using following formula calculating
Flutter the minimum prefix size M of the corresponding polymerizable collection of t-th of leaf node in relationshipt:Wherein, NtFor
The multicast group number that the corresponding polymerizable collection of t-th of leaf node includes, t is the integer not less than 1;
The minimum prefix size of the corresponding polymerizable collection of s-th of nonleaf node in topological relation is calculated using following formula
Ms:Wherein, NsFor any one height section for being not present in s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of point, n are the number for the child node that s-th of nonleaf node includes, MpFor n son section
P-th child node in point, s, p are respectively the integer for being not less than 1.
Optionally, as one embodiment of the invention, allocation unit 430 is specifically also used to: according to root section in nonleaf node
The minimum prefix size of point, determines the minimum prefix of the IP address of root node;V-th of non-root node is corresponding from nonleaf node
In the IP address of father node, the minimum prefix for selecting minimum prefix size to be equal to the corresponding polymerizable collection of v-th of non-root node is big
Small IP address, the IP address as the corresponding polymerizable collection of v-th of non-root node;According to v-th of non-root node is corresponding can
The IP address of aggregate set is each Multicast Group Assignment IP address of the corresponding polymerizable concentration of v-th of non-root node, wherein v is
Integer not less than 1.
Optionally, as one embodiment of the invention, the equipment further include: acquiring unit 440, the acquiring unit
440 for obtaining multicase control information, wherein multicase control information includes: the multicast application information, multiple that multiple users submit
The corresponding number of each multicast group in multicast group, the corresponding interchanger number of each interchanger, each multicast in multiple switch
Forwarding port of the group in the forwarding-table item and each multicast group on the multiple interchanger on the multiple interchanger.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines polymerizable collection, is the minimum prefix phase of the IP address of each Multicast Group Assignment of any one polymerizable concentration
Together, therefore all multicast groups of any one polymerizable concentration can be aggregated in a forwarding-table item.Therefore, the present invention mentions
The method and apparatus of the distribution IP address of confession can be improved the scalability of multicast.
Fig. 5 shows a kind of structural block diagram of the equipment of distribution IP address of the embodiment of the present invention.As shown in figure 5, equipment
500 include at least one processor 510, at least one network interface or other communication interfaces 520, memory 530, and at least
One communication bus 540, for realizing the connection communication between these components.Processor 510 is deposited in memory 530 for executing
The executable module of storage, such as computer program 531.Memory 530 may include high speed random access memory (English: random-
Access memory, referred to as: RAM), it is also possible to it further include nonvolatile memory (English: non-volatile memory),
A for example, at least magnetic disk storage.By the realization of at least one network interface 520 (can be wired or wireless) and at least
Communication connection between one other network element.
In some embodiments, memory 530 stores program 531, and processor 510 executes program 531, can be used for holding
The following operation of row:
According to multicase control information, multiple collection of equal value of multiple switch are determined, wherein i-th in multiple switch
Interchanger corresponds at least one equivalence collection, and j-th of collection of equal value that at least one equivalence is concentrated includes M multicast group, M multicast group
In each multicast group there are forwarding-table items on i-th of interchanger, and in M multicast group each multicast group i-th exchange
The forwarding port of machine is identical, i, j, and M is respectively the integer for being not less than 1;
Multiple polymerizable collection are determined according to multiple collection of equal value, wherein j-th of collection of equal value of multiple collection of equal value includes at least one
A polymerizable collection, whole multicast groups of polymerizable concentration can be polymerized to a forwarding-table item;
For each Multicast Group Assignment IP address of multiple polymerizable concentrations, wherein can gather for multiple polymerizable concentrate k-th
The minimum prefix of the IP address of each Multicast Group Assignment is identical in intersection, and k is the integer not less than 1.
Optionally, as one embodiment of the invention, processor 510 is also used to: according to j-th of i-th of interchanger etc.
Valence collection determines at least one polymerizable collection, so that on the most interchanger of the number of corresponding polymerizable collection, the polymerizable collection
Number it is minimum.
Optionally, as one embodiment of the invention, processor 510 is also used to: being determined and is belonged to q on i-th of interchanger
The multicast group of a polymerizable collection is not belonging to first of polymerizable collection, wherein first of polymerizable collection is any one on i-th of interchanger
A polymerizable collection for being different from q-th of polymerizable collection, q are the integer not less than 1.
Optionally, as one embodiment of the invention, processor 510 is also used to: determining q-th of polymerizable collection and r-th
Polymerizable be filled with is enough any one lower relationship, wherein r-th of polymerizable collection is that multiple polymerizable concentrate are gathered different from q-th
The aggregate set of intersection:
Q-th of polymerizable collection is the subset of r-th of polymerizable collection;Or
R-th of polymerizable collection is the subset of j-th of polymerizable collection;Or
Q-th of polymerizable collection and r-th of polymerizable collection are completely non-intersecting, wherein r is the integer not less than 1.
Optionally, as one embodiment of the invention, allocation unit 430 is specifically used for: determining between multiple polymerizable collection
Topological relation;According to topological relation, multiple polymerizable minimum prefix sizes for concentrating each polymerizable collection are determined;According to multiple
The polymerizable minimum prefix size for concentrating each polymerizable collection is each Multicast Group Assignment IP address of each polymerizable concentration.
Optionally, as one embodiment of the invention, processor 510 is also used to: determining multiple gather according to following rule
Position of the polymerizable collection of each of intersection in topological relation:
The polymerizable collection of u-th of multiple polymerizable concentrations is the corresponding polymerizable collection of father node of u-th of polymerizable collection
Proper subclass;And the corresponding polymerizable collection of child node of u-th of polymerizable collection is the proper subclass of u-th of polymerizable collection, wherein u is
Integer not less than 1.
Optionally, as one embodiment of the invention, processor 510 is also used to: calculating topological relation using following formula
In the corresponding polymerizable collection of t-th of leaf node minimum prefix size Mt:Wherein, NtFor t-th of leaf
The multicast group number that the corresponding polymerizable collection of node includes, t is the integer not less than 1;
The minimum prefix size of the corresponding polymerizable collection of s-th of nonleaf node in topological relation is calculated using following formula
Ms:Wherein, NsFor any one height section for being not present in s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of point, n are the number for the child node that s-th of nonleaf node includes, MpFor n son section
P-th child node in point, s, p are respectively the integer for being not less than 1.
Optionally, as one embodiment of the invention, processor 510 is also used to: most according to root node in nonleaf node
Small prefix size determines the minimum prefix of the IP address of root node;The corresponding father node of v-th of non-root node from nonleaf node
IP address in, select minimum prefix size to be equal to the IP of the minimum prefix size of the corresponding polymerizable collection of v-th of non-root node
Address, the IP address as the corresponding polymerizable collection of v-th of non-root node;According to the corresponding polymerizable collection of v-th of non-root node
IP address, be the corresponding polymerizable concentration of v-th of non-root node each Multicast Group Assignment IP address, wherein v be not less than
1 integer.
Optionally, as one embodiment of the invention, processor 510 is also used to: obtaining multicase control information, wherein group
Broadcast Control information includes: the multicast application information, the corresponding number of each multicast group in multiple multicast groups, more that multiple users submit
In a interchanger forwarding-table item on the multiple interchanger of the corresponding interchanger number of each interchanger, each multicast group and
Forwarding port of each multicast group on the multiple interchanger.
The embodiment of the present invention is by determining the collection of equal value of multiple switch, further basis should according to multicast solicitation message
Equivalence collection determines polymerizable collection, is the minimum prefix phase of the IP address of each Multicast Group Assignment of any one polymerizable concentration
Together, therefore all multicast groups of any one polymerizable concentration can be aggregated in a forwarding-table item.Therefore, the present invention mentions
The method and apparatus of the distribution IP address of confession can be improved the scalability of multicast.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
The scope of the present invention.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed systems, devices and methods, it can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
It, can be with if the function is realized in the form of SFU software functional unit and when sold or used as an independent product
It is stored in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially in other words
The part of the part that contributes to existing technology or the technical solution can be embodied in the form of software products, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be a
People's computer, server or network equipment etc.) or processor (processor) execute side described in each embodiment of the present invention
The all or part of the steps of method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
In the technical scope disclosed by the present invention, any changes or substitutions that can be easily thought of by those familiar with the art, all answers
It is included within the scope of the present invention, therefore protection scope of the present invention should be subject to the protection scope in claims.
Claims (18)
1. a kind of method for distributing internet protocol address characterized by comprising
According to multicase control information, multiple collection of equal value of multiple switch are determined, wherein i-th in the multiple interchanger
Interchanger corresponds at least one equivalence collection, and j-th of collection of equal value that at least one described equivalence is concentrated includes M multicast group, the M
There are forwarding-table items on i-th of interchanger for each multicast group in a multicast group, and each group in the M multicast group
It is identical in the forwarding port of i-th of interchanger to broadcast group, i, j, M are respectively the integer for being not less than 1;
Multiple polymerizable collection are determined according to the multiple collection of equal value, wherein j-th of collection of equal value of the multiple collection of equal value includes extremely
A few polymerizable collection, whole multicast groups of the polymerizable concentration can be polymerized to a forwarding-table item;
For each Multicast Group Assignment IP address of the multiple polymerizable concentration, wherein be k-th of the multiple polymerizable concentration
The minimum prefix of the polymerizable IP address for concentrating each Multicast Group Assignment is identical, and k is the integer not less than 1.
2. the method according to claim 1, wherein described multiple polymerizable according to the multiple collection determination of equal value
Collection, comprising:
According to j-th of i-th of interchanger collection of equal value, at least one described polymerizable collection is determined, so that corresponding gather
On the most interchanger of the number of intersection, the number of the polymerizable collection is minimum.
3. method according to claim 1 or 2, which is characterized in that it is described according to the multiple collection of equal value determine it is multiple can
Aggregate set, comprising:
Determine that the multicast group for belonging to q-th of polymerizable collection on i-th of interchanger is not belonging to first of polymerizable collection, wherein institute
Stating first of polymerizable collection is the polymerizable collection that any one is different from described q-th polymerizable collection on i-th of interchanger, q
For the integer not less than 1.
4. according to the method described in claim 3, it is characterized in that, described multiple polymerizable according to the multiple collection determination of equal value
Collection, comprising:
Q-th of polymerizable collection is enough any one lower relationship with r-th of polymerizable be filled with, wherein described r-th polymerizable
Collection is the multiple polymerizable aggregate set concentrated different from described q-th polymerizable collection:
Q-th of polymerizable collection is the subset of described r-th polymerizable collection;Or
R-th of polymerizable collection is the subset of described q-th polymerizable collection;Or
Q-th of polymerizable collection and described r-th polymerizable collection are completely non-intersecting, wherein r is the integer not less than 1.
5. method according to claim 1 or 2, which is characterized in that it is described to distribute IP address for the multiple polymerizable collection,
Include:
Determine the topological relation between the multiple polymerizable collection;
According to the topological relation, the multiple polymerizable minimum prefix size for concentrating each polymerizable collection is determined;
It is the every of each polymerizable concentration according to the multiple polymerizable minimum prefix size for concentrating each polymerizable collection
A Multicast Group Assignment IP address.
6. according to the method described in claim 5, it is characterized in that, the topology between the multiple polymerizable collection of the determination is closed
System, comprising:
Position of the polymerizable collection of each of the multiple polymerizable concentration in the topological relation is determined according to following rule:
The polymerizable collection of u-th of the multiple polymerizable concentration is that the father node of described u-th polymerizable collection is corresponding polymerizable
The proper subclass of collection;And
The corresponding polymerizable collection of the child node of u-th of polymerizable collection is the proper subclass of described u-th polymerizable collection, wherein u
For the integer not less than 1.
7. according to the method described in claim 5, it is characterized in that, each multicast group for the multiple polymerizable concentration
Distribute IP address, comprising:
The minimum prefix size M of the corresponding polymerizable collection of t-th of leaf node in the topological relation is calculated using following formulat:Wherein, NtFor the multicast group number that the corresponding polymerizable collection of t-th of leaf node includes, t is not
Integer less than 1;
The minimum prefix size M of the corresponding polymerizable collection of s-th of nonleaf node in the topological relation is calculated using following formulas:Wherein, NsFor any one height for being not present in s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of node, n are the number for the child node that s-th of nonleaf node includes, MpFor n
The minimum prefix size of the corresponding polymerizable collection of p-th of child node in a child node, s, p are respectively the integer for being not less than 1.
8. the method according to the description of claim 7 is characterized in that each multicast group for the multiple polymerizable concentration
Distribute IP address, comprising:
According to the minimum prefix size of root node in the nonleaf node, the minimum prefix of the IP address of the root node is determined;
From in the IP address of the corresponding father node of v-th of non-root node, the minimum prefix size of selection is equal in the nonleaf node
The IP address of the minimum prefix size of the corresponding polymerizable collection of v-th of non-root node, as v-th of non-root node pair
The IP address for the polymerizable collection answered;
According to the IP address of the corresponding polymerizable collection of v-th of non-root node, gather for v-th of non-root node is corresponding
Each of intersection broadcasts a group distribution IP address, wherein v is the integer not less than 1.
9. method according to claim 1 or 2, which is characterized in that the method also includes:
Obtain the multicase control information, wherein the multicase control information includes: the multicast letter of application that multiple users submit
Breath, the corresponding number of each multicast group in the multiple multicast group, the corresponding exchange of each interchanger in the multiple interchanger
Machine number, forwarding-table item and each multicast group of each multicast group on the multiple interchanger are in the multiple friendship
Forwarding port on changing planes.
10. a kind of equipment for distributing internet protocol address characterized by comprising
First determination unit, first determination unit are used for according to multicase control information, determine the multiple etc. of multiple switch
Valence collection, wherein i-th of interchanger in the multiple interchanger corresponds at least one equivalence collection, at least one described equivalence collection
In j-th of collection of equal value include M multicast group, each multicast group exists on i-th of interchanger in the M multicast group
Forwarding-table item, and each multicast group is identical in the forwarding port of i-th of interchanger in the M multicast group, i, j, M points
It Wei not integer not less than 1;
Second determination unit, second determination unit are used to determine multiple polymerizable collection according to the multiple collection of equal value, wherein
J-th of collection of equal value of the multiple collection of equal value includes at least one polymerizable collection, whole multicast group energy of the polymerizable concentration
Enough it is polymerized to a forwarding-table item;
Allocation unit, each Multicast Group Assignment IP address that the allocation unit is used for as the multiple polymerizable concentration, wherein
Identical for the multiple polymerizable minimum prefix for concentrating k-th of polymerizable IP address for concentrating each Multicast Group Assignment, k is not
Integer less than 1.
11. equipment according to claim 10, which is characterized in that second determination unit is specifically used for:
According to j-th of i-th of interchanger collection of equal value, at least one described polymerizable collection is determined, so that corresponding gather
On the most interchanger of the number of intersection, the number of the polymerizable collection is minimum.
12. equipment described in 0 or 11 according to claim 1, which is characterized in that second determination unit is specifically also used to:
Determine that the multicast group for belonging to q-th of polymerizable collection on i-th of interchanger is not belonging to first of polymerizable collection, wherein institute
Stating first of polymerizable collection is the polymerizable collection that any one is different from described q-th polymerizable collection on i-th of interchanger, q
For the integer not less than 1.
13. equipment according to claim 12, which is characterized in that second determination unit is specifically also used to: determining institute
It states q-th of polymerizable collection and is enough any one lower relationship with r-th of polymerizable be filled with, wherein r-th of polymerizable collection is institute
State multiple polymerizable aggregate sets concentrated different from described q-th polymerizable collection:
Q-th of polymerizable collection is the subset of described r-th polymerizable collection;Or
R-th of polymerizable collection is the subset of described q-th polymerizable collection;Or
Q-th of polymerizable collection and described r-th polymerizable collection are completely non-intersecting, wherein r is the integer not less than 1.
14. equipment described in 0 or 11 according to claim 1, which is characterized in that the allocation unit is specifically used for:
Determine the topological relation between the multiple polymerizable collection;
According to the topological relation, the multiple polymerizable minimum prefix size for concentrating each polymerizable collection is determined;
It is the every of each polymerizable concentration according to the multiple polymerizable minimum prefix size for concentrating each polymerizable collection
A Multicast Group Assignment IP address.
15. equipment according to claim 14, which is characterized in that the allocation unit is specifically also used to: according to following rule
Then determine position of the polymerizable collection of each of the multiple polymerizable concentration in the topological relation:
The polymerizable collection of u-th of the multiple polymerizable concentration is that the father node of described u-th polymerizable collection is corresponding polymerizable
The proper subclass of collection;And
The corresponding polymerizable collection of the child node of u-th of polymerizable collection is the proper subclass of described u-th polymerizable collection, wherein u
For the integer not less than 1.
16. equipment according to claim 14, which is characterized in that the allocation unit is specifically also used to:
The minimum prefix size M of the corresponding polymerizable collection of t-th of leaf node in the topological relation is calculated using following formulat:Wherein, NtFor the multicast group number that the corresponding polymerizable collection of t-th of leaf node includes, t is not
Integer less than 1;
The minimum prefix size M of the corresponding polymerizable collection of s-th of nonleaf node in the topological relation is calculated using following formulas:Wherein, NsFor any one height for being not present in s-th of nonleaf node
The multicast group number of the corresponding polymerizable concentration of node, n are the number for the child node that s-th of nonleaf node includes, MpFor n
The minimum prefix size of the corresponding polymerizable collection of p-th of child node in a child node, s, p are respectively the integer for being not less than 1.
17. equipment according to claim 16, which is characterized in that the allocation unit is specifically also used to:
According to the minimum prefix size of root node in the nonleaf node, the minimum prefix of the IP address of the root node is determined;
From in the IP address of the corresponding father node of v-th of non-root node, the minimum prefix size of selection is equal in the nonleaf node
The IP address of the minimum prefix size of the corresponding polymerizable collection of v-th of non-root node, as v-th of non-root node pair
The IP address for the polymerizable collection answered;
According to the IP address of the corresponding polymerizable collection of v-th of non-root node, gather for v-th of non-root node is corresponding
Each of intersection broadcasts a group distribution IP address, wherein v is the integer not less than 1.
18. equipment described in 0 or 17 according to claim 1, which is characterized in that the equipment further include:
Acquiring unit, the acquiring unit is for obtaining the multicase control information, wherein the multicase control information includes:
The corresponding number of each multicast group, the multiple exchange in multicast application information that multiple users submit, the multiple multicast group
The corresponding interchanger number of each interchanger, forwarding-table item and institute of each multicast group on the multiple interchanger in machine
State forwarding port of each multicast group on the multiple interchanger.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510337394.4A CN106331186B (en) | 2015-06-17 | 2015-06-17 | The method and apparatus for distributing internet protocol address |
PCT/CN2016/084044 WO2016202172A1 (en) | 2015-06-17 | 2016-05-31 | Method and apparatus for allocating internet protocol (ip) addresses |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510337394.4A CN106331186B (en) | 2015-06-17 | 2015-06-17 | The method and apparatus for distributing internet protocol address |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106331186A CN106331186A (en) | 2017-01-11 |
CN106331186B true CN106331186B (en) | 2019-05-21 |
Family
ID=57545067
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510337394.4A Active CN106331186B (en) | 2015-06-17 | 2015-06-17 | The method and apparatus for distributing internet protocol address |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN106331186B (en) |
WO (1) | WO2016202172A1 (en) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1801711A (en) * | 2006-01-18 | 2006-07-12 | 杭州华为三康技术有限公司 | Multicast group member identification method and apparatus |
CN1881931A (en) * | 2005-06-13 | 2006-12-20 | 中兴通讯股份有限公司 | Multicast forwarding route aggregating method |
CN101026479A (en) * | 2007-03-30 | 2007-08-29 | 北京交通大学 | Multi mobile router mobile network multicast method |
CN101400100A (en) * | 2008-10-13 | 2009-04-01 | 北京交通大学 | Mobile multicast routing optimizing method |
WO2009039772A1 (en) * | 2007-09-21 | 2009-04-02 | Huawei Technologies Co., Ltd. | Method for creating multimedia broadcast/multicast service user plane transmit channel |
CN104540120A (en) * | 2014-12-24 | 2015-04-22 | 中国科学院计算技术研究所 | Route optimization method and system of mobile multicast supported by PMIPv6 |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6011782A (en) * | 1997-05-08 | 2000-01-04 | At&T Corp. | Method for managing multicast addresses for transmitting and receiving multimedia conferencing information on an internet protocol (IP) network |
CN1300991C (en) * | 2004-11-23 | 2007-02-14 | 北京航空航天大学 | Group transmitting address distributing method |
JPWO2012081631A1 (en) * | 2010-12-16 | 2014-05-22 | 日本電気株式会社 | Switching device, host device, network, and packet transfer method |
US8817816B2 (en) * | 2011-02-28 | 2014-08-26 | Futurwei Technologies, Inc. | Multicast support for dual stack-lite and internet protocol version six rapid deployment on internet protocol version four infrastructures |
-
2015
- 2015-06-17 CN CN201510337394.4A patent/CN106331186B/en active Active
-
2016
- 2016-05-31 WO PCT/CN2016/084044 patent/WO2016202172A1/en active Application Filing
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1881931A (en) * | 2005-06-13 | 2006-12-20 | 中兴通讯股份有限公司 | Multicast forwarding route aggregating method |
CN1801711A (en) * | 2006-01-18 | 2006-07-12 | 杭州华为三康技术有限公司 | Multicast group member identification method and apparatus |
CN101026479A (en) * | 2007-03-30 | 2007-08-29 | 北京交通大学 | Multi mobile router mobile network multicast method |
WO2009039772A1 (en) * | 2007-09-21 | 2009-04-02 | Huawei Technologies Co., Ltd. | Method for creating multimedia broadcast/multicast service user plane transmit channel |
CN101400100A (en) * | 2008-10-13 | 2009-04-01 | 北京交通大学 | Mobile multicast routing optimizing method |
CN104540120A (en) * | 2014-12-24 | 2015-04-22 | 中国科学院计算技术研究所 | Route optimization method and system of mobile multicast supported by PMIPv6 |
Non-Patent Citations (1)
Title |
---|
基于混合式IP组播的大规模;刘晓建,钟海荣等;《电子学报》;20031130(第11期);第1678-1681页 |
Also Published As
Publication number | Publication date |
---|---|
WO2016202172A1 (en) | 2016-12-22 |
CN106331186A (en) | 2017-01-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103825954B (en) | A kind of OpenFlow control methods and corresponding plug-in unit, platform and network | |
CN104798356B (en) | Method and apparatus for the utilization rate in controlled level expanding software application | |
CN106470168B (en) | data transmission method, switch using the method and network control system | |
CN104348724B (en) | A kind of data forwarding method and device for supporting multi-tenant | |
CN103929368B (en) | Load balance method and device for multiple service units | |
CN106031094A (en) | Accurate measurement of distributed counters | |
CN104468371B (en) | multicast service message processing method and device | |
CN108809847A (en) | Realize the method, apparatus and network system of load balancing | |
CN101667961B (en) | Policy-routing system based on grid service and dynamic policy-generating method | |
CN103338252A (en) | Distributed database concurrence storage virtual request mechanism | |
EP3229413B1 (en) | Cross-domain cooperative method, cooperative device and control device for network as a service business | |
CN103281211B (en) | Large-scale network node system for managing in groups and management method | |
WO2022067539A1 (en) | Network traffic processing method and apparatus, storage medium and computer device | |
CN107040605A (en) | Cloud platform scheduling of resource and management system and its application process based on SDN | |
CN106131141B (en) | A kind of distributed type assemblies load balancing parallel dispatch system and method | |
CN109257282A (en) | A kind of data transmission method and device | |
CN106488402B (en) | Ground is made an inventory rendering method and relevant device | |
CN105072050A (en) | Data transmission method and data transmission device | |
CN106681795B (en) | Virtual network mapping method for node local topology and available resource capacity | |
CN102420797A (en) | Topology mapping method and system | |
CN103581329B (en) | The construction method of peer-to-peer network flow medium live system topological structure based on sub-clustering | |
CN110311838A (en) | A kind of method and device of security service traffic statistics | |
CN104838624B (en) | The method, apparatus and system that a kind of control business data forward in virtual network | |
CN106331129A (en) | Load balancing apparatus and load balancing method thereof | |
CN106063228A (en) | Consistent hashing using exact matching with application to hardware load balancing |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |