CN105245592B - Mobile network base station cache contents laying method based on adjacent cache cooperation - Google Patents
Mobile network base station cache contents laying method based on adjacent cache cooperation Download PDFInfo
- Publication number
- CN105245592B CN105245592B CN201510631981.4A CN201510631981A CN105245592B CN 105245592 B CN105245592 B CN 105245592B CN 201510631981 A CN201510631981 A CN 201510631981A CN 105245592 B CN105245592 B CN 105245592B
- Authority
- CN
- China
- Prior art keywords
- base station
- node
- cache
- list
- content
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a kind of mobile network base station cache contents laying method based on adjacent cache cooperation, the specific steps are：Determine the cooperative base station set of each base station；Build system model figure G；Statistics network context information；Node B cache space is distributed based on system model figure and network scenario information；First four step is periodically executed to be allocated node B cache space.Under the conditions of present invention mainly solves in mobile network base station caching system based on adjacent cache cooperation to caching in storage content assignment problem, it has been obviously improved the content hit rate of node B cache system, the response delay for reducing user's request content, improves the performance of mobile network base station caching system.
Description
Technical field
The present invention relates to mobile communication fields, and in particular to disposes buffer service mobile subscriber content in mobile network base station
The mobile network base station caching system of request.
Background technology
With increasing considerably for mobile network's access bandwidth, content oriented service traffics in mobile network (such as network
Video etc.) it is skyrocketed through.The mobile network architecture of existing centralization can not be competent at large-scale data transmission.In order to improve movement
Support of the network to business such as Internet videos is disposed in mobile network base station and is cached, and by the content requests of buffer service user
It is the effective means for realizing the distribution of mobile network's efficient content.Compared to traditional content distribution system based on caching, such as
Content distributing network is primarily present problems with a) in mobile network base station deployment caching and is limited to mobile network base station service use
Amount mesh is less and the limited memory capacity of node B cache, the content requests hit rate of node B cache are relatively low；B) base station
Separate storage content is cached, cache contents Placement Strategy (such as the common Least Frequently based on content popularit
Used strategies) cause to close on and stores a large amount of redundant data between caching.
For main problem existing for these mobile network base station caching systems, stored using the cooperation between node B cache
It is a kind of effective solution method.Cooperation storage refer to when user request when current cache is not hit, by user request turn
Other cachings are sent to respond the content requests of user.Cache cooperation can improve the diversity of buffer memory content, and reduction is deposited
Redundancy is stored up, Buffer Utilization and content requests hit rate are improved, and is finally reached Mobile Network Operator to reduce data transmission
Expense reduces data transmission delay, improves user to targets such as the user experiences of the applications such as mobile video, realizes in mobile network
Efficient content distribution mechanisms.
Cache contents management is exactly the mapping established between content and caching, is determined in what content of each buffer memory,
Cache contents management is also known as cache contents and places problem by us.Usually, it is internal to depend on user for the placement of cache contents
The request degree of appearance, therefore be the premise for realizing efficient content distribution to the placement management of cache contents, only cache contents are matched
Setting more optimization, rationally, user experience can just be protected.
Problem is placed for the content in the mobile network base station caching system of mobile network base station deployment caching,
H.Ahlehagh et al. is in " Video Caching in Radio Access Network:Impacton Delay and
Two kinds of node B cache content Placement Strategies are proposed in a Capacity " texts to realize the content distribution mechanism in mobile network, but
Cooperation storage is not considered between caching in this text.J.He et al. is in " A Collaborative Framework for In-
The cache contents based on the whole network cooperation storage are proposed in networkVideo Caching in Mobile Networks " to put
Set mechanism.But mobile network's coverage area is wide, usually contains the base station of enormous amount.Therefore the whole network cooperation will increase user
It was found that the complexity of content and content transmission, limits the scalability of system.
In conclusion current mobile network base station cache contents are placed in solution, adjacent base is not efficiently used
It stands and delimit cooperation range to realize the scheme of optimization cache contents placement.
Invention content
In view of the deficiencies of the prior art, the present invention is intended to provide a kind of mobile network base station based on adjacent cache cooperation is slow
Content laying method is deposited, cache contents are distributed rationally suitable for optimization mobile network base station caching, to improve caching life
Middle rate reduces the transmission delay of user's request content.
To achieve the goals above, the present invention adopts the following technical scheme that：
Mobile network base station cache contents laying method based on adjacent cache cooperation, including mobile network base station caching system
System, the mobile network base station caching system are mainly set in mobile network base station as storage by mobile network base station, setting
User equipment of the standby node B cache and user for request content forms；Described method includes following steps：
S1 determines the cooperative base station collection of each node B cache by the transmission performance parameter between accounting base-station, delimits base
Stand caching collaboration region；
S2 passes through the cooperation relation and mobile network's topological diagram determination characterization mobile network base station caching between node B cache
The illustraton of model G of system, scheme G in one vertex representation in each base station, when between two base stations there are when cooperation relation with one
Side connects two vertex；
S3 statistics network context informations, including user access the general of each base station to the probability of content requests and user
Rate；
Base station collaboration regions of the S4 based on delimitation, given system model phenogram G and network scenario information data come
Distribute cache contents；
S5 periodically executes step S1 to step S4 and redistributes node B cache space to cope with network scenario information more
Newly.
It should be noted that in step S1, the transmission performance parameter includes the transmission delay between base station, and delimits base station
The specific method is as follows for the collaboration region of caching：
Two base stations cooperative base station each other when the transmission delay between two base stations is less than given threshold value, by above-mentioned
Standard, a cooperative base station set delimited in each base station, and carry out content cooperation storage with the base station in the set that cooperates and answer
It answers.
It should be noted that the specific method is as follows by step S3：
3.1) recording gauge calculation is watched according to the history of user and judges probability of the user to some content requests；
3.2) user is switched using discrete time Markov Chain base station and is modeled, to by the history of user
Mobile data obtains the probability of user's access base station.
It should be noted that step S4 is specifically included：
4.1) the figure G calculated for algorithm is generated by the system model phenogram G obtained in step S22；
4.2) to each base station, calculation base station syndication users are asked, i.e. the syndication users required parameter of the base station, to
Request degree of the user to some content for indicating the base station and its all cooperative base station, is usedIt indicates, wherein n indicates base
It stands, mi(i=1,2 ..., M) indicates that request content, M indicate the total quantity of content；
4.3) to each content mi, syndication users ask highest value use in all node B cachesIt indicates, it is right
All the elements mi, according toDescending arranges to obtain list List (M)；To each content mi, according toDescending arranges to obtain
M list List (mi)；
4.4) first, it is determined that whether list List (M) is empty, if it is empty then spatial cache distribution terminates, and executes step S5,
Otherwise following judgement is continued to execute：
Judge each node B cache whether also have unappropriated memory space, if without if spatial cache distribution terminate, hold
Otherwise row step S5 continues step 4.5)；
4.5) the primary content m of list List (M) are come currentlyiCorresponding list List (mi) in, it chooses polymerization and uses
All nodes of the family request more than a given value V are simultaneously put into set AmiIn；In corresponding figure G2In, seek set AmiIn have caching
The weight limit isolated node collection B in spacemi, then set BmiThe node B cache storage content m of middle corresponding nodei, and update it
Spatial cache capacity；
4.6) the primary content m of list List (M) are come from currentlyiCorresponding list List (mi) in delete and set
BmiCorresponding node and set BmiIn figure G2In neighbor node；If at this point, list List (mi) be sky, then from list
Content m is deleted in List (M)iCorresponding item, return to step 4.4)；If list List (mi) it is not sky, then more new content miCurrently
Maximum syndication users request, rearrange list List (M), return to step 4.4).
Explanation is needed further exist for, the specific method is as follows for step 4.1)：
Scheme G and figure G2Node set it is identical, in scheming G, there are a lines between two node uv, or there are a nodes
W so that there are there are a lines between a line and wv between uw, then in figure G2In, there are a lines between two node uv.
Explanation is needed further exist for, the syndication users required parameter in step 4.2) is calculated by following formula：
Wherein u indicates that a certain user, n ' expressions are located at the base station in the cooperation set N (n) of base station n；Indicate user u
The probability of access base station n '；Indicate user's u request contents miProbability.
Explanation is needed further exist for, the given value V in step 4.5) is calculated by following formula：
Wherein, dmi*To be currently located at deputy content m in list List (M)iCorresponding maximum syndication users are asked
It asks, α is customized parameter.
It needs further exist for illustrating, in step 4.5), seeks set AmiIn there is the weight limit of spatial cache independently to save
Point set BmiThe specific method is as follows：
4.5.1) for given node set Ami, by node therein, according to node weights, arrangement form arranges from high to low
Table L1, node weights are the syndication users value request of node respective base station；
4.5.2) by list L1Middle weight peak corresponding node is selected into set L2；By this node and this node in figure G2
In neighbor node from list L1Middle deletion；
4.5.3) if list L1For sky, then step terminates, set L2The corresponding weight limit isolated node collection B chosenmi；If
List L1It is not sky, then returns to step 4.5.2).The beneficial effects of the present invention are：
The present invention is based on the cache cooperations between mobile network's adjacent base station to store user's request content, has considered use
The context informations such as the probability of access base station are moved to the request probability of content, user in family, it is proposed that one kind is assisted based on adjacent base station
Make strategy of the node B cache space stored to content assignment.The strategy can improve the space utilization of mobile network base station caching
Rate reduces the redundant data of caching, the final whole hit rate for improving mobile network base station caching system.
Description of the drawings
Fig. 1 is the mobile network base station caching system schematic diagram of the present invention；
Fig. 2 is the implementing procedure figure of the present invention；
Fig. 3 is the system model figure G and the figure G that thus generates of the present invention2Schematic diagram；
Fig. 4 is the cache hit rate contrast schematic diagram of the present invention and LFU in emulation experiment；
Fig. 5 is the content transmission time delay contrast schematic diagram of the present invention and LFU in emulation experiment；
Fig. 6 be emulation experiment under different base station number of users cache hit rate schematic diagram of the present invention.
Specific implementation mode
Below with reference to attached drawing, the invention will be further described, it should be noted that the present embodiment is with this technology side
Premised on case, detailed embodiment and specific operating process are given, but protection scope of the present invention is not limited to this reality
Apply example.
The present invention utilizes the X2 interface transmitting content data between base station, is stored by close cooperation between base stations and improves content point
Send out efficiency.When user asks in home base stations cache miss, user's request is forwarded to close cooperative base station, is answered by the latter
It answers and request base station is directly transferred to by X2 interface.By delimiting suitable cooperation range, close base station stored redundancy is avoided
Data, to improve buffer memory space availability ratio, storage content diversity which thereby enhances the hit rate of caching, and
Reduce the transmission flow of mobile network's return link and gateway.
The basic fundamental thinking of the present invention is, under the cooperation range for delimiting node B cache, base station connects according to user's movement
Enter the probability of base station and to the related context information such as request probability of content, distributes the memory space of node B cache to store use
Family request content, the final whole hit rate for realizing caching system are promoted.Comprehensive mobile network base station topology is closed with base station collaboration
System establishes the illustraton of model (being indicated with G) of characterization mobile network base station caching system：Figure interior joint indicates node B cache, side expression pair
Answer vertex represent two node B caches there are cooperation relations.Based on cooperation caching mechanism, a content is in each collaboration region
Inside at most storage portion can meet the request of memory node and adjacent node to the content.Based on above system illustraton of model
G, then the memory node collection of each content is figure G2Independent sets.In the present invention, buffer memory content distribution method is with regard to base
In in figure G2The middle independent sets node (maximum weighted independent set) for finding weight limit.Based in this way
Scheme, can effectively reduce and store redundant content between adjacent caching, improve Buffer Utilization, it is final to realize node B cache system
The hit rate of system is promoted.
The present invention is applied to the mobile network base station caching system cached in base station deployment, as shown in Figure 1, the system packet
It includes：
Mobile network base station (BS)：The base station refers to the base station in cellular cell on conversational implication, can be covering
User in range provides communication information service, using LTE wireless access technologys, X2 interface can be used to transmit number between base station
According to.
Node B cache (Cache)：Node B cache refers to the storage device being arranged in mobile network base station, passes through storage content
The content of provider and direct response user mitigate the flow of return link in mobile network's backbone network to the request of content
And the load of mobile network gateway.Node B cache has specific memory capacity.
User equipment (UE)：Customer mobile terminal is generally referred to, user can be by terminal request content, such as watches
Internet video etc..
The content requests of response user can be assisted to indicate cache cooperation relationship between base station between base station, assisted beyond this base station
Make range base station need not be carried out with this base station storage cooperate with response.Dotted line indicates that the cooperation between node B cache is closed in Fig. 1
System.
As shown in Fig. 2, the present invention includes the following steps：
S1 determines the cooperative base station collection of each node B cache by the transmission performance parameter between accounting base-station, delimits base
Stand caching collaboration region.Propagation delay time of the transmission performance parameter between base station between consideration base station, when the statistics between two base stations passes
When defeated time delay is less than given threshold value, two base stations are believed to cooperate.
S2 passes through the cooperation relation and mobile network's topological diagram determination characterization mobile network base station caching between node B cache
The illustraton of model G of system, one vertex representation in each base station in figure, when there are a lines when cooperation relation between two base stations
Two vertex are connected, as shown in Figure 3.
S3 determines that user accesses the probability of content requests and user the probability of each base station.User is to content requests
The probability that probability and user access each base station belongs to network scenario information, wherein the probability that user accesses each base station is used
In the mobility of characterization user, this is because in a mobile network, user can move freely through and be cut between base station
It changes, therefore needs the mobility of consideration user when solving content and placing.
Wherein record (such as history video can be watched according to the history of user with known technologies such as applicating cooperation filtering techniques
Viewing record) calculate the fancy grade for judging user to some content (such as video), some content is asked to obtain user
The probability asked；And user access each base station probability can with usage time homogeneity discrete time Markov Chain to user in base
Switching between standing is modeled, to obtain the probability of user's access base station by the history mobile data of user.
Base station collaboration regions of the S4 based on delimitation, given system model phenogram and context information data are slow to distribute
The step of depositing content include：
4.1) the figure G calculated for algorithm is generated by characterized systematically figure G first2, as shown in Figure 3.
4.2) to each base station, the syndication users required parameter of the base station is calculated, to indicate that the base station and its own
Cooperative base station is to the request degree of some content, and the higher user illustrated in corresponding base station and its cooperative base station of the parameter is to this
The request degree of content is higher.In the present invention, this parameter nomenclature is asked for base station syndication users, is usedIt indicates, wherein n tables
Show base station, mi(i=1,2 ..., M) indicates that request content, M indicate the total quantity of content；
Syndication users required parameter is calculated by following formula：
Wherein u indicates that a certain user, n ' expressions are located at the base station in the cooperation set N (n) of base station n；Indicate user u
The probability of access base station n '；Indicate user's u request contents miProbability.
4.3) to each content mi, syndication users ask highest value use in all node B cachesIt indicates, it is right
All the elements mi, according toDescending arranges to obtain list List (M)；To each content mi, according toDescending arranges to obtain
M list List (mi)；
4.4) first, it is determined that whether list List (M) is empty, if it is empty then spatial cache distribution terminates, and executes step S5,
Otherwise judge each node B cache whether also have unappropriated memory space, if without if spatial cache distribution terminate, execute step
Otherwise rapid S5 continues step 4.5)；
4.5) assume that in current list List (M) the primary content that comes be m1, in corresponding list List (m1) in,
It chooses all nodes of the syndication users request more than a given value V and is put into set Am1In；In corresponding figure G2In, it seeks gathering
Am1In have the weight limit isolated node collection B of spatial cachem1, then set Bm1The node B cache of middle corresponding node stores m1, and
Update its spatial cache capacity；
Given value V is calculated by following method：Assuming that being positioned at deputy content in list List (M) currently
m2, corresponding to maximum syndication users request be dm2*, then Wherein α is customized parameter.The purpose of setting value V
It is, as currently processed content m1When the syndication users request of corresponding node has been reduced below a certain value, it is empty to occupy storage
Between storage content m1Be not as big as the income for handling the latter content.
The method for seeking the weight limit isolated node collection of given set is as follows.Here node weights finger joint point pair
Answer the syndication users value request of base station.
4.5.1) for given node set Am1, by it according to weight arrangement form list L from high to low1。
4.5.2) by list L1Middle weight peak corresponding node is selected into set L2；By this node and this node in figure G2
In neighbours from list L1Middle deletion；
4.5.3) if list L1For sky, then step terminates, set L2The corresponding weight limit isolated node collection chosen；If row
Table L1It is not sky, then returns to step 4.5.2).
4.6) from list List (m1) in delete with set Bm1Corresponding node and set Bm1In figure G2In neighbours section
Point；If at this point, list List (m1) it is sky, from deletion content m in list List (M)1Corresponding item, return to step 4.4)；If row
Table List (m1) it is not sky, then more new content m1Current maximum syndication users request, rearranges list List (M), returns to step
It is rapid 4.4).
S5 mobile network base stations caching system periodically executes step S1 to step S4 and redistributes node B cache space
Cope with the update of network scenario information.
It will further illustrate the performance of the present invention by emulation experiment below.
Emulation platform to the present invention program includes 1200 base stations, and the number of users by changing each base station service
And the cooperative base station number of each base station, to observe the performance of node B cache system under this programme.
As shown in Figure 4, it can be seen that in Least Frequently Used (LFU) cachings stored with no base station collaboration
Hold allocation strategy to compare, the cache hit rate of this programme is greatly improved.With the increase of the cooperative base station number of base station, delay
It deposits hit rate also to increase, illustrates that the cache contents distribution method of the present invention is effective for the hit rate for promoting caching system.
As shown in Figure 5, it can be seen that compared with the LFU cache contents allocation strategies that no base station collaboration stores, under this programme
The response delay of user's request content is greatly lowered.With the increase of the cooperative base station number of base station, the lasting drop of response delay
It is low.As a result illustrate, cached from adjacent base station and obtain content ratio from single node B cache and lower, the explanation of outer net acquisition content delay
The present invention program effectively reduces content and is delayed accordingly.
As shown in fig. 6, for different base station service user numbers, when number of users is 50, content requests are relatively
Few, the hit rate of collaborative node B cache can reach 90 or more percent when cooperative base station number is at 4 or more.With
The increase of number of users, content requests also increase, then the hit rate of node B cache is declined.This emulation testing is in different use
The performance of the present invention program under family request situation.
For those skilled in the art, it can be made various corresponding according to above technical solution and design
Change and distortion, and all these change and distortions should be construed as being included within the protection domain of the claims in the present invention.
Claims (8)
1. the mobile network base station cache contents laying method based on adjacent cache cooperation, including mobile network base station caching system
System, the mobile network base station caching system are mainly set in mobile network base station as storage by mobile network base station, setting
User equipment of the standby node B cache and user for request content forms；It is characterized in that, the method includes walking as follows
Suddenly：
S1 determines the cooperative base station collection of each node B cache by the transmission performance parameter between accounting base-station, and it is slow to delimit base station
The collaboration region deposited；
S2 passes through the cooperation relation and mobile network's topological diagram determination characterization mobile network base station caching system between node B cache
Illustraton of model G, scheme G in one vertex representation in each base station, when there are connected with a line when cooperation relation between two base stations
Connect two vertex；
S3 statistics network context informations, including user access the probability of content requests and user the probability of each base station；
Base station collaboration regions of the S4 based on delimitation, given system model phenogram G and network scenario information data are distributed
Cache contents；
S5 periodically executes step S1 to step S4 and redistributes node B cache space to cope with the update of network scenario information.
2. the mobile network base station cache contents laying method according to claim 1 based on adjacent cache cooperation, special
Sign is, in step S1, the transmission performance parameter includes the transmission delay between base station, and delimits the collaboration region of node B cache
The specific method is as follows：
When the transmission delay between two base stations is less than given threshold value, two base stations cooperative base station each other, passes through above-mentioned mark
Standard, a cooperative base station set delimited in each base station, and carry out content cooperation storage response with the base station in the set that cooperates.
3. the mobile network base station cache contents laying method according to claim 1 based on adjacent cache cooperation, special
Sign is that the specific method is as follows by step S3：
3.1) recording gauge calculation is watched according to the history of user and judges probability of the user to some content requests；
3.2) user is switched using discrete time Markov Chain base station and is modeled, to be moved by the history of user
Data obtain the probability of user's access base station.
4. the mobile network base station cache contents laying method according to claim 1 based on adjacent cache cooperation, special
Sign is that step S4 is specifically included：
4.1) the figure G calculated for algorithm is generated by the system model phenogram G obtained in step S22；
4.2) to each base station, the request of calculation base station syndication users, i.e. the syndication users required parameter of the base station, to indicate
The user of the base station and its all cooperative base station uses the request degree of some contentIt indicates, wherein n indicates base station, mi
Indicate that request content, and i=1,2 ..., M, M indicate the total quantity of content；
4.3) to each content mi, syndication users ask highest value use in all node B cachesIt indicates, to all
Content mi, according toDescending arranges to obtain list List (M)；To each content mi, according toDescending arranges to obtain M
List List (mi)；
4.4) first, it is determined that whether list List (M) is empty, if it is empty then spatial cache distribution terminates, and executes step S5, otherwise
Continue to execute following judgement：
Judge each node B cache whether also have unappropriated memory space, if without if spatial cache distribution terminate, execute step
Otherwise rapid S5 continues step 4.5)；
4.5) the primary content m of list List (M) are come currentlyiCorresponding list List (mi) in, it chooses syndication users and asks
It seeks all nodes more than a given value V and is put into set AmiIn；In corresponding figure G2In, seek set AmiIn have spatial cache
Weight limit isolated node collection Bmi, then set BmiThe node B cache storage content m of middle corresponding nodei, and update its caching
Spatial content；
4.6) the primary content m of list List (M) are come from currentlyiCorresponding list List (mi) in delete with set BmiIt is right
The node and set B answeredmiIn figure G2In neighbor node；If at this point, list List (mi) be sky, then from list List
(M) content m is deleted iniCorresponding item, return to step 4.4)；If list List (mi) it is not sky, then more new content miIt is current most
Big syndication users request, rearranges list List (M), return to step 4.4).
5. the mobile network base station cache contents laying method according to claim 4 based on adjacent cache cooperation, special
Sign is that the specific method is as follows for step 4.1)：
Scheme G and figure G2Node set it is identical, in scheming G, there are a lines between two node uv, or there are a node w, make
Between uw there are there are a lines between a line and wv, then in figure G2In, there are a lines between two node uv.
6. the mobile network base station cache contents laying method according to claim 4 based on adjacent cache cooperation, special
Sign is that the syndication users required parameter in step 4.2) is calculated by following formula：
Wherein u indicates that a certain user, n ' expressions are located at the base station in the cooperation set N (n) of base station n；Indicate that user u accesses base
It stands the probability of n '；Indicate user's u request contents miProbability.
7. the mobile network base station cache contents laying method according to claim 4 based on adjacent cache cooperation, special
Sign is that the given value V in step 4.5) is calculated by following formula：
Wherein, dmi*To be currently located at deputy content m in list List (M)iCorresponding maximum syndication users value request,
α is customized parameter.
8. the mobile network base station cache contents laying method according to claim 4 based on adjacent cache cooperation, special
Sign is, in step 4.5), seeks set AmiIn have the weight limit isolated node collection B of spatial cachemiSpecific method such as
Under：
4.5.1) for given node set Ami, by node therein according to node weights arrangement form list from high to low
L1, node weights are the syndication users value request of node respective base station；
4.5.2) by list L1Middle weight peak corresponding node is selected into set L2；By this node and this node in figure G2In
Neighbor node is from list L1Middle deletion；
4.5.3) if list L1For sky, then step terminates, set L2The corresponding weight limit isolated node collection B chosenmi；If list
L1It is not sky, then returns to step 4.5.2).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510631981.4A CN105245592B (en) | 2015-09-29 | 2015-09-29 | Mobile network base station cache contents laying method based on adjacent cache cooperation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510631981.4A CN105245592B (en) | 2015-09-29 | 2015-09-29 | Mobile network base station cache contents laying method based on adjacent cache cooperation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105245592A CN105245592A (en) | 2016-01-13 |
| CN105245592B true CN105245592B (en) | 2018-07-20 |
Family
ID=55043090
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510631981.4A Active CN105245592B (en) | 2015-09-29 | 2015-09-29 | Mobile network base station cache contents laying method based on adjacent cache cooperation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105245592B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106550039B (en) * | 2016-11-08 | 2017-08-11 | 华中科技大学 | A kind of cross-layer cooperation content buffering method and system based on SD RAN |
| CN106888462B (en) * | 2017-03-06 | 2020-05-01 | 西安电子科技大学 | Content topology construction method and system |
| CN107493328B (en) * | 2017-08-14 | 2019-10-11 | 武汉大学 | A kind of Cooperative caching method based on Fusion Features |
| CN107623720B (en) * | 2017-08-18 | 2021-02-05 | 中国科学院上海微系统与信息技术研究所 | Data selective caching method based on cooperative caching |
| CN109561469A (en) * | 2017-09-25 | 2019-04-02 | 中兴通讯股份有限公司 | Caching method, device, storage medium and the electronic device of local content |
| CN109714790A (en) * | 2019-01-23 | 2019-05-03 | 南京邮电大学 | A kind of edge cooperation caching optimization method based on user mobility prediction |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801039A (en) * | 2010-03-29 | 2010-08-11 | 华中科技大学 | Method for reducing delay in multiple base station cooperation |
| CN101841778A (en) * | 2009-03-17 | 2010-09-22 | 松下电器产业株式会社 | Method and device for adjusting timing advance in uplink multipoint reception |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8731087B2 (en) * | 2009-06-30 | 2014-05-20 | Microsoft Corporation | Uplink MIMO transmission from mobile communications devices |
-
2015
- 2015-09-29 CN CN201510631981.4A patent/CN105245592B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101841778A (en) * | 2009-03-17 | 2010-09-22 | 松下电器产业株式会社 | Method and device for adjusting timing advance in uplink multipoint reception |
| CN101801039A (en) * | 2010-03-29 | 2010-08-11 | 华中科技大学 | Method for reducing delay in multiple base station cooperation |
Non-Patent Citations (3)
| Title |
|---|
| A Collaborative Framework for In-networkVideo Caching in Mobile Networks;J He et al;《Eprint Arxiv》;20140403;全文 * |
| Base Station Cooperation with Non-Ideal Backhaul and Non-Full Buffer Traffic;Krishna Balachandran et al;《Vehicular Technology Conference (VTC Fall), 2014 IEEE 80th》;20140917;全文 * |
| 位置感知查询中的协作缓存管理;杜方;《计算机工程与应用》;20081111(第32期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105245592A (en) | 2016-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105245592B (en) | Mobile network base station cache contents laying method based on adjacent cache cooperation | |
| CN105491156B (en) | A kind of the whole network collaborative content cache management system based on SD RAN and method | |
| Gu et al. | Distributed cache replacement for caching-enable base stations in cellular networks | |
| Sheng et al. | Enhancement for content delivery with proximity communications in caching enabled wireless networks: Architecture and challenges | |
| CN106331083B (en) | A kind of heterogeneous network selection method considering content distribution energy consumption | |
| Zhong et al. | Deep multi-agent reinforcement learning based cooperative edge caching in wireless networks | |
| CN109600774B (en) | WiFi (Wireless Fidelity) unloading method based on alliance game in LTE (Long term evolution) network | |
| CN106900011A (en) | Task discharging method between a kind of cellular basestation based on MEC | |
| CN107968835B (en) | Wireless heterogeneous network video cache facility deployment method based on coding | |
| CN108093435B (en) | Cellular downlink network energy efficiency optimization system and method based on cached popular content | |
| CN105357281B (en) | A kind of Mobile Access Network distributed content cache access control method and system | |
| Lin et al. | Caching in heterogeneous ultradense 5G networks: A comprehensive cooperation approach | |
| CN108600998B (en) | Cache optimization decision method for ultra-density cellular and D2D heterogeneous converged network | |
| CN102098728A (en) | Mobile load balancing method | |
| CN106851731A (en) | A kind of D2D cache allocation methods for maximizing unloading probability | |
| CN106851741B (en) | Distributed mobile node file caching method based on social relation in cellular network | |
| CN107135469B (en) | A kind of distributed user cut-in method | |
| CN108307446B (en) | Wireless network edge cooperative caching system and method based on software definition | |
| CN106888257A (en) | The storage resource distribution method of mist node in radio communication | |
| CN110022579A (en) | Content caching management method based on base station collaboration | |
| CN106791887A (en) | The distributed caching of video and transmission optimization method in wireless network | |
| CN108881445A (en) | A kind of mist calculate in the cooperation caching method based on ancient promise game | |
| He et al. | Cache-enabled coordinated mobile edge network: Opportunities and challenges | |
| CN107872478A (en) | A kind of content buffering method, device and system | |
| CN108769729A (en) | Caching arrangement system based on genetic algorithm and caching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |