CN104902516B - Flow configuration method and system - Google Patents
Flow configuration method and system Download PDFInfo
- Publication number
- CN104902516B CN104902516B CN201510290844.9A CN201510290844A CN104902516B CN 104902516 B CN104902516 B CN 104902516B CN 201510290844 A CN201510290844 A CN 201510290844A CN 104902516 B CN104902516 B CN 104902516B
- Authority
- CN
- China
- Prior art keywords
- flow
- network
- layer network
- terminal device
- matrix
- 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
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
- H04L47/785—Distributed allocation of resources, e.g. bandwidth brokers among multiple network domains, e.g. multilateral agreements
- H04L47/786—Mapping reservation between domains
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/801—Real time traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of flow configuration method and system, above-mentioned flow configuration method includes the following steps：Two heterogeneous networks are set in a shared bottom-layer network, and obtain the connection relation of heterogeneous network terminal device corresponding with shared bottom-layer network；The mapping relations for sharing bottom-layer network are determined according to the connection relation；The flow demand of each terminal device is determined according to the mapping relations；The flow shared bottom-layer network and flow to each terminal device is configured according to the flow demand.Flow configuration method and system provided by the invention, by the way that two heterogeneous networks are arranged in a shared bottom-layer network, obtain the connection relation of heterogeneous network terminal device corresponding with shared bottom-layer network, and then determine the mapping relations of shared bottom-layer network and the flow demand of each terminal device, the flow for sharing bottom-layer network is configured according to the flow demand, the handling capacity that corresponding network data channel can be improved ensures its real-time reliability of service.
Description
Technical field
The present invention relates to Internet technical fields, more particularly to a kind of flow configuration method and system.
Background technology
With the fast development of power telecom network, network bearer diversification, data diversification, information magnanimity are
The new challenge that the network architecture is brought.The essence of data analysis is disclosed using the correlation and causality between mass data
Problem as a result, to disclose the activity of data behind and the effect of management work or benefit, finally provide number for administrative decision
According to support.The big data scale of construction is not only that data capacity is big greatly, it is often more important that data class is various, in numerous Various types of data
Between, correlation and causality are the bases that big data is excavated, and are that high value letter is excavated from the data of loose information density
The key of breath amount.Such huge data processing and analysis pressure are faced, existing various data processing shelfs expose difference
The problem of degree, in this regard, the proposition of network virtualization is to change a kind of Major Technology of the rigid problem of existing network framework.
The essence of network virtualization is to be operating independently multiple void on a public physical network by abstract, distribution, isolation mech isolation test
Quasi- network maximizes physical network resource utilization rate, improves service so as to selectively carry out resource allocation and scheduling
Quality reduces network operation and maintenance cost.The key technology of wherein network virtualization is virtual network mapping problems, that is, is studied
How by dummy node and virtual link be mapped to suitable bottom physical node and chain road.
The appearance of wireless Mesh netword (WMN) causes the extensive concern of people.It facilitates the characteristic of deployment and use
Advantage of the wireless multi-hop connection to expand the coverage area makes wireless Mesh netword obtain being widely recognized as industry.In addition, electric
It is also a kind of emerging communication mode that the line of force, which communicates (PLC), it does not need additional infrastructure construction so that it is in a variety of nets
There is some superiority in the competition of network.However, due to bit error rate and packet loss caused by network interferences and link attenuation, wirelessly
The link of Mesh network (WMN) and power line communication (PLC), which belongs to, damages link.If only with traditional network design side
Method can only just provide the service done one's best, wherein the above-mentioned service done one's best refers to a kind of Internet service mould of standard
Formula does not take user or application, horse back packet discard, until portfolio is reduced into account when congestion occurs for network interface
Until；It is just difficult to ensure the reliability of real time service in this way.
Invention content
Based on this, it is necessary to which the technical issues of being difficult to ensure real time service reliability for the prior art provides a kind of stream
Measure configuration method and system.
A kind of flow configuration method, includes the following steps：
Two heterogeneous networks are set in a shared bottom-layer network, and obtain the heterogeneous network and shared bottom-layer network pair
The connection relation for the terminal device answered；
The mapping relations for sharing bottom-layer network are determined according to the connection relation；Wherein, the mapping relations include shared
Each node of bottom-layer network terminal corresponding with the mapping relations of corresponding terminal device and the shared bottom-layer network
The mapping relations of connecting link between equipment；
The flow demand of each terminal device is determined according to the mapping relations；Wherein, the flow demand is that each terminal is set
It is standby to carry out communicating required flow；
The flow shared bottom-layer network and flow to each terminal device is configured according to the flow demand.
A kind of flow configuration system, including：
Setup module, for two heterogeneous networks to be arranged in a shared bottom-layer network, and obtain the heterogeneous network with
The connection relation of the corresponding terminal device of shared bottom-layer network；
First determining module, for determining the mapping relations for sharing bottom-layer network according to the connection relation；Wherein, described
Mapping relations include each node and the mapping relations of corresponding terminal device and the shared underlying network of shared bottom-layer network
The mapping relations of connecting link between the corresponding terminal device of network；
Second determining module, the flow demand for determining each terminal device according to the mapping relations；Wherein, the stream
Amount demand is that each terminal device carries out communicating required flow；
Configuration module, for configuring the flow shared bottom-layer network and flow to each terminal device according to the flow demand.
Above-mentioned flow configuration method and system obtain institute by the way that two heterogeneous networks are arranged in a shared bottom-layer network
The connection relation of heterogeneous network terminal device corresponding with shared bottom-layer network is stated, and then determines that the mapping of shared bottom-layer network is closed
The flow demand of system and each terminal device configures the flow for sharing bottom-layer network according to the flow demand, can be with
The handling capacity for improving corresponding network data channel, ensures its real-time reliability of service.
Description of the drawings
Fig. 1 is the flow configuration method flow chart of one embodiment；
Fig. 2 is the connection relationship diagram of the heterogeneous network and shared bottom-layer network of one embodiment；
Fig. 3 is that the flow of one embodiment configures system structure diagram；
Fig. 4 is the maximum throughput simulation analysis schematic diagram of the shared bottom-layer network of one embodiment；
Fig. 5 is the maximum throughput simulation analysis schematic diagram of the shared bottom-layer network of one embodiment.
Specific implementation mode
The specific implementation mode of flow configuration method and system how provided by the invention is retouched in detail below in conjunction with the accompanying drawings
It states.
With reference to figure 1, Fig. 1 show the flow configuration method flow chart of one embodiment, includes the following steps：
S10 is arranged two heterogeneous networks in a shared bottom-layer network, and obtains the heterogeneous network and shared underlying network
The connection relation of the corresponding terminal device of network；
In above-mentioned steps S10, intelligence is overcome by allowing multiple heterogeneous networks to coexist in a shared bottom-layer network (SN)
It can the shortcomings that being difficult to merge of power telecom network.The connection relation of above-mentioned heterogeneous network and shared bottom-layer network can be such as Fig. 2 institutes
Show, as shown in Fig. 2, above-mentioned two heterogeneous network 501 and 505 may each comprise multiple virtual nets；Shared network bottom layer 508 is arranged
Multiple nodes, the virtual network in two heterogeneous networks 501 and 505 are corresponding with each node in shared network bottom layer 508 respectively
Connection.
S20 determines the mapping relations for sharing bottom-layer network according to the connection relation；Wherein, the mapping relations include
Each node and the mapping relations of corresponding terminal device and the shared bottom-layer network of shared bottom-layer network are corresponding
The mapping relations of connecting link between terminal device；
In above-mentioned steps S20, the mapping relations of above-mentioned shared bottom-layer network may include that the node of shared network bottom layer reflects
Penetrate relationship, and corresponding link maps relationship.
S30 determines the flow demand of each terminal device according to the mapping relations；Wherein, the flow demand is each end
End equipment carries out communicating required flow；
In one embodiment, above-mentioned steps S30 may include：
Object function and constraints are constructed according to the mapping relations；Wherein, the object function isThe meaning of above-mentioned object function is that shared bottom-layer network flows to the throughput-maximized of each terminal device,
Wherein, n is the number of nodes of shared bottom-layer network, and bf (i) asks for optimum flow.The constraints is：
Pcr(i)≥Rcr(i),Pop(i)≥Rop(i), bf (i) >=rs (i), i=1,2 ..., n-1,
According to the studies above content, following problem model can be obtained：Wireless Mesh netword and PLC network can be abstracted
At undirected authorized graph, it is expressed as GW=(N, LW) and GP=(N, LP).The two networks set of node N having the same, wherein
| N |=n.Set N (is denoted as n comprising a CC0) and (n-1) TD (be denoted as ni, wherein i=1,2 ..., n).In addition to CC, each TD
Node all has there are three VN requests, i.e. control service request, operation service request and optimum flow is asked.Control service request
By cr (i)=(Lcr(i),Rcr(i)) it indicates, wherein Lcr(i) it is main control message length, Rcr(i) it is reliability requirement.cr
(i) it is P to be mapped to the actual transmissions after the SN of isomery into probabilitycr(i).N × (n-1) matrix [scr(i,j)]n×(n-1)For remembering
The radio sub-carrier distribution manner of record control service.Service request is operated by op (i)=(Lop(i),Rop(i)) it indicates, wherein
Lop(i) and Rop(i) it is respectively primary operational message-length and reliability requirement.The actual transmissions probability of success of op (i) is Pop
(i).N × (n-1) matrix [sop(i,j)]n×(n-1)For recording radio sub-carrier distribution manner.Optimum flow is asked by bf
(i)=(rs (i)) it indicates, wherein rs (i) is that the practical of optimum flow is satisfied with part, i.e. actual flow.Similarly, n × (n-1) square
Battle array [sop(i,j)]n×(n-1)For recording radio sub-carrier distribution manner.
Wherein, n is the number of nodes of shared bottom-layer network, and bf (i) asks for optimum flow, Pcr(i) it is the control of i-th of node
Message processed transmits successful probability, R on PLCcr(i) it is the reliability requirement of the control service request of i-th of node, Pop(i)
For the actual transmissions probability of success of the operation service request of i-th of node, Rop(i) it is the operation service request of i-th of node
Reliability requirement, rs (i) are that the practical of optimum flow is satisfied with part, scr(i, j) is the wireless electron carrier wave of record control service
The n of the method for salary distribution × (n-1) matrix, sop(i, j) is n × (n-1) of the radio sub-carrier distribution manner of record operation service
Matrix, sbf(i, j) is n × (n-1) matrix for the radio sub-carrier distribution manner for recording optimum flow request.
The fitness function for sharing bottom-layer network is constructed according to the object function and constraints using genetic algorithm；Its
In, the fitness function isWherein, n is the node of shared bottom-layer network
Number, α and β are constraint factor, PcrMessage transmits successful probability, R on PLC in order to controlcrFor reliability requirement index, Pop
Successful probability, R are transmitted on PLC for operation informationopTo operate service request coefficient, rs is that the practical of optimum flow is satisfied with portion
Point, scrFor n × (n-1) matrix of the radio sub-carrier distribution manner of record control service, sopFor the nothing of record operation service
The n of the line electrical carrier method of salary distribution × (n-1) matrix, sbfFor the radio sub-carrier distribution manner of record optimum flow request
N × (n-1) matrix, S are n × (n-1) matrix for all radio sub-carrier distribution manners for recording three kinds of requests.
The flow demand of each terminal device is determined according to the fitness function.
In the present embodiment, above-mentioned flow demand is determined using genetic algorithm, it is necessary first to according to shared bottom-layer network
Each parameter setting genetic groups number be P, iterations G, crossover probability Pc, mutation probability Pv, carrying out corresponding mesh
The construction of scalar functions, constraints solves object function according to above-mentioned constraints, further constructs corresponding fitness letter
Number carries out the determination of the flow demand of the corresponding each terminal device of shared bottom-layer network, can accurately determine the following big data
Flow demand under environment, and complete relevant configuration.
In one embodiment, above-mentioned two heterogeneous network can be respectively PLC network and WMN networks
As one embodiment, above-mentioned steps S30 may include：
Determined according to the mapping relations control message for sharing bottom-layer network and operation information respectively in PLC network and
The probability of success transmitted on WMN networks；
Reliable sexual intercourse is constructed according to the probability of success；Wherein, the reliable sexual intercourse is each heterogeneous network to each end
Relationship between the probability of success and setting value of the transmission of end equipment flow；
The residual plot of bottom-layer network is shared according to the reliable sexual intercourse structure；
The residual plot is traversed according to the node of shared bottom-layer network, and each end is determined according to the result traversed
The flow demand of end equipment.
As one embodiment, the node that above-mentioned basis shares bottom-layer network traverses the residual plot, and according to
The result traversed determines that the step of flow demand of each terminal device may include：
From top to bottom according to residual plot described in each node traverses for sharing bottom-layer network, uplink is obtained；
The flow of downlink is determined according to the flow of the uplink, wherein the downlink is by from bottom to up
Residual plot obtains described in each node traverses according to shared bottom-layer network；
The flow demand of each terminal device is determined according to the flow of the uplink and downlink.
S40 configures the flow shared bottom-layer network and flow to each terminal device according to the flow demand.
Flow configuration method provided in this embodiment is obtained by the way that two heterogeneous networks are arranged in a shared bottom-layer network
The connection relation of heterogeneous network terminal device corresponding with shared bottom-layer network is taken, and then determines reflecting for shared bottom-layer network
Relationship and the flow demand of each terminal device are penetrated, the flow for sharing bottom-layer network is configured according to the flow demand,
The handling capacity that corresponding network data channel can be improved ensures its real-time reliability of service.
In one embodiment, above-mentioned flow configuration method can also include：
The traffic throughput of the shared bottom-layer network is determined according to the flow demand of each terminal device.
The present embodiment determines the traffic throughput of the shared bottom-layer network according to the flow demand of each terminal device, can be with
The handling capacity for effectively improving entire shared bottom-layer network, ensures the reliability of network of relation real time service.
With reference to figure 3, Fig. 3 show the flow configuration system structure diagram of one embodiment, including：
Setup module 10 for two heterogeneous networks to be arranged in a shared bottom-layer network, and obtains the heterogeneous network
The connection relation of terminal device corresponding with shared bottom-layer network；
First determining module 20, for determining the mapping relations for sharing bottom-layer network according to the connection relation；Wherein, institute
State each node and the mapping relations of corresponding terminal device and the shared bottom that mapping relations include shared bottom-layer network
The mapping relations of connecting link between the corresponding terminal device of network；
Second determining module 30, the flow demand for determining each terminal device according to the mapping relations；Wherein, described
Flow demand is that each terminal device carries out communicating required flow；
In one embodiment, above-mentioned second determining module can be further used for：
Object function and constraints are constructed according to the mapping relations；Wherein, the object function isThe meaning of above-mentioned object function is that shared bottom-layer network flows to the throughput-maximized of each terminal device,
Wherein, n is the number of nodes of shared bottom-layer network, and bf (i) asks for optimum flow.The constraints is Pcr(i)≥Rcr(i),
Pop(i)≥Rop(i), bf (i) >=rs (i), i=1,2 ..., n-1,
Wherein, n is the node of shared bottom-layer network
Number, bf (i) ask for optimum flow, Pcr(i) successful probability, R are transmitted on PLC for the control message of i-th of nodecr(i)
For the reliability requirement of the control service request of i-th of node, Pop(i) it is the practical biography of the operation service request of i-th of node
The defeated probability of success, Rop(i) it is the reliability requirement of the operation service request of i-th of node, rs (i) is that the reality of optimum flow is full
Meaning part, scr(i, j) is n × (n-1) matrix of the radio sub-carrier distribution manner of record control service, sop(i, j) is note
N × (n-1) matrix of the radio sub-carrier distribution manner of record operation service, sbf(i, j) is the nothing for recording optimum flow request
The n of the line electrical carrier method of salary distribution × (n-1) matrix.It is constructed altogether according to the object function and constraints using genetic algorithm
Enjoy the fitness function of bottom-layer network；Wherein, the fitness function isIts
In, n is the number of nodes of shared bottom-layer network, and α and β are constraint factor, PcrMessage is transmitted successfully general on PLC in order to control
Rate, RcrFor reliability requirement index, PopSuccessful probability, R are transmitted on PLC for operation informationopFor operation service request system
Number, rs are that the practical of optimum flow is satisfied with part, scrFor n × (n- of the radio sub-carrier distribution manner of record control service
1) matrix, sopFor n × (n-1) matrix of the radio sub-carrier distribution manner of record operation service, sbfTo record optimum flow
The n of the radio sub-carrier distribution manner of request × (n-1) matrix, S are all wireless electron carrier waves point for recording three kinds of requests
N with mode × (n-1) matrix.
The flow demand of each terminal device is determined according to the fitness function.
In one embodiment, above-mentioned two heterogeneous network can be respectively PLC network and WMN networks
As one embodiment, above-mentioned second determining module can be further used for：
Determined according to the mapping relations control message for sharing bottom-layer network and operation information respectively in PLC network and
The probability of success transmitted on WMN networks；
Reliable sexual intercourse is constructed according to the probability of success；Wherein, the reliable sexual intercourse is each heterogeneous network to each end
Relationship between the probability of success and setting value of the transmission of end equipment flow；
The residual plot of bottom-layer network is shared according to the reliable sexual intercourse structure；
The residual plot is traversed according to the node of shared bottom-layer network, and each end is determined according to the result traversed
The flow demand of end equipment.
Configuration module 40, for configuring the flow shared bottom-layer network and flow to each terminal device according to the flow demand.
In one embodiment, NV (Networking Virtualization, network virtualization), which is one kind, has foreground good
Good technology, it overcomes intelligent electric power communication network by allowing multiple heterogeneous networks to coexist in a shared bottom-layer network (SN)
The shortcomings that being difficult to merge.These heterogeneous networks are referred to as VNs, it provides customized end-to-end service.VNs is only from SN
It is vertical out, to provide greater flexibility, configurability and managerial.Each substrate node can support multiple virtual sections
Point, and each VNs independent operatings are not interfere with each other.As shown in Fig. 2, different topological structures two isomery VNs (VN1 and
VN2 it) coexists in a SN, they operate and provide different data processing services respectively.
Since intelligent electric power communication network requires various application services (including service that is real-time and doing one's best), the design of NV
Thought is very suitable for intelligent grid communication.That is, different application programs on the communications infrastructure on different VNs
Operation.By resource distribution appropriate, these VNs can independently independent operating.How a significant challenge of NV is
Processing is mapped to physical node and link, i.e., the VNE problems of efficient mapping method from dummy node and virtual linkage.Then it is exactly
When dummy node and virtual linkage are mapped to substrate node and path in SN, then VNE mappings are completed.The two stages or with
It is independent, or in a coordinated fashion, realize node and link mapping.Network virtualization technology can share bottom-layer network resource, herein
On the basis of establish multiple mutually isolated virtual networks.Each virtual network is by the virtual link group between dummy node and node
At.Support using underlay network device to network virtualization, virtual network can be in the premises not had an impact to bottom-layer network
Under, carry out the research and development of new network architecture and the relevant technologies.In network virtualization environment, Internet Service Provider ISP
(Internet Service Provider) is separated into infrastructure provider (Infrastructure Provider, InP)
With service provider (Service Provider, SP), makes the improvement of network technology and innovate no longer between by Incumbent
The limitation of communication and become more flexible.The physical network of InP managed operation bottoms, SP is according in the virtual network requests of user
The physical network resource of InP is rented in the constraint of node and link, this process maps for virtual network, has proven to one
NP-Hard problems.
In intelligent electric power communication network, WMN and PLC network are established in the same time on SN.Due to two networks
The transmission medium of PHY is different, they may have different topological structures and different transmission characteristics.VNs can be embedded at this time
Into two isomery SNs based on a variety of demands.This characteristic make the VNE in intelligent electric power communication network as a uniqueness and
Challenging research topic.It is to determine due to the node being mapped in intelligent electric power communication network, as communication service end
End is only determined according to specified power equipment.However, in the environment of intelligent distribution network, can be used for (i.e. there are two SNs
WMN networks and PLC network) link mapping.
In virtual network mapping problems, bottom physical network can turn to a non-directed graph in the form ofWherein, NsAnd LsBottom layer node set and bottom link set are indicated respectively, and LsIn link group
At path be denoted as Ps；Bottom layer node attribute set is indicated, such as the cpu resource or physical location of node；Indicate bottom chain
Road attribute set, as the bandwidth resources or lag characteristic virtual network requests forms of link turn to a non-directed graphWherein, NvAnd LvDummy node set and virtual link set are indicated respectively,Indicate dummy node
Constraint set,Indicate virtual link constraint set.
It, can virtual networks mapping as follows in order to more accurately describe virtual network mapping problems：
Define 1：If bottom physical network is Gs, virtual network Gv, then claim from GvTo GsThe mapping M of subset:Gv→(N',
P',RN,RL) it is that a virtual network maps, wherein RNAnd RLIndicate that distributing to virtual network asks respectively
The node resource set and link circuit resource set asked.The definition mapped from virtual network can see, virtual network mapping problems
Two sub-problems, i.e. dummy node mapping problems and virtual link mapping problems can be decomposed into.
Define 2：Bottom physical network is Gs, virtual network Gv, then claim from GvTo GsThe mapping of subsetIt is mapped for a virtual network node.
Define 3：Bottom physical network is Gs, virtual network Gv, then claim from GvTo GsThe mapping of subsetIt is mapped for a virtual network node.
First, then the key parameter that the present invention will be analyzed first in PLC network and WMN networks provides PLC network and WMN
The bottom mapping model of network, and then establish problem model.In PLC network and WMN networks, need transmission ask control and
Operation information, therefore the probability of success for being respectively transmitted different information of two kinds of networks of lower surface analysis, and then constrained objective function.
The Successful transmissions probability problem that the Packet Error Ratio of analysis PLC network first is brought.Packet Error Ratio θPIt indicates, terminal to base
The hop count of node is indicated with h.When the control of request and operation service flow load be not very heavy when, that is, be in exempt from competition when
Section (CFP), what resource can be always assigned.Therefore, the probability of success that control message is transmitted on PLC (is denoted as PCR) be：
PCR=(1- θP)h (1)
The collision probability p that given i-th jumps, continuously transmits probability Cp(i)C can be passed throughp(i)=1-p is calculated.Based on this
It is a little theoretical, the probability of success P of the operation information transmission on PLCOPIt is：
Wherein, εpIt is the bit error rate of PLC links, h indicates terminal to the hop count of base node, Cp(i)Expression continuously transmits probability.
Then the subcarrier assignment problem of wireless Mesh netword is analyzed.Compared to PLC network, WMN provides higher band
Wide and bit rate.Therefore, in the design of the present invention, WMN must support the VNs of management and data field rather than control and operation
The VNs in area.In order to ensure that the quality of real time service, different VNs should keep independent, should not interfere with each other.One of NV is basic
Principle is, when multiple VN coexist in the wireless Mesh netword of same physical layer, the activity of a VN should be unable to influence any
Other VNs, vice versa.It is different from the mapping of traditional virtual network, do not need physical node reflecting to dummy node
It penetrates, and the mapping of physical link to virtual link is converted into the allocation schedule virtualization of physical layer carrier wave, i.e., one control CC
(contrl center, control centre) and several TD (terminal device, terminal device) form virtual network, TD it
Between there are fixed subcarrier carry out control and operation information transmission.
According to the studies above content, following problem model can be obtained：Wireless Mesh netword and PLC network can be abstracted
At undirected authorized graph, it is expressed as GW=(N, LW) and GP=(N, LP).The two networks set of node N having the same, wherein
| N |=n.Set N (is denoted as n comprising a CC0) and (n-1) TD (be denoted as ni, wherein i=1,2 ..., n).In addition to CC, each TD
Node all has there are three VN requests, i.e. control service request, operation service request and optimum flow is asked.Control service request
By cr (i)=(Lcr(i),Rcr(i)) it indicates, wherein Lcr(i) it is main control message length, Rcr(i) it is reliability requirement.cr
(i) it is P to be mapped to the actual transmissions after the SN of isomery into probabilitycr(i).N × (n-1) matrix [scr(i,j)]n×(n-1)For remembering
The radio sub-carrier distribution manner of record control service.Service request is operated by op (i)=(Lop(i),Rop(i)) it indicates, wherein
Lop(i) and Rop(i) it is respectively primary operational message-length and reliability requirement.The actual transmissions probability of success of op (i) is Pop
(i).N × (n-1) matrix [sop(i,j)]n×(n-1)For recording radio sub-carrier distribution manner.Optimum flow is asked by bf
(i)=(rs (i)) it indicates, wherein rs (i) is that the practical of optimum flow is satisfied with part, i.e. actual flow.Similarly, n × (n-1) square
Battle array [sop(i,j)]n×(n-1)For recording radio sub-carrier distribution manner.
In order to meet real time service reliability requirement and under conditions of being constrained without prejudice to sub-carrier frequencies maximize business
Object function can be set as by total throughout：
Meet following constraints：
Pcr(i)≥Rcr(i),Pop(i)≥Rop(i), bf (i) >=rs (i), i=1,2 ..., n-1,
The meaning of above-mentioned object function is that shared bottom-layer network flows to the throughput-maximized of each terminal device, wherein n is
The number of nodes of shared bottom-layer network, bf (i) ask for optimum flow.
N is the number of nodes of shared bottom-layer network, and bf (i) asks for optimum flow, Pcr(i) disappear for the control of i-th of node
Breath transmits successful probability, R on PLCcr(i) it is the reliability requirement of the control service request of i-th of node, Pop(i) it is the
The actual transmissions probability of success of the operation service request of i node, Rop(i) it is the reliable of the operation service request of i-th of node
Property require, rs (i) be the practical of optimum flow be satisfied with part, scr(i, j) is the wireless electron carrier wave distribution of record control service
The n of mode × (n-1) matrix, sop(i, j) is n × (n-1) matrix of the radio sub-carrier distribution manner of record operation service,
sbf(i, j) is n × (n-1) matrix for the radio sub-carrier distribution manner for recording optimum flow request.
Due to object function and the diversification of parameter adjustment, it can prove that it is a nondeterministic polynomial to find optimal solution
Problem.And genetic algorithm in founding mathematical models without the concern for the inwardness of problem, for any form of target letter
Number and constraint, either linear is still nonlinear, and discrete being also continuous can be handled.Genetic algorithm is directly to structure
Object is operated, and the restriction of derivation and function continuity is not present；With inherent Implicit Parallelism and better global optimizing
Ability；Using the optimization method of randomization, the search space of optimization can be obtained and be instructed automatically, searcher is adaptively adjusted
To the rule that need not be determined.Therefore, the application is solved the above problems using genetic algorithm, and key step is as follows：
The initialization procedure of genetic algorithm is carried out first：Setting genetic groups number is P, iterations G, crossover probability
For Pc, mutation probability Pv.The application uses binary coding mode, wireless Mesh netword and PLC network to contain N number of node,
Since CC (contrl center, control centre) node is served only for controlling and dispatches, it is not involved in chromosome coding.Therefore, only right
N-1 TD (terminal device, terminal device) node is encoded.Set individual chromosome to gene=[cr1,
cr2,...,crn-1；op1,op2,...,opn-1；bf1,bf2,...,bfn-1], each chromosome is equivalent to the ginseng of current TD nodes
Number setting.During searching for optimal solution, control service request, operation service request and optimum flow can be asked simultaneously
It optimizes.After initialization and coding, each individual in population is assessed, the solution for possessing optimal adaptation degree is made
It is also globally optimal solution simultaneously for initial population for local individual optimal solution.Determine a fitness function appropriate,
To evaluate the quality of each chromosome so that population multiplies to better direction.
The object function of (3) and corresponding constraints in conjunction with shown in formula, the reliability of three kinds of information on services is by transmitting
The probability of success influences, in addition, the assignment problem of wireless electron carrier wave is also considered, it is thus determined that fitness function is as follows：
Wherein, n is the number of nodes of shared bottom-layer network, and α and β are constraint factor, PcrMessage is transmitted on PLC in order to control
Successful probability, RcrFor reliability requirement index, PopSuccessful probability, R are transmitted on PLC for operation informationopIt is serviced for operation
It is that the practical of optimum flow is satisfied with part, s to ask coefficient, rscrFor the n of the radio sub-carrier distribution manner of record control service
× (n-1) matrixes, sopFor n × (n-1) matrix of the radio sub-carrier distribution manner of record operation service, sbfTo record most
The n of the radio sub-carrier distribution manner of good traffic requests × (n-1) matrix, S are all wireless electrons for recording three kinds of requests
The n of the carrier wave method of salary distribution × (n-1) matrix.
According to the fitness of calculating as a result, the high optimization individual of fitness is genetic directly to the next generation or is handed over by matching
Fork generates new individual and is genetic to the next generation again.Genetic operator is divided into selection, intersection, three aspect of variation.Each operation is first by selecting
Select operation and pick out two chromosomes, then judge whether to intersect by crossover probability, finally according to mutation probability to intersection after
Result be adjusted.Using by selecting, intersection, the result after variation as new population, repeat aforesaid operations until reaching
Iterations G, the highest result of fitness function in all records are required optimal solution.Due to the characteristic of genetic algorithm,
It is very easy to use genetic algorithm in parallel computation and cluster environment.A kind of method be directly each node as one simultaneously
Capable population is treated.Then organism moves to another node according to different propagation methods from a node.Another kind side
Method is " farmer/labourer " architecture, and it is " farmer " node to specify a node, i.e., the CC nodes in the application are responsible for
It selecting organism and assigns the value of fitness, other node is used as " labourer " node, i.e., above-mentioned TD nodes are responsible for reconfiguring,
The assessment of variation and fitness function, and then corresponding flow transmission is distributed under big data environment.
Based on the strategy of virtual network mapping algorithm, heuritic approach of the invention uses three-step-march strategy：First, it calculates
The probability of success of real time service in PLC network；Then, the subcarrier distribution of the real time service of wireless mesh network is carried out；Finally,
Maximize optimal service handling capacity.In the following, the realization process of each step is discussed in detail：
First, transmission medium one of of the PLC network as real time service.In PLC network, control services in CFP,
And services is operated in CAP.According to formula (1) and (2), the success that can calculate the real-time service transmission in PLC network is general
Rate (uses PPLCIt indicates).
In addition, another transmission medium of the wireless Mesh netword as real time service, to improve diversity gain and reliability.
PWMNFor the probability of success of real-time service transmission in wireless Mesh netword, RREQFor the reliability requirement of real time business.Due to real-time
Business is transmitted on two SN, diversity gain make the real time business reliability be equal at least about on a SN transmission at
The probability of work(.It can obtain：
According to the real-time service transmission probability of success is obtained in PLC network, in wireless Mesh netword, the lower bound of reliability can
To be expressed as：
Finally, in order to enable business throughput maximizes, the residual error G of wireless Mesh netword*=(N, E*) it is used for optimum flow
Calculating.
In order to enable network throughput maximizes, and reduces the computation complexity of intelligent optimization algorithm, the application proposes one
Kind heuritic approach, and prove being resolved in polynomial time for the algorithm.The algorithm core concept includes two
Stage.First stage is to limit link ability from top to bottom in layered structure.Second stage is as much as possible from bottom
Flow is pushed to top layer.First stage can enter the smaller uplink of capacity to avoid excessive flow.It is computed, the algorithm
Computation complexity be O (| E* | | N |).It the following is the flow chart of the heuritic approach.
In one embodiment, utilize genetic algorithm according to the object function and constraints structure to provided by the present application
The fitness function of shared bottom-layer network, and then the method for determining each terminal device flow demand are made, and according to shared bottom
The node traverses residual plot of network be determined each terminal device flow demand method carry out simulation analysis, result such as Fig. 4,
Shown in Fig. 5, in figures 4 and 5, abscissa indicates that data aggregate demand, unit are Mbps (megabyte per second), and ordinate indicates altogether
Enjoy the maximum throughput of bottom-layer network, unit Mbps.
In the present embodiment, simulating scenes setting is as follows：It includes a CC (contrl center, in control to generate one
The heart) and 10 TD (terminal device, terminal device) set of node.TD node serial numbers are 1 to 10.Each node is equipped with
There are two wireless device, each radio has 128 subcarriers.Since uplink service stream and downstream service flow are symmetrical, for just
In analysis, the present invention only considers uplink optimum flow.
Fig. 4 and Fig. 5 shows influence of the PLC network to maximum throughput.Minimum curve, which corresponds to, only has wireless mesh
Network is come the case where supporting all VNs, do not use PLC network.In this case, wireless Mesh netword will be to take in real time
Business distributes more subcarriers, to ensure its reliability requirement.Therefore, the remaining subcarrier for distributing to optimum flow scheduling
It is less, lead to lower handling capacity.Another extreme situation is, sufficiently high in the reliability of PLC, all real-time to meet
Whole subcarriers of the demand of service, Wireless Mesh network are used equally for optimum flow to dispatch.In this case, ideal maximum
Handling capacity be line azury, it indicate maximum throughput the upper limit.In addition, changing the PER of PLC from 0.1 to 0.001
(εp), obtain a series of emulating images.Lower εpMean that PLC can provide higher transmission reliability, thus it is more in WMN
Subcarrier can be used for the scheduling of optimum flow.Therefore the PER of maximum throughput and PLC that optimum flow can be obtained is negatively correlated.
According to Fig. 4 and Fig. 5 it can be found that maximum throughput (the utilization heredity i.e. provided by the present application that genetic algorithm obtains
Algorithm shares the fitness function of bottom-layer network according to the object function and constraints construction, and then determines each terminal device
The method of flow demand) being always better than heuritic approach, (the node traverses residual plot that i.e. above-mentioned basis shares bottom-layer network carries out
The method for determining each terminal device flow demand), this is because genetic algorithm always searches for the optimal solution within the scope of greatest iteration,
Compared to heuritic approach, higher time complexity and resource are needed.The a small amount of handling capacity reduction of heuritic approach sacrifice is brought
The significant decrease of time complexity, therefore heuritic approach is more practical.
The flow configuration system and the flow configuration method of the present invention of the present invention corresponds, in above-mentioned flow configuration method
Embodiment illustrate technical characteristic and advantage be suitable for flow configuration system embodiment, hereby give notice that.
Each technical characteristic of embodiment described above can be combined arbitrarily, to keep description succinct, not to above-mentioned reality
It applies all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, it is all considered to be the range of this specification record.
Several embodiments of the invention above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the protection of the present invention
Range.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (7)
1. a kind of flow configuration method, which is characterized in that include the following steps：
Two heterogeneous networks are set in a shared bottom-layer network, and it is corresponding with shared bottom-layer network to obtain the heterogeneous network
The connection relation of terminal device；
The mapping relations for sharing bottom-layer network are determined according to the connection relation；Wherein, the mapping relations include shared bottom
Each node of network terminal device corresponding with the mapping relations of corresponding terminal device and the shared bottom-layer network
Between connecting link mapping relations；
The flow demand of each terminal device is determined according to the mapping relations；Wherein, the flow demand be each terminal device into
Row communicates required flow；
The flow shared bottom-layer network and flow to each terminal device is configured according to the flow demand；
The step of flow demand that each terminal device is determined according to the mapping relations includes：
Object function and constraints are constructed according to the mapping relations；Wherein, the object function is
The constraints is Pcr(i)≥Rcr(i),Pop(i)≥Rop(i), bf (i) >=rs (i), i=1,2 ..., n-1,Wherein, n is the number of nodes of shared bottom-layer network, bf (i)
It is asked for optimum flow；Pcr(i) successful probability, R are transmitted on PLC for the control message of i-th of nodecr(i) it is i-th
The reliability requirement of the control service request of node, Pop(i) general for the actual transmissions success of the operation service request of i-th of node
Rate, Rop(i) it is the reliability requirement of the operation service request of i-th of node, rs (i) is that the practical of optimum flow is satisfied with part,
scr(i, j) is n × (n-1) matrix of the radio sub-carrier distribution manner of record control service, sop(i, j) is that record operates
The n of the radio sub-carrier distribution manner of service × (n-1) matrix, sbf(i, j) is the wireless electron for recording optimum flow request
The n of the carrier wave method of salary distribution × (n-1) matrix, S (i) be record three kinds request all radio sub-carrier distribution manners n ×
(n-1) matrix.
2. flow configuration method according to claim 1, which is characterized in that described to determine each end according to the mapping relations
The step of flow demand of end equipment further includes：
The fitness function for sharing bottom-layer network is constructed according to the object function and constraints using genetic algorithm；Wherein,
The fitness function isWherein, n is the number of nodes of shared bottom-layer network, α
It is constraint factor, P with βcrMessage transmits successful probability, R on PLC in order to controlcrFor reliability requirement index, PopFor behaviour
Make message and transmits successful probability, R on PLCopTo operate service request coefficient, rs is that the practical of optimum flow is satisfied with part,
Bf asks for optimum flow, scrFor n × (n-1) matrix of the radio sub-carrier distribution manner of record control service, sopFor note
N × (n-1) matrix of the radio sub-carrier distribution manner of record operation service, sbfFor the wireless electron of record optimum flow request
The n of the carrier wave method of salary distribution × (n-1) matrix, S are the n × (n- for all radio sub-carrier distribution manners for recording three kinds of requests
1) matrix；
The flow demand of each terminal device is determined according to the fitness function.
3. flow configuration method according to claim 1, which is characterized in that described two heterogeneous networks are respectively PLC nets
Network and WMN networks.
4. flow configuration method according to claim 1, which is characterized in that further include：
The traffic throughput of the shared bottom-layer network is determined according to the flow demand of each terminal device.
5. a kind of flow configures system, which is characterized in that including：
Setup module for two heterogeneous networks to be arranged in a shared bottom-layer network, and obtains the heterogeneous network and shares
The connection relation of the corresponding terminal device of bottom-layer network；
First determining module, for determining the mapping relations for sharing bottom-layer network according to the connection relation；Wherein, the mapping
Relationship include shared bottom-layer network each node and the mapping relations of corresponding terminal device and the shared bottom-layer network and
The mapping relations of connecting link between its corresponding terminal device；
Second determining module, the flow demand for determining each terminal device according to the mapping relations；Wherein, the flow needs
It asks and carries out communicating required flow for each terminal device；
Configuration module, for configuring the flow shared bottom-layer network and flow to each terminal device according to the flow demand；
Second determining module is further used for：
Object function and constraints are constructed according to the mapping relations；Wherein, the object function is
The constraints is Pcr(i)≥Rcr(i),Pop(i)≥Rop(i), bf (i) >=rs (i), i=1,2 ..., n-1,Wherein, n is the number of nodes of shared bottom-layer network, bf (i)
It is asked for optimum flow；Pcr(i) successful probability, R are transmitted on PLC for the control message of i-th of nodecr(i) it is i-th
The reliability requirement of the control service request of node, Pop(i) general for the actual transmissions success of the operation service request of i-th of node
Rate, Rop(i) it is the reliability requirement of the operation service request of i-th of node, rs (i) is that the practical of optimum flow is satisfied with part,
scr(i, j) is n × (n-1) matrix of the radio sub-carrier distribution manner of record control service, sop(i, j) is that record operates
The n of the radio sub-carrier distribution manner of service × (n-1) matrix, sbf(i, j) is the wireless electron for recording optimum flow request
The n of the carrier wave method of salary distribution × (n-1) matrix, S (i) be record three kinds request all radio sub-carrier distribution manners n ×
(n-1) matrix.
6. flow according to claim 5 configures system, which is characterized in that second determining module is also further used
In：
The fitness function for sharing bottom-layer network is constructed according to the object function and constraints using genetic algorithm；Wherein,
The fitness function isWherein, n is the number of nodes of shared bottom-layer network, α
It is constraint factor, P with βcrMessage transmits successful probability, R on PLC in order to controlcrFor reliability requirement index, PopFor behaviour
Make message and transmits successful probability, R on PLCopTo operate service request coefficient, rs is that the practical of optimum flow is satisfied with part,
Bf asks for optimum flow, scrFor n × (n-1) matrix of the radio sub-carrier distribution manner of record control service, sopFor note
N × (n-1) matrix of the radio sub-carrier distribution manner of record operation service, sbfFor the wireless electron of record optimum flow request
The n of the carrier wave method of salary distribution × (n-1) matrix, S are the n × (n- for all radio sub-carrier distribution manners for recording three kinds of requests
1) matrix；
The flow demand of each terminal device is determined according to the fitness function.
7. flow according to claim 5 configures system, which is characterized in that described two heterogeneous networks are respectively PLC nets
Network and WMN networks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510290844.9A CN104902516B (en) | 2015-05-29 | 2015-05-29 | Flow configuration method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510290844.9A CN104902516B (en) | 2015-05-29 | 2015-05-29 | Flow configuration method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104902516A CN104902516A (en) | 2015-09-09 |
| CN104902516B true CN104902516B (en) | 2018-09-21 |
Family
ID=54034852
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510290844.9A Active CN104902516B (en) | 2015-05-29 | 2015-05-29 | Flow configuration method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104902516B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086898B (en) * | 2022-06-15 | 2023-12-29 | 金钱猫科技股份有限公司 | Traffic sharing method, system and storage device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
-
2015
- 2015-05-29 CN CN201510290844.9A patent/CN104902516B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
Non-Patent Citations (3)
| Title |
|---|
| "Network Virtualization for Smart Grid Communications";Pin Lv etc;《IEEE SYSTEMS JOURNAL》;20130808;第8卷(第2期);第1-5节，图1-18 * |
| "Virtual network embedding for Evolving Networks";Zhiping Cai etc.;《Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE》;20101210;第1-5页 * |
| "基于粒子群优化的虚拟网络映射算法";程祥等;《电子学报》;20111030;第39卷(第10期);第2240-2244页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104902516A (en) | 2015-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109639377B (en) | Spectrum resource management method based on deep reinforcement learning | |
| Sheng et al. | Energy efficiency and delay tradeoff in device-to-device communications underlaying cellular networks | |
| CN110430613B (en) | Energy-efficiency-based resource allocation method for multi-carrier non-orthogonal multiple access system | |
| Lu et al. | A cross-layer resource allocation scheme for ICIC in LTE-Advanced | |
| CN104080126B (en) | Cellular network power-economizing method based on coordinated multipoint transmission | |
| Jia et al. | A genetic approach on cross-layer optimization for cognitive radio wireless mesh network under SINR model | |
| CN102244840A (en) | Method for routing multicasts and allocating frequency spectrums in cognitive wireless Mesh network | |
| CN107613556A (en) | A kind of full duplex D2D interference management methods based on Power Control | |
| Yin et al. | Prediction-based end-to-end dynamic network slicing in hybrid elastic fiber-wireless networks | |
| CN109362093A (en) | The method for optimizing resources of the total throughput maximization of network function virtualization | |
| Barolli et al. | Node placement for wireless mesh networks: Analysis of WMN-GA system simulation results for different parameters and distributions | |
| CN103619066B (en) | Method for distributing downlink interference mitigation based on distributed channel | |
| CN104581918A (en) | Satellite cross-layer joint optimal power allocation method based on non-cooperative game | |
| Ortín et al. | Joint cell selection and resource allocation games with backhaul constraints | |
| CN104902516B (en) | Flow configuration method and system | |
| Liu et al. | Robust power control for clustering-based vehicle-to-vehicle communication | |
| CN105979589A (en) | Method and system for allocating energy efficient resources of heterogeneous network | |
| Jia et al. | Joint topology control and routing for multi-radio multi-channel WMNs under SINR model using bio-inspired techniques | |
| Yassin | Inter-cell interference coordination in wireless networks | |
| CN102186232A (en) | Power distribution method for multi-district OFDMA (Orthogonal Frequency Division Modulation) system | |
| CN105530678B (en) | A kind of wireless backhaul route selection method in super-intensive network based on load and time delay | |
| Hossen et al. | Relax online resource allocation algorithms for D2D communication | |
| CN106793117B (en) | elastic virtual subnet mapping method in wireless mesh network | |
| CN116567667A (en) | Heterogeneous network resource energy efficiency optimization method based on deep reinforcement learning | |
| Chakraborty et al. | Q-CAR: an intelligent solution for joint QoS multicast routing and channel assignment in multichannel multiradio wireless mesh networks |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200914 Address after: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Patentee after: Guangzhou Power Supply Bureau of Guangdong Power Grid Co.,Ltd. Address before: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Patentee before: GUANGZHOU POWER SUPPLY Co.,Ltd. |
|
| TR01 | Transfer of patent right |