CN104022937B - A kind of mapping method of virtual network based on cellular type P system - Google Patents
A kind of mapping method of virtual network based on cellular type P system Download PDFInfo
- Publication number
- CN104022937B CN104022937B CN201410288752.2A CN201410288752A CN104022937B CN 104022937 B CN104022937 B CN 104022937B CN 201410288752 A CN201410288752 A CN 201410288752A CN 104022937 B CN104022937 B CN 104022937B
- Authority
- CN
- China
- Prior art keywords
- msub
- mrow
- msubsup
- prime
- rsqb
- 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.)
- Expired - Fee Related
Links
Landscapes
- Pharmaceuticals Containing Other Organic And Inorganic Compounds (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of mapping method of virtual network based on cellular type P system and system, physical network and virtual network information are changed into the manageable form of cellular type P system by this method first, again by setting initial seed film number to carry out physics film initialization, virtual network mapping is performed to all success virtual net mapping films to evolve, retain minimum several the preceding virtual networks mapping film of extra expenses, dissolve other virtual networks mapping film, this process is repeated until mapping failure or is mapped successfully, such as map success, the minimum virtual network mapping film of selection extra expenses is used as output, dissolve other all virtual network mapping films, then all map informations in virtual network mapping result output film are checked, if there is overdue virtual network map information, physical resource is returned to by physical network according to virtual network map information, this method and system can effectively improve the resource utilization of bottom physical network.
Description
Technical field
The present invention relates to network virtualization technical field, more particularly to a kind of virtual network based on cellular type P system is reflected
Shooting method and system.
Background technology
As time goes on, the scale of network becomes increasing, various new applications emerge in an endless stream, conventional internet by
It has been difficult the development rhythm for keeping up with current network in the defect of itself architectural framework.Brilliant becoming in the past is interconnected now
The yoke of planar network architecture upgrading, any upgrading for internet bottom architecture may all pull one hair and move the whole body, and this is related to
The problem of each side conflict of interest, hinders the development of internet.Extended by HardwareUpgring merely or using new software
While technology is more and more weak, the researchers of academia start to think deeply the design problem of Future-oriented Internet Architecture.Net
Network virtualization technology exactly proposes that traditional ISP is partitioned into two independences by it in this case
Role：Infrastructure provider and service provider.Infrastructure provider only focuses on bottom physical resource, and services and provide
Business then rents these resources to infrastructure provider and provides a user service, and user's request can have different topologys
Structure, using different agreements, such network virtualization just can support various heterogeneous networks on shared physical resource
System coexists.Therefore, network virtualization technology is considered as overcoming a kind of effective scheme of current internet system defect.
The various heterogeneous network systems coexisted referred in above mentioned problem, are referred to as virtual net in network virtualization environment
Network, is made up of, their topological structure is different, the agreement used thereon one group of dummy node virtual link connection
It is varied, by using different topological structure and agreement, being directed to different demands, there is provided different services.
It is effectively different virtual networks how in the case where bottom physical resource is limited that the key issue for providing such a service, which is,
Bottom physical resource is distributed, so that the virtual network requests received are as more as possible.This is that virtual network distributes asking for resource
Topic is exactly virtual network mapping problems, i.e., reflect the dummy node and virtual link in virtual network according to certain constraints
It is mapped on the physical node of bottom physical network and physical pathway.
Due to the complexity of virtual network mapping problems, problem has been carried out not for the research that virtual network maps in early days
With the limitation of degree：Such as assume that bottom physical network resource is unlimited；All virtual network requests are all known；Ignore
Some demands such as node or link requirements therein；Or only focus on some virtual network for specifying topological structure.Subsequently
Research to problem on the basis of irrational limitation is not carried out, it is proposed that such as link is split, cooperative nodes and link maps,
One session map, the mapping of virtual network is carried out using topology information to methods such as node sequencings.But existing method
The resource of bottom physical network much all can not be effectively utilized, its solution obtained is frequently not optimal solution or preferably solved,
Therefore the demand of the method to can effectively utilize bottom physical network resource is extremely urgent.
The content of the invention
It is an object of the invention to provide a kind of mapping method of virtual network based on cellular type P system and system, the party
Method and system can effectively improve the resource utilization of bottom physical network.
To achieve the above object, the technical scheme is that：A kind of virtual network mapping side based on cellular type P system
Method, comprises the following steps：
Step S1：Membrane structure is initialized according to the physical node quantity of physical network；
Step S2：Physical network information is converted into physics film local message；
Step S3：Receive virtual network information and convert thereof into virtual local message；
Step S4：Arrange parameter initial seed film number initial_membranes and reservation general layout number conf_
Numbers, replicates initial_membranes virtual network mapping film, maps film to each virtual network, select different
Physics film performs the initialization of physics film, dissolves the virtual network mapping film of all initialization failures；
Step S5：Film is mapped to each virtual network, virtual network mapping is performed and evolves, the void of all failures of evolving is dissolved
Intend network mapping film；
Step S6：The virtual network mapping film repeated is deleted, each virtual net is calculated by fitness function of extra expenses
Network maps the extra expenses of film, and selection retains the minimum preceding conf_numbers virtual network mapping film of extra expenses, dissolving
Other all virtual network mapping films；
Step S7：Virtual network mapping failure, jumps to step if it there is currently no any virtual network mapping film
S9, otherwise judges whether virtual network maps completely, is to jump to step S8, otherwise jumps to step S5；
Step S8：Select the minimum virtual network of extra expenses to map film as output, dissolve other all virtual networks
Film is mapped, map information is sent in virtual network mapping result output film, physical network resource is distributed；
Step S9：All map informations in virtual network mapping result output film are checked, if there is overdue
Virtual network map information, returns to physical network by physical resource according to virtual network map information, jumps to step S3.
Further, in above-mentioned steps S1, physical node quantity is initialized as n membrane structure Wherein, film 0 is top layer film, and film 1' is virtual network input film, film 2'1It is virtual network mapping film, film 1
It is physics film to film n, film n+1 is virtual local message film, and film n+2 is current map information film, and film 3' is virtual network mapping
Information exports film.
Further, in above-mentioned steps S2 and step S3, physics film local message refers to the form table with object multiset
The available resources of the physical node shown and the available resources of physical pathway, virtual local message refer to the form with object multiset
The resource requirement of the dummy node of expression and the resource requirement of virtual link；The extracts physical network information and virtual network information
Rule is as follows：
[1'VNR→VLIs]1'；
Further, in above-mentioned steps S4, the carry out physics film initialization procedure of all virtual network mapping films parallel, thing
Reason film initialization refers to that physics film randomly chooses a unmapped dummy node and mapped；The rule of physics film initialization is such as
Under：
Further, in above-mentioned steps S5, the carry out virtual network mapping of all virtual network mapping films parallel is evolved, empty
Intend network mapping evolution to refer to virtual network mapping film random selection one unmapped dummy node of mapping and map
Virtual link between the dummy node and all nodes of maps virtual；The rule that virtual network mapping is evolved is as follows：
Further, in above-mentioned steps S6, delete the virtual network mapping film repeated and refer to possess identical section to all
The virtual network mapping film of point map information and link map information, only retains one, dissolves other all virtual network mappings
Film；The rule for deleting the virtual network mapping film repeated is as follows：
Further, in above-mentioned steps S6, for a virtual network requests, fitness function extra expenses refer to that it is obtained
Difference between the physical network resource and the portion requirements of the actual occupancy in part of mapping, that is, map the extra Physical Network of consuming
Network resource；Selection retains the minimum preceding conf_numbers virtual network mapping film of extra expenses, dissolves other all virtual
The rule of network mapping film is as follows：
Further, in above-mentioned steps S8, the minimum virtual network of selection extra expenses maps film as output, refers to carry
The corresponding map information of virtual network mapping film that extra expenses are minimum is taken, the overall spending of the mapping scheme is obtained, and send
Into virtual network mapping result output film；Select the minimum virtual network of extra expenses to map film as output, dissolve other
All virtual networks map film, and map information is sent in virtual network mapping result output film, distribution physical network resource
Rule is as follows：
Further, in above-mentioned steps S9, no matter whether some virtual network is received, in last all progress pair of evolution
The judgement of the virtual network of current all mappings that succeeded, release overdue virtual network resource, and receiving newly
Virtual network requests；The rule for discharging overdue virtual network resource is as follows：
Present invention also offers a kind of virtual network mapped system based on cellular type P system, the system includes：
Initialization unit, for physical network information to be converted into membrane structure and corresponding physics film local message；
Input block, for virtual network information to be converted into virtual local message；
Map unit, for the virtual local message to being converted to by virtual network, is reflected using physics film information
Penetrate；
Output unit, for when virtual network maps failure, without any output, being mapped successfully in virtual network
When, export the overall spending of optimal mapping scheme and the optimal mapping scheme；
Updating block, judges for the virtual network to all mappings that succeeded after each output, will arrive
The virtual network resource of phase returns to physical network.
The beneficial effects of the invention are as follows：In the case where bottom physical network supports link segmentation, by based on cellular type P
The evolutionary computation method of system, realizes the selection of optimal physical network mapping scheme, effectively increases the resource profit of bottom-layer network
With rate, more spaces are provided for follow-up virtual network requests, in addition, the void based on cellular type P system that the present invention is realized
Intending network mapping method can be by adjusting initial seed film number and retaining the effective realization of the two parameters of general layout number most
Balance selection between effect of optimization and mapping time, can be widely applied in real virtual network environment, with very
Strong practicality and wide application prospect.
Brief description of the drawings
Fig. 1 is mapping method of virtual network of the present invention based on cellular type P system and the implementation process schematic diagram of system.
The membrane structure schematic diagram that Fig. 2 uses for mapping method of virtual network of the present invention based on cellular type P system and system.
Fig. 3 is that the bottom physical network of the mapping method of virtual network of the invention based on cellular type P system is averagely received for a long time
Beneficial curve synoptic diagram.
Fig. 4 is the virtual network requests receptance curve of the mapping method of virtual network of the invention based on cellular type P system
Schematic diagram.
Fig. 5 is that the bottom physical network of the mapping method of virtual network of the invention based on cellular type P system is averagely received for a long time
Beneficial cost compares curve synoptic diagram.
Embodiment
Mapping method of virtual network of the invention based on cellular type P system, as shown in figure 1, comprising the following steps：
Step S1：Membrane structure is initialized according to the physical node quantity of physical network.
Membrane structure is as shown in Fig. 2 physical node quantity is initialized as n membrane structure Wherein, film 0 is top layer film, and film 1' is virtual network input film, film 2'1It is virtual network mapping film, film 1
It is physics film to film n, film n+1 is virtual local message film, and film n+2 is current map information film, and film 3' is virtual network mapping
Information exports film.
Step S2：Physical network information is converted into physics film local message.
Step S3：Receive virtual network information and convert thereof into virtual local message.
In above-mentioned steps S2 and step S3, physics film local message refers to the physics section represented with the form of object multiset
The available resources of point and the available resources of physical pathway, it is virtual that virtual local message refers to be represented with the form of object multiset
The resource requirement of node and the resource requirement of virtual link；The rule of the extracts physical network information and virtual network information is as follows：
[1'VNR→VLIs]1'；
Step S4：Arrange parameter initial seed film number initial_membranes and reservation general layout number conf_
Numbers, replicates initial_membranes virtual network mapping film, maps each virtual network film, selection is different
Physics film perform the initialization of physics film, dissolve the virtual networks mapping films of all initialization failures.
In above-mentioned steps S4, the carry out physics film initialization procedure of all virtual network mapping films parallel, physics film is initial
Change refers to that physics film randomly chooses a unmapped dummy node and mapped；The rule of physics film initialization is as follows：
Step S5：Film is mapped to each virtual network, virtual network mapping is performed and evolves, the void of all failures of evolving is dissolved
Intend network mapping film.
In above-mentioned steps S5, the carry out virtual network mapping of all virtual network mapping films parallel is evolved, and virtual network is reflected
Injecting refers to virtual network mapping film random selection one unmapped dummy node of mapping and maps the virtual section
Virtual link between point and all nodes of maps virtual；The rule that virtual network mapping is evolved is as follows：
Step S6：The virtual network mapping film repeated is deleted, by extra expenses (Extra Cost) in terms of fitness function
The extra expenses that each virtual network maps film are calculated, selection retains the minimum preceding conf_numbers virtual network of extra expenses
Film is mapped, other all virtual network mapping films are dissolved.
In above-mentioned steps S6, delete the virtual network mapping film repeated and refer to possess identical node map information to all
Film is mapped with the virtual network of link map information, only retains one, other all virtual network mapping films are dissolved；Delete and repeat
Virtual network mapping film rule it is as follows：
For a virtual network requests, fitness function extra expenses refer to the actual occupancy in part that it is mapped
Difference between physical network resource and the portion requirements, that is, map the extra physical network resource of consuming；Select retention external-open
The minimum preceding conf_numbers virtual network mapping film of branch, the rule for dissolving other all virtual network mapping films is as follows：
Step S7：Virtual network mapping failure, jumps to step if it there is currently no any virtual network mapping film
S9, otherwise judges whether virtual network maps completely, is to jump to step S8, otherwise jumps to step S5.
Step S8：Select the minimum virtual network of extra expenses to map film as output, dissolve other all virtual networks
Film is mapped, map information is sent in virtual network mapping result output film, physical network resource is distributed.
In above-mentioned steps S8, the minimum virtual network of selection extra expenses maps film as output, refers to extract and additionally opens
The minimum corresponding map information of virtual network mapping film of branch, obtains the overall spending of the mapping scheme, and be sent to virtual net
In network mapping result output film；Select the minimum virtual network of extra expenses to map film as output, dissolve other all virtual
Network mapping film, map information is sent in virtual network mapping result output film, the rule of distribution physical network resource is as follows：
Step S9：All map informations in virtual network mapping result output film are checked, if there is overdue
Virtual network map information, returns to physical network by physical resource according to virtual network map information, jumps to step S3.
In above-mentioned steps S9, no matter whether some virtual network is received, and last in evolution is all carried out to current all
Succeeded mapping virtual network judgement, discharge overdue virtual network resource, and receive new virtual network
Request；The rule for discharging overdue virtual network resource is as follows：
The symbol and variable implication referred in above-mentioned steps is as follows：
SN：Physical network；MLIs：Physics film local message；VNR：Virtual network requests；VLIs：Virtual local message；
All：Cell membrane embeds all objects；s：Duplicating film number tag；q：Initialize physics membrane marker；v：Iteration map is successfully marked
Note；X：Physical network nodes resource；x：Virtual network node demand；B：Physical network links resource；b：Virtual network link is needed
Ask；y：Resource impact information；z：Export mapping result mark；e：Virtual net duration flag；k：Cycle count variable.
It is described present invention also offers the virtual network mapped system based on cellular type P system corresponding with the above method
System includes：
Initialization unit, for physical network information to be converted into membrane structure and corresponding physics film local message；
Input block, for virtual network information to be converted into virtual local message；
Map unit, for the virtual local message to being converted to by virtual network, is reflected using physics film information
Penetrate；
Output unit, for when virtual network maps failure, without any output, being mapped successfully in virtual network
When, export the overall spending of optimal mapping scheme and the optimal mapping scheme；
Updating block, judges for the virtual network to all mappings that succeeded after each output, will arrive
The virtual network resource of phase returns to physical network.
Below in conjunction with the accompanying drawings and specific embodiment the present invention is described in further detail.
First, the concept being related to inside virtual network mapping field is briefly introduced.
Physical network：Physical network topology can be markedWherein NsRepresent physics
The set of network node, LsRepresent the set of physical network links.WithRepresent that physical node and physical link are had respectively
There is the set of attribute.The attribute that physical node has is the currently available computing capability CPU of the node, the attribute that physical link has
For the currently available bandwidth resources of the link.
Virtual network requests：Similar with bottom-layer network, virtual network topology can also be marked as weighted-graphWherein NvFor the set of dummy node, LvFor the set of virtual link,WithVirtual section is represented respectively
The resource constraint of point and virtual link.In general, the resource constraint of dummy node mainly considers the calculating energy of the dummy node
Power demand, the resource constraint of virtual link mainly considers the bandwidth resources demand of the virtual link.Please for a virtual network
Ask, triple VNR can be used(i)(Gv, t, d) represent, wherein t represents the due in of virtual network requests, d represents virtual net
Network duration in bottom-layer network.After i-th of virtual network requests is reached, bottom-layer network should meet it for its distribution
The respective resources of node and link resource needs.It is that the resource of its distribution will be released when virtual network leaves bottom-layer network.
In addition, when bottom-layer network inadequate resource, the request should be refused.
Virtual network maps：Virtual network mapping problems is defined as mapping：M:Gv a(N',P',RN,RL), wherein PSRepresent the path loop-free of all bottom-layer networks.Mapping can be decomposed into following two steps：Will be virtual
Node is mapped in the bottom layer node for meeting its node resource constraints；Virtual link is mapped to and meets its bandwidth resources about
In the bottom loop free path of beam condition.
Primary evaluation index：Virtual network mapping primary evaluation index have bottom-layer network for a long time be averaged running income, void
Intend network request receptance, virtual network and map long-term average yield expense ratio.In addition, mapped for online virtual network,
Time complexity should also be considered.Wherein, further above-mentioned evaluation index is illustrated.
The income for receiving a virtual network requests in t may be defined as the computational resource requirements of the virtual network requests
With bandwidth resources demand sum：
The expense for receiving a virtual network requests in t may be defined as bottom-layer network and distribute to the virtual network requests
Resource sum：
Wherein,As bottom link lsTo virtual link lvWhen distributing bandwidth resourcesOtherwiseRepresent lsTo lvThe value of the bandwidth of distribution.
The averagely running income for a long time of bottom-layer network can be represented with following formula：
Virtual network requests receptance is represented by：
Wherein VNRaccRepresent the virtual network number successfully mapped from the t=0 moment to the T moment, VNRallRepresent from t=0
Sum of the moment to T moment virtual network requests.
The long-term average yield expense ratio of bottom-layer network is represented by：
On mapping method of virtual network disclosed by the invention, related notion is described below：
Extra expenses (Extra Cost) and the extra resource sum of current mapping scheme, are represented by：
Wherein,When bottom path p is to virtual link lvWhen distributing extra resourceOtherwiseRepresent p to lvThe value of the extra bandwidth of distribution.
Finally, cellular type P system is briefly described：Cellular type P system is by European Section academician, Romania
What academy of sciences academician Paun was proposed in 1998 in the research report of Turku, Finland computer center, be from life cells
Abstracted in 26S Proteasome Structure and Function and from the cooperation of the cell Cooperation group such as tissue and organ.With the method pair of same type
Than the features such as with distributivity, concurrency and uncertainty.
The present invention basic thought be：A. membrane structure is initialized according to the physical node quantity of physical network；B. by thing
The information of reason network is converted into physics film local message；C. receive virtual network information and convert thereof into virtual local letter
Breath；D. arrange parameter initial seed film number initial_membranes and reservation general layout number conf_numbers, is replicated
Initial_membranes virtual network maps film, and film is mapped to each virtual network, selects different physics films to perform thing
Film initialization is managed, the virtual network mapping film of all initialization failures is dissolved；E. film is mapped to each virtual network, performed virtual
Network mapping is evolved, and dissolves the virtual network mapping film of all failures of evolving；F. the virtual network mapping film of repetition is deleted, according to
The value selection of extra expenses (Extra Cost) this fitness function retains conf_numbers minimum virtual network and reflected
Film is penetrated, other all virtual network mapping films are dissolved；If G. there is currently no any virtual network mapping film, I is jumped to.Such as
Fruit virtual network is successfully completed, and jumps to H.Otherwise E is jumped to；H. the minimum virtual network of selection extra expenses maps film
As output, other all virtual network mapping films are dissolved, map information is sent in virtual network mapping result output film, point
With physical network resource；I. all map informations in virtual network mapping result output film are checked, if there is having expired
Virtual network map information, physical resource is returned to by Physical Network according to virtual network map information, C is jumped to.
Mapping method of virtual network and system of the present invention based on cellular type P system, by extracts physical network and virtually
The information of network is simultaneously inputted in membranous system, and the mapping of virtual network is completed in the way of evolution, and exports mapping result and more
The resource of new physicses network.
To the result that can be obtained under the above-mentioned mapping method of virtual network based on cellular type P system and optimal situation with
Lower evaluation index：Bottom physical network averagely runs income (referring to above-mentioned formula (3)), virtual network requests receptance for a long time
(referring to above-mentioned formula (4)), the long-term average yield expense ratio of bottom-layer network (referring to above-mentioned formula (5)) are contrasted：
The configuration of actual and virtual network is as follows：Bottom physical network topology is configured with 100 nodes and about 600 links.
Bottom physical network nodes cpu resource and bandwidth resources obey being uniformly distributed for 50-100.It is virtual in every 100 chronomeres
The Poisson process that average is 5 is obeyed in the arrival of network request, and the life span of each virtual network obeys exponential distribution, and it is averaged
Life span is 1000 chronomeres.
For each virtual network requests, virtual network node obeys being uniformly distributed for 2-10, each pair virtual network node
It is connected with 0.5 probability.Virtual network node cpu resource obeys being uniformly distributed for 0-40, and link bandwidth resource obeys 0-100's
It is uniformly distributed.
Each record system runs about 50000 time quantums, comprising 2500 virtual network requests, by present invention offer
Mapping method of virtual network be labeled as MIC, pre-set parameter initial_membranes and conf_numbers for 30.
Specific virtual network mapping result 3~Fig. 5 of reference picture, wherein Fig. 3 show that the present invention is based on cellular type P system
Mapping method of virtual network the long-term average yield curve of bottom physical network, Fig. 4 show the present invention be based on cellular type P systems
The virtual network requests receptance curve of the mapping method of virtual network of system, Fig. 5 shows the present invention based on cellular type P system
The long-term average yield cost of bottom physical network of mapping method of virtual network method compares curve.
The mapping method of virtual network based on cellular type P system that the present invention is provided it can be seen from Fig. 3 and Fig. 4, is obtained
The bottom physical network long-term average yield and virtual network requests receptance of near-optimization.As seen from Figure 5, it is of the invention
The mapping method of virtual network based on cellular type P system provided obtains higher bottom physical network long-term average yield generation
Valency ratio.
Above is presently preferred embodiments of the present invention, all changes made according to technical solution of the present invention, produced function is made
During with scope without departing from technical solution of the present invention, protection scope of the present invention is belonged to.
Claims (9)
1. a kind of mapping method of virtual network based on cellular type P system, it is characterised in that comprise the following steps：
Step S1：Membrane structure is initialized according to the physical node quantity of physical network；
Step S2：Physical network information is converted into physics film local message；
Step S3：Receive virtual network information and convert thereof into virtual local message；
Step S4：Arrange parameter initial seed film number initial_membranes and reservation general layout number conf_numbers,
Initial_membranes virtual network mapping film is replicated, film is mapped to each virtual network, selects different physics films to hold
Row physics film is initialized, and dissolves the virtual network mapping film of all initialization failures；
Step S5：Film is mapped to each virtual network, virtual network mapping is performed and evolves, the virtual net of all failures of evolving is dissolved
Network maps film；
Step S6：The virtual network mapping film repeated is deleted, each virtual network is calculated by fitness function of extra expenses and is reflected
The extra expenses of film are penetrated, selection retains the minimum preceding conf_numbers virtual network mapping film of extra expenses, dissolves other
All virtual networks map film；
Step S7：The virtual network mapping failure if it there is currently no any virtual network mapping film, jumps to step S9, no
Then judge whether virtual network maps completely, be to jump to step S8, otherwise jump to step S5；
Step S8：Select the minimum virtual network of extra expenses to map film as output, dissolve other all virtual network mappings
Film, map information is sent in virtual network mapping result output film, physical network resource is distributed；
Step S9：All map informations in virtual network mapping result output film are checked, if there is overdue virtual
Network mapping information, returns to physical network by physical resource according to virtual network map information, jumps to step S3.
2. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S1, physical node quantity is initialized as n membrane structureWherein, film 0
It is top layer film, film 1' is virtual network input film, film 2'1It is virtual network mapping film, film 1 to film n is physics film, and film n+1 is
Virtual local message film, film n+2 is current map information film, and film 3' is virtual network map information output film.
3. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S2 and step S3, physics film local message refers to the available money of the physical node represented with the form of object multiset
Source and the available resources of physical pathway, virtual local message refer to the resource of the dummy node represented with the form of object multiset
The resource requirement of demand and virtual link；The rule of the extracts physical network information and virtual network information is as follows：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>S</mi>
<mi>N</mi>
<mo>&RightArrow;</mo>
<mi>M</mi>
<mi>L</mi>
<mi>I</mi>
<mi>s</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
[1'VNR→VLIs]1'；
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>V</mi>
<mi>L</mi>
<mi>I</mi>
<mi>s</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mi>V</mi>
<mi>L</mi>
<mi>I</mi>
<mi>s</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>.</mo>
</mrow>
4. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S4, the carry out physics film initialization procedure of all virtual network mapping films parallel, physics film initialization refers to physics
Film randomly chooses a unmapped dummy node and mapped；The rule of physics film initialization is as follows：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>s</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>s</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>s</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>s</mi>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>q</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>q</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>,</mo>
<mn>1</mn>
<mo>&le;</mo>
<mi>k</mi>
<mo>&le;</mo>
<mo>|</mo>
<mi>s</mi>
<mo>|</mo>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msubsup>
<mi>qy</mi>
<mi>i</mi>
<mi>j</mi>
</msubsup>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>m</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>x</mi>
<mi>j</mi>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>m</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>v</mi>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>qX</mi>
<mi>i</mi>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>x</mi>
<mi>j</mi>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>y</mi>
<mi>i</mi>
<mi>j</mi>
</msubsup>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>,</mo>
<mn>0</mn>
<mo>&le;</mo>
<mi>k</mi>
<mo>&le;</mo>
<mo>|</mo>
<mi>s</mi>
<mo>|</mo>
<mo>;</mo>
</mrow>
1
5. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S5, the carry out virtual network mapping of all virtual network mapping films parallel is evolved, and virtual network mapping evolution refers to
One virtual network mapping film random selection one unmapped dummy node of mapping and map the dummy node and it is all
Virtual link between maps virtual node；The rule that virtual network mapping is evolved is as follows：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<mi>v</mi>
<mo>,</mo>
<mn>0</mn>
<mo>&le;</mo>
<mi>k</mi>
<mo>&le;</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>|</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mn>.0</mn>
<mo>&le;</mo>
<mi>k</mi>
<mo>&le;</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msubsup>
<mi>y</mi>
<mi>i</mi>
<mi>j</mi>
</msubsup>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>x</mi>
<mi>j</mi>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>x</mi>
<mi>j</mi>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>y</mi>
<mi>i</mi>
<mi>j</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
</msubsup>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
</msubsup>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mrow>
<mn>2</mn>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
</msubsup>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
</msubsup>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>i</mi>
<mn>3</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>b</mi>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>y</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<msub>
<mi>j</mi>
<mn>2</mn>
</msub>
<msub>
<mi>j</mi>
<mn>1</mn>
</msub>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<msub>
<mo>|</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<msubsup>
<mi>a</mi>
<mi>j</mi>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>b</mi>
<mrow>
<mo>*</mo>
<mi>j</mi>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>b</mi>
<mrow>
<mi>j</mi>
<mo>*</mo>
</mrow>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>2</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
</msub>
<mo>;</mo>
</mrow>
6. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S6, delete the virtual network mapping film repeated and refer to possess identical node map information and link maps to all
The virtual network mapping film of information, only retains one, dissolves other all virtual network mapping films；Delete the virtual network repeated
The rule for mapping film is as follows：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>,</mo>
<mi>v</mi>
<msub>
<mo>|</mo>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>=</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mo>|</mo>
<msup>
<mi>v</mi>
<mo>&prime;</mo>
</msup>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
</mrow>
</msub>
<mo>.</mo>
</mrow>
7. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S6, for a virtual network requests, fitness function extra expenses refer to that part that it is mapped is actual and accounted for
Difference between physical network resource and the portion requirements, that is, map the extra physical network resource of consuming；Select retention
The minimum preceding conf_numbers virtual network mapping film of outer spending, dissolves the rule of other all virtual network mapping films such as
Under：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>,</mo>
<mi>v</mi>
<msub>
<mo>|</mo>
<mrow>
<mo>|</mo>
<mi>k</mi>
<mo>|</mo>
<mo>></mo>
<mo>|</mo>
<mi>u</mi>
<mo>|</mo>
</mrow>
</msub>
<mo>.</mo>
</mrow>
8. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S8, the minimum virtual network mapping film of selection extra expenses refers to extract the minimum void of extra expenses as output
Intend the corresponding map information of network mapping film, obtain the overall spending of the mapping scheme, and be sent to virtual network mapping result
Export in film；Select the minimum virtual network of extra expenses to map film as output, dissolve other all virtual network mapping films,
Map information is sent in virtual network mapping result output film, the rule of distribution physical network resource is as follows：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>z</mi>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<msubsup>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mo>|</mo>
<mi>z</mi>
<mo>|</mo>
</mrow>
</msubsup>
<mi>z</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mrow>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
</mrow>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mi>v</mi>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>1</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<mi>a</mi>
<mi>l</mi>
<mi>l</mi>
<mo>,</mo>
<mi>v</mi>
<msub>
<mo>|</mo>
<mrow>
<mo>|</mo>
<mi>v</mi>
<mo>|</mo>
<mo>></mo>
<mn>1</mn>
</mrow>
</msub>
<mo>.</mo>
</mrow>
9. a kind of mapping method of virtual network based on cellular type P system according to claim 1, it is characterised in that on
State in step S9, no matter whether some virtual network is received, last in evolution all carries out successfully having reflected to currently all
The judgement for the virtual network penetrated, discharges overdue virtual network resource, and receive new virtual network requests；Release is
Rule through overdue virtual network resource is as follows：
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<msubsup>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mo>|</mo>
<mi>z</mi>
<mo>|</mo>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>X</mi>
<mi>i</mi>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<msubsup>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mo>|</mo>
<mi>z</mi>
<mo>|</mo>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<msubsup>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mi>r</mi>
</msubsup>
<mi>e</mi>
<mi>z</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mo>|</mo>
<mi>z</mi>
<mo>|</mo>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msup>
<mn>3</mn>
<mo>&prime;</mo>
</msup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mi>e</mi>
<mi>z</mi>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>1</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>1</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>&RightArrow;</mo>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<msub>
<mrow>
<msub>
<mo>&lsqb;</mo>
<mi>i</mi>
</msub>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>2</mn>
</msub>
<msub>
<mi>i</mi>
<mn>3</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>B</mi>
<mrow>
<msub>
<mi>iLi</mi>
<mn>3</mn>
</msub>
<msub>
<mi>i</mi>
<mn>2</mn>
</msub>
<mi>L</mi>
</mrow>
<mrow>
<mi>c</mi>
<mo>+</mo>
<mi>r</mi>
</mrow>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mi>i</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<msubsup>
<mn>2</mn>
<mn>1</mn>
<mo>&prime;</mo>
</msubsup>
</msub>
<mo>.</mo>
</mrow>
3
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410288752.2A CN104022937B (en) | 2014-06-26 | 2014-06-26 | A kind of mapping method of virtual network based on cellular type P system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410288752.2A CN104022937B (en) | 2014-06-26 | 2014-06-26 | A kind of mapping method of virtual network based on cellular type P system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104022937A CN104022937A (en) | 2014-09-03 |
| CN104022937B true CN104022937B (en) | 2017-09-29 |
Family
ID=51439516
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410288752.2A Expired - Fee Related CN104022937B (en) | 2014-06-26 | 2014-06-26 | A kind of mapping method of virtual network based on cellular type P system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104022937B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109921934B (en) * | 2019-03-11 | 2021-06-11 | 湖南大学 | Virtual network mapping method based on path splitting and energy consumption perception |
| CN110321318B (en) * | 2019-06-04 | 2023-04-07 | 西南交通大学 | FPGA (field programmable Gate array) implementation method of multi-clock single-state organization type P system |
| CN113763388B (en) * | 2021-07-29 | 2022-12-09 | 山东师范大学 | Deep coagulation population P system and method for brain metastasis tumor hybrid supervised learning |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075402A (en) * | 2011-02-12 | 2011-05-25 | 华为技术有限公司 | Virtual network mapping processing method and system |
-
2014
- 2014-06-26 CN CN201410288752.2A patent/CN104022937B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075402A (en) * | 2011-02-12 | 2011-05-25 | 华为技术有限公司 | Virtual network mapping processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104022937A (en) | 2014-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jurdziński et al. | MST in O (1) rounds of congested clique | |
| CN112712182B (en) | Model training method and device based on federal learning and storage medium | |
| Chang et al. | Performance evaluation of artificial intelligence algorithms for virtual network embedding | |
| CN104022937B (en) | A kind of mapping method of virtual network based on cellular type P system | |
| CN112236760B (en) | Graph data updating method, system, computer readable storage medium and equipment | |
| CN110071965A (en) | A kind of data center management system based on cloud platform | |
| CN109995580A (en) | VN mapping method based on GA_PSO hybrid algorithm in 5G network slice | |
| CN102508955B (en) | Workflow-technology-based distributed traffic simulation platform and simulation method | |
| Fajjari et al. | A new virtual network static embedding strategy within the Cloud’s private backbone network | |
| CN106453608A (en) | Cloud-based adaptive scheduling algorithm for background request of mobile application | |
| CN107885601A (en) | A kind of cloud computing method for scheduling task based on difference and ant group algorithm | |
| CN112073237B (en) | Large-scale target network construction method in cloud edge architecture | |
| CN114556381A (en) | Developing machine learning models | |
| CN105677447A (en) | Clustering-based delay bandwidth minimization virtual machine deployment method in distributed cloud | |
| CN110380906B (en) | Large-scale multidimensional fusion virtual network mapping method | |
| CN104618480A (en) | Cloud system source distributing method driven on basis of network link utilization rates | |
| CN104009943B (en) | LLDP message transmitting methods and DCB equipment | |
| CN104579896B (en) | A kind of partitioning method and device of virtual network | |
| CN104348695A (en) | Artificial immune system-based virtual network mapping method and system thereof | |
| CN108833162B (en) | Network node sequencing method and virtual network mapping method | |
| CN106657238A (en) | Interactive-workload-oriented data center coarse-grained dynamic server reservation algorithm | |
| Wang et al. | A coordinated two-stages virtual network embedding algorithm based on reinforcement learning | |
| Lin et al. | Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles | |
| Zhu et al. | A hybrid reliable heuristic mapping method based on survivable virtual networks for network virtualization | |
| Hou et al. | Research on dynamic assignment of satellite communication tasks based on GA algorithm |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170929 Termination date: 20200626 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |