CN109039706A - Mist wireless access network collaborative content dispositions method based on graph theory - Google Patents
Mist wireless access network collaborative content dispositions method based on graph theory Download PDFInfo
- Publication number
- CN109039706A CN109039706A CN201810717808.XA CN201810717808A CN109039706A CN 109039706 A CN109039706 A CN 109039706A CN 201810717808 A CN201810717808 A CN 201810717808A CN 109039706 A CN109039706 A CN 109039706A
- Authority
- CN
- China
- Prior art keywords
- content
- mist
- cluster
- node
- radio access
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of mist wireless access network collaborative content dispositions method based on graph theory, it include: that (1) is closed according to the cooperation caching gathering of access layer, construct the popular content set of each cooperation caching cluster and the popular content set of each non-cluster node；(2) the cooperation caching cluster poor and affiliated with load according to the distance between mist radio node, constructs the connection line set of access layer mist radio node(3) according to connection line setConstruct access layer adjacency list set(4) according to setIt obtainsThe corresponding redundant content set of middle each edge(5) according to redundant content setIt calculatesThe cache decision of the corresponding redundant content of middle each edge corrects indicatrix；(6) cache decision for calculating each cooperation caching cluster corrects indicatrix；(7) cache decision for calculating each non-cluster mist radio access node corrects indicatrix；(8) final cache decision is calculated.The present invention determines the cache decision of the F-AP in mist wireless access network cooperatively, and computation complexity is low, total forward pass discharging quantity is higher.
Description
Technical field
The present invention relates to content disposition method more particularly to a kind of mist wireless access network collaborative content deployment based on graph theory
Method.
Background technique
Novel system of the mist wireless access network (F-RAN, Fog-Radio Access Network) as 5G communication system
Framework, the huge advantage of alleviate forward pass congestion with it and reduce communication delay etc., has obtained the extensive concern of the communications field.
Mist radio access node F-AP (Fog-Access Point) in F-RAN can be in non-peak moment buffered in advance prevalence
Hold, this is the key that realize forward pass unloading.But the limited storage space of F-AP, and the content popularit on the overlay area F-AP
It is distributed more dispersed, the edge cache performance gain of F-RAN is thus greatly restricted.Consider neighbouring cooperative node, with
The mode of cooperation disposes content, improves content variety, eliminates caching redundancy, the requested content locally obtained may make to increase
More, cooperation caching can bring huge help further to promote 5G system performance gain.
The problem of collaborative content deployment issue is a NP-hard, can be in the hope of global optimum with dynamic programming method
Solution, but the time complexity of this method is index time complexity.The approximate solution proposed in the past is mainly by content portion
Administration's optimization problem is converted into the dull Submodular function optimization problem for being limited to matroid constraint, then proposes that greedy algorithm solves conversion
Problem afterwards.When using such methods, need complicated calculating process to assess the marginal value of objective function, such methods when
Between complexity be higher order polynomial time complexity about cache node number and content library size.Since content library size is logical
Chang Feichang is big, and in mist wireless access network, F-AP distribution is more intensive, therefore, it is necessary to propose more efficient collaborative content
Dispositions method.
Summary of the invention
Goal of the invention: in view of the problems of the existing technology the present invention, provides a kind of mist wireless access network based on graph theory
Collaborative content dispositions method, this method determine the cache decision of the F-AP of given area in mist wireless access network, meter centralizedly
Calculation complexity is low, forward pass unloading performance is higher.
Technical solution: the mist wireless access network collaborative content dispositions method of the present invention based on graph theory, comprising:
(1) it is closed according to the cooperation caching gathering of access layer, constructs the popular content set of each cooperation caching cluster nWith
And the popular content set of each non-cluster mist radio access node iN=1 ..., N, i=1 ..., I, N, I respectively indicate association
Make the number of caching cluster and non-cluster mist radio access node；
(2) according to the distance and cooperation caching cluster belonging to the poor and mist radio node of load, building between mist radio node
The connection line set ε of access layer mist radio noder；
(3) according to the connection line set εr, construct access layer adjacency list set
(4) according to access layer adjacency list setObtain εrThe corresponding redundant content set of middle each edge
(5) according to redundant content setCalculate εrThe cache decision of the corresponding redundant content of middle each edge corrects instruction
Amount；
(6) according to the popular content set of the updated cooperation caching cluster of step (5), each cooperation caching cluster n phase is calculated
The cache decision amendment indicatrix answered；
(7) indicatrix is corrected according to the cache decision that step (5) obtains, it is corresponding calculates each non-cluster mist radio access node
Cache decision correct indicatrix；
(8) indicatrix is corrected according to the cache decision that step (5)-(7) obtain, calculates final cache decision.
Further, step (1) specifically includes:
(1.1) by access layer mist wireless access point setIn node division at N number of cooperation caching cluster, it is unclustered
Mist radio node constitutes non-cluster mist radio node set
(1.2) n-th of cooperation caching cluster is selected, content library is calculatedIn each content in the cluster of cooperation caching cluster n
Request Probability pnf, and according to requesting Probability p in clusternfDescending sort, by preceding SnKmIn prevalence of a content as cooperation caching cluster n
Hold setWherein, Probability p is requested in clusternfCalculating formula are as follows:
In formula,Represent the set for the mist radio access node for including in cooperation caching cluster n, pmfRepresent mist wireless access
Node F-APmThe request probability of content f on overlay area,λmRepresent mist radio access node F-APmRequest reach
Rate, SnRepresent the quantity of mist radio access node in cooperation caching cluster n, KmRepresent mist radio access node F-APmIt can cache
Content quantity；
(1.3) it for other cooperation caching clusters, is repeated according to (1.2), until obtaining each cooperation caching cluster
Popular content set；
(1.4) i-th of non-cluster mist radio access node is selectedCalculate content libraryIn each content pair
In non-cluster mist radio access node F-APiRequest Probability pif, and according to request Probability pifDescending sort, by preceding KiIt is a most popular
Composition of contents setWherein, KiRepresent mist radio access node F-APiThe content quantity that can be cached；
(1.5) it for other non-cluster mist radio access nodes, is repeated according to (1.4), until obtaining each non-cluster mist
The popular content set of radio access node.
Further, step (2) specifically includes:
(2.1) initialization connection line set εrFor empty set；
(2.2) access layer mist wireless access point set is selectedIn m-th of node F-APm, execute following operation:
Obtain the m' node F-APm', m'=m+1 ..., M, M indicate the number of mist wireless access point, and judgement is
It is no to meet the following conditions:
a、Dmm'≤γd, Lmm'≥γl；Wherein, Dmm′=| | dm-dm′||2, dmAnd dm′Respectively represent mist radio access node
F-APmAnd F-APm'Coordinate in theorem in Euclid space, Lmm′=| | λm-λm′||2, λmAnd λm′Respectively represent mist radio access node F-
APmAnd F-APm'Request arriving rate on overlay area, γdRepresent the threshold value of distance between mist radio access node, γlIt represents negative
The threshold value of difference is carried, | | | |2Indicate L2 norm operator；
B, node F-APmWith node F-APm'Not in the same cooperation caching cluster；
If meeting condition a and b simultaneously, side (F-AP will be connectedm,F-APm') it is added to set εrIn；
(2.3) it is directed to mist wireless access point setIn other nodes, repeated according to step (2.2), until traversal
Complete mist wireless access point setIn all nodes, obtain finally connecting line set εr。
Further, step (3) specifically includes:
(3.1) to access layer mist wireless access point setIn m-th of node F-APm, construct its adjacency list set
(3.2) to the adjacency list set of all F-AP nodes, the adjacency list set that element number is 1 is rejected, it will be remaining
Adjacency list set is gathered according to element number descending sort in setWherein H isMiddle element number.
Further, step (4) specifically includes:
(4.1) for adjacency list setIn k-th of elementExecute following steps:
A, it obtainsIn j-th of element F-APk,jWith first element F-APk,1Connection side e, according to following criterion
Obtain the popular properties collection of the corresponding repetition of connection side e
In formula,Indicate the set for the mist radio access node for including in cooperation caching cluster n,Indicate non-cluster mist without
Line node set Indicate F-APk,jPopular content set, j=2 ..., Jk, JkIt indicatesMiddle element number；
B, for adjacency list setIn other elements, (4.1) are repeated, so that it is corresponding to obtain every connection side
Repeat popular properties collection
(4.2) for adjacency list setIn k-th of elementExecute following steps:
ForIn j-th of element F-APk,j, initialize Kk,j=Km=K, wherein j=1 ..., Jk, JkIt indicatesIn
Element number, m represent mist radio access node F-APk,jGatheringIn serial number, m ∈ { 1 ..., M }, M indicate mist it is wireless
The number of access node, Kk,jAnd KmRepresent mist radio access node F-APk,jFree memory size, K indicate mist without
The maximum free memory size of line access node；
(4.3) for adjacency list setIn k-th of elementExecute following steps:
A, cumulative calculationIn j-th of element F-APk,jWith first element F-APk,1The corresponding repetition in connection side
Popular content intersection of sets collection
If B,Then for setIn j-th of element F-APk,jWith first element F-APk,1Side e,
From setMiddle random selection Kk,1The corresponding redundant content set of a Composition of contents side eAnd according to redundant content set
Update Kk,j, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ...,
Jk') free memory Kk',j'Value be updated to Km, and update connection F-APk,jThe corresponding repetition of other sides e' ≠ e
Popular content setWherein, j=2 ..., Jk；
If C,Then for setIn j-th of element F-APk,jWith first element F-APk,1Side e,
From setMiddle random selectionA content, then together with setIn all the elements constitute
The corresponding redundant content set of side eAnd according to redundant content setUpdate Kk,j, update corresponding Km, and by serial number m
Other mist radio access nodes F-APk',j'(k'> k, j' ∈ 1 ..., Jk') free memory Kk',j'Value update
For Km, and update connection F-APk,jOther sides e' ≠ e corresponding repeat popular properties collectionWherein, j
=2 ..., Jk；
D, for adjacency list setIn other elements, repeat (4.3), to obtain the corresponding redundancy in every connection side
Properties collection
Further, step (5) specifically includes:
(5.1) for adjacency list setIn k-th of elementExecute following steps:
ForIn j-th of element F-APk,j, reset Kk,j=Km=K, wherein j=1 ..., Jk, JkIt indicatesMiddle member
Plain number, m represent mist radio access node F-APk,jGatheringIn serial number, m ∈ { 1 ..., M }, M indicate mist wirelessly connect
The number of ingress, Kk,jAnd KmRepresent mist radio access node F-APk,jFree memory size, K indicate mist it is wireless
The maximum free memory size of access node；
(5.2) for adjacency list setIn k-th of elementExecute following steps:
To setIn j-th of element F-APk,jWith first element F-APk,1The corresponding redundant content collection of connection side e
It closesIt is following four steps operation, j=2 ..., Jk, JkIt indicatesMiddle element number:
1. gatheringIn to find cache location be in F-APk,1Content, this partial content do not allow to be buffered in F-
APk,j, to avoid caching redundancy, then by F-APk,jCorresponding cache decision correct indicatrix Δ xk,j,fIt is set to -1, it may be assumed thatAnd by these contents from setMiddle removal, wherein cache decision amendment
Indicatrix Δ xk,j,f=1 indicates that the cache location of content f is in F-APk,j；
2. gatheringIn find cache location not and allow in F-APk,1Content, this partial content must be buffered in F-
APk,j, then by F-APk,jCorresponding cache decision correct indicatrix Δ xk,j,fIt is set to 1, it may be assumed thatAndWhen, by these contents from setMiddle removal,
Update Kk,j, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ...,
Jk') free memory Kk',j'Value be updated to Km, by these contents from setMiddle removal；Wherein, cache decision is repaired
Positive indicatrix Δ xk,1,fThe cache location of=- 1 expression content f does not allow in F-APk,1；
3. calculating separately will gatherIn content caching in F-APk,1Obtainable forward pass discharging quantityAnd it will collection
It closesIn content caching in F-APK, jObtainable forward pass discharging quantityWherein:
In formula, setRepresent all satisfaction (F-APm,F-APK, 1)∈εrOr (F-APK, 1,F-APm)∈εrMist it is wireless
Access node F-APmThe set of composition, setRepresent all satisfaction (F-APm,F-APK, j)∈εrOr (F-APK, j,F-APm)
∈εrMist radio access node F-APmThe set of composition, λm'Represent mist radio access node F-APm'Request arriving rate, pm'f
Represent mist radio access node F-APm'The request probability of content f, L represent the size of each content on overlay area；
4. ifThen gatherMiddle residue content caching is in F-APk,1It can get higher forward pass discharging quantity,
By F-APk,1Corresponding cache decision amendment indicatrix is set to 1, F-APk,jCorresponding cache decision amendment indicatrix is set to -1,
That is: Δ xk,1.f=1, Δ xk,j.f=-1,AndWhen, by these contents from setMiddle removal, more
New Kk,1, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ...,
Jk') free memory Kk',j'Value be updated to Km；IfThen gatherMiddle residue content caching is in F-
APk,jIt can get higher forward pass discharging quantity, by F-APk,1Corresponding cache decision amendment indicatrix is set to -1, F-APk,jAccordingly
Cache decision amendment indicatrix be set to 1, it may be assumed that Δ xk,j.1=-1, Δ xk,j.f=1,AndWhen,
By these contents from setMiddle removal updates Kk,j, update corresponding Km, and by other mist radio access nodes of serial number m
F-APk',j'(k'> k, j' ∈ 1 ..., Jk') free memory Kk',j'Value be updated to Km；
(5.3) for adjacency list setIn other elements, repeat step (5.2), obtain εrMiddle each edge is corresponding
Redundant content cache decision correct indicatrix.
Further, step (6) specifically includes:
(6-1) executes following steps for n-th of cooperation caching cluster:
A, for first of mist radio access node F-AP in n-th of cooperation caching clustern,lIfThen willCache location be all selected in F-APn,l, accordingly
Cache decision corrects indicatrix Δ xn,l,fIt is set to 1, it may be assumed thatIfThen fromIn at random select Kn,lIt is a, and by F-APn,lAccordingly
Cache decision corrects indicatrix Δ xn,l,fIt is set to 1；Update Kn,l, and by selected content from setMiddle removal；Wherein, Δ
xn,l,fWhether=0 indicate the cache location that can not determine content f in mist radio access node F-APn,l, Kn,lIndicate F-APn,l's
Free memory, l=1 ..., Ln, Ln indicate the node number in cooperation caching cluster n；
B, for F-APn,lIf Kn,l> 0, then from setMiddle random selection Kn,lA content, and will cache and determine accordingly
Plan corrects indicatrix Δ xn,l,fIt is set to 1, updates Kn,l, and by the content of selection from setMiddle removal；Otherwise without processing；
Wherein, l=1 ..., Ln；
(6.2) it for other cooperation caching clusters, is repeated according to (6.1), until it is corresponding to obtain each cooperation caching cluster
Cache decision correct indicatrix.
8, the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, feature exist
In step (7) specifically includes:
(7.1) to non-cluster mist radio node setIn i-th of element F-APiExecute following steps:
If Ki> 0, then will setIn content according to request Probability pifDescending sort,
K before selectingiCorresponding cache decision is corrected indicatrix Δ x by a contentifIt is set to 1；Otherwise operation is not executed；Wherein, KiIt indicates
F-APiFree memory,Indicate full content set, Δ xm′fThe cache location for indicating content f is in F-APm′,Table
Show all satisfaction (APm,APi)∈εrOr (APi,APm)∈εrMist radio access node APmThe set of composition；
(7.2) for non-cluster mist radio node setMiddle other elements repeat (7.1), to obtain each
A corresponding cache decision of non-cluster mist radio access node corrects indicatrix.
Further, step (8) specifically includes:
(8.1) access layer mist wireless access point set is selectedIn m-th of node F-APm, execute following steps:
Searching cache location is in F-APmContent, by these contents in F-APmFinal cache decision be set to 1, it may be assumed that
xmf=1, f ∈ f | Δ xmf=1 }, and by remaining content in F-APmFinal cache decision be set to 0, it may be assumed thatWherein,Indicate full content set, xmfContent f is represented in F-APmFinal caching
Decision；
(8.2) for access layer mist wireless access point setIn other nodes, (8.1) are repeated, to obtain every
The final cache decision of a mist radio access node.
The utility model has the advantages that compared with prior art, the present invention its remarkable advantage is:
1, it by constructing the adjacency list set on vertex, avoids with different vertex to sequentially repeated building same
Side, subsequent calculating largely relevant to side are avoided that repetition, this simplifies calculating from source；
2, on the basis of determining that each edge is corresponding and repeating popular properties collection, in conjunction with the storage of mist radio access node
Bulk further determines that the corresponding redundant content set of each edge, this is eliminated indirectly must not in repetition popular content
The content for causing caching redundancy, further simplifies calculating；
3, the redundant content set of every determining a line then corresponds to these contents from this is connected in remaining of upper vertex
Repetition prevalence properties collection in remove, guarantee will not do the same content on the same mist radio access node delays twice
Decision amendment is deposited, calculating is further simplified；
4, it in a manner of stage by stage, finds first popular in the forward pass unloading maximum cluster of increment for enabling to cooperate in cluster
Properties collection and non-cluster node popular content set, then amendment influences the forward pass unloading to cooperate between cooperation, non-cluster node between cluster
The cache decision of the repetition popular content of amount, at this point, meeting multiple popular contents that repeat of cache location feature can determine simultaneously
Cache decision corrects indicatrix, it is no longer necessary to iteratively calculate the cache location of each content, whole process, which enormously simplifies, to be asked
The operation of the maximum collaborative content deployment of the total forward pass discharging quantity of Xie.
Detailed description of the invention
Fig. 1 is application scenario diagram of the invention；
Fig. 2 is flow diagram of the invention.
Specific embodiment
The present embodiment provides a kind of mist wireless access network collaborative content dispositions method based on graph theory, application scenarios are as schemed
Shown in 1, there are H F-AP, all F-AP to constitute set in mist wireless access network access layerAs shown in Fig. 2, this method includes
Following steps:
(1) it is closed according to the cooperation caching gathering of access layer, constructs the popular content set of each cooperation caching cluster nWith
And the popular content set of each non-cluster mist radio access node iN=1 ..., N, i=1 ..., I, N, I respectively indicate association
Make the number of caching cluster and non-cluster mist radio access node.It specifically includes:
(1.1) by access layer mist wireless access point setIn node division at N number of cooperation caching cluster, unclustered mist
Radio node constitutes non-cluster mist radio node set
(1.2) n-th of cooperation caching cluster is selected, content library is calculatedIn each content in the cluster of cooperation caching cluster n
Request Probability pnf, and according to requesting Probability p in clusternfDescending sort, by preceding SnKmIn prevalence of a content as cooperation caching cluster n
Hold setWherein, Probability p is requested in clusternfCalculating formula are as follows:
In formula,Represent the set for the mist radio access node for including in cooperation caching cluster n, pmfRepresent mist wireless access
Node F-APmThe request probability of content f on overlay area,λmRepresent mist radio access node F-APmRequest reach
Rate, SnRepresent the quantity of mist radio access node in cooperation caching cluster n, KmRepresent mist radio access node F-APmIt can cache
Content quantity；
(1.3) it for other cooperation caching clusters, is repeated according to (1.2), until obtaining each cooperation caching cluster
Popular content set；
(1.4) i-th of non-cluster mist radio access node is selectedCalculate content libraryIn each content pair
In non-cluster mist radio access node F-APiRequest Probability pif, and according to request Probability pifDescending sort, by preceding KiIt is a most popular
Composition of contents setWherein, KiRepresent mist radio access node F-APiThe content quantity that can be cached；
(1.5) it for other non-cluster mist radio access nodes, is repeated according to (1.4), until obtaining each non-cluster mist
The popular content set of radio access node.
(2) according to the distance and cooperation caching cluster belonging to the poor and mist radio node of load, building between mist radio node
The connection line set ε of access layer mist radio noder。
It specifically includes:
(2.1) initialization connection line set εrFor empty set；
(2.2) access layer mist wireless access point set is selectedIn m-th of node F-APm, execute following operation:
Obtain the m' node F-APm', m'=m+1 ..., M, M indicate the number of mist wireless access point, and judgement is
It is no to meet the following conditions:
a、Dmm'≤γd, Lmm'≥γl；Wherein, Dmm′=| | dm-dm′||2, dmAnd dm′Respectively represent mist radio access node
F-APmAnd F-APm'Coordinate in theorem in Euclid space, Lmm′=| | λm-λm′||2, λmAnd λm′Respectively represent mist radio access node F-
APmAnd F-APm'Request arriving rate on overlay area, γdRepresent the threshold value of distance between mist radio access node, γlIt represents negative
The threshold value of difference is carried, | | | |2Indicate L2 norm operator；
B, node F-APmWith node F-APm'Not in the same cooperation caching cluster；
If meeting condition a and b simultaneously, side (F-AP will be connectedm,F-APm') it is added to set εrIn；
(2.3) it is directed to mist wireless access point setIn other nodes, repeated according to step (2.2), until traversal
Complete mist wireless access point setIn all nodes, obtain finally connecting line set εr。
(3) according to the connection line set εr, construct access layer adjacency list setIt specifically includes:
(3.1) to access layer mist wireless access point setIn m-th of node F-APm, construct its adjacency list set
(3.2) to the adjacency list set of all F-AP nodes, the adjacency list set that element number is 1 is rejected, it will be remaining
Adjacency list set is obtained according to element number descending sort in setWherein H isIn
Element number.
(4) according to access layer adjacency list setObtain εrThe corresponding redundant content set of middle each edgeSpecific packet
It includes:
(4.1) for adjacency list setIn k-th of elementExecute following steps:
A, it obtainsIn j-th of element F-APk,jWith first element F-APk,1Connection side e, according to following criterion
Obtain the popular properties collection of the corresponding repetition of connection side e
In formula,Indicate the set for the mist radio access node for including in cooperation caching cluster n,Indicate non-cluster mist without
Line node set Indicate F-APk,jPopular content set, j=2 ..., Jk, JkIt indicatesMiddle element number；
B, for adjacency list setIn other elements, (4.1) are repeated, so that it is corresponding to obtain every connection side
Repeat popular properties collection
(4.2) for adjacency list setIn k-th of elementExecute following steps:
ForIn j-th of element F-APk,j, initialize Kk,j=Km=K, wherein j=1 ..., Jk, JkIt indicatesIn
Element number, m represent mist radio access node F-APk,jGatheringIn serial number, m ∈ { 1 ..., M }, M indicate mist it is wireless
The number of access node, Kk,jAnd KmRepresent mist radio access node F-APk,jFree memory size, K indicate mist without
The maximum free memory size of line access node；
(4.3) for adjacency list setIn k-th of elementExecute following steps:
A, cumulative calculationIn j-th of element F-APk,jWith first element F-APk,1The corresponding repetition in connection side
Popular content intersection of sets collection
If B,Then for setIn j-th of element F-APk,jWith first element F-APk,1Side e,
From setMiddle random selection Kk,1The corresponding redundant content set of a Composition of contents side eAnd according to redundant content set
Update Kk,j, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ...,
Jk') free memory Kk',j'Value be updated to Km, and update connection F-APk,jThe corresponding repetition of other sides e' ≠ e
Popular content setWherein, j=2 ..., Jk；
If C,Then for setIn j-th of element F-APk,jWith first element F-APk,1Side e,
From setMiddle random selectionA content, then together with setIn all the elements constitute
The corresponding redundant content set of side eAnd according to redundant content setUpdate Kk,j, update corresponding Km, and by serial number m
Other mist radio access nodes F-APk',j'(k'> k, j' ∈ 1 ..., Jk') free memory Kk',j'Value update
For Km, and update connection F-APk,jOther sides e' ≠ e corresponding repeat popular properties collectionWherein, j
=2 ..., Jk；
D, for adjacency list setIn other elements, repeat (4.3), to obtain the corresponding redundancy in every connection side
Properties collection
(5) according to redundant content setCalculate εrThe cache decision of the corresponding redundant content of middle each edge corrects instruction
Amount.It specifically includes:
(5-1) is for adjacency list setIn k-th of elementExecute following steps:
ForIn j-th of element F-APk,j, reset Kk,j=Km=K, wherein j=1 ..., Jk, JkIt indicatesMiddle member
Plain number, m represent mist radio access node F-APk,jGatheringIn serial number, m ∈ { 1 ..., M }, M indicate mist wireless access
The number of node, Kk,jAnd KmRepresent mist radio access node F-APk,jFree memory size, K indicate mist wirelessly connect
The maximum free memory size of ingress；
(5-2) is for adjacency list setIn k-th of elementExecute following steps:
To setIn j-th of element F-APk,jWith first element F-APk,1The corresponding redundant content collection of connection side e
It closesIt is following four steps operation, j=2 ..., Jk, JkIt indicatesMiddle element number:
1. gatheringIn to find cache location be in F-APk,1Content, this partial content do not allow to be buffered in F-
APk,j, to avoid caching redundancy, then by F-APk,jCorresponding cache decision correct indicatrix Δ xk,j,fIt is set to -1, it may be assumed that Δ
xk,j,f=-1,And by these contents from setMiddle removal, wherein cache decision amendment refers to
The amount of showing Δ xk,j,f=1 indicates that the cache location of content f is in F-APk,j；
2. gatheringIn find cache location not and allow in F-APk,1Content, this partial content must be buffered in F-
APk,j, then by F-APk,jCorresponding cache decision correct indicatrix Δ xk,j,fIt is set to 1, it may be assumed thatAndWhen, by these contents from setMiddle removal, more
New Kk,j, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ...,
Jk') free memory Kk',j'Value be updated to Km, by these contents from setMiddle removal；Wherein, cache decision is repaired
Positive indicatrix Δ xk,1,fThe cache location of=- 1 expression content f does not allow in F-APk,1；
3. calculating separately will gatherIn content caching in F-APk1Obtainable forward pass discharging quantityAnd it will collection
It closesIn content caching in F-APk,jObtainable forward pass discharging quantityWherein:
In formula, setRepresent all satisfaction (F-APm,F-APK, 1)∈εrOr (F-APK, 1,F-APm)∈εrMist it is wireless
Access node F-APmThe set of composition, setRepresent all satisfaction (F-APm,F-APK, j)∈εrOr (F-APK, j,F-APm)
∈εrMist radio access node F-APmThe set of composition, λm'Represent mist radio access node F-APm'Request arriving rate, pm'f
Represent mist radio access node F-APm'The request probability of content f, L represent the size of each content on overlay area；
4. ifThen gatherMiddle residue content caching is in F-APk,1It can get higher forward pass discharging quantity,
By F-APk,1Corresponding cache decision amendment indicatrix is set to 1, F-APk,jCorresponding cache decision amendment indicatrix is set to -1,
That is: Δ xk,j.1=1, Δ xk,j.f=-1,AndWhen, by these contents from setMiddle removal, more
New corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ..., Jk') it is available
Memory space Kk',j'Value be updated to Km；IfThen gatherMiddle residue content caching is in F-APk,jIt can get more
High forward pass discharging quantity, by F-APk,1Corresponding cache decision amendment indicatrix is set to -1, F-APk,jCorresponding cache decision is repaired
Positive indicatrix is set to 1, it may be assumed that Δ xk,j.1=-1, Δ xk,j.f=1,AndWhen, by these contents from
SetMiddle removal updates Kk,j, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'
> k, j' ∈ 1 ..., Jk') free memory Kk',j'Value be updated to Km；
(5-3) is for adjacency list setIn other elements, repeat step (5-2), obtain εrMiddle each edge is corresponding
Redundant content cache decision correct indicatrix.
(6) according to the popular content set of the updated cooperation caching cluster of step (5), each cooperation caching cluster n phase is calculated
The cache decision amendment indicatrix answered.It specifically includes:
(6-1) executes following steps for n-th of cooperation caching cluster:
A, for first of mist radio access node F-AP in n-th of cooperation caching clustern,lIfThen willCache location be all selected in F-APn,l, accordingly
Cache decision corrects indicatrix Δ xn,l,fIt is set to 1, it may be assumed that Δ xn,l,f=1,IfThen fromIn at random select Kn,lIt is a, and by F-APn,lIt is corresponding slow
Deposit decision amendment indicatrix Δ xn,l,fIt is set to 1；Update Kn,l, and by selected content from setMiddle removal；Wherein, Δ xn,l,f
Whether=0 indicate the cache location that can not determine content f in mist radio access node F-APn,l, Kn,lIndicate F-APn,lIt is available
Memory space, l=1 ..., Ln, Ln indicate the node number in cooperation caching cluster n；
B, for F-APn,lIf Kn,l> 0, then from setMiddle random selection Kn,lA content, and will cache and determine accordingly
Plan corrects indicatrix Δ xn,l,fIt is set to 1, updates Kn,l, and by the content of selection from setMiddle removal；Otherwise without processing；
Wherein, l=1 ..., Ln；
(6.2) it for other cooperation caching clusters, is repeated according to (6.1), until obtaining each cooperation caching cluster
Corresponding cache decision corrects indicatrix.
(7) indicatrix is corrected according to the cache decision that step (5) obtains, it is corresponding calculates each non-cluster mist radio access node
Cache decision correct indicatrix.It specifically includes:
(7.1) to non-cluster mist radio node setIn i-th of element F-APiExecute following steps:
If Ki> 0, then will setIn content according to request Probability pifDescending sort,
K before selectingiCorresponding cache decision is corrected indicatrix Δ x by a contentifIt is set to 1；Otherwise operation is not executed；Wherein, KiIt indicates
F-APiFree memory,Indicate full content set, Δ xm′fThe cache location for indicating content f is in F-APm′,Table
Show all satisfaction (APm,APi)∈εrOr (APi,APm)∈εrMist radio access node APmThe set of composition；
(7.2) for non-cluster mist radio node setMiddle other elements repeat (7.1), to obtain each
A corresponding cache decision of non-cluster mist radio access node corrects indicatrix.
(8) indicatrix is corrected according to the cache decision that step (5)-(7) obtain, calculates final cache decision.Specific packet
It includes:
(8.1) access layer mist wireless access point set is selectedIn m-th of node F-APm, execute following steps:
Searching cache location is in F-APmContent, by these contents in F-APmFinal cache decision be set to 1, it may be assumed that
xmf=1, f ∈ f | Δ xmf=1 }, and by remaining content in F-APmFinal cache decision be set to 0, it may be assumed that xmf=0,Wherein,Indicate full content set, xmfContent f is represented in F-APmFinal cache decision；
(8.2) for access layer mist wireless access point setIn other nodes, (8.1) are repeated, to obtain every
The final cache decision of a mist radio access node.
Above disclosed is only a preferred embodiment of the present invention, and the right model of the present invention cannot be limited with this
It encloses, therefore equivalent changes made in accordance with the claims of the present invention, is still within the scope of the present invention.
Claims (9)
1. a kind of mist wireless access network collaborative content dispositions method based on graph theory, it is characterised in that this method comprises:
(1) it is closed according to the cooperation caching gathering of access layer, constructs the popular content set of each cooperation caching cluster nAnd it is every
The popular content set of one non-cluster mist radio access node iN=1 ..., N, i=1 ..., I, it is slow that N, I respectively indicate cooperation
Deposit the number of cluster and non-cluster mist radio access node；
(2) it is accessed according to the distance between mist radio node with cooperation caching cluster belonging to poor and mist radio node, building is loaded
The connection line set ε of layer mist radio noder；
(3) according to the connection line set εr, construct access layer adjacency list set
(4) according to access layer adjacency list setObtain εrThe corresponding redundant content set of middle each edge
(5) according to redundant content setCalculate εrThe cache decision of the corresponding redundant content of middle each edge corrects indicatrix；
(6) according to the popular content set of the updated cooperation caching cluster of step (5), it is corresponding to calculate each cooperation caching cluster n
Cache decision corrects indicatrix；
(7) indicatrix is corrected according to the cache decision that step (5) obtains, calculates each non-cluster mist radio access node and delays accordingly
Deposit decision amendment indicatrix；
(8) indicatrix is corrected according to the cache decision that step (5)-(7) obtain, calculates final cache decision.
2. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, it is characterised in that: step
Suddenly (1) specifically includes:
(1.1) by access layer mist wireless access point setIn node division at N number of cooperation caching cluster, unclustered mist is wireless
Node constitutes non-cluster mist radio node set
(1.2) n-th of cooperation caching cluster is selected, content library is calculatedIn each content for being requested in the cluster of cooperation caching cluster n
Probability pnf, and according to requesting Probability p in clusternfDescending sort, by preceding SnKmPopular content collection of a content as cooperation caching cluster n
It closesWherein, Probability p is requested in clusternfCalculating formula are as follows:
In formula,Represent the set for the mist radio access node for including in cooperation caching cluster n, pmfRepresent mist radio access node
F-APmThe request probability of content f on overlay area,λmRepresent mist radio access node F-APmRequest arriving rate, Sn
Represent the quantity of mist radio access node in cooperation caching cluster n, KmRepresent mist radio access node F-APmThe content that can be cached
Quantity；
(1.3) it for other cooperation caching clusters, is repeated according to (1.2), until obtaining the prevalence of each cooperation caching cluster
Properties collection；
(1.4) i-th of non-cluster mist radio access node is selectedCalculate content libraryIn each content for non-
Cluster mist radio access node F-APiRequest Probability pif, and according to request Probability pifDescending sort, by preceding KiA most popular content
Constitute setWherein, KiRepresent mist radio access node F-APiThe content quantity that can be cached；
(1.5) it for other non-cluster mist radio access nodes, is repeated according to (1.4), until it is wireless to obtain each non-cluster mist
The popular content set of access node.
3. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, it is characterised in that: step
Suddenly (2) specifically include:
(2.1) initialization connection line set εrFor empty set；
(2.2) access layer mist wireless access point set is selectedIn m-th of node F-APm, execute following operation:
Obtain the m' node F-APm', m'=m+1 ..., M, M indicate the number of mist wireless access point, judge whether full
Sufficient the following conditions:
a、Dmm'≤γd, Lmm'≥γl；Wherein, Dmm′=| | dm-dm′||2, dmAnd dm′Respectively represent mist radio access node F-APm
And F-APm'Coordinate in theorem in Euclid space, Lmm′=| | λm-λm′||2, λmAnd λm′Respectively represent mist radio access node F-APmWith
F-APm'Request arriving rate on overlay area, γdRepresent the threshold value of distance between mist radio access node, γlIt is poor to represent load
Threshold value, | | | |2Indicate L2 norm operator；
B, node F-APmWith node F-APm'Not in the same cooperation caching cluster；
If meeting condition a and b simultaneously, side (F-AP will be connectedm,F-APm') it is added to set εrIn；
(2.3) it is directed to mist wireless access point setIn other nodes, repeated according to step (2.2), until traversed mist
Wireless access point setIn all nodes, obtain finally connecting line set εr。
4. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, it is characterised in that: step
Suddenly (3) specifically include:
(3.1) to access layer mist wireless access point setIn m-th of node F-APm, construct its adjacency list set
(3.2) to the adjacency list set of all F-AP nodes, the adjacency list set that element number is 1 is rejected, by remaining adjoining
Table set is gathered according to element number descending sort in setWherein H isIn
Element number.
5. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, it is characterised in that: step
Suddenly (4) specifically include:
(4.1) for adjacency list setIn k-th of elementExecute following steps:
A, it obtainsIn j-th of element F-APk,jWith first element F-APk,1Connection side e, according to following criterion obtain connect
Edge fit e is corresponding to repeat popular properties collection
In formula,Indicate the set for the mist radio access node for including in cooperation caching cluster n,Indicate that non-cluster mist wirelessly saves
Point set Indicate F-APk,jPopular content set, j=2 ..., Jk, JkIt indicatesMiddle element number；
B, for adjacency list setIn other elements, (4.1) are repeated, to obtain the corresponding repetition in every connection side
Popular content set
(4.2) for adjacency list setIn k-th of elementExecute following steps:
ForIn j-th of element F-APk,j, initialize Kk,j=Km=K, wherein j=1 ..., Jk, JkIt indicatesMiddle element
Number, m represent mist radio access node F-APk,jGatheringIn serial number, m ∈ { 1 ..., M }, M indicate mist wireless access
The number of node, Kk,jAnd KmRepresent mist radio access node F-APk,jFree memory size, K indicate mist wirelessly connect
The maximum free memory size of ingress；
(4.3) for adjacency list setIn k-th of elementExecute following steps:
A, cumulative calculationIn j-th of element F-APk,jWith first element F-APk,1Connection side it is corresponding repeat prevalence in
Hold intersection of sets collection
If B,Then for setIn j-th of element F-APk,jWith first element F-APk,1Side e, from collection
It closesMiddle random selection Kk,1The corresponding redundant content set of a Composition of contents side eAnd according to redundant content setMore
New Kk,j, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ...,
Jk') free memory Kk',j'Value be updated to Km, and update connection F-APk,jThe corresponding repetition of other sides e' ≠ e
Popular content setWherein, j=2 ..., Jk；
If C,Then for setIn j-th of element F-APk,jWith first element F-APk,1Side e, from collection
It closesMiddle random selectionA content, then together with setIn all the elements constitute side e
Corresponding redundant content setAnd according to redundant content setUpdate Kk,j, update corresponding Km, and by serial number m's
Other mist radio access nodes F-APk',j'(k'> k, j' ∈ 1 ..., Jk') free memory Kk',j'Value be updated to
Km, and update connection F-APk,jOther sides e' ≠ e corresponding repeat popular properties collectionWherein, j=
2,…,Jk；
D, for adjacency list setIn other elements, repeat (4.3), to obtain the corresponding redundant content in every connection side
Set
6. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, it is characterised in that: step
Suddenly (5) specifically include:
(5.1) for adjacency list setIn k-th of elementExecute following steps:
ForIn j-th of element F-APk,j, reset Kk,j=Km=K, wherein j=1 ..., Jk, JkIt indicatesMiddle element
Number, m represent mist radio access node F-APk,jGatheringIn serial number, m ∈ { 1 ..., M }, M indicate mist wireless access section
The number of point, Kk,jAnd KmRepresent mist radio access node F-APk,jFree memory size, K indicate mist wireless access
The maximum free memory size of node；
(5.2) for adjacency list setIn k-th of elementExecute following steps:
To setIn j-th of element F-APk,jWith first element F-APk,1The corresponding redundant content set of connection side e
It is following four steps operation, j=2 ..., Jk, JkIt indicatesMiddle element number:
1. gatheringIn to find cache location be in F-APk,1Content, this partial content do not allow to be buffered in F-APk,j, with
Caching redundancy is avoided, then by F-APk,jCorresponding cache decision correct indicatrix Δ xk,j,fIt is set to -1, it may be assumed that Δ xk,j,f=-1,And by these contents from setMiddle removal, wherein cache decision corrects indicatrix Δ xk,j,f
=1 indicates that the cache location of content f is in F-APk,j；
2. gatheringIn find cache location not and allow in F-APk,1Content, this partial content must be buffered in F-APk,j,
Then by F-APk,jCorresponding cache decision correct indicatrix Δ xk,j,fIt is set to 1, it may be assumed that Δ xk,j.f=1,AndWhen, by these contents from setMiddle removal updates Kk,j, more
New corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ..., Jk') it is available
Memory space Kk',j'Value be updated to Km, by these contents from setMiddle removal；Wherein, cache decision corrects indicatrix Δ
xk,1,fThe cache location of=- 1 expression content f does not allow in F-APk,1；
3. calculating separately will gatherIn content caching in F-APk,1Obtainable forward pass discharging quantityAnd it will setIn content caching in F-APk,jObtainable forward pass discharging quantityWherein:
In formula, setRepresent all satisfaction (F-APm,F-APK, 1)∈εrOr (F-APK, 1,F-APm)∈εrMist wireless access
Node F-APmThe set of composition, setRepresent all satisfaction (F-APm,F-APK, j)∈εrOr (F-APK, j,F-APm)∈εr
Mist radio access node F-APmThe set of composition, λm'Represent mist radio access node F-APm'Request arriving rate, pm'fIt represents
Mist radio access node F-APm'The request probability of content f, L represent the size of each content on overlay area；
4. ifThen gatherMiddle residue content caching is in F-APk,1It can get higher forward pass discharging quantity, by F-
APk,1Corresponding cache decision amendment indicatrix is set to 1, F-APk,jCorresponding cache decision amendment indicatrix is set to -1, it may be assumed that Δ
xk,1.f=1, Δ xk,j.f=-1,AndWhen, by these contents from setMiddle removal updates
Kk,1, update corresponding Km, and by other mist radio access nodes F-AP of serial number mk',j'(k'> k, j' ∈ 1 ..., Jk'})
Free memory Kk',j'Value be updated to Km；IfThen gatherMiddle residue content caching is in F-APk,jIt can
Higher forward pass discharging quantity is obtained, by F-APk,1Corresponding cache decision amendment indicatrix is set to -1, F-APk,jCorresponding caching
Decision amendment indicatrix is set to 1, it may be assumed that Δ xk,j.1=-1, Δ xk,j.f=1,AndWhen, by these
Content is from setMiddle removal updates Kk,j, update corresponding Km, and by other mist radio access nodes F- of serial number m
APk',j'(k'> k, j' ∈ 1 ..., Jk') free memory Kk',j'Value be updated to Km；
(5.3) for adjacency list setIn other elements, repeat step (5.2), obtain εrMiddle each edge is corresponding superfluous
The cache decision of remaining content corrects indicatrix.
7. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, it is characterised in that: step
Suddenly (6) specifically include:
(6-1) executes following steps for n-th of cooperation caching cluster:
A, for first of mist radio access node F-AP in n-th of cooperation caching clustern,lIf
Then willCache location be all selected in F-APn,l, corresponding cache decision amendment indicatrix Δ
xn,l,fIt is set to 1, it may be assumed that Δ xn,l,f=1,IfThen fromIn at random select Kn,lIt is a, and by F-APn,lCorresponding cache decision corrects indicatrix Δ xn,l,fIt is set to
1；Update Kn,l, and by selected content from setMiddle removal；Wherein, Δ xn,l,f=0 indicates not determining the caching of content f
Whether position is in mist radio access node F-APn,l, Kn,lIndicate F-APn,lFree memory, l=1 ..., Ln, Ln indicate
Node number in cooperation caching cluster n；
B, for F-APn,lIf Kn,l> 0, then from setMiddle random selection Kn,lA content, and corresponding cache decision is repaired
Positive indicatrix Δ xn,l,fIt is set to 1, updates Kn,l, and by the content of selection from setMiddle removal；Otherwise without processing；Its
In, l=1 ..., Ln；
(6.2) it for other cooperation caching clusters, repeats according to (6.1), delays accordingly until obtaining each cooperation caching cluster
Deposit decision amendment indicatrix.
8. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, which is characterized in that step
Suddenly (7) specifically include:
(7.1) to non-cluster mist radio node setIn i-th of element F-APiExecute following steps:
If Ki> 0, then will setIn content according to request Probability pifDescending sort, selection
Preceding KiCorresponding cache decision is corrected indicatrix Δ x by a contentifIt is set to 1；Otherwise operation is not executed；Wherein, KiIndicate F-APi
Free memory,Indicate full content set, Δ xm′fThe cache location for indicating content f is in F-APm',Indicate institute
There is satisfaction (APm,APi)∈εrOr (APi,APm)∈εrMist radio access node APmThe set of composition；
(7.2) for non-cluster mist radio node setMiddle other elements repeat (7.1), so that it is non-to obtain each
The corresponding cache decision of cluster mist radio access node corrects indicatrix.
9. the mist wireless access network collaborative content dispositions method according to claim 1 based on graph theory, which is characterized in that step
Suddenly (8) specifically include:
(8.1) access layer mist wireless access point set is selectedIn m-th of node F-APm, execute following steps:
Searching cache location is in F-APmContent, by these contents in F-APmFinal cache decision be set to 1, it may be assumed that xmf=1,
f∈{f|Δxmf=1 }, and by remaining content in F-APmFinal cache decision be set to 0, it may be assumed that xmf=0,Wherein,Indicate full content set, xmfContent f is represented in F-APmFinal cache decision；
(8.2) for access layer mist wireless access point setIn other nodes, (8.1) are repeated, to obtain each mist
The final cache decision of radio access node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810717808.XA CN109039706B (en) | 2018-07-03 | 2018-07-03 | Fog wireless access network collaboration content deployment method based on graph theory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810717808.XA CN109039706B (en) | 2018-07-03 | 2018-07-03 | Fog wireless access network collaboration content deployment method based on graph theory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109039706A true CN109039706A (en) | 2018-12-18 |
| CN109039706B CN109039706B (en) | 2021-05-11 |
Family
ID=65522262
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810717808.XA Active CN109039706B (en) | 2018-07-03 | 2018-07-03 | Fog wireless access network collaboration content deployment method based on graph theory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109039706B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109831790A (en) * | 2019-03-05 | 2019-05-31 | 东南大学 | Cooperation caching method based on brainstorming optimization algorithm in mist wireless access network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107040931A (en) * | 2017-04-05 | 2017-08-11 | 北京邮电大学 | A kind of wireless and caching Resource co-allocation method of mist Radio Access Network |
| CN108156617A (en) * | 2017-11-23 | 2018-06-12 | 东南大学 | Cooperation caching method based on graph theory in a kind of mist wireless access network |
-
2018
- 2018-07-03 CN CN201810717808.XA patent/CN109039706B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107040931A (en) * | 2017-04-05 | 2017-08-11 | 北京邮电大学 | A kind of wireless and caching Resource co-allocation method of mist Radio Access Network |
| CN108156617A (en) * | 2017-11-23 | 2018-06-12 | 东南大学 | Cooperation caching method based on graph theory in a kind of mist wireless access network |
Non-Patent Citations (1)
| Title |
|---|
| 崔潇婷 等: "Graph-based Cooperative Caching in Fog-RAN", 《NETWORKING AND COMMUNICATION》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109831790A (en) * | 2019-03-05 | 2019-05-31 | 东南大学 | Cooperation caching method based on brainstorming optimization algorithm in mist wireless access network |
| CN109831790B (en) * | 2019-03-05 | 2021-11-12 | 东南大学 | Cooperative caching method based on brainstorming optimization algorithm in fog wireless access network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109039706B (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108260169B (en) | QoS guarantee-based dynamic service function chain deployment method | |
| CN108156617A (en) | Cooperation caching method based on graph theory in a kind of mist wireless access network | |
| CN108684046B (en) | Random learning-based access network service function chain deployment method | |
| CN112020103A (en) | Content cache deployment method in mobile edge cloud | |
| CN112953761B (en) | Virtual-real resource mapping method for virtual network construction in multi-hop network | |
| CN104168620A (en) | Route establishing method in wireless multi-hop backhaul network | |
| CN110365568A (en) | A kind of mapping method of virtual network based on deeply study | |
| CN107196806B (en) | Topological proximity matching virtual network mapping method based on sub-graph radiation | |
| CN109104464A (en) | A kind of distributed data update method towards collaboration storage under edge calculations environment | |
| CN105681153A (en) | Virtual network mapping method and device | |
| CN108259628A (en) | Content caching and user-association combined optimization method in isomery cellular network | |
| CN111885493B (en) | Micro-cloud deployment method based on improved cuckoo search algorithm | |
| CN106792995A (en) | The user access method of content low time delay transmission is ensured in a kind of following 5G networks | |
| CN113993168B (en) | Collaborative caching method based on multi-agent reinforcement learning in fog wireless access network | |
| CN109039706A (en) | Mist wireless access network collaborative content dispositions method based on graph theory | |
| CN110120892B (en) | SDN multi-controller deployment method and system based on improved firefly algorithm | |
| CN116050540A (en) | Self-adaptive federal edge learning method based on joint bi-dimensional user scheduling | |
| CN106686399A (en) | Intra-network video buffering method based on combined buffering architecture | |
| CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
| CN115248811B (en) | Scalable collaborative blockchain block storage method and device | |
| CN116634504A (en) | Unmanned aerial vehicle networking topology relation and bandwidth allocation optimization strategy based on improved NSGA-II algorithm | |
| Elkael et al. | Improved monte carlo tree search for virtual network embedding | |
| CN106056330B (en) | A kind of multistage guarantee dispositions method based on networked system | |
| US10868764B2 (en) | Route calculation control device and route calculation control method | |
| CN114884825B (en) | Network planning method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 |