CN105847144B - A kind of method of cooperation optimization overlay network performance - Google Patents
A kind of method of cooperation optimization overlay network performance Download PDFInfo
- Publication number
- CN105847144B CN105847144B CN201610365578.6A CN201610365578A CN105847144B CN 105847144 B CN105847144 B CN 105847144B CN 201610365578 A CN201610365578 A CN 201610365578A CN 105847144 B CN105847144 B CN 105847144B
- Authority
- CN
- China
- Prior art keywords
- alliance
- participant
- matrix
- overlay network
- equal
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Navigation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
A kind of method of cooperation optimization overlay network performance, including following operative step: (1) setting initial value to the alliance strategy matrix Q of each participant；(2) each participant updates its alliance strategy matrix Q；(3) step 2 is repeated, until the alliance strategy matrix Q of each participant reaches stable convergence, is no longer changed；(4) each participant forms alliances according to its current alliance strategy matrix Q；The participant belonged in same alliance routes according to the routing policy of the cost minimization of alliance where making；(5) all participants repeat step 1 to step 4, to realize that cooperation optimizes all participant's performances according to the uniform period of setting.Method of the invention optimizes the network routing of nerve of a covering, improves network performance and stability.
Description
Technical field
The present invention relates to a kind of methods of cooperation optimization overlay network performance, belong to technical field of the computer network, especially
It is to belong to coverage water optimisation technique field.
Background technique
Overlay network is a kind of virtual network being deployed on physical network, does not need to change network structure just on a large scale
More preferable and more reliable network service can be provided.Overlay network is by being distributed overlay node in a network and connecting their logic
Link composition, wherein overlay node is router, host or the application server in physical network, has and routes, at data
The functions such as reason and data preservation, and corresponding one or more physical link of logical links, that is, covering link.Overlay network possesses one
Cover the routing mechanism that route independently of physical network layer, can application layer according to the strategy of oneself carry out the routing of data packet with
Forwarding.In the past few years, a large amount of different types of overlay networks are by SPs (Service Providers, service provider)
It is deployed in internet, for providing different services, for example, CDN (Content Delivery Network, content distribution
Network), P2P (Peer-to-Peer, peer-to-peer network) and RON (Resilient Overlay Network, elastic nerve of a covering
Network).
Although these overlay networks improve the routing performance of conventional physical network, largely occur covering in a network
The routings such as the routing interaction between routing interaction, overlay network between cover net network and physical network mix interaction problems, this
Routing mixing interaction problems lead to unstable networks and performance loss.The reason is as follows that: on the one hand, overlay network is generally according to one
Specific performance indicator optimizes their routing, such as minimizes time delay cost, and physical network generallys use TE
(Traffic Engineering, traffic engineering) carrys out the cost of peak optimizating network, such as minimizes network congestion cost.Covering
For network according to the Target Assignment flow of themselves on logical layer, it is no longer optimal for leading to the existing TE routing policy of bottom
Strategy, then TE, which can be triggered, readjusts routing, and new routing will affect the performance of overlay network above again in turn, therefore
The inconsistent of target causes covering routing and TE to interact, and then affects the stability and optimality of overall network.It is another
Aspect, when multiple overlay networks are deployed on the same physical network simultaneously, their overlay path may be overlapped, because
For a plurality of overlay path may use simultaneously arrived same physical link, some overlay network optimize its routing when may
The performance of other overlay networks can be impacted, therefore the competition of Internet resources results in the interaction between overlay network, into
And also affect the stability and optimality of overlay network.
There are problems that largely routing the optimization of network performance under mixing interaction scenario becomes in overlay network and physical network
One, Computer Network Project field technical problem urgently to be resolved at present.
Summary of the invention
In view of this, the purpose of the present invention is inventing a kind of method, both consider each overlay network and physical network it
Between routing interaction, it is also considered that between overlay network routing interaction on the basis of, by between physical network and overlay network
Alliance's cooperation, be deployed in caused routing on same physical network to solve multiple overlay networks and mix interaction problems, most
The performance optimization of overlay network is realized eventually.
In order to achieve the above object, the invention proposes a kind of method of cooperation optimization overlay network performance, the methods
Including following operative step:
(1) initial value is set to the alliance strategy matrix T of each participant；
The participant refers to overlay network or physical network；The alliance strategy matrix T of the participant refers to
The matrix that each participant and other participant's relationships of forming alliances are constituted, the matrix are the matrixes of 1 row Z column, and Z is indicated
The number of all participants, including all overlay networks and 1 physical network；The alliance strategy matrix T's of the participant
The physical meaning of 1st row kth column element refers to the relationship of the participant and k-th of participant, if the two is formed alliances
Then the element value is 1 to relationship, and otherwise the element value is that 0, k is greater than the natural number for being less than or equal to Z equal to 1；
The form alliances physical meaning of relationship of the participant refers to and forms an alliance between participant, then together
Minimize the cost of the alliance；The cost of the alliance refers to the weighted sum of the cost of all participants in the alliance；Institute
The alliance stated refers to the set of all participants in same alliance；
(2) according to the current value of alliance's strategy matrix of other participants, each participant updates its alliance's strategy matrix
T；
(3) step 2 is repeated, until the alliance strategy matrix T of each participant reaches stable convergence, is no longer changed；
(4) each participant forms alliances according to its current alliance strategy matrix T；Belong to the participant in same alliance
It is routed according to the routing policy of the cost minimization of alliance where making；
(5) all participants repeat step (1) to step (4) according to the uniform period of setting, to realize that cooperation is excellent
Change all participant's performances.
The particular content of the step 2 be include following operation sub-step:
(201) each participant sets its C assigned cost function w (T) that coalizes, which is equal to alliance C and adopts
The cost of the participant is distributed to Charolais cattle mode, the function is specific as follows:
In above formula,
C indicates the alliance that the participant forms according to alliance strategy matrix T；S indicates any sub- alliance in alliance C,
The sub- alliance refers to a subset (including vacuous subset, if vacuous subset, then S is empty alliance) of alliance；K indicates the participation
The number of person, wherein k is greater than the natural number for being less than or equal to Z equal to 1, and the number of all overlay network participants is from 1 to Z-
1, the number of physical network participant is Z；
| C | indicate the size of alliance C；| S | indicate the size of sub- alliance S；
V (S) indicates the cost that sub- alliance S is obtained, the cost equal to sub- alliance S and alliance C other are all by remaining
It is successively executed between the sub- alliance (remaining one people of participant constitutes a Ge Zi alliance) that participant is separately formed and other alliances
The result that the objective function of oneself obtains after stable convergence；The objective function of the sub- alliance uses and the alliance
The identical function form of Definition of objective function；The objective function of the alliance C setting is equal to all participations in the alliance C
The minimum value of person's cost function weighted sum, the function are specific as follows:
In above formula,
ψk=g (Y), works as k=1, when 2 ..., Z-1；ψk=λ f (X), as k=Z；
In above formula,
λ is the weight of equal value between the time delay cost of overlay network participant and the congestion cost of physical network participant,
Indicate that 1 unit time delay cost is equivalent to λ unit congestion cost；
X indicates the flow proportional matrix of physics network participants, refers to all nerve of a covering assignment of traffic to different physics roads
The matrix that proportionality coefficient on diameter is constituted, the matrix are the matrixes of R row N column, and R indicates own in physics network participants
The item number of physical pathway, N indicate the total number of the covering link of all overlay network participants；I-th row jth of the matrix arranges member
The physical meaning of element refers to the ratio in the nerve of a covering assignment of traffic to i-th physical pathway of j-th strip covering link, and i is greater than
It is less than or equal to the natural number of R equal to 1, j is greater than the natural number for being less than or equal to N equal to 1；
Y is the assignment of traffic matrix of the overlay network participant, refers to every covering in overlay network participant
The matrix that the flow that flow point is fitted on the different overlay paths of overlay network participant is constituted, the matrix are a P row Q column
Matrix, P indicates the item number of the overlay path of overlay network participant, and Q indicates the covering stream of overlay network participant
Item number；The physical meaning of the n-th column element of m row of the matrix refers to that nth covering flow point is fitted on the stream on the m articles overlay path
Amount, m are greater than the natural number for being less than or equal to P equal to 1, and n is greater than the natural number for being less than or equal to Q equal to 1；
F (X) indicates that the congestion metric function of physics network participants, the function are equal to the congestion cost of all physical links
The sum of, the function is specific as follows:
F (X)=δTO(L)
In above formula,
δ is that length is E, and element value is all 1 vector, and E indicates the item number of all physical links in physics network participants；
O (L) indicates the congestion cost function vector of all physical links, defines O (L)=(o1(l1),…,oe(le),…,
oE(lE))T, wherein oe(le) indicating the congestion cost function of physical link e, the function is specific as follows:
ceIndicate the capacity of physical link e；
leIndicate the flow value on physical link e；
L indicates the flow value vector of all physical links, defines L=(l1,…,le,…,lE)T, the calculating of L is as follows:
L=AXH
A indicates whether the physical pathway of physics network participants passes through the identity matrix of physical link, which is an E
The matrix of row R column, E indicate that the item number of all physical links in physics network participants, R indicate institute in physics network participants
There is the item number of physical pathway；The physical meaning of the s row t column element of the matrix refers to whether the t articles physical pathway passes through s
Physical link, the element value is 1 when passing through, without when the element value be 0, wherein s is greater than equal to 1 less than or equal to E's
Natural number, t are greater than the natural number for being less than or equal to R equal to 1；
The flow proportional matrix of X expression physics network participants；
H is the matrix of a N row 1 column, and specific formula for calculation is as follows:
In above formula,
For each overlay network participant, whether B indicates the overlay path in overlay network participant by being somebody's turn to do
The identity matrix of covering link in overlay network participant, matrix B are the matrixes of W row P column, and W indicates the overlay network
The item number of the covering link of participant, P indicate the item number of the overlay path of overlay network participant；The u row v of the matrix
The physical meaning of column element refers to whether the v articles overlay path passes through the u articles covering link, and the element value is 1 when passing through, without
The out-of-date element value is 0, and wherein u is greater than the natural number for being less than or equal to W equal to 1, and v is greater than oneself for being less than or equal to P equal to 1
So number；
It indicates nonzero element all in the assignment of traffic matrix Y of overlay network participant according to the suitable of its column
Sequence successively carries out the matrix that the P row 1 that column arrangement is constituted arranges；
The number order according to all overlay network participants is indicated, all overlay network participants'According to
The secondary matrix for carrying out the N row 1 that column arrangement is constituted and arranging；
G (Y) is the time delay target function of overlay network participant, which is equal to all of the overlay network participant
The sum of time delay cost of covering link, the function are specific as follows:
G (Y)=(AX Ω)TD(L)
In above formula,
A indicates whether the physical pathway of physics network participants passes through the identity matrix of physical link；
The flow proportional matrix of X expression physics network participants；
Ω is the matrix of a N row 1 column, and specific formula for calculation is as follows:
In above formula,
It indicates nonzero element all in the assignment of traffic matrix Y of the overlay network participant according to its column
Sequence successively carry out the matrix that the P row 1 that column arrangement constituted arranges；
The number order according to all overlay network participants is indicated, by the overlay network participant'sExpand
Transform into the matrix arranged with matrix H N row 1 of the same size, and by the element in the matrix in addition to the nerve of a covering corresponding position
All it is set to zero；
D (L) indicates the time delay cost function vector of all physical links, defines D (L)=(d1(l1),…,de(le),…,
dE(lE))T, wherein de(le) indicating the time delay cost function of physical link e, the function is specific as follows:
de(le(the c of)=1/e-le)+p
The function is equal to the sum of queuing delay and propagation delay, ceIndicate the capacity of physical link e, 1/ (ce-le) indicate M/
M/1 queuing delay, constant p indicate propagation delay；
(202) participant carries out optimization processing to the assigned cost function w (T), that is, calculate so that by
Allocated costs function w (T) obtains alliance strategy matrix T when minimum value；
In the step (201), other of the sub- alliance S and alliance C all are separately formed by remaining participant
Sub- alliance and other alliances between successively execute oneself objective function process between the alliance successively execute from
The process of oneself objective function is identical；
In the step (201), the calculation method of the alliance target function sets is genetic algorithm；
The beneficial effects of the present invention are: method of the invention has comprehensively considered the road between overlay network and physical network
By interact and overlay network between routing interaction etc. routings mixing interaction various situations, pass through physical network and nerve of a covering
Alliance's cooperation between network realizes and optimizes to the network routing of nerve of a covering, improves network performance and stability.
Detailed description of the invention
Fig. 1 is a kind of flow chart of the method for cooperation optimization overlay network performance proposed by the present invention.
Fig. 2 is the network diagram of the embodiment of the present invention.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, the present invention is made with reference to the accompanying drawing further
Detailed description.
Referring to Fig. 1, the method for introducing a kind of cooperation optimization overlay network performance proposed by the present invention, the method includes under
Column operating procedure:
(1) initial value is set to the alliance strategy matrix T of each participant；
The participant refers to overlay network or physical network；The alliance strategy matrix T of the participant refers to
The matrix that each participant and other participant's relationships of forming alliances are constituted, the matrix are the matrixes of 1 row Z column, and Z is indicated
The number of all participants, including all overlay networks and 1 physical network；The alliance strategy matrix T's of the participant
The physical meaning of 1st row kth column element refers to the relationship of the participant and k-th of participant, if the two is formed alliances
Then the element value is 1 to relationship, and otherwise the element value is that 0, k is greater than the natural number for being less than or equal to Z equal to 1；
Referring to fig. 2, what Fig. 2 was provided is the network of a physical network and three overlay networks signal in the embodiment of the present invention
Figure.
Because the number of all participants is 4, the alliance strategy matrix T of 1 participant of overlay network is the matrix of 1 row 4 column,
T=[t11 t12 t13 t14], wherein t11Indicate the alliance of overlay network 1 participant and oneself, t12Indicate overlay network 1
The alliance of participant and 2 participant of overlay network, t13Indicate the connection of 1 participant of overlay network and 3 participant of overlay network
Alliance's relationship, t14Indicate the alliance of 1 participant of overlay network and 4 participant of overlay network, and t11=1, indicate participant
Alliance with oneself is 1.Here, T=[t is given11 t12 t13 t14] initial value is set as T=[1 10 0], indicate covering
1 participant of network forms alliances with 2 participant of overlay network, does not form with 3 participant of overlay network and physical network participant
Alliance；
The alliance strategy matrix T of 2 participant of overlay network is the matrix of 1 row 4 column, T=[t21 t22 t23 t24], wherein
t21Indicate the alliance of 2 participant of overlay network and 1 participant of overlay network, t22Indicate 2 participant of overlay network and oneself
Alliance, t23Indicate the alliance of 2 participant of overlay network and 3 participant of overlay network, t24Indicate overlay network 2
The alliance of participant and 4 participant of overlay network, and t22=1, indicate that 2 participant of overlay network and the alliance of oneself are closed
System is 1.Because alliance's strategy matrix of the participant in same alliance is identical, according to the alliance of 1 participant of overlay network
Strategy matrix initial value T=[1 10 0], alliance's strategy matrix of 2 participant of overlay network are also [1 10 0] T=, table
Show that 2 participant of overlay network forms alliances with 1 participant of overlay network, with 3 participant of overlay network and physical network participant
It does not form alliances；
The alliance strategy matrix T of 3 participant of overlay network is the matrix of 1 row 4 column, T=[t31 t32 t33 t34], wherein
t31Indicate the alliance of 3 participant of overlay network and 1 participant of overlay network, t32Indicate 3 participant of overlay network and covering
The alliance of 2 participant of network, t33Indicate the alliance of overlay network 3 participant and oneself, t34Indicate overlay network 3
The alliance of participant and 4 participant of overlay network, and t33=1, indicate that 3 participant of overlay network and the alliance of oneself are closed
System is 1.According to the initial value of 2 participant alliance strategy matrix of 1 participant of overlay network and overlay network, overlay network 1 is participated in
Person, 2 participant of overlay network and 3 participant of overlay network do not form alliances, then have t31=0, t32=0.Therefore, T=[t is given31
t32 t33 t34] setting initial value T=[0 01 1], indicate 3 participant of overlay network and 1 participant of overlay network, nerve of a covering
2 participant of network does not form alliances, and participant forms alliances with physical network；
The alliance strategy matrix T of 4 participant of overlay network is the matrix of 1 row 4 column, T=[t41 t42 t43 t44], wherein
t41Indicate the alliance of 4 participant of overlay network and 1 participant of overlay network, t42Indicate 4 participant of overlay network and covering
The alliance of 2 participant of network, t43Indicate the alliance of 4 participant of overlay network and 3 participant of overlay network, t44Table
Show the alliance of overlay network 4 participant and oneself, and t44=1, indicate that 4 participant of overlay network and the alliance of oneself are closed
System is 1.According to alliance's strategy matrix of 3 participant of 1 participant of overlay network, 2 participant of overlay network and overlay network, object
The alliance's strategy matrix for managing network participants is T=[0 01 1], indicate physics network participants and 1 participant of overlay network,
2 participant of overlay network does not form alliances, and 3 participant forms alliances with overlay network；
The form alliances physical meaning of relationship of the participant refers to and forms an alliance between participant, then together
Minimize the cost of the alliance；The cost of the alliance refers to the weighted sum of the cost of all participants in the alliance；Institute
The alliance stated refers to the set of all participants in same alliance；
(2) according to the current value of alliance's strategy matrix of other participants, each participant updates its alliance's strategy matrix
T；
(3) step 2 is repeated, until the alliance strategy matrix T of each participant reaches stable convergence, is no longer changed；
(4) each participant forms alliances according to its current alliance strategy matrix T；Belong to the participant in same alliance
It is routed according to the routing policy of the cost minimization of alliance where making；
(5) all participants repeat step (1) to step (4) according to the uniform period of setting, to realize that cooperation is excellent
Change all participant's performances.
The particular content of the step 2 be include following operation sub-step:
(201) each participant sets its C assigned cost function w (T) that coalizes, which is equal to alliance C and adopts
The cost of the participant is distributed to Charolais cattle mode, the function is specific as follows:
According to alliance's strategy matrix initial value of all participants set in step 1,1 participant of overlay network and covering
2 participant of network forms alliances, and 3 participant of overlay network and physical network participant form alliances, then existing alliance can be with
{ 1,2 } are expressed as, { 3,4 }；
The alliance strategy matrix T=[1 10 0] of 1 participant of overlay network, then 1 participant of overlay network belongs to alliance
{ 1,2 }, according to the formula of w (T),
Wherein,For empty alliance, the cost of empty allianceResult equal to 0, v ({ 1 }) is the sub- alliance of alliance { 1,2 }
{ 1 }, the objective function that oneself is successively executed between the sub- alliance { 2 } of alliance { 1,2 }, alliance { 3,4 } obtains after stable convergence
As a result, the result of v ({ 2,1 }) successively executes the objective function of oneself until steady between alliance { 2,1 }, alliance { 3,4 }
It is being obtained after fixed convergence as a result, the result of v ({ 2 }) is the sub- alliance { 2 } of alliance { 1,2 }, the sub- alliance { 1 } of alliance { 1,2 }, connection
The result that the objective function of oneself obtains after stable convergence is successively executed between alliance { 3,4 }；
The alliance strategy matrix T=[1 10 0] of 2 participant of overlay network, then 2 participant of overlay network belongs to alliance
{ 1,2 }, according to the formula of w (T),
Wherein,For empty alliance, the cost of empty allianceResult equal to 0, v ({ 2 }) is the sub- alliance of alliance { 1,2 }
{ 2 }, the objective function that oneself is successively executed between the sub- alliance { 1 } of alliance { 1,2 }, alliance { 3,4 } obtains after stable convergence
As a result, the result of v ({ 1,2 }) successively executes the objective function of oneself until steady between alliance { 1,2 }, alliance { 3,4 }
It is being obtained after fixed convergence as a result, the result of v ({ 1 }) is the sub- alliance { 1 } of alliance { 1,2 }, the sub- alliance { 2 } of alliance { 1,2 }, connection
The result that the objective function of oneself obtains after stable convergence is successively executed between alliance { 3,4 }；
The alliance strategy matrix T=[0 01 1] of 3 participant of overlay network, then 3 participant of overlay network belongs to alliance
{ 3,4 }, according to the formula of w (T),
Wherein,For empty alliance, the cost of empty allianceResult equal to 0, v ({ 3 }) is the sub- alliance of alliance { 3,4 }
{ 3 }, the objective function that oneself is successively executed between the sub- alliance { 4 } of alliance { 3,4 }, alliance { 1,2 } obtains after stable convergence
As a result, the result of v ({ 4,3 }) successively executes the objective function of oneself until steady between alliance { 4,3 }, alliance { 1,2 }
It is being obtained after fixed convergence as a result, the result of v ({ 4 }) is the sub- alliance { 4 } of alliance { 3,4 }, the sub- alliance { 3 } of alliance { 3,4 }, connection
The result that the objective function of oneself obtains after stable convergence is successively executed between alliance { 1,2 }；
The alliance strategy matrix T=[0 01 1] of 4 participant of overlay network, then 4 participant of overlay network belongs to alliance
{ 3,4 }, according to the formula of w (T),
Wherein,For empty alliance, the cost of empty allianceResult equal to 0, v ({ 4 }) is the sub- alliance of alliance { 3,4 }
{ 4 }, the objective function that oneself is successively executed between the sub- alliance { 3 } of alliance { 3,4 }, alliance { 1,2 } obtains after stable convergence
As a result, the result of v ({ 3,4 }) successively executes the objective function of oneself until steady between alliance { 3,4 }, alliance { 1,2 }
It is being obtained after fixed convergence as a result, the result of v ({ 3 }) is the sub- alliance { 3 } of alliance { 3,4 }, the sub- alliance { 4 } of alliance { 3,4 }, connection
The result that the objective function of oneself obtains after stable convergence is successively executed between alliance { 1,2 }；
In above formula,
C indicates the alliance that the participant forms according to alliance strategy matrix T；S indicates any sub- alliance in alliance C,
The sub- alliance refers to a subset (including vacuous subset, if vacuous subset, then S is empty alliance) of alliance；K indicates the participation
The number of person, wherein k is greater than the natural number for being less than or equal to Z equal to 1, and the number of all overlay network participants is from 1 to Z-
1, the number of physical network participant is Z；
| C | indicate the size of alliance C；| S | indicate the size of sub- alliance S；
V (S) indicates the cost that sub- alliance S is obtained, the cost equal to sub- alliance S and alliance C other are all by remaining
It is successively executed between the sub- alliance (remaining one people of participant constitutes a Ge Zi alliance) that participant is separately formed and other alliances
The result that the objective function of oneself obtains after stable convergence；The objective function of the sub- alliance uses and the alliance
The identical function form of Definition of objective function；The objective function of the alliance C setting is equal to all participations in the alliance C
The minimum value of person's cost function weighted sum, the function are specific as follows:
According to alliance's strategy matrix initial value of all participants set in step 1, for alliance { 1,2 }, then it
Objective function h ({ 1,2 }) be
H ({ 1,2 })=min g (Y1)+g (Y2)
Wherein Y1, Y2 are respectively the assignment of traffic matrix of 2 participant of 1 participant of overlay network and overlay network；
For alliance { 3,4 }, then its objective function h ({ 3,4 }) is
H ({ 3,4 })=min g (Y3)+λ f (X)
Wherein Y3 is the assignment of traffic matrix of 3 participant of overlay network, and X is the flow proportional square of physical network participant
Battle array, the value of λ are set as 1 in emulation experiment；
In above formula,
ψk=g (Y), works as k=1, when 2 ..., Z-1；ψk=λ f (X), as k=Z；
In above formula,
λ is the weight of equal value between the time delay cost of overlay network participant and the congestion cost of physical network participant,
Indicate that 1 unit time delay cost is equivalent to λ unit congestion cost；
X indicates the flow proportional matrix of physics network participants, refers to all nerve of a covering assignment of traffic to different physics roads
The matrix that proportionality coefficient on diameter is constituted, the matrix are the matrixes of R row N column, and R indicates own in physics network participants
The item number of physical pathway, N indicate the total number of the covering link of all overlay network participants；I-th row jth of the matrix arranges member
The physical meaning of element refers to the ratio in the nerve of a covering assignment of traffic to i-th physical pathway of j-th strip covering link, and i is greater than
It is less than or equal to the natural number of R equal to 1, j is greater than the natural number for being less than or equal to N equal to 1；
Referring to fig. 2, what Fig. 2 was provided is the network of a physical network and three overlay networks signal in the embodiment of the present invention
Figure.
Overlay network 1 has 5 overlay node G1,E1,F1,H1,I1With 12 covering links: G1-E1,E1-I1,G1-F1,F1-
I1,G1-H1,H1-I1,E1-G1,I1-E1,F1-G1,I1-F1,H1-G1,I1-H1；Have in overlay network 1 one from overlay node G1It arrives
I1Demand be 1Mbps covering stream, by G1-E1-I1, G1-F1-I1And G1-H1-I1Three overlay path transmission；
Overlay network 2 has 4 overlay node A2,C2,F2,D2With 8 covering links: A2-C2,C2-D2,A2-F2,F2- D2,
C2-A2,D2-C2, F2-A2, D2-F2；Have in overlay network 2 one from overlay node A2To D2Demand be 2Mbps covering stream,
By A2-C2-D2And A2-F2-D2Two overlay path transmission；
There are 3 overlay node A in overlay network 33, G3, E3With 6 covering links: A3-E3, A3-G3, G3-E3, E3- A3,
G3-A3, E3-G3；Have in overlay network 3 one from overlay node A3To E3Demand be 3Mbps covering stream, by A3-E3With
A3-G3-E3Three overlay path transmission；
Physical network has 16 links: A-B, B-C, C-D, A-E, C-E, E-D, A-G, A-F, E-I, D-I, G-E, G-F,
F-D, F-I, G-H and H-I, in order respectively marked as 1 to 16.
Table 1
What table 1 provided is the physics road of all covering links mapping in overlay network 1, overlay network 2 and overlay network 3
Diameter collection table.In the present embodiment, because of covering link E in overlay network 11-G1, I1-E1,F1-G1,I1-F1,H1- G1,I1-
H1, covering link C in overlay network 22-A2,D2-C2,F2-A2,D2-F2With the covering link E in overlay network 33-A3,G3-
A3,E3-G3On be not covered with flow, and the physical pathway collection that they are mapped is combined into empty (i.e. there is no path is reachable), so table 1
In just do not list they map physical pathway set.
In physical network, the flow in every covering link will bring a physical streams, the physics to physical network
The source of stream, destination node are the corresponding physical nodes of covering link both ends overlay node, and the demand of the physical streams is equal to this
Covering flow in covering link.For example, if covering link G1-E1On have the flow of 1/3Mbps, it gives physical network band
The physical streams that a demand from physical node G to E is 1/3Mbps are carried out.
In the embodiment shown in Figure 2, because of the total item of the covering link of overlay network 1, overlay network 2 and overlay network 3
Number is 26, and the corresponding physical pathway total number of 26 covering links is 19 (19 in table 1), then the flow of physical network
Scaling matrices X is 19 row, 26 column matrix.
Only having in 13 covering links in embodiment has covering flow: G1-E1,E1-I1,G1-F1,F1-I1,G1-H1,H1-
I1,A2-C2,C2-D2,A2-F2,F2-D2,A3-E3,A3-G3,G3-E3, therefore, we in order respectively marked as 1 to 13, other
Covering link sequentially label 14 to 26.Again because this 13 covering links have mapped 19 physical pathways: G-E, E-D-I, E-I,
G-F、F-D-I、F-I、G-H、H-I、A-B-C、C-D、C-E-D、A-F、A-G-F、F-D、A-B-C-E、 A-E、A-G-E、A-G、G-
E, therefore we are also in order respectively marked as 1 to 19.
Therefore, the flow proportional matrix X of physical network can be expressed as
Wherein xijIndicate the ratio in the nerve of a covering assignment of traffic to i-th physical pathway of j-th strip covering link, x11=
1,x22+x32=1, x43=1, x54+x64=1, x75=1, x86=1, x97=1, x10,8+x11,8=1, x12,9+x13,9=1, x14,10
=1, x15,11+x16,11+x17,11=1, x18,12=1, x19,13=1, indicate that physics flow point is fitted on the flow in all physical pathways
The sum of ratio is equal to 1.Because of G1To E1、G1To F1、G1To H1、H1To I1、A2To C2、F2To D2、A3To G3、G3To E3Corresponding stream
Only 1, so x11, x43, x75, x86, x97, x14,10, x18,12, x19,13Value be 1.Therefore, the initial value of X can be set are as follows:
Y is the assignment of traffic matrix of the overlay network participant, refers to every covering in overlay network participant
The matrix that the flow that flow point is fitted on the different overlay paths of overlay network participant is constituted, the matrix are a P row Q column
Matrix, P indicates the item number of the overlay path of overlay network participant, and Q indicates the covering stream of overlay network participant
Item number；The physical meaning of the n-th column element of m row of the matrix refers to that nth covering flow point is fitted on the stream on the m articles overlay path
Amount, m are greater than the natural number for being less than or equal to P equal to 1, and n is greater than the natural number for being less than or equal to Q equal to 1；
Referring to fig. 2, have in overlay network 1 one from overlay node G1To I1Demand be 1Mbps covering stream, by three
The transmission of overlay path, then the assignment of traffic matrix Y of overlay network 1 is the matrix of 3 rows 1 column,Wherein y11It indicates
The covering flow point is fitted on overlay path G1-E1-I1On covering flow, y21Indicate that the covering flow point is fitted on overlay path G1- F1-
I1On flow, y31Indicate that the covering flow point is fitted on overlay path G1-H1-I1On flow, and y11+y21+ y31=1, it indicates
The sum of the covering flow that the covering flow point is fitted on three overlay paths is equal to the 1Mbps demand of the covering stream.Here, it givesSet initial value as
Have in overlay network 2 one from overlay node A2To D2Demand be 2Mbps covering stream, by two covering roads
Diameter transmission, then the assignment of traffic matrix Y of overlay network 2 is the matrix of 2 rows 1 column,Wherein y11Indicate the covering flow point
It is fitted on overlay path A2-C2-D2On covering flow, y21Indicate that the covering flow point is fitted on overlay path A2-F2-D2On flow,
And y11+y21=2, indicate that the sum of the covering flow that the covering flow point is fitted on two overlay paths is equal to the covering stream
2Mbps demand.Here, it givesSet initial value as
Have in overlay network 3 one from overlay node A3To E3Demand be 3Mbps covering stream, by two covering roads
Diameter transmission, then the assignment of traffic matrix Y of overlay network 3 is the matrix of 2 rows 1 column,Wherein y11Indicate the covering flow point
It is fitted on overlay path A3-E3On covering flow, y21Indicate that the covering flow point is fitted on overlay path A3-G3-E3On flow, and
And y11+y21=3, indicate that the sum of the covering flow that the covering flow point is fitted on two overlay paths is equal to the covering stream
3Mbps demand.Here, it givesSet initial value as
F (X) indicates that the congestion metric function of physics network participants, the function are equal to the congestion cost of all physical links
The sum of, the function is specific as follows:
F (X)=δTO(L)
In above formula,
δ is that length is E, and element value is all 1 vector, and E indicates the item number of all physical links in physics network participants；
Referring to Fig. 2, physical network has 16 physical links, and all δ are the matrix of 16 rows 1 column, then δ are as follows:
δ=[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]T
O (L) indicates the congestion cost function vector of all physical links, defines O (L)=(o1(l1),…,oe(le),…,
oE(lE))T, wherein oe(le) indicating the congestion cost function of physical link e, the function is specific as follows:
ceIndicate the capacity of physical link e；
leIndicate the flow value on physical link e；
L indicates the flow value vector of all physical links, defines L=(l1,…,le,…,lE)T, the calculating of L is as follows:
L=AXH
A indicates whether the physical pathway of physics network participants passes through the identity matrix of physical link, which is an E
The matrix of row R column, E indicate that the item number of all physical links in physics network participants, R indicate institute in physics network participants
There is the item number of physical pathway；The physical meaning of the s row t column element of the matrix refers to whether the t articles physical pathway passes through s
Physical link, the element value is 1 when passing through, without when the element value be 0, wherein s is greater than equal to 1 less than or equal to E's
Natural number, t are greater than the natural number for being less than or equal to R equal to 1；
Referring to Fig. 2, there are 16 physical links and 19 physical pathways in physical network, then A is the matrix of 16 rows 19 column, then
A is
The flow proportional matrix of X expression physics network participants；
H is the matrix of a N row 1 column, and specific formula for calculation is as follows:
In above formula,
For each overlay network participant, whether B indicates the overlay path in overlay network participant by being somebody's turn to do
The identity matrix of covering link in overlay network participant, matrix B are the matrixes of W row P column, and W indicates the overlay network
The item number of the covering link of participant, P indicate the item number of the overlay path of overlay network participant；The u row v of the matrix
The physical meaning of column element refers to whether the v articles overlay path passes through the u articles covering link, and the element value is 1 when passing through, without
The out-of-date element value is 0, and wherein u is greater than the natural number for being less than or equal to W equal to 1, and v is greater than oneself for being less than or equal to P equal to 1
So number；
It indicates nonzero element all in the assignment of traffic matrix Y of overlay network participant according to the suitable of its column
Sequence successively carries out the matrix that the P row 1 that column arrangement is constituted arranges；
The number order according to all overlay network participants is indicated, all overlay network participants'According to
The secondary matrix for carrying out the N row 1 that column arrangement is constituted and arranging；
Referring to fig. 2, there are 12 covering links and three overlay paths in overlay network 1, then the identity matrix of overlay network 1
B is the matrix of 12 rows 3 column, then B is
Because the initial value of overlay network 1 isSo according toDefinition,ThenFor
There are 8 covering links and 2 overlay paths in overlay network 2, then the identity matrix B of overlay network 2 is 8 rows 2 column
Matrix, then B be
Because the initial value of overlay network 2 isSo according toDefinition,Then
There are 6 covering links and 2 overlay paths in overlay network 3, then the identity matrix B of overlay network 3 is 6 rows 2 column
Matrix, then B be
Because the initial value of overlay network 3 isSo according toDefinition,Then
According to the formula of H, H is the matrix of 26 rows 1 column, then H is
Here, the label sequence of all covering links must keep one with the label sequence of covering links all in X in H
It causes.
G (Y) is the time delay target function of overlay network participant, which is equal to all of the overlay network participant
The sum of time delay cost of covering link, the function are specific as follows:
G (Y)=(AX Ω)TD(L)
In above formula,
A indicates whether the physical pathway of physics network participants passes through the identity matrix of physical link；
The flow proportional matrix of X expression physics network participants；
Ω is the matrix of a N row 1 column, and specific formula for calculation is as follows:
In above formula,
It indicates nonzero element all in the assignment of traffic matrix Y of the overlay network participant according to its column
Sequence successively carry out the matrix that the P row 1 that column arrangement constituted arranges；
The number order according to all overlay network participants is indicated, by the overlay network participant's
It is extended to the matrix arranged with matrix H N row 1 of the same size, and by the member in the matrix in addition to the nerve of a covering corresponding position
It is plain to be all set to zero；
Overlay network 1According to's
Definition, Ω are the matrix of 26 rows 1 column, then Ω are as follows:
Overlay network 2According toDefinition, Ω 26
The matrix that row 1 arranges, then Ω are as follows:
Ω=[0 000001111000000000000000 0]T
Overlay network 3According toDefinition, Ω be 26 rows 1 column
Matrix, then Ω are as follows:
D (L) indicates the time delay cost function vector of all physical links, defines D (L)=(d1(l1),…,de(le),…,
dE(lE))T, wherein de(le) indicating the time delay cost function of physical link e, the function is specific as follows:
de(le(the c of)=1/e-le)+p
The function is equal to the sum of queuing delay and propagation delay, ceIndicate the capacity of physical link e, 1/ (ce-le) indicate M/
M/1 queuing delay, constant p indicate propagation delay (value of p generally between two end node of physical link at a distance from it is directly proportional, imitative
In true experiment, we are uniformly set as 1 second)；
(202) participant carries out optimization processing to the assigned cost function w (T), that is, calculate so that by
Allocated costs function w (T) obtains alliance strategy matrix T when minimum value；
In the step (201), other of the sub- alliance S and alliance C all are separately formed by remaining participant
Sub- alliance and other alliances between successively execute oneself objective function process between the alliance successively execute from
The process of oneself objective function is identical；
In the step (201), the calculation method of the alliance target function sets is genetic algorithm；
In genetic algorithm, the chromosome of overlay network participant is expressed as Y, and the chromosome of physical network participant indicates
For X, the number of chromosome is 50, and tolerable error is set as 0.001, and crossover probability is set as 0.8, and mutation probability is set as 0.5.It is losing
The propagation algorithm initial stage initializes 50 feasible chromosomes, then successively using evaluation, selection, the operation of intersection and variation
Successively objective function h (C) acquirement minimum value of the iteration until alliance.
1 participant of overlay network, 2 participant of overlay network, 3 participant of overlay network, physical network participant finally tie
Result at the stable state of alliance is as follows:
The alliance strategy matrix T=[1 11 0] of 1 participant of overlay network；
The alliance strategy matrix T=[1 11 0] of 2 participant of overlay network；
The alliance strategy matrix T=[1 11 0] of 3 participant of overlay network；
The alliance strategy matrix T=[0 00 1] of physical network participant；
Inventor has carried out a large amount of emulation experiments to method of the invention, and the interaction of simulation results show mixed logic dynamic leads to net
The oscillation of network performance, after method of the invention, system has converged to a stable shape after the interaction of multiple mixed logic dynamic
State obtains the optimal performance of physical network and overlay network.
Claims (4)
1. a kind of method of cooperation optimization overlay network performance, it is characterised in that: the method includes following operative steps:
(1) initial value is set to the alliance strategy matrix T of each participant；
The participant refers to overlay network or physical network；The alliance strategy matrix T of the participant refers to each
The matrix that participant and other participant's relationships of forming alliances are constituted, the matrix are the matrixes of 1 row Z column, and Z indicates all
The number of participant, including all overlay networks and 1 physical network；The 1st row of the alliance strategy matrix T of the participant
The physical meaning of kth column element refers to the relationship of the participant and k-th of participant, if the two is formed alliances, relationship is then
The element value is 1, and otherwise the element value is that 0, k is greater than the natural number for being less than or equal to Z equal to 1；
The form alliances physical meaning of relationship of the participant refers to and forms an alliance between participant, then minimum together
Change the cost of the alliance；The cost of the alliance refers to the weighted sum of the cost of all participants in the alliance；Described
Alliance refers to the set of all participants in same alliance；
(2) according to the current value of alliance's strategy matrix of other participants, each participant updates its alliance strategy matrix T；
(3) step 2 is repeated, until the alliance strategy matrix T of each participant reaches stable convergence, is no longer changed；
(4) each participant forms alliances according to its current alliance strategy matrix T；Belong to participant in same alliance according to
The routing policy of the cost minimization of alliance is routed where making；
(5) all participants repeat step (1) to step (4) according to the uniform period of setting, cooperate optimization institute to realize
There is participant's performance.
2. a kind of method of cooperation optimization overlay network performance according to claim 1, it is characterised in that: the step 2
Particular content be include following operation sub-step:
(201) each participant sets its C assigned cost function w (T) that coalizes, which is equal to alliance C and uses the summer
Puli's value mode distributes to the cost of the participant, and the function is specific as follows:
In above formula,
C indicates the alliance that the participant forms according to alliance strategy matrix T；S indicates any sub- alliance in alliance C, described
Sub- alliance refers to a subset of alliance；K indicates the number of the participant, and wherein k is greater than oneself for being less than or equal to Z equal to 1
So number, the number of all overlay network participants is from 1 to Z-1, and the number of physical network participant is Z；
| C | indicate the size of alliance C；| S | indicate the size of sub- alliance S；
V (S) indicates the cost that sub- alliance S is obtained, the cost be equal to sub- alliance S and alliance C other are all by remaining participation
The knot that the objective function of oneself obtains after stable convergence is successively executed between the sub- alliance and other alliances that person is separately formed
Fruit；The objective function of the sub- alliance uses function form of Definition identical with the objective function of the alliance；Described
The objective function of alliance C setting is equal to the minimum value of all participant's cost function weighted sums in the alliance C, and the function is specific
It is as follows:
In above formula,
ψk=g (Y), works as k=1, when 2 ..., Z-1；ψk=λ f (X), as k=Z；
In above formula,
λ is the weight of equal value between the time delay cost of overlay network participant and the congestion cost of physical network participant, indicates 1
Unit time delay cost is equivalent to λ unit congestion cost；
X indicates the flow proportional matrix of physics network participants, refers in all nerve of a covering assignment of traffic to different physical pathways
The matrix that is constituted of proportionality coefficient, which is the matrix of R row N column, and R indicates all physics in physics network participants
The item number in path, N indicate the total number of the covering link of all overlay network participants；I-th row jth column element of the matrix
Physical meaning refers to the ratio in the nerve of a covering assignment of traffic to i-th physical pathway of j-th strip covering link, and i is greater than equal to 1
Natural number less than or equal to R, j are greater than the natural number for being less than or equal to N equal to 1；
Y is the assignment of traffic matrix of the overlay network participant, refers to every covering flow point in overlay network participant
The matrix that the flow being fitted on the different overlay paths of overlay network participant is constituted, the matrix are the squares of P row Q column
Battle array, P indicate that the item number of the overlay path of overlay network participant, Q indicate the item number of the covering stream of overlay network participant；
The physical meaning of the n-th column element of m row of the matrix refers to that nth covering flow point is fitted on the flow on the m articles overlay path, m
It is greater than and is equal to 1 natural number for being less than or equal to P, n is greater than the natural number for being less than or equal to Q equal to 1；
F (X) indicate physics network participants congestion metric function, the function be equal to all physical links congestion cost it
With the function is specific as follows:
F (X)=δTO(L)
In above formula,
δ is that length is E, and element value is all 1 vector, and E indicates the item number of all physical links in physics network participants；
O (L) indicates the congestion cost function vector of all physical links, defines O (L)=(o1(l1) ..., oe(le) ..., oE
(lE))T, wherein oe(le) indicating the congestion cost function of physical link e, the function is specific as follows:
ceIndicate the capacity of physical link e；
leIndicate the flow value on physical link e；
L indicates the flow value vector of all physical links, defines L=(l1..., le..., lE)T, the calculating of L is as follows:
L=AXH
A indicates whether the physical pathway of physics network participants passes through the identity matrix of physical link, which is an E row R
The matrix of column, E indicate that the item number of all physical links in physics network participants, R indicate property in physics network participants
The item number of line of reasoning diameter；The physical meaning of the s row t column element of the matrix refers to whether the t articles physical pathway passes through the s articles object
Manage link, when passing through the element value be 1, without when the element value be 0, wherein s be greater than equal to 1 be less than or equal to E nature
Number, t are greater than the natural number for being less than or equal to R equal to 1；
The flow proportional matrix of X expression physics network participants；
H is the matrix of a N row 1 column, and specific formula for calculation is as follows:
In above formula,
For each overlay network participant, B indicates whether the overlay path in overlay network participant passes through the covering
The identity matrix of covering link in network participants, matrix B are the matrixes of W row P column, and W indicates that the overlay network participates in
The item number of the covering link of person, P indicate the item number of the overlay path of overlay network participant；The u row v of the matrix arranges member
Element physical meaning refer to whether the v articles overlay path passes through the u articles covering link, when passing through the element value be 1, without when
The element value is 0, and wherein u is greater than the natural number for being less than or equal to W equal to 1, and v is greater than the natural number for being less than or equal to P equal to 1；
Indicate nonzero element all in the assignment of traffic matrix Y of overlay network participant according to its column sequence according to
The secondary matrix for carrying out the P row 1 that column arrangement is constituted and arranging；
The number order according to all overlay network participants is indicated, all overlay network participants'Successively into
Ranks arrange the matrix that constituted N row 1 arranges；
G (Y) is the time delay target function of overlay network participant, which is equal to all coverings of the overlay network participant
The sum of time delay cost of link, the function are specific as follows:
G (Y)=(AX Ω)TD(L)
In above formula,
A indicates whether the physical pathway of physics network participants passes through the identity matrix of physical link；
The flow proportional matrix of X expression physics network participants；
Ω is the matrix of a N row 1 column, and specific formula for calculation is as follows:
In above formula,
It indicates nonzero element all in the assignment of traffic matrix Y of the overlay network participant according to the suitable of its column
Sequence successively carries out the matrix that the P row 1 that column arrangement is constituted arranges；
The number order according to all overlay network participants is indicated, by the overlay network participant'sIt is extended to
The matrix arranged with matrix H N row 1 of the same size, and the element in the matrix in addition to the nerve of a covering corresponding position is whole
It is set to zero；
D (L) indicates the time delay cost function vector of all physical links, defines D (L)=(d1(l1) ..., de(le) ..., dE
(lE))T, wherein de(le) indicating the time delay cost function of physical link e, the function is specific as follows:
de(le(the c of)=1/e-le)+p
The function is equal to the sum of queuing delay and propagation delay, ceIndicate the capacity of physical link e, 1/ (ce-le) indicate M/M/1
Queuing delay, constant p indicate propagation delay；
(202) participant carries out optimization processing to the assigned cost function w (T), that is, calculates so that being assigned
Cost function w (T) obtain minimum value when alliance strategy matrix T.
3. a kind of method of cooperation optimization overlay network performance according to claim 2, it is characterised in that: the step
(201) in, other all sub- alliances being separately formed by remaining participant and other connection of the sub- alliance S and alliance C
The mistake of objective function of the process of the objective function of oneself with successively executing oneself between the alliance is successively executed between alliance
Cheng Xiangtong.
4. a kind of method of cooperation optimization overlay network performance according to claim 2, it is characterised in that: the step
(201) in, the calculation method of the alliance target function sets is genetic algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610365578.6A CN105847144B (en) | 2016-05-27 | 2016-05-27 | A kind of method of cooperation optimization overlay network performance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610365578.6A CN105847144B (en) | 2016-05-27 | 2016-05-27 | A kind of method of cooperation optimization overlay network performance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105847144A CN105847144A (en) | 2016-08-10 |
| CN105847144B true CN105847144B (en) | 2019-01-29 |
Family
ID=56594956
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610365578.6A Active CN105847144B (en) | 2016-05-27 | 2016-05-27 | A kind of method of cooperation optimization overlay network performance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105847144B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103578280A (en) * | 2013-10-12 | 2014-02-12 | 西安理工大学 | Traffic flow monitoring system based on Internet of Things and vehicle monitoring method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060206586A1 (en) * | 2005-03-09 | 2006-09-14 | Yibei Ling | Method, apparatus and system for a location-based uniform resource locator |
-
2016
- 2016-05-27 CN CN201610365578.6A patent/CN105847144B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103578280A (en) * | 2013-10-12 | 2014-02-12 | 西安理工大学 | Traffic flow monitoring system based on Internet of Things and vehicle monitoring method |
Non-Patent Citations (2)
| Title |
|---|
| A coalitional game approach on improving interactions in multiple overlay environments;廖建新 等;《Computer Networks》;20150720;全文 |
| 基于环覆盖网络的端系统组播方法;袁平鹏等;《计算机工程》;20090820(第16期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105847144A (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107248956B (en) | A kind of method for routing and device of information centre's network | |
| CN108401015A (en) | A kind of data center network method for routing based on deeply study | |
| CN101478802B (en) | Self-organizing QoS routing method based on ant colony algorithm | |
| CN105469143B (en) | Network-on-chip method for mapping resource based on neural network dynamic feature | |
| Sun et al. | Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA | |
| CN101478803B (en) | Self-organizing QoS routing method based on ant colony algorithm | |
| CN109962774A (en) | Quantum cryptography networks key relays dynamic routing method | |
| CN108833285A (en) | Network moving target defence method, electronic equipment, storage medium and system | |
| Zhao et al. | An improved ant colony optimization for communication network routing problem | |
| CN105847144B (en) | A kind of method of cooperation optimization overlay network performance | |
| CN106059947B (en) | A kind of method of dynamic optimization overlay network performance | |
| Randaccio et al. | Group multicast routing problem: A genetic algorithms based approach | |
| Rikhtegar et al. | BiTE: a dynamic bi-level traffic engineering model for load balancing and energy efficiency in data center networks | |
| Mokhtarian et al. | Minimum-delay overlay multicast | |
| Alqahtani et al. | Ernie: scalable load-balanced multicast source routing for cloud data centers | |
| NK et al. | Routing in dynamic network using ants and genetic algorithm | |
| CN103619047B (en) | A kind of chance method for routing in many concurrently stream wireless mesh networks | |
| Wu et al. | Optimization algorithms for proxy server placement in content distribution networks | |
| CN101741749A (en) | Method for optimizing multi-object multicast routing based on immune clone | |
| Sabri | Performance analysis for network coding using ant colony routing | |
| Van Mieghem | Robustness of large networks | |
| Wählisch et al. | Broadcasting in prefix space: P2p data dissemination with predictable performance | |
| Tang et al. | Content replication scheme using stable matching in vehicular networks | |
| Arun et al. | A survey on network path identification using bio inspired algorithms | |
| Karpov et al. | Enhancing Application Layer Multicast Using Multi-objective Optimization Techniques |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |