CN106507490A - A kind of time-frequency resource maps method based on wireless dummy network life cycle - Google Patents
A kind of time-frequency resource maps method based on wireless dummy network life cycle Download PDFInfo
- Publication number
- CN106507490A CN106507490A CN201611006781.0A CN201611006781A CN106507490A CN 106507490 A CN106507490 A CN 106507490A CN 201611006781 A CN201611006781 A CN 201611006781A CN 106507490 A CN106507490 A CN 106507490A
- Authority
- CN
- China
- Prior art keywords
- vnr
- time
- mapped
- network
- mapping
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
Abstract
The present invention relates to wireless network technical field of virtualization, more particularly to a kind of time-frequency resource maps method based on wireless dummy network life cycle, first determine whether whether physical network residue time/frequency source block is continuous, if being judged as continuous, the VNR of buffer area is mapped successively, otherwise, the VNR to having mapped carries out selectivity and remaps, and then again the VNR of buffer area is mapped successively;The VNR of the buffer area includes the VNR of current time piece arrival and timeslice arrival before and fails mapping and in the maximum VNR mapped in time delay;Compared with prior art, after VNR receptances tend to be steady, the present invention not only makes the receptance of VNR improve more than 17%, and makes physical network obtain higher income.
Description
Technical field
The present invention relates to wireless network technical field of virtualization, more particularly to a kind of based on wireless dummy network life cycle
Time-frequency resource maps method.
Background technology
Conventional Internet service and is provided based on this from establishing network (i.e. so-called infrastructure provider) by operator
The service (i.e. so-called service provider) of network, two kinds of identity unite two into one, and cause operator to be unwilling or be difficult to adopt one kind
The new network architecture carries out some modifications on existing network so that existing Internet technology is unfavorable for supporting movement
Property, the autgmentability of core route is have impact on, the efficiency of existing security mechanism is reduced, is hindered the development of new network.For
Solve " ossifing " problem of the Internet and stimulate the innovation of future network research, the method for network virtualization to be suggested, and
Become the emphasis of future network research work.
Network virtualization refers to, infrastructure provider is responsible for the construction of physical network facility and O&M, virtualization, abstract
Change physical resource and corresponding physical resource is provided to service provider;And service provider is carried from one or more infrastructure
Virtual network, the deployment customized agreement of oneself is set up for business's lease resource provides the user transmission service end to end.Base
In infrastructure provider design mechanism detached with service provider, network virtualization technology enables multiple heterogeneous networks to be total to
Enjoy same physical network.The main target of network virtualization is, by allowing network share identical physical link and route
The physical resources such as device, build virtual environment that is healthy and strong, believable, being easily managed, are various virtual nets request distribution
Suitable virtual resource, realizes resource-sharing, improves infrastructure resources utilization rate.
There are some researchs for wireless dummy network mapping algorithm, but the framework spy because of wireless network itself at present
Point and specific constraints, its mapping algorithm need further to be optimized.Park K et al. are in " A framework for
virtual network embedding in wireless networks,”in Proceedings of the 4th
International Conference on Future Internet Technologies,ser.CFI’09.New York,
NY,USA:ACM, proposes a kind of mapping framework of wireless dummy network in 2009, pp.5 7., in order that each virtual network
Do not interfere with each other, by by physical resource dividing for multi-dimensional orthogonal resource realizing, but the algorithm does not propose specific mapping and calculates
Method.Yun D are in Virtual network embedding in wireless multihop networks.In
Proceedings of the 6th International Conference on Future Internet
Technologies, 2011,30-33. are directed to wireless multi-hop network, set up in conjunction with the mapping algorithm under cable network environment wireless
Network model, it is proposed that wireless dummy network mapping algorithm, it takes into full account the interference problem in wireless network, but which maps
Expense and complexity are larger.Yang M are in Karnaugh-map like online embedding algorithm of
wireless virtualization.In Wireless Personal Multimedia Communications(WPMC),
It is empty that 15th International Symposium, 2012,594-598 propose a kind of wireless network based on similar Karnaugh map
Planization mapping algorithm, the algorithm can process online virtual network requests (VNR, virtual network requests),
By abstract for Radio Resource for time slot and the rectangle of orthogonal frequency product, rectangular area is divided using the thought of Karnaugh map.
The method can lift resource utilization, but dynamic does not change section.Hsu F T are in (Resource Allocation with
Spectrum Aggregation for Wireless Virtual Network Embedding[C]//Vehicular
Technology Conference(VTC Fall),2015IEEE 82nd.IEEE,2015:1-5. considers part available frequency
Bands of a spectrum width and spectrum aggregating ability, discontinuous frequency spectrum fragment is used, frequency spectrum resource utilization rate is improve.However, should
Algorithm does not account for virtual network and remaps, and the complexity of algorithm is high.Van de Belt J are in A dynamic
embedding algorithm for wireless network virtualization[C],Vehicular
Technology Conference(VTC Fall),2014IEEE 80th.IEEE,2014:It is embedding that 1-6. proposes a kind of dynamic
Enter formula greediness mapping algorithm, construct the mapping problems with service priority additional requirement, each timeslice can be to reflecting
The VNR for penetrating is remapped, and can improve physical network resource utilization rate and VNR receptances.But the algorithm does not account for remapping
Complexity and remap impact to the normal operation of whole network, and service priority may cause business multiformity to be lost
Weighing apparatus.
In sum, there are the following problems for the mapping algorithm in the virtualization of prior art wireless network:(1) VNR have ignored
Impact of the life cycle to the importance of mapping and to physical network income in single timeslice;(2) VNR to having mapped is weighed
During mapping adjustment, compromise consideration is not made to VNR receptances and the cost overhead for remapping.
Content of the invention
For above technical problem, the present invention proposes a kind of time-frequency resource maps based on wireless dummy network life cycle
Method, the present invention utilize life cycle, and bound fraction VNR remaps strategy, realize the VNR mappings of high receptance.
A kind of time-frequency resource maps method based on wireless dummy network life cycle of the present invention, including judging physical network
Whether remaining time/frequency source block is continuous, if being judged as continuously, mapping the VNR of buffer area successively, otherwise, to mapping
Virtual network requests VNR carry out selectivity and remap, then again the VNR of buffer area is mapped successively;The buffer area
VNR include VNR that current time piece reaches and timeslice reaches and fails and mapping and maps in time delay maximum before
VNR.
Preferably, described the virtual network requests VNR for having mapped is carried out selectivity remap including:Calculate replay projection
Factor ξ is rung, the VNR for selecting top n ξ maximum is mapped, if end condition meets, terminate remapping, otherwise circulation is held
This step capable;N is cycle-index, and initial value is 1.
Preferably, remapping factor of influence ξ calculations includes:
ξ=b/ (2 × (f+t))
Wherein, f represents that the sub-carrier resources amount needed for VNR to be mapped, t represent the time slot money needed for VNR to be mapped
Measure in source;ai,jRepresent the corresponding Resource Block of i-th subcarrier, j-th time slot, ai,j=0 represents i-th subcarrier, j-th time slot pair
The Resource Block that answers is idle;ai,j=1 represents that the corresponding Resource Block of i-th subcarrier, j-th time slot is occupied, bi,jRepresent the
The mapping density level EDI of the corresponding Resource Block of j-th time slot of i subcarrier, represents XOR.
Preferably, the end condition include following any one:Physical network residue time/frequency source block be continuous, or
The VNR that person has mapped remap factor of influence ξ be respectively less than set threshold value, or the VNR for having mapped remap impact because
Sub- ξ values no longer change.
Preferably, the VNR to buffer area carries out mapping being reflected including the priority according to VNR from high to low successively
Penetrate;The priority of the VNR determines that according to the life cycle of virtual network requests the i.e. short then priority of life cycle is high, conversely,
Priority is low.
Preferably, there is identical priority if there are multiple VNR, then calculating each VNR to be mapped can make Physical Network
The income that network is obtained, according to income size, preferential mapping can make the VNR that physical network obtains more high yield.
Preferably, each VNR to be mapped includes can the income calculation mode that physical network is obtained:
Wherein, wsS-th virtual network requests revenue factor related to business is represented, its value is fixed according to type of service
Justice, different types of service have different revenue factors, 1/dsRepresent the priority of s-th virtual network requests, AsRepresent s
Time/frequency source block number needed for individual virtual network requests;Need the VNR's of mapping in S (t) t-th timeslice buffer area of expression
Set;S*T () represents the successful VNR set of mapping in t-th timeslice buffer area, K (t) represent t-th timeslice need into
The VNR set that row is remapped, if K (t) is sky, represents that t-th timeslice is not remapped;asijRepresent s-th virtual network
Request is mapped to the corresponding time-frequency resource block position of i-th subcarrier, j-th time slot, wherein i ∈ { 1,2 ..., F }, j ∈ 1,
2 ..., T }, F represents that system orthogonal sub-carriers number, T represent each subcarrier slots number;asij=1 represents s-th virtuality
Network request occupies the corresponding time/frequency source block of i-th subcarrier, j-th time slot in physical network;asij=0 expression is not accounted for
With the corresponding time/frequency source block of i-th subcarrier, j-th time slot in physical network.
Preferably, if under the conditions of equal priority, each VNR to be mapped can make the income also phase that physical network is obtained
With then according to the sequencing of the VNR times of advent, by the strategy that first maps is arrived first, being reflected by Karnaugh map to the VNR in buffer area
Penetrate algorithm to be mapped successively
Compared with prior art, after VNR receptances tend to be steady, the present invention not only makes the receptance of VNR improve 17%
More than, and make physical network obtain higher income.
Description of the drawings
Fig. 1 is time-frequency resource maps method preferred embodiment flow process of the present invention based on wireless dummy network life cycle
Figure;
Fig. 2 is the continuous schematic diagram of physical network of the present invention residue time/frequency source block;
Fig. 3 is the discontinuous schematic diagram of physical network of the present invention residue time/frequency source block;
Fig. 4 is schematic diagram of the present invention based on life cycle priority mapping;
Fig. 5 is virtual network requests receptance simulation comparison figure of the present invention;
Fig. 6 is physical network income simulation comparison figure of the present invention.
Specific embodiment
In order that the objects, technical solutions and advantages of the present invention become more apparent, below in conjunction with accompanying drawing to of the invention real
Apply example further description.
Present system model mainly considers the frequency domain resource and time-domain resource of physical network resource.Physical network resource is used
One bivector (F, T) represents that F represents that system orthogonal sub-carriers number, T represent each subcarrier slots number.F × T tables
Show the Resource Block total number that physical network running time-frequency resource is divided.The set of the frequency domain resource of physical network (1,2 ..., i,
... F) represent, time-domain resource is represented with set (1,2 ..., j ..., T).As shown in Figure 2,3, in figure, horizontal direction represents frequency
Rate, vertical direction represent time slot, and each lattice represents 1 Resource Block, used as the least unit of running time-frequency resource scheduling.
VNO (VNO, Virtual network operator) is reflected for VNR by the timeslice of regular length
Penetrate physical resource.If a VNR is successfully mapped in certain timeslice, the VNR will take mapped physical resource.When
VNR life cycle (i.e. from the time for mapping successfully to release running time-frequency resource occupancy) is through later, its physical resource for taking is released
Put, to receive new VNR.Conversely, a VNR in given timeslice fails to map successfully, then the VNR is put into caching
Area waits next timeslice to again attempt to map.The process is constantly circulated, when the VNR is in time (the i.e. maximum mapping of regulation
Time delay max_delay, represents the maximum time piece number to be mapped such as VNR) in still fail to be mapped to work(, just by which from buffer area
Delete.Each VNR is owned by a life cycle, constructs different priority based on different life cycle.Life cycle is short
Then priority is high, conversely, priority is low.Additionally, the VNR of high priority of the present invention is preferentially mapped, physical network therefore can be made
Obtain higher income.
In the present invention, a virtual network requests VNR can be with a four-tuple (ws,fs,ts,ds) represent.wsIncome because
Son, represent physical network unit running time-frequency resource be mapped to after s-th virtual network requests produced by income, with the virtual net
The type of service of network request is relevant, i.e. distribution same asset amount can bring different incomes to different business, and its value is matched somebody with somebody by VNO
Put;fsRepresent the frequency resource amount needed for s-th virtual network requests;tsRepresent the time slot money needed for s-th virtual network requests
Measure in source;dsRepresent the life cycle of s-th virtual network requests.
In general, the arrival of VNR has randomness, and its arrival situation typically obeys Poisson distribution.Each timeslice is arrived
The VNR for reaching is placed into buffer area, includes VNR and timeslice arrival before and the mapping that fails for reaching recently in the buffer area
And in the maximum VNR mapped in time delay.VNR in buffer area of the present invention ranks according to priority, the high VNR of priority,
Head of the queue is come, preferentially can be mapped.
Each timeslice first determined whether whether physical network residue time/frequency source block is continuous, if sentencing before mapping VNR
Break as continuous, the VNR of buffer area is mapped successively, otherwise, selectivity is carried out to the VNR for having mapped and is remapped, Ran Houzai
The VNR of buffer area is mapped successively.The VNR of the buffer area includes the VNR and timeslice before that current time piece reaches
Reach and fail and map and in the maximum VNR mapped in time delay.
Physical network residue time/frequency source block continuously refers to that all physics residue of network organization Resource Block form connection, such as Fig. 2
Shown, white is surplus resources block (vacant Resource Block), and black is occupied resource block, and all surplus resources blocks formation are linked to be
Connected state, means that physical network surplus resources block is continuous;And as shown in figure 3, the occupied Resource Block of surplus resources block
It is divided into two regions for separating, then it represents that physical network surplus resources block is discontinuous.
If physical network surplus resources block is discontinuous, the virtual network requests VNR for having mapped will not all be carried out
Remap, but select the part VNR for having mapped to be remapped, i.e., selectivity is remapped.
Present invention definition remaps factor of influence ξ, for representing that certain VNR takes the EDI of Physical Resource Block and the VNR institutes
The ratio of area circumference shared by running time-frequency resource is needed, bigger explanation VNR is lower with other VNR aggregation degrees for ξ values, physical network
Remaining running time-frequency resource more disperses.Remapping factor of influence ξ can reflect the VNR for having mapped to the successional shadow of remaining time/frequency source block
Ring.
Alternatively, can adopt existing Karnaugh map mapping algorithm record mapping density level (EDI,
Embedding Density Index, its represent the bar number on border between idling-resource block and occupied resource block) define and attach most importance to
Mapping factor of influence ξ.
Used as another kind of optional mode, the present invention modifies to mapping density level, innovatively adopts below equation meter
Calculation remaps factor of influence ξ:
ξ=b/ (2 × (f+t)) (1)
Wherein, f represents that the sub-carrier resources amount needed for VNR to be mapped, t represent the time slot money needed for VNR to be mapped
Measure in source.ai,jRepresent the corresponding Resource Block of i-th subcarrier, j-th time slot, ai,j=0 represents i-th subcarrier, j-th time slot pair
The Resource Block that answers is idle;ai,j=1 represents that the corresponding Resource Block of i-th subcarrier, j-th time slot is occupied, bi,jRepresent the
The mapping density level EDI of the corresponding Resource Block of j-th time slot of i subcarrier, b represent the Physical Resource Block that certain VNR takes
Mapping density level EDI, represents XOR.
The selectivity remap including:ξ is calculated, (N is cycle-index, and initial value is the VNR of 1) ξ maximums to select top n
Mapped, if end condition meets, terminate remapping, otherwise circulation is executed this step.Sheet is executed in upper once circulation
Before step, N increases by 1 automatically.
Calculate all virtual network requests for having mapped remaps factor of influence ξ values, and the VNR for selecting ξ values big is remapped
To the position that EDI is minimum, to increase the concentration class of physical network residue running time-frequency resource, so as to improve physical network resource utilization
Rate.
The end condition include following any one, physical network residue time/frequency source block is continuous, or reflects
The VNR for penetrating remap factor of influence ξ be respectively less than set threshold value (threshold value is the preferably value obtained after test of many times, this
It is preferably 0.5) in invention, or the factor of influence ξ values that remap of the VNR for having mapped no longer changes.
Preferably as a kind of achievable mode, the VNR to buffer area maps successively, including according to VNR's
Priority is mapped from high to low;The priority of the VNR is according to the determination of the life cycle of virtual network requests, i.e. Life Cycle
Phase, short then priority was high, conversely, priority is low.
Preferably as another kind of achievable mode, there is identical priority if there are multiple VNR, then calculate each
VNR to be mapped can make the income that physical network is obtained, and according to income size, the higher VNR of preferential mapping income, to make
Whole physical network obtains higher income.
Preferably, invention defines revenue function rev (t), represents that t-th timeslice physical network receives s
The income that individual VNR is obtained, its value depend on running time-frequency resource amount and priority needed for revenue factor, VNR:
Wherein, wsS-th virtual network requests revenue factor related to business is represented, its value is fixed according to type of service
Justice, different types of service have different revenue factors, 1/dsRepresent the priority of s-th virtual network requests, AsRepresent s
Unit time/frequency source block number needed for individual virtual network requests, S (t) is represented needs mapping in t-th timeslice buffer area
The set of VNR, S*T () represents that the successful VNR set of mapping in t-th timeslice buffer area, K (t) represent that t-th timeslice is needed
The VNR set for being remapped, if K (t) is sky, represents that t-th timeslice is not remapped;asijRepresent s-th virtuality
Network request is mapped to the corresponding time-frequency resource block position of i-th subcarrier, j-th time slot, wherein i ∈ { 1,2 ..., F }, j ∈
{1,2,...,T};asij=1 s-th virtual network requests of expression occupy i-th subcarrier, j-th time slot pair in physical network
The time/frequency source block that answers;asij=0 represents the corresponding running time-frequency resource of i-th subcarrier, j-th time slot in vacant physical network
Block.
Present invention performance to be investigated is that object function is:For the VNR for arbitrarily mapping in t timeslices is physical network
The income that brings is R (t):
s.t.
Wherein, asijRepresent that s-th virtual network requests is mapped to the corresponding running time-frequency resource of i-th subcarrier, j-th time slot
Block position, csijThe original position of s-th virtual network requests configuration running time-frequency resource is expressed as, and i will be caused, j values are minimum to be made
For original position.
(5-1) it is to ensure that the physical network resource block of mapping is not overlapped;(5-2) represent that already present VNRs may quilt
Remap, the VNRs in buffer area may be mapped;(5-3) it is present to ensure that each VNR has and only one of which csijAs time-frequency
The original position of resource distribution so that csij=1;(5-4) be region limits condition, i.e., the money needed for s-th virtual network requests
Surplus resources area size of the source occupied area size no more than physical network;(5-5) it is asijSpan;(5-6) it is
csijSpan.
For example, as shown in figure 4, three timeslices distinguish the indefinite VNR of random arriving amt, the value difference in bracket
Represent revenue factor, required frequency resource amount, required time interval resource amount and the life cycle of VNR.Wherein revenue factor
Difference, the corresponding maximum mapping time delays of VNR are also different, i.e. VNR3 is identical with the maximum mapping time delay that VNR4 is allowed, and the present invention sets
For 1 timeslice;VNR1 is identical with the maximum mapping time delay that VNR5 is allowed, and the present invention is set to 2 timeslices;VNR2 is allowed most
Big mapping time delay is set to 4 timeslices.Time-frequency resource maps to the VNR shown in Fig. 2, detailed process include:
Fig. 4 (a) represents first timeslice, and the timeslice reaches two virtual network requests VNR1, VNR2.The life of VNR1
The life cycle is 5 for the life cycle of 4, VNR2, and according to life cycle priority mapping principle, the timeslice preferentially maps VNR1,
Secondly VNR2 is mapped;
Fig. 4 (b) represents second timeslice, and the timeslice reaches three virtual network requests VNR3, VNR4 and VNR5.
According to priority, mapping order is followed successively by VNR3, VNR4, VNR5.After having mapped VNR3, the surplus resources of physical network are not
VNR4 can be met, but VNR4 is still mapped in time delay maximum, then put it into buffer area, waits next timeslice to again attempt to reflect
Penetrate;
Fig. 4 (c) represents the 3rd timeslice, and VNR3 mappings terminate, shared physical network time-frequency money during release mapping
Source, successfully maps VNR4.
VNR to buffer area of the present invention maps successively, including being mapped by Karnaugh map to the VNR in buffer area
Algorithm is mapped, and is specifically included:
(1) the remaining running time-frequency resource of physical network is divided into by multiple rectangle running time-frequency resources by Karnaugh map principle of drawing a circle
Block;
(2) Resource Block that can meet running time-frequency resource needed for certain VNR is filtered out, during the rectangle for selecting running time-frequency resource amount minimum
Frequency Resource Block is used as running time-frequency resource to be mapped;
(3) if the running time-frequency resource amount of selected time/frequency source block be more than running time-frequency resource amount needed for the VNR, according to formula (2)-
(3) EDI of each position that may be mapped is calculated, and the corner of energy minimization EDI is selected as final mapping position.
In order to further illustrate a kind of time-frequency resource maps based on wireless dummy network life cycle of present invention offer
Method effectiveness, carries out simulating, verifying to the present invention below, and with static mappings algorithm (Static Embedding) and covet
Greedy dynamic mapping algorithm (Greedy Dynamic Embedding) is contrasted, as shown in Figure 5, Figure 6.In emulation, this is compared
The bright performance with Static Embedding and Greedy Dynamic Embedding, including virtual network requests receptance and
The comparison of physical network income.
Three kinds of business are configured with for virtual network requests in emulation, because physical network income is relevant with type of service, therefore
Different revenue factor w are assigned with to different types of service, and different types of service has also corresponded to different VNRs and allowed
Maximum mapping when postpone max_delay.For example, w=0.5 represents real-time service, if max_delay=1;Such as VIOP;w
=0.3 represents high rate stream media business, if max_delay=2, such as video traffic;W=0.2 represents Best-Effort service,
If max_delay=4, such as file downloading service.Assume that the arrival process of VNR is modeled as one and obeys Poisson of the parameter for λ
Distributed process, the life cycle of VNR obey exponential of the parameter for μ, and λ=5, u=10.Running time-frequency resource needed for VNR is equal
Obey being uniformly distributed for U (2,5).The running time-frequency resource amount of physical network is respectively T=20, F=20.
Can be seen that compared with other two kinds of algorithms from Fig. 5, Fig. 6, the VNR receptances of the present invention have larger lifting, because
Life cycle priority is not taken into full account all for algorithm Static Embedding and Greedy Dynamic Embedding,
So as to result in lower receptance.After VNR receptances tend to be steady, i.e., when timeslice is reached after 200, of the invention and calculation
Method Static Embedding is compared with Greedy Dynamic Embedding, and its receptance has been respectively increased about 20% He
17%, as shown in Figure 5.In each timeslice, the physical network income that the present invention is obtained is all higher than algorithm Static
The physical network income that Embedding and Greedy Dynamic Embedding are obtained, as shown in Figure 6.
The object, technical solutions and advantages of the present invention have been carried out further detailed description, institute by embodiment provided above
It should be understood that embodiment provided above be only the preferred embodiment of the present invention, not in order to limit the present invention, all
Within the spirit and principles in the present invention, any modification, equivalent substitution and improvements made for the present invention etc., should be included in the present invention
Protection domain within.
Claims (8)
1. a kind of time-frequency resource maps method based on wireless dummy network life cycle, it is characterised in that including judging physics
Whether residue of network organization time/frequency source block is continuous, if being judged as continuously, mapping the VNR of buffer area successively, otherwise, to
The virtual network requests VNR of mapping carries out selectivity and remaps, and then again the VNR of buffer area is mapped successively;Described slow
The VNR for depositing area includes VNR that current time piece reaches and timeslice reaches and fail mapping and in maximum mapping before
VNR in prolonging.
2. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 1, its feature exist
In, described the virtual network requests VNR for having mapped is carried out selectivity remap including:Calculating remaps factor of influence ξ, selects
The maximum VNR of top n ξ is mapped, if end condition meets, terminates remapping, and otherwise circulation executes this step;N is
Cycle-index.
3. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 2, its feature exist
In remapping factor of influence ξ calculations includes:
ξ=b/ (2 × (f+t))
Wherein, f represents that the sub-carrier resources amount needed for VNR to be mapped, t represent the time interval resource amount needed for VNR to be mapped;
ai,jRepresent the corresponding Resource Block of i-th subcarrier, j-th time slot, ai,j=0 represents that i-th subcarrier, j-th time slot is corresponding
Resource Block is idle;ai,j=1 represents that the corresponding Resource Block of i-th subcarrier, j-th time slot is occupied, bi,jRepresent i-th
The mapping density level EDI of the corresponding Resource Block of j-th time slot of subcarrier,Represent XOR.
4. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 2, its feature exist
In, the end condition include following any one:Physical network residue time/frequency source block is continuous, or has mapped
The factor of influence ξ that remaps of VNR is respectively less than the threshold value for setting, or the factor of influence ξ values that remap of the VNR for having mapped no longer change
Become.
5. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 1, its feature exist
In the VNR to buffer area carries out mapping being mapped including the priority according to VNR from high to low successively;The VNR's
Priority determines that according to the life cycle of virtual network requests the i.e. short then priority of life cycle is high, conversely, priority is low.
6. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 5, its feature exist
In, there is identical priority if there are multiple VNR, then calculate the income that each VNR to be mapped obtains can physical network,
According to income size, preferential mapping can make the VNR that physical network obtains more high yield.
7. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 6, its feature exist
In each VNR to be mapped includes can the income calculation mode that physical network is obtained:
Wherein, wsRepresent that s-th virtual network requests revenue factor related to business, its value are defined according to type of service, different
Type of service have different revenue factors, 1/dsRepresent the priority of s-th virtual network requests, AsRepresent s-th virtual net
Time/frequency source block number needed for network request;S (t) represents the set of the VNR for needing to map in t-th timeslice buffer area;S*
T () represents that the successful VNR set of mapping in t-th timeslice buffer area, K (t) represent that t-th timeslice needs to be remapped
VNR set, if K (t) for sky, represent t-th timeslice do not remapped;asijRepresent s-th virtual network requests mapping
To the corresponding time-frequency resource block position of i-th subcarrier, j-th time slot, wherein i ∈ { 1,2 ..., F }, j ∈ { 1,2 ..., T },
F represents that system orthogonal sub-carriers number, T represent each subcarrier slots number;asij=1 s-th virtual network requests of expression are accounted for
With the corresponding time/frequency source block of i-th subcarrier, j-th time slot in physical network;asij=0 represents vacant physical network
In the corresponding time/frequency source block of i-th subcarrier, j-th time slot.
8. the time-frequency resource maps method based on wireless dummy network life cycle according to claim 6, its feature exist
In if under the conditions of equal priority, each VNR to be mapped can make the income that physical network is obtained also identical, then according to VNR
The sequencing of the time of advent, by the strategy that first maps is arrived first, is entered by Karnaugh map mapping algorithm successively to the VNR in buffer area
Row mapping.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201611006781.0A CN106507490B (en) | 2016-11-15 | 2016-11-15 | A kind of time-frequency resource maps method based on wireless dummy network life cycle |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201611006781.0A CN106507490B (en) | 2016-11-15 | 2016-11-15 | A kind of time-frequency resource maps method based on wireless dummy network life cycle |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106507490A true CN106507490A (en) | 2017-03-15 |
CN106507490B CN106507490B (en) | 2019-08-16 |
Family
ID=58324705
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201611006781.0A Active CN106507490B (en) | 2016-11-15 | 2016-11-15 | A kind of time-frequency resource maps method based on wireless dummy network life cycle |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106507490B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106792725A (en) * | 2017-03-28 | 2017-05-31 | 重庆邮电大学 | Dynamic allocation method based on sharing frequency spectrum resource in wireless network virtualization |
CN110062424A (en) * | 2019-04-19 | 2019-07-26 | 西安电子科技大学 | A kind of service-oriented frequency spectrum dicing method, device and computer storage medium |
CN111698703A (en) * | 2020-05-25 | 2020-09-22 | 国网河北省电力有限公司石家庄供电分公司 | Network reliability optimization method based on service priority and load balance |
CN114697223A (en) * | 2022-03-22 | 2022-07-01 | 西安交通大学 | Virtual network mapping method based on heaven and earth integrated information network |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150036541A1 (en) * | 2013-07-31 | 2015-02-05 | Tsinghua University | Inter-domain virtual network mapping method and system and inter-domain virtual network |
CN106100964A (en) * | 2016-08-24 | 2016-11-09 | 北京邮电大学 | The method and apparatus that a kind of virtual network maps |
-
2016
- 2016-11-15 CN CN201611006781.0A patent/CN106507490B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150036541A1 (en) * | 2013-07-31 | 2015-02-05 | Tsinghua University | Inter-domain virtual network mapping method and system and inter-domain virtual network |
CN106100964A (en) * | 2016-08-24 | 2016-11-09 | 北京邮电大学 | The method and apparatus that a kind of virtual network maps |
Non-Patent Citations (5)
Title |
---|
FU-TE HSU ET AL.: "Resource Allocation with Spectrum Aggregation for Wireless Virtual Network Embedding", 《2015IEEE》 * |
JONATHAN VAN DE BELT ET AL.: "A Dynamic Embedding Algorithm for Wireless Network Virtualization", 《2014IEEE》 * |
MAO YANG ET AL.: "Karnaugh-map Like Online Embedding Algorithm of Wireless Virtualization", 《WPMC》 * |
卜旭阳等: "基于资源再分配的无线虚拟网络映射算法", 《计算机技术与发展》 * |
曹傧等: "基于最大收益的无线虚拟网络重映射算法", 《重庆邮电大学学报(自然科学版)》 * |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106792725A (en) * | 2017-03-28 | 2017-05-31 | 重庆邮电大学 | Dynamic allocation method based on sharing frequency spectrum resource in wireless network virtualization |
CN106792725B (en) * | 2017-03-28 | 2019-07-19 | 重庆邮电大学 | Dynamic allocation method based on sharing frequency spectrum resource in wireless network virtualization |
CN110062424A (en) * | 2019-04-19 | 2019-07-26 | 西安电子科技大学 | A kind of service-oriented frequency spectrum dicing method, device and computer storage medium |
CN110062424B (en) * | 2019-04-19 | 2021-02-02 | 西安电子科技大学 | Service-oriented spectrum slicing method and device and computer storage medium |
CN111698703A (en) * | 2020-05-25 | 2020-09-22 | 国网河北省电力有限公司石家庄供电分公司 | Network reliability optimization method based on service priority and load balance |
CN111698703B (en) * | 2020-05-25 | 2024-02-20 | 国网河北省电力有限公司石家庄供电分公司 | Network reliability optimization method based on service priority and load balancing |
CN114697223A (en) * | 2022-03-22 | 2022-07-01 | 西安交通大学 | Virtual network mapping method based on heaven and earth integrated information network |
Also Published As
Publication number | Publication date |
---|---|
CN106507490B (en) | 2019-08-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106507490A (en) | A kind of time-frequency resource maps method based on wireless dummy network life cycle | |
CN109409517B (en) | The training method and device of object detection network | |
CN110908795B (en) | Cloud computing cluster mixed part job scheduling method and device, server and storage device | |
CN109791504A (en) | For the dynamic BTS configuration of application container | |
CN106100907B (en) | A kind of MEC server selection method based on fairness | |
CN103906257B (en) | LTE wide-band communication system computing resource schedulers and its dispatching method based on GPP | |
CN107113243A (en) | For the system and method using Virtual network operator managing network flow | |
CN107592219A (en) | Service degradation processing method and processing device | |
CN109923930A (en) | It is managed in 802.11ax network for the QoS of multi-user EDCA transmission mode | |
CN109660376A (en) | A kind of mapping method of virtual network, equipment and storage medium | |
CN106358295B (en) | A kind of resource allocation methods and device | |
CN109040231A (en) | Data transmission method, device, equipment/terminal/server and computer readable storage medium | |
CN109451462A (en) | A kind of In-vehicle networking frequency spectrum resource allocation method based on semi-Markov chain | |
CN103841562B (en) | A kind of time interval resource takes processing method and processing device | |
CN107666448A (en) | A kind of 5G virtual access network mapping methods under time delay perception | |
CN110351764A (en) | A kind of information transferring method, device, base station and computer readable storage medium | |
CN106686352A (en) | Real-time processing method of multiple video data on multi-GPU (multiple graphics processing unit) platform | |
CN107239337A (en) | The distribution of virtual resources and dispatching method and system | |
Martins et al. | Agile optimization for a real‐time facility location problem in Internet of Vehicles networks | |
CN103713852B (en) | A kind of information processing method, service platform and electronic equipment | |
CN106453139A (en) | Method and device of data packet scheduling | |
CN107733805A (en) | Business load dispatching method and device | |
CN105592333B (en) | Information processing method and device | |
CN106851667A (en) | A kind of data processing method and device for air protocol data surface | |
Wang et al. | Two-dimensional resource allocation for OFDMA system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |