CN108156617A - Cooperation caching method based on graph theory in a kind of mist wireless access network - Google Patents
Cooperation caching method based on graph theory in a kind of mist wireless access network Download PDFInfo
- Publication number
- CN108156617A CN108156617A CN201711181927.XA CN201711181927A CN108156617A CN 108156617 A CN108156617 A CN 108156617A CN 201711181927 A CN201711181927 A CN 201711181927A CN 108156617 A CN108156617 A CN 108156617A
- Authority
- CN
- China
- Prior art keywords
- vertex
- cluster
- cooperation caching
- candidate
- node
- 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
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the cooperation caching methods based on graph theory in a kind of mist wireless access network, include the following steps：1st, it is poor according to the distance between F AP nodes and load, the connection line set of structure access layer F AP；2nd, access layer adjacency list set is built；3rd, maximum complete subgraph is built4th, to F AP node division candidate's cooperation caching clusters of access layer, and the forward pass unloading increment size of each candidate cooperation caching cluster is calculated5th, using candidate cooperation caching cluster as vertex, forward pass unloads increment size as weights, and side, structure figure are established between the corresponding vertex of the candidate cooperation caching cluster of two differences containing identical F AP；6th, the most authority independent subset of vertex set is solved, the candidate cooperation caching cluster of vertex correspondence is to close the cooperation caching gathering of forward pass discharging quantity maximum in the most authority independent subset.This method can carry out reasonable sub-clustering, and computation complexity is low, global performance is higher to the F AP in mist wireless access network.
Description
Technical field
The present invention relates to the cooperation caching methods based on graph theory in a kind of mist wireless access network, belong to 5G mobile communication system
In caching technology field.
Background technology
Novel system of the mist wireless access network (F-RAN, Fog-Radio Access Network) as 5G communication systems
Framework with the huge advantage that it alleviates forward pass congestion and reduces 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 that forward pass unloading and time delay reduce.But the limited storage space of F-AP, and on F-AP overlay areas
Content popularit distribution more disperses, the edge cache performance gain of F-RAN thus greatly restricted.F-AP is divided into
Cluster, deployment and shared buffer memory content cooperatively between node, may be such that the buffer memory capacity in node cluster expands, in cluster
Content popularit distribution situation also improves therewith, and cooperation caching can be further to promote 5G system performance gains to bring huge side
It helps.
Since the content popularit distributional difference between F-AP is complex in actual scene, and dense deployment is presented in F-AP
State, the content requests on F-AP overlay areas reach that rate also changes over time and uneven distribution, these factors cause from big
Rapidly and accurately select suitable cooperative node cluster extremely difficult in the mist radio access node of amount, without accurate sub-clustering scheme
The Local Property of cooperation caching is easily caused to be promoted and the result of global poor-performing.
It is previous it has been assumed that content popularit on different mist radio access node overlay area in mist wireless access network
All same is distributed, that is, obeys global content popularit distribution, under this assumed condition, if cluster interior nodes quantity is identical, selection
Which node cluster cooperate on the performance gain of cooperation caching be do not have it is influential, and under actual conditions, because user is had
Standby exclusive content-preference, there is more complicated differences for the content popularit distribution on different regions, are considering
After the otherness being distributed to local content popularity, the building mode of cooperative cluster directly affects content popularit in cluster and is distributed,
Forward pass discharging quantity is can be obtained so as to influence cache contents deployment and all node cooperation cachings, how by dense deployment
Mist radio access node is rapidly and accurately configured to suitable cooperative cluster so that in cluster content popularit be distributed centrality and
The otherness that content popularit is distributed between cluster is optimised, so as to promote all mist radio access node cooperations to the greatest extent
The problem of total forward pass discharging quantity of caching, this is one extremely complex.
Invention content
Goal of the invention：For problems of the prior art, the present invention provides be based in a kind of mist wireless access network
The cooperation caching method of graph theory, this method can carry out the F-AP in mist wireless access network reasonable sub-clustering, and computation complexity
Low, global performance is higher.
Technical solution：The present invention adopts the following technical scheme that：
Cooperation caching method based on graph theory in a kind of mist wireless access network has N in the mist wireless access network access layer
A F-AP, all F-AP form setInclude the following steps：
(1) it is poor according to the distance between F-AP nodes and load, the connection line set ε of structure access layer F-AP；
(2) according to the side articulation set ε of access layer F-AP, access layer adjacency list set is built
(3) according to access layer adjacency list setThe maximum complete subgraph of structure
(4) to F-AP node division candidate's cooperation caching clusters of access layer, and before each candidate cooperation caching cluster of calculating
Pass unloading increment size
(5) using each the candidate cooperation caching cluster obtained in step (4) as a vertex, containing identical F-AP's
The candidate cooperation caching cluster of two differences establishes side between corresponding vertex, and structure is schemed, and enables the weights on n-th of vertex
Wherein,It is the forward pass unloading increment size of the candidate cooperation caching cluster of n-th acquired in step (4)；
(6) to the figure built in step (5), the most authority independent subset of vertex set, the independent son of the most authority are solved
The candidate cooperation caching cluster for concentrating vertex correspondence is to close the cooperation caching gathering of forward pass discharging quantity maximum.
Step (1) specifically includes：It is empty set to initialize set ε, is traversedIn element, it is rightIn m-th of node APm,
Traverse other N-1 node APm'If meet condition Dmm'≤γd, and Lmm'≥γl, and there is no node to (AP in set εm',
APm), then by node to (APm,APm') be added in set ε.
Step (2) specifically includes：
(2.1) to setIn each F-AP nodes, build its adjacency list set, forIn m-th of node APm,
Its adjacency list setBy node APm, it is all with node APmThe node connected by side forms, i.e.,：
(2.2) it to the adjacency list set of all F-AP nodes, rejects element number and is 1 or itself is other F-AP nodes
The adjacency list set of the subset of adjacency list set, by remaining adjacency list set according to element number descending sort, structure in set
Build setWherein M is remaining adjacency list set number after rejecting.
Step (3) specifically includes：
InitializationFor empty set, i=1, to setIn each element perform following steps：
Selected setIn i-th of elementK=1, j=1, set T ' are initialized asTo setIn
J-th of elements A PjAdjacency list setIt does following (A) and (B) and judges intersection operation：
(A) ifThen build k-th of setAnd it updatesK=k+1；
(B) ifThenIt remains unchanged, and updates j=j+1.
With the variation of j, to setIn each element perform successively more than (A) and (B) judge intersection operation,
It is obtained in the T ' and each calculating process that are obtained after operationBecomeIn element add
It is added toIn, and update i=i+1.
With the variation of i, to setIn each element perform successively more than calculate, every time calculate all will obtainIn
Element, to setIn all elements perform above calculate after, can obtain completeSet.
Step (4) specifically includes：
The set obtained to step (3)In the corresponding maximum complete subgraph vertex set of each element split,
The condition that the subclass element number split out is not less than 2 need to be met during fractionation；
Element in each subclass forms the vertex of corresponding complete subgraph, the corresponding mist radio access node of subclass
Set forms a candidate cooperation caching cluster, calculates the forward pass unloading increment size of each candidate cluster, and the forward pass of n-th of candidate cluster unloads
Carry increment sizeCalculating formula is：
WhereinRepresent n-th of candidate cluster, APqRepresent the mist radio access node in cluster, λqRepresent mist wireless access section
Point APqRequest arriving rate on overlay area, the serial number of content that f representatives are arranged according to popularity descending,It is wireless to represent mist
Access node APqThe request probability of f-th of local most popular content on overlay area, K, which represents mist radio access node m, to be delayed
The content quantity deposited,Represent the request probability of most popular content in f-th of cluster in n-th of candidate cluster, KnRepresent n-th of time
The quantity for differing content of all mist radio access node cooperation cachings in cluster is selected, L represents the size of each content.
Solve most authority independent subset the specific steps are：
A vertex is selected at random as initial vertex, and the top for having side to connect with the vertex is then rejected in vertex set
Point, this vertex rejected form a vertex subset；A vertex of maximum weight is selected in remaining vertex, is repeated above-mentioned
The process with vertex subset structure is rejected, until vertex set is sky, the vertex rejected every time forms the one of original vertices set
Group independent subset, using each vertex in vertex set successively as initial vertex, can obtain multigroup independent subset accordingly,
One group that vertex total weight value maximum is selected in all independent subsets, the as required forward pass discharging quantity of corresponding candidate cluster is most
Big cooperation caching gathering is closed.
Advantageous effect：Compared with prior art, the cooperation based on graph theory in mist wireless access network disclosed by the invention is delayed
The method of depositing has the following advantages：1st, it by building the adjacency list set on vertex, avoids same from different vertex repeat search
The situation of maximum complete subgraph does rejecting processing to adjacency list set, and it is other maximums to avoid the complete subgraph that search obtains
The situation of a part of this invalid search of complete subgraph, the low complex degree for being conducive to cooperation caching method are realized；2nd, pass through collection
Close to decompose and be quickly obtained candidate cluster, consider the forward pass unloading increment under different cooperation modes comprehensively, convenient for solve global performance compared with
High cooperation caching gathering is closed；3rd, in a manner of stage by stage, first with can the maximum complete subgraph of low complex degree search advantage
Candidate cluster quickly is acquired, forward pass discharging quantity maximum is then solved with polynomial time using the characteristics of most authority independent subset
Non-intersect candidate cluster, whole process enormously simplify the operation of the cooperative cluster of direct solution forward pass discharging quantity maximum.
Description of the drawings
Fig. 1 is the application scenario diagram of the cooperation caching method based on graph theory in mist wireless access network；
Fig. 2 is the flow diagram that the present invention discloses method.
Specific embodiment
The invention discloses the cooperation caching method based on graph theory in a kind of mist wireless access network, below in conjunction with the accompanying drawings into
One step illustrates the present invention.
Cooperation caching method based on graph theory in a kind of mist wireless access network has N in the mist wireless access network access layer
A F-AP, all F-AP form setInclude the following steps：
(1) it is poor according to the distance between F-AP nodes and load, the connection line set ε of structure access layer F-AP；
It is empty set to initialize set ε, is traversedIn element, it is rightIn m-th of node APm, traverse other N-1 section
Point APm'If meet condition Dmm'≤γd, and Lmm'≥γl, and there is no node to (AP in set εm',APm), then by node pair
(APm,APm') be added in set ε.Dmm′=| | dm-dm′||2, dmAnd dm′Mist radio access node AP is represented respectivelymAnd APm'
Coordinate in theorem in Euclid space, Lmm′=| | λm-λm′||2, λmAnd λm′Mist radio access node AP is represented respectivelymAnd APm'Overlay area
On request arriving rate, γdRepresent the threshold value of distance between mist radio access node, γlRepresent the threshold value of load difference.||·||2
Represent L2 norm operators.
(2) according to the side articulation set ε of access layer F-AP, access layer adjacency list set is built
(2.1) to setIn each F-AP nodes, build its adjacency list set, forIn m-th of node APm,
Its adjacency list setBy node APm, it is all with node APmThe node connected by side forms, i.e.,：
(2.2) it to the adjacency list set of all F-AP nodes, rejects element number and is 1 or itself is other F-AP nodes
The adjacency list set of the subset of adjacency list set, by remaining adjacency list set according to element number descending sort, structure in set
Build setWherein M is remaining adjacency list set number after rejecting.
(3) according to access layer adjacency list setThe maximum complete subgraph of structure
InitializationFor empty set, i=1, to setIn each element perform following steps：
Selected setIn i-th of elementK=1, j=1, set T ' are initialized asTo setIn
J-th of elements A PjAdjacency list setIt does following (A) and (B) and judges intersection operation：
(A) ifThen build k-th of setAnd it updatesK=k+1；
(B) ifThen T ' is remained unchanged, and updates j=j+1.
With the variation of j, to setIn each element perform successively more than (A) and (B) judge intersection operation,
It is obtained in the T ' and each calculating process that are obtained after operationBecomeIn element add
It is added toIn, and update i=i+1.
With the variation of i, to setIn each element perform successively more than calculate, every time calculate all will obtainIn
Element, to setIn all elements perform above calculate after, can obtain completeSet.
(4) to F-AP node division candidate's cooperation caching clusters of access layer, and before each candidate cooperation caching cluster of calculating
Pass unloading increment size
The set obtained to step (3)In the corresponding maximum complete subgraph vertex set of each element split,
The condition that the subclass element number split out is not less than 2 need to be met during fractionation；
The quantity of obtained subclass withIn element it is related, i.e., with being added in step (3)In set
OrThe scale of itself is related；Element in each subclass forms the vertex of corresponding complete subgraph, and subclass is corresponding
Mist radio access node set forms a candidate cooperation caching cluster, calculates the forward pass unloading increment size of each candidate cluster, n-th
The forward pass unloading increment size of candidate clusterCalculating formula is：
WhereinRepresent n-th of candidate cluster, APqRepresent the mist radio access node in cluster, λqRepresent mist wireless access section
Point APqRequest arriving rate on overlay area, the serial number of content that f representatives are arranged according to popularity descending,It is wireless to represent mist
Access node APqThe request probability of f-th of local most popular content on overlay area, K, which represents mist radio access node m, to be delayed
The content quantity deposited,Represent the request probability of most popular content in f-th of cluster in n-th of candidate cluster, KnRepresent n-th of time
The quantity for differing content of all mist radio access node cooperation cachings in cluster is selected, L represents the size of each content.
(5) using each the candidate cooperation caching cluster obtained in step (4) as a vertex, containing identical F-AP's
The candidate cooperation caching cluster of two differences establishes side between corresponding vertex, and structure is schemed, and enables the weights on n-th of vertex
Wherein,It is the forward pass unloading increment size of the candidate cooperation caching cluster of n-th acquired in step (4)；
(6) to the figure built in step (5), the most authority independent subset of vertex set, the independent son of the most authority are solved
The candidate cooperation caching cluster for concentrating vertex correspondence is to close the cooperation caching gathering of forward pass discharging quantity maximum.It is only to solve most authority
Vertical subset the specific steps are：
A vertex is selected at random as initial vertex, and the top for having side to connect with the vertex is then rejected in vertex set
Point, this vertex rejected form a vertex subset；A vertex of maximum weight is selected in remaining vertex, is repeated above-mentioned
The process with vertex subset structure is rejected, until vertex set is sky, the vertex rejected every time forms the one of original vertices set
Group independent subset, using each vertex in vertex set successively as initial vertex, can obtain multigroup independent subset accordingly,
One group that vertex total weight value maximum is selected in all independent subsets, the as required forward pass discharging quantity of corresponding candidate cluster is most
Big cooperation caching gathering is closed.
Claims (6)
1. the cooperation caching method based on graph theory in a kind of mist wireless access network, have in the mist wireless access network access layer N number of
F-AP, all F-AP form setIt is characterised in that it includes following steps：
(1) it is poor according to the distance between F-AP nodes and load, the connection line set ε of structure access layer F-AP；
(2) according to the side articulation set ε of access layer F-AP, access layer adjacency list set is built
(3) according to access layer adjacency list setThe maximum complete subgraph of structure
(4) to F-AP node division candidate's cooperation caching clusters of access layer, and the forward pass for calculating each candidate cooperation caching cluster unloads
Carry increment size
(5) using each the candidate cooperation caching cluster obtained in step (4) as a vertex, in two containing identical F-AP
Difference candidate's cooperation caching cluster establishes side between corresponding vertex, and structure is schemed, and enables the weights on n-th of vertexWherein,It is the forward pass unloading increment size of the candidate cooperation caching cluster of n-th acquired in step (4)；
(6) to the figure built in step (5), the most authority independent subset of vertex set is solved, in the most authority independent subset
The candidate cooperation caching cluster of vertex correspondence is to close the cooperation caching gathering of forward pass discharging quantity maximum.
2. the cooperation caching method based on graph theory in mist wireless access network according to claim 1, which is characterized in that step
(1) it specifically includes：It is empty set to initialize set ε, is traversedIn element, it is rightIn m-th of node APm, traverse other N-1
A node APm'If meet condition Dmm'≤γd, and Lmm'≥γl, and there is no node to (AP in set εm',APm), then it will section
Point is to (APm,APm') be added in set ε；Dmm′=| | dm-dm′||2, dmAnd dm′Mist radio access node AP is represented respectivelymWith
APm'Coordinate in theorem in Euclid space, Lmm′=| | λm-λm′||2, λmAnd λm′Mist radio access node AP is represented respectivelymAnd APm'It covers
Request arriving rate in cover area, γdRepresent the threshold value of distance between mist radio access node, γlRepresent the threshold value of load difference.
3. the cooperation caching method based on graph theory in mist wireless access network according to claim 1, which is characterized in that step
(2) it specifically includes：
(2.1) to setIn each F-AP nodes, build its adjacency list set, forIn m-th of node APm, it is adjacent
Connect table setBy node APm, it is all with node APmThe node connected by side forms, i.e.,：
(2.2) it to the adjacency list set of all F-AP nodes, rejects element number and is 1 or itself is other F-AP node adjacencies
The adjacency list set of the subset of table set, by remaining adjacency list set according to element number descending sort in set, structure collection
It closes Wherein M is remaining adjacency list set number after rejecting.
4. the cooperation caching method based on graph theory in mist wireless access network according to claim 1, which is characterized in that step
(3) it specifically includes：
InitializationFor empty set, i=1, to setIn each element perform following steps：
Selected setIn i-th of elementK=1, j=1, set T ' are initialized asTo setIn j-th
Elements A PjAdjacency list setIt does following (A) and (B) and judges intersection operation：
(A) ifThen build k-th of setAnd it updatesK=k+1；
(B) ifThen T ' is remained unchanged, and updates j=j+1；
With the variation of j, to setIn each element perform successively more than (A) and (B) judge intersection operation, operation knot
It is obtained in the T ' and each calculating process that are obtained after beamK' ∈ { 1,2 ..., k-1 }, becomeIn element be added toIn, and update i=i+1；
With the variation of i, to setIn each element perform successively more than calculate, every time calculate all will obtainIn member
Element, to setIn all elements perform above calculate after, can obtain completeSet.
5. the cooperation caching method based on graph theory in mist wireless access network according to claim 1, which is characterized in that step
(4) it specifically includes：
The set obtained to step (3)In the corresponding maximum complete subgraph vertex set of each element split, split
When need to meet the condition that the subclass element number that splits out is not less than 2；
The quantity of obtained subclass withIn element it is related, i.e., with being added in step (3)In setOrThe scale of itself is related；
Element in each subclass forms the vertex of corresponding complete subgraph, the corresponding mist radio access node set of subclass
A candidate cooperation caching cluster is formed, calculates the forward pass unloading increment size of each candidate cluster, the forward pass unloading of n-th of candidate cluster increases
MagnitudeCalculating formula is：
WhereinRepresent n-th of candidate cluster, APqRepresent the mist radio access node in cluster, λqRepresent mist radio access node APq
Request arriving rate on overlay area, the serial number of content that f representatives are arranged according to popularity descending,Represent mist wireless access
Node APqThe request probability of f-th of local most popular content, K represent what mist radio access node m can be cached on overlay area
Content quantity,Represent the request probability of most popular content in f-th of cluster in n-th of candidate cluster, KnRepresent n-th of candidate cluster
In all mist radio access node cooperation cachings the quantity for differing content, L represents the size of each content.
6. the cooperation caching method based on graph theory in mist wireless access network according to claim 1, which is characterized in that step
(6) in solve most authority independent subset the specific steps are：
A vertex is selected at random as initial vertex, then there is the vertex that side is connect on rejecting and the vertex in vertex set,
This vertex rejected forms a vertex subset；A vertex of maximum weight is selected in remaining vertex, repeats above-mentioned pick
Except the process built with vertex subset, until vertex set is sky, the vertex rejected every time forms one group of original vertices set
Independent subset using each vertex in vertex set successively as initial vertex, can obtain multigroup independent subset accordingly,
One group that vertex total weight value maximum is selected in all independent subsets, corresponding candidate cluster are that required forward pass discharging quantity is maximum
Cooperation caching gathering close.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711181927.XA CN108156617B (en) | 2017-11-23 | 2017-11-23 | Graph theory-based cooperative caching method in fog wireless access network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711181927.XA CN108156617B (en) | 2017-11-23 | 2017-11-23 | Graph theory-based cooperative caching method in fog wireless access network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108156617A true CN108156617A (en) | 2018-06-12 |
| CN108156617B CN108156617B (en) | 2020-11-20 |
Family
ID=62469017
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711181927.XA Active CN108156617B (en) | 2017-11-23 | 2017-11-23 | Graph theory-based cooperative caching method in fog wireless access network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108156617B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108881445A (en) * | 2018-06-22 | 2018-11-23 | 南京理工大学 | A kind of mist calculate in the cooperation caching method based on ancient promise game |
| CN108881444A (en) * | 2018-06-22 | 2018-11-23 | 东南大学 | A kind of content popularit is distributed the asynchronous code cache method of inconsistent mist wireless access network |
| CN108900617A (en) * | 2018-07-03 | 2018-11-27 | 东南大学 | A kind of three layers of cooperative caching method of mist wireless access network |
| CN109039706A (en) * | 2018-07-03 | 2018-12-18 | 东南大学 | Mist wireless access network collaborative content dispositions method based on graph theory |
| CN109831790A (en) * | 2019-03-05 | 2019-05-31 | 东南大学 | Cooperation caching method based on brainstorming optimization algorithm in mist wireless access network |
| CN111510477A (en) * | 2020-04-07 | 2020-08-07 | 河海大学 | Fog computing network task unloading method based on improved contract network agreement and BAS |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016114767A1 (en) * | 2015-01-13 | 2016-07-21 | Hitachi, Ltd. | Location based cooperative caching at the ran |
| CN106507415A (en) * | 2016-10-20 | 2017-03-15 | 北京工业大学 | A kind of content caching of mobile network-oriented and network cooperating method |
| CN106550039A (en) * | 2016-11-08 | 2017-03-29 | 华中科技大学 | A kind of cross-layer cooperation content buffering method and system based on SD RAN |
| CN107241790A (en) * | 2017-05-24 | 2017-10-10 | 沈阳航空航天大学 | Base station collaboration Energy Saving Strategy based on content caching |
| CN107343304A (en) * | 2017-05-15 | 2017-11-10 | 中国科学院信息工程研究所 | The cooperation caching method of content center network |
-
2017
- 2017-11-23 CN CN201711181927.XA patent/CN108156617B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016114767A1 (en) * | 2015-01-13 | 2016-07-21 | Hitachi, Ltd. | Location based cooperative caching at the ran |
| CN106507415A (en) * | 2016-10-20 | 2017-03-15 | 北京工业大学 | A kind of content caching of mobile network-oriented and network cooperating method |
| CN106550039A (en) * | 2016-11-08 | 2017-03-29 | 华中科技大学 | A kind of cross-layer cooperation content buffering method and system based on SD RAN |
| CN107343304A (en) * | 2017-05-15 | 2017-11-10 | 中国科学院信息工程研究所 | The cooperation caching method of content center network |
| CN107241790A (en) * | 2017-05-24 | 2017-10-10 | 沈阳航空航天大学 | Base station collaboration Energy Saving Strategy based on content caching |
Non-Patent Citations (3)
| Title |
|---|
| XIAOTING CUI,ETC: "Graph-based cooperative caching in Fog-RAN", 《NETWORKING AND COMMUNICATIONS》 * |
| 崔潇婷: "《中国优秀硕士学位论文全文数据库》", 15 May 2019 * |
| 张涛等: "面向软件定义无线接入网的高效协作内容缓存算法", 《电子学报》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108881445A (en) * | 2018-06-22 | 2018-11-23 | 南京理工大学 | A kind of mist calculate in the cooperation caching method based on ancient promise game |
| CN108881444A (en) * | 2018-06-22 | 2018-11-23 | 东南大学 | A kind of content popularit is distributed the asynchronous code cache method of inconsistent mist wireless access network |
| CN108881444B (en) * | 2018-06-22 | 2020-11-03 | 东南大学 | Fog wireless access network asynchronous coding caching method with inconsistent content popularity distribution |
| CN108881445B (en) * | 2018-06-22 | 2021-04-27 | 南京理工大学 | Cooperation caching method based on Gono game in fog calculation |
| CN108900617A (en) * | 2018-07-03 | 2018-11-27 | 东南大学 | A kind of three layers of cooperative caching method of mist wireless access network |
| CN109039706A (en) * | 2018-07-03 | 2018-12-18 | 东南大学 | Mist wireless access network collaborative content dispositions method based on graph theory |
| CN108900617B (en) * | 2018-07-03 | 2020-09-18 | 东南大学 | Three-layer cooperative caching method for fog wireless access network |
| CN109039706B (en) * | 2018-07-03 | 2021-05-11 | 东南大学 | Fog wireless access network collaboration content deployment method based on graph theory |
| 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 |
| CN111510477A (en) * | 2020-04-07 | 2020-08-07 | 河海大学 | Fog computing network task unloading method based on improved contract network agreement and BAS |
| CN111510477B (en) * | 2020-04-07 | 2021-05-11 | 河海大学 | Fog computing network task unloading method based on improved contract network agreement and BAS |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108156617B (en) | 2020-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108156617A (en) | Cooperation caching method based on graph theory in a kind of mist wireless access network | |
| CN110493360A (en) | The mobile edge calculations discharging method of system energy consumption is reduced under multiserver | |
| CN111342993B (en) | SDN-based air-space-ground controller deployment architecture and control method | |
| CN112020103B (en) | Content cache deployment method in mobile edge cloud | |
| CN110418353B (en) | Edge computing server placement method based on particle swarm algorithm | |
| CN110445866B (en) | Task migration and cooperative load balancing method in mobile edge computing environment | |
| CN110351754A (en) | Industry internet machinery equipment user data based on Q-learning calculates unloading decision-making technique | |
| CN109639833A (en) | A kind of method for scheduling task based on wireless MAN thin cloud load balancing | |
| CN104994515B (en) | A kind of gateway deployment method under information physical emerging system | |
| CN111885493B (en) | Micro-cloud deployment method based on improved cuckoo search algorithm | |
| CN106792995B (en) | User access method for guaranteeing low-delay content transmission in 5G network | |
| CN115392481A (en) | Federal learning efficient communication method based on real-time response time balancing | |
| CN113315669B (en) | Cloud edge cooperation-based throughput optimization machine learning inference task deployment method | |
| CN110597598B (en) | Control method for virtual machine migration in cloud environment | |
| CN116050540A (en) | Self-adaptive federal edge learning method based on joint bi-dimensional user scheduling | |
| CN112040512A (en) | Fair-based fog computing task unloading method and system | |
| CN110120892B (en) | SDN multi-controller deployment method and system based on improved firefly algorithm | |
| Fang et al. | Olive branch learning: A topology-aware federated learning framework for space-air-ground integrated network | |
| Luo et al. | Joint game theory and greedy optimization scheme of computation offloading for UAV-aided network | |
| CN107426315A (en) | A kind of improved method of the distributed cache system Memcached based on BP neural network | |
| CN113965569A (en) | High-energy-efficiency low-delay edge node calculation migration framework and configuration system | |
| CN113821317A (en) | Edge cloud collaborative micro-service scheduling method, device and equipment | |
| CN113364626A (en) | Service placement and bandwidth allocation method for video analysis application facing edge environment | |
| CN107688625A (en) | A kind of method and system of the storage small documents based on distributed memory system | |
| CN109039706A (en) | Mist wireless access network collaborative content dispositions method based on graph theory |
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 |