CN106708923A - Shared method of native cache file based on mobile intelligence network - Google Patents

Shared method of native cache file based on mobile intelligence network Download PDF

Info

Publication number
CN106708923A
CN106708923A CN201610985297.0A CN201610985297A CN106708923A CN 106708923 A CN106708923 A CN 106708923A CN 201610985297 A CN201610985297 A CN 201610985297A CN 106708923 A CN106708923 A CN 106708923A
Authority
CN
China
Prior art keywords
user
file
alliance
cache
general layout
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
Application number
CN201610985297.0A
Other languages
Chinese (zh)
Other versions
CN106708923B (en
Inventor
陈艳姣
林龙
段凌杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan University WHU
Original Assignee
Wuhan University WHU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wuhan University WHU filed Critical Wuhan University WHU
Priority to CN201610985297.0A priority Critical patent/CN106708923B/en
Publication of CN106708923A publication Critical patent/CN106708923A/en
Application granted granted Critical
Publication of CN106708923B publication Critical patent/CN106708923B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/17—Details of further file system functions
    • G06F16/176—Support for shared access to files; File sharing support
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/17—Details of further file system functions
    • G06F16/172—Caching, prefetching or hoarding of files
    • 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/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The invention discloses a shared method of native cache file based on mobile intelligence network. First builds a user alliance pattern based on gunz file shared network through cooperative game model, the user alliance pattern shares allied gather for muti-user file for user; formulates a best file cache strategy and a file shared strategy fora specific user alliance by adopting the user alliance pattern; user downloads from base station corresponding proportional file to local mobile device by the file cache strategy and the file shared strategy. The shared method main forms the shared user alliance of file based on the intelligence network, reduces transmission delay through a local connectivity; a distributed arithmetic of the user alliance pattern is achieved and has unit reasonability, Dhp stability and agreement stability; introduces concept of file popularity index, confirms the best cache strategy through minimized total transmission delay of the user alliance, the mobile network transmission delay can be reduced.

Description

A kind of local cache sharing files method based on mobile collective intelligence network
Technical field
The invention belongs to mobile internet technical field, more particularly to a kind of local cache text based on mobile collective intelligence network Part sharing method.
Background technology
Watching video by mobile device has become to become more and more popular.According to Cisco System Co. to global mobile data flow Prediction, mobile video flow just exponentially increases, and expection in 2017 is up to 9.9 Chinese mugwort bytes/moon.End to 2020 Year, video flow will account for the 72% of total flow.Worked independently by core network and would become hard to meet so huge demand, and Somewhat expensive, while the transmission delay for shortening mobile video service is also imperative.Using the memory space of magnanimity edge device Technological progress with junction service can provide a solution.International mobile equipment and access point are expected that 9,000,000 can be reached, Using their huge and inexpensive memory spaces, then the high-speed transfer that file is realized by wireless terminal market.Then, user Cache file, such as equipment-p- equipment (Device-to-Device, D2D) communication, WiFi, indigo plant can be shared by junction service Tooth and ultra wide band.Two junction service transmission rates between close user can be than user and core network base station The fast several times of cellular transmission speed between (Base Stations, BSs), significantly shorten the transmission delay of user.
Recently, many concerns are had been obtained for by the conception of home base stations or mobile terminal device cache file.With Femto caches the proposition of concept, and welcome file has been buffered in small base station (Femtocells), is downloaded for surrounding user. Scalability to cache file in user equipment is also all verified.However, due to the selfish person's character of people, user can only cache him Favorite file, not interested is other people cache files.Therefore repetition caching is may result in, so as to cause storage The waste in space.There is researcher to recommend core network carrier to use bonus policy, encourage user cache file and pass through D2D Network is shared.Even so, but core network carrier is difficult to determine and quantify the money return of user cache behavior.Such as Fruit core network carrier does not carry out centralized Control, and the not enough motivations of selfish user oneself are removed active cache and divided mutually Enjoy file.
In order to solve this problem, distributed structure/architecture can be used, according to cooperative game theory, user's composition is based on gunz The alliance of sharing files network, alliance internal members carry out sharing files, do not carry out sharing files with the member beyond alliance.But Challenge, the file preference of user, the locality connection speed phase not to the utmost between file size and user are still present in caching system Together, therefore it is difficult to whole alliance and determines best file cache strategy.Selfish user can only cache the text of most desired caching Part, and alliance director needs to consider the interests of this alliance, the memory space for making full use of all user equipmenies limited.User The formation of alliance has spontaneity, and user can freely add or leave alliance.Do not add if coalizing and causing service delay to exceed Fashionable service delay, then selfish user will move out alliance.If adding other alliances to shorten current delay, user's meeting Depart from existing alliance.For user group determines that a kind of alliance of stabilization sets up form and needs a model being easily achieved.
The content of the invention
The present invention is in view of the shortcomings of the prior art, it is proposed that a kind of new local cache file based on collective intelligence network point Enjoy method.
The technical solution adopted in the present invention is：A kind of local cache sharing files method based on mobile collective intelligence network, It is characterised in that it includes following steps：
Step 1：User coalitions general layout based on gunz sharing files network, the user are built based on Cooperative reference Alliance's general layout is the set that multiple user files that user is formed share alliance；
Step 2：It is that specific user alliance formulates optimal file cache according to the user coalitions general layout formed using step 1 Strategy and sharing files strategy；
Step 3：According to file cache strategy and sharing files strategy that step 2 is obtained, user downloads corresponding ratio from base station The file of example is to local mobile device.
Preferably, step 1 is implemented including following sub-step：
Step 1.1：Define a kind of good and bad relation for weighing alliance general layout S and alliance general layout R
Alliance general layout S is better than alliance general layout R, and the service delay of and if only if all users under alliance general layout S is all little In the service delay under alliance general layout R, and service delay of at least one user under alliance general layout S strictly less than Service delay under alliance general layout R, i.e., And a kind of at least strict being less than of holding is closed System, wherein, ci(S) service delay of the user i under alliance general layout S is represented；
Step 1.2：Define the principle that alliance's general layout updates：Combination principle, separation principle and addition principle；
Combination principle：If there is multiple alliances, the alliance's general layout after its merging is more excellent, i.e., Then merge all scattered alliance { S1, S2..., SlBe
Separation principle：If there is an alliance, the alliance's general layout after multiple alliances, and fractionation can be split as more It is excellent, i.e.,Then by allianceIt is decomposed into { S1, S2..., Sl}；
Add principle：If an alliance S1Middle to there is a Ge Zi alliances S ', it departs from alliance S1Coalize S2Alliance afterwards General layout is more excellent, i.e.,Then by alliance S1Subset S ' coalize S2；
Step 1.3：Initialization alliance general layout is the alliance S0 comprising all isolated users；
Step 1.4：Judge whether to meet the alliance of combination principle；
If it is present updating alliance's general layout according to combination principle, new alliance's general layout is obtained for S；And the circulation that continues is held Row step 1.4；
If it does not exist, then performing following step 1.5；
Step 1.5：Judge whether to meet the alliance of separation principle；
If it is present updating alliance's general layout according to separation principle, new alliance's general layout is obtained for S；And the circulation that continues is held Row step 1.5；
If it does not exist, then performing following step 1.6；
Step 1.6：Judge whether to meet the alliance for adding principle；
If it is present according to adding principle to update alliance's general layout, obtaining new alliance's general layout for S；And the circulation that continues is held Row step 1.6；
If it does not exist, then revolution performs the step 1.7.
Step 1.7：Judge whether S0 is equal to S；
If it is not, revolution performs step 1.4；
If so, then exporting alliance's general layout of stabilization, this flow terminates.
Preferably, file cache strategy described in step 2 is implemented including following sub-step：
Step 2.1：User-file is set up to (i, m) list
Step 2.2：Based on user preference file distribution, user's locality connection speed, user and base station transmission rate, calculate Popularity of each user-file to (i, m)
Wherein RI, 0It is the transmission rate between user i and base station, RJ, iIt is the local transmission speed between user i and user j Rate,It is user i to the preference of file m, smIt is the size of file m；
Step 2.3：From listIt is middle to remove user-file pair that all popularities are negative value；
Step 2.4：Judge listWhether it is empty；
If so, then this flow terminates；
If it is not, then continuing executing with step 2.5；
Step 2.5：CalculateIn all user-files pair pre-cache ratio
Wherein γiIt is the mobile device free space of user i, ymIt is the ratio of the uncached part of file m；
Step 2.6：Choose listMiddle popularity and pre-cache ratio productMaximum user-file pair, And from listMiddle removal this document pair；
Step 2.7：The ratio for specifying user's i cache files m is
Step 2.8：The mobile device free space for updating user i is
Step 2.9：Whether the mobile device free space for judging user i is 0；
If so, then from listIt is middle to remove all user-files pair comprising user i；And perform following step 2.10；
If it is not, then performing following step 2.10；
Step 2.10：The ratio of the uncached part of more new file m is
Step 2.11：Judge whether the ratio of the uncached part of file m is changed into 0；
If so, then from listIt is middle to remove all user-files pair comprising file m；And turn round the execution step 2.4；
If it is not, then revolution performs the step 2.4.
Preferably, the process that implements of sharing files strategy described in step 2 is：When user i needs file m, First look in local mobile device whether the full content of storage file m；If it is not, obtaining same by locality connection The ratio of the file m cached in the user's j mobile devices in alliance, the file m that user j is shared is the file m of its caching All parts；If there is no the file m of caching whole, user i to be published papers under base station in the user's mobile device in same alliance The remainder of part m.
Preferably, after forming user coalitions general layout, each alliance specifies an alliance director, is counted by alliance director Calculate and the optimal file cache strategy of implementation and supervision and sharing files strategy.
If preferably, in user coalitions all users have identical to base station communication speed, locality connection speed, File preference and mobile device memory space, then the file cache strategy of each user is identical with sharing files strategy；
The realization of file cache strategy A includes following sub-step：
Step A1：Calculate the popularity q of All Files mm；
Wherein n is the number of users in alliance, smIt is the size of file m, R is the identical that has of all users to base station Traffic rate, R0It is all two two users to the identical locality connection speed that has, pmFor the identical pair that all users have The preference of file m；
Step A2：All popularities will not be buffered for the file of negative value, Lm={ m1, m2 ... } be for popularity On the occasion of listed files, with qmNon-increasing sorts；
Step A3：Judge total memory space of mobile device of user in alliance whether less than LmThe size of middle All Files Summation；
If so, then caching LmIn preceding k file, k meetPreceding k-1 text Part is all cached；The k-1 1/n of file before each user cache, i.e., K-th file quilt Part caches, and the ratio of each user cache isWherein, γ is the phase that all users have Same mobile device free space,It is LmIn i-th size of file；
If it is not, then caching LmIn All Files, i.e.,
The realization of sharing files strategy A is including process：When user i needs file m, local mobile device is first looked at In whether the full content of storage file m；If it is not, the user j obtained by locality connection in same alliance is moved and set The file m of standby middle caching, the ratio of the file m that user j is shared is all parts of the file m of its caching；If same There is no caching whole file m, user i that the remainder of file m is downloaded from base station in user's mobile device in alliance.
Preferably, if all users are two classes in user coalitions, the user in each of which class is respectively provided with identical To base station communication speed, locality connection speed, file preference and mobile device memory space；And transmission speed in fellow users group group Rate is higher, with RhRepresent, and Rh＞ R0, R0Represent identical that all users have to base station transmission rate；Inhomogeneity user's group Transmission rate is relatively low between group, with RlRepresent；Then file cache strategy is with the implementation process of sharing files strategy：
When intercorrelation is strong, that is, meet condition Rl＞ nRhR0/(2Rh+(n-2)R0), calculate All Files m popularity values It is defined asIts file cache strategy and file cache strategy A principle phases Together, sharing files strategy is identical with sharing files strategy A principles；
When intercorrelation is weak, that is, meet condition Rl＜ nRhR0/(2Rh+(n-2)R0)), calculate All Files m popularity values It is defined asIts file cache strategy is identical with file cache strategy A principles, file point Enjoy strategy be when user i needs file m, first look in local mobile device whether the full content of storage file m；If No, then the file m cached in the user's j mobile devices in same alliance is obtained by locality connection, if user j and user I is same group, then the ratio of the file m that user j is shared is all parts of the file m of its caching, if user j and user I is different groups, then user j does not share cached file m with user i；If do not had in the user's mobile device in same alliance There are caching whole file m, user i that the remainder of file m is downloaded from base station.
Relative to prior art, the beneficial effects of the invention are as follows：User carries out local file and delays using mobile network's terminal Deposit, and file-sharing is carried out by local connection at a high speed, the transmission for substantially reducing the mobile network's business based on multimedia is prolonged Late, improve the satisfaction of user.
Brief description of the drawings
Fig. 1 is the flow chart of the embodiment of the present invention；
Fig. 2 is the optimal file cache strategic process figure of user coalitions of the embodiment of the present invention；
Fig. 3 is the schematic diagram of the embodiment of the present invention.
Specific embodiment
Understand for the ease of those of ordinary skill in the art and implement the present invention, below in conjunction with the accompanying drawings and embodiment is to this hair It is bright to be described in further detail, it will be appreciated that implementation example described herein is merely to illustrate and explain the present invention, not For limiting the present invention.
A kind of local cache sharing files method based on mobile collective intelligence network that the present invention is provided, comprises the following steps：
Step 1：User coalitions general layout based on gunz sharing files network, user coalitions are built based on Cooperative reference General layout is the set that multiple user files that user is formed share alliance；See Fig. 1, it is implemented including following sub-step：
Step 1.1：Define a kind of good and bad relation for weighing alliance general layout S and alliance general layout R
Alliance general layout S is better than alliance general layout R, and the service delay of and if only if all users under alliance general layout S is all little In the service delay under alliance general layout R, and service delay of at least one user under alliance general layout S strictly less than Service delay under alliance general layout R, i.e., And a kind of at least strict being less than of holding is closed System, wherein, ci(S) service delay of the user i under alliance general layout S is represented；
Step 1.2：Define the principle that alliance's general layout updates：Combination principle, separation principle and addition principle；
Combination principle：If there is multiple alliances, the alliance's general layout after its merging is more excellent, i.e., Then merge all scattered alliance { S1, S2..., SlBe
Separation principle：If there is an alliance, the alliance's general layout after multiple alliances, and fractionation can be split as more It is excellent, i.e.,Then by allianceIt is decomposed into { S1, S2..., Sl}；
Add principle：If an alliance S1Middle to there is a Ge Zi alliances S ', it departs from alliance S1Coalize S2Alliance afterwards General layout is more excellent, i.e.,Then by alliance S1Subset S ' coalize S2；
Step 1.3：Initialization alliance general layout is the alliance S0 comprising all isolated users；
Step 1.4：Judge whether to meet the alliance of combination principle；
If it is present updating alliance's general layout according to combination principle, new alliance's general layout is obtained for S；And the circulation that continues is held Row step 1.4；
If it does not exist, then performing following step 1.5；
Step 1.5：Judge whether to meet the alliance of separation principle；
If it is present updating alliance's general layout according to separation principle, new alliance's general layout is obtained for S；And the circulation that continues is held Row step 1.5；
If it does not exist, then performing following step 1.6；
Step 1.6：Judge whether to meet the alliance for adding principle；
If it is present according to adding principle to update alliance's general layout, obtaining new alliance's general layout for S；And the circulation that continues is held Row step 1.6；
If it does not exist, then revolution performs the step 1.7.
Step 1.7：Judge whether S0 is equal to S；
If it is not, revolution performs step 1.4；
If so, then exporting alliance's general layout of stabilization, this flow terminates.
See Fig. 3 (a), in the present embodiment, it is assumed that have 4 users, then the alliance's general layout being likely to form and corresponding user Service delay it is as shown in the table：
According to good and bad relationUnderstand,Because the service of user 1 and user 2 in the case of { 1,2 } Postpone to be 64 and 43, the service delay 70 and 70 respectively less than in the case of { 1 }, { 2 }.
Embodiment realizes that the algorithm of Stable coalitions general layout is as follows：
1) initialization alliance general layout is { 1 }, { 2 }, { 3 }, { 4 }.
2) alliance { 1 } and alliance { 2 } meet combination principle, merge into { 1,2 }, update alliance's general layout for { 1,2 }, { 3 }, {4}。
3) alliance { 3 } and alliance { 4 } meet combination principle, merge into { 3,4 }, and it is { 1,2 }, { 3,4 } to update alliance's general layout.
4) in the absence of the alliance for meeting combination principle.
5) in the absence of the alliance for meeting disassembly principle.
6) alliance { 1,2 } and { 3,4 } meet addition principle, and it is { 1,2,4 }, { 3 } to update alliance's general layout.
7) in the absence of the alliance for meeting addition principle.
8) in the absence of the alliance for meeting combination principle.
9) alliance { 1,2,4 } meets disassembly principle, and it is { 1 }, { 2,4 }, { 3 } to update alliance's general layout.
10) in the absence of the alliance for meeting fractionation, addition or combination principle, alliance's general layout of stabilization is { 1 }, { 2,4 }, { 3 }.
Step 2：It is that specific user alliance formulates optimal file cache according to the user coalitions general layout formed using step 1 Strategy and sharing files strategy；
See Fig. 2, file cache strategy is implemented including following sub-step：
Step 2.1：User-file is set up to (i, m) list
Step 2.2：Based on user preference file distribution, user's locality connection speed, user and base station transmission rate, calculate Popularity of each user-file to (i, m)
Wherein RI, 0It is the transmission rate between user i and base station, RJ, iIt is the local transmission speed between user i and user j Rate,It is user i to the preference of file m, smIt is the size of file m；
Step 2.3：From listIt is middle to remove user-file pair that all popularities are negative value；
Step 2.4：Judge listWhether it is empty；
If so, then this flow terminates；
If it is not, then continuing executing with step 2.5；
Step 2.5：CalculateIn all user-files pair pre-cache ratio
Wherein γiIt is the mobile device free space of user i, ymIt is the ratio of the uncached part of file m；
Step 2.6：Choose listMiddle popularity and pre-cache ratio productMaximum user-file pair, And from listMiddle removal this document pair；
Step 2.7：The ratio for specifying user's i cache files m is
Step 2.8：The mobile device free space for updating user i is
Step 2.9：Whether the mobile device free space for judging user i is 0；
If so, then from listIt is middle to remove all user-files pair comprising user i；And perform following step 2.10；
If it is not, then performing following step 2.10；
Step 2.10：The ratio of the uncached part of more new file m is
Step 2.11：Whether judge that the ratio of the uncached part of file m becomes is 0；
If so, then from listIt is middle to remove all user-files pair comprising file m；And turn round the execution step 2.4；
If it is not, then revolution performs the step 2.4.
See Fig. 3 (b), in the present embodiment, it is assumed that have a user coalitions { 1,2,3 }, caching shares file { a, b, c }, The parameter being related to is as follows：
ListFor (1, a), (1, b), (1, c), (2, a), (2, b), (2, c), (3, a), (3, b), (3, c), according to public affairs The popularity that formula is calculated is as follows：
From listMiddle removal (2, a) and (2, c).
Removal popularity is the user-file of negative value to rear, listFor (1, a), (1, b), (1, c), (2, b), (3, a), (3, b), (3, c).The product of pre-cache ratio and popularity and pre-cache ratio is as follows：
Maximum user-file is selected to (2, b), the ratio for specifying the cache file b of user 2 is 0.5, is removed from list (2, b), the free space of user 2 is changed into 0, and the ratio of the uncached part of file b is changed into 0.2.Update pre-cache ratio and people The product of gas index and pre-cache ratio is as follows：
Maximum user-file is selected to (3, c), the ratio for specifying the cache file c of user 3 is 1, is removed from list (3, c), the free space of user 3 is changed into 0, removed from list (3, a) with (3, b), the ratio of the uncached part of file c becomes It is 0, removed from list (1, c).The product for updating pre-cache ratio and popularity and pre-cache ratio is as follows：
Maximum user-file is selected to (1, b), the ratio for specifying the cache file b of user 1 is 0.15, is moved from list Except (1, b), the free space of user 3 is changed into 0, and (1, c), the ratio of the uncached part of file b is changed into for removal from list 0.05.List is sky.The optimal cache policy for finally giving is that the cache file b ratios of user 1 are 0.15, the cache file b of user 2 Ratio is 0.8, and the ratio of the cache file c of user 3 is 1.
The process that implements of wherein sharing files strategy is：When user i needs file m, local movement is first looked at In equipment whether the full content of storage file m；If it is not, the user j obtained by locality connection in same alliance is moved The file m cached in dynamic equipment, the ratio of the file m that user j is shared is all parts of the file m of its caching；If same There is no caching whole file m, user i that the remainder of file m is downloaded from base station in user's mobile device in one alliance.
In the present embodiment, when user 3 needs file c, first look at local mobile device caching, due to 3 cached it is complete Portion file c, can directly use.When user 3 needs file b, check that local mobile device does not have a cache file b, user 3 from User 1 and user 2 obtain 0.15 and 0.8 file b respectively, then remaining 0.05 file b is obtained from base station.
Step 3：According to file cache strategy and sharing files strategy that step 2 is obtained, user downloads corresponding ratio from base station The file of example is to local mobile device.
After user coalitions general layout is formed, each alliance specifies an alliance director to the present embodiment, by alliance director Calculate with the optimal file cache of implementation and supervision with share strategy.Can select to be located at the user in the middle of user coalitions, or have The user of larger mobile device memory space, or with very fast locally-attached user as alliance director.Alliance is responsible for People obtains the file preference of user by locality connection, and mobile device memory space, locality connection speed between each user is each to use The information such as transmission rate is used to calculate optimal file cache and shares strategy between family and base station.
See Fig. 3 (b), the specific implementation process of the present embodiment is described as follows：
The memory space of user 1,2,3 is respectively 3,16,10, if use of the selection with larger mobile device memory space Family is alliance director as alliance director, then user 2.The average local connection speed of user 1,2,3 is respectively 4,3.5, 4.5, if selection has very fast locally-attached user as alliance director, selection user 3 is alliance director.
In the present embodiment, if user coalitions, by closely located, file preference is similar, the similar user's group of mobile device Into that is, all users have identical to base station communication speed, and locality connection speed, file preference and mobile device storage are empty Between, then the file cache strategy of each user is identical with sharing files strategy.
The implementation process of wherein file cache strategy A is：The popularity for calculating All Files m first isWherein n is the number of users in alliance.All popularities are negative value (qm＜ 0) File will not be buffered, i.e.,Lm={ m1, m2... for popularity be on the occasion of (qm＞ 0) listed files, with qmIt is non- Sort ascending.If total memory space of the mobile device of user is less than L in alliancemThe summation of the size of middle All Files, then delay Deposit LmIn preceding k file, k meetPreceding k-1 file is all cached, each The k-1 1/n of file before user cache, i.e.,K-th file is partly cached, each user The ratio of caching isIf total memory space of the mobile device of user is not less than L in alliancem The summation of the size of middle All Files, then cache LmIn All Files, i.e.,
The realization of sharing files strategy A is including process：When user i needs file m, local mobile device is first looked at In whether the full content of storage file m；If it is not, the user j obtained by locality connection in same alliance is moved and set The file m of standby middle caching, the ratio of the file m that user j is shared is all parts of the file m of its caching；If same There is no caching whole file m, user i that the remainder of file m is downloaded from base station in user's mobile device in alliance.
See Fig. 3 (c), the specific implementation process of embodiment is described as follows：
Assuming that there is a user coalitions { 1,2,3,4,5,6 }, the complete homogeneity of user, caching shares file { a, b, c, d }, relates to And the parameter that arrives is as follows：
pa 0.1 pb 0.2 pc 0.3 pd 0.4
R 10 R0 1 γ 20
sa 10 sb 20 sc 90 sd 60
It is as follows according to the popularity that formula is calculated：
qa qb qc qd
-13.5 3.0 58.5 72.0
File a will not be buffered, list LmIt is { c, d, b } that preceding 2 files will be buffered, each user cache file c's Ratio is 1/6=0.1667, and the ratio of each user cache file d is
When user 1 needs file c, the file c of its caching is obtained respectively from user 2~6, it is not necessary to published papers under base station Part.When user 1 needs file d, the file d of its caching is obtained respectively from user 2~6, then remaining ratio is obtained from base station It is 0.5 file d.When user 1 needs file a or b, it is necessary to directly be downloaded from base station.
In the present embodiment, if user coalitions can be divided into two user's groups, every group is n/2 user, with the use in group Family is fellow users mutually similar, and the user of different groups is user different each other.Transmission rate is (with group in group The speed of file is transmitted between any two users) it is higher, with RhRepresent, and Rh＞ R0.Transmission rate (is appointed in difference group between group The speed of file is transmitted between what two user) it is relatively low, with RlRepresent.Due to the still well-balanced distribution of user, so each user Cache policy is identical, and calculation is as follows.
When intercorrelation is strong, that is, meet condition Rl＞ nRhR0/(2Rh+(n-2)R0), calculate All Files m popularity values It is defined asIts file cache strategy and file cache strategy A principle phases Together, sharing files strategy is identical with sharing files strategy A principles；
See Fig. 3 (d), the specific implementation process of embodiment is described as follows：
Assuming that there is a user coalitions { 1,2,3,4,5,6 }, it is divided into two user's groups { 1,2,3 } and { 4,5,6 }, caching point File { a, b, c, d } is enjoyed, the parameter being related to is as follows：
pa 0.1 pb 0.2 pc 0.3 pd 0.4
Rh 10 Rl 5 R0 1 γ 20
sa 10 sb 20 sc 90 sd 60
Can be with design conditions Rl＞ nRhR0/(2Rh+(n-2)R0) set up, according to the following institute of popularity that formula is calculated Show：
qa qb qc qd
-14.4 1.2 50.4 64.8
File a will not be buffered, list LmIt is { d, c, b } that preceding 2 files will be buffered, each user cache file d's Ratio is 1/6=0.1667, and the ratio of each user cache file c is
When user 1 needs file d, the file d of its caching is obtained respectively from user 2~6, it is not necessary to published papers under base station Part.When user 1 needs file c, the file c of its caching is obtained respectively from user 2~6, then remaining ratio is obtained from base station It is 0.3333 file c.When user 1 needs file a or b, it is necessary to directly be downloaded from base station.
When intercorrelation is weak, that is, meet condition Rl＜ nRhR0/(2Rh+(n-2)R0)), calculate All Files m popularity values It is defined asIts file cache strategy is identical with file cache strategy A principles；File point Enjoy strategy be when user i needs file m, first look in local mobile device whether the full content of storage file m；If No, then the file m cached in the user's i mobile devices in same alliance is obtained by locality connection, if user i and user I is same group, then the ratio of the file m that user i is shared is all parts of the file m of its caching, if user i and user I is different groups, then user i does not share cached file m with user i；If do not had in the user's mobile device in same alliance There are caching whole file m, user i that the remainder of file m is downloaded from base station.
Assuming that there is a user coalitions { 1,2,3,4,5,6 }, it is divided into two user's groups { 1,2,3 } and { 4,5,6 }, caching point File { a, b, c, d } is enjoyed, the parameter being related to is as follows：
pa 0.1 pb 0.2 pc 0.3 pd 0.4
Rh 10 Rl 2 R0 1 γ 20
sa 10 sb 20 sc 90 sd 60
It is as follows according to the popularity that formula is calculated：
qa qb qc qd
-17.1 -4.2 26.1 43.2
File a, b will not be buffered, list LmIt is { d, c } that preceding 2 files will be buffered, each user cache file d's Ratio is 1/6=0.1667, and the ratio of each user cache file c is
When user 1 needs file d, the file d of its caching is obtained respectively from user 2,3, user 1 can not be from user 4~6 File d is obtained, user 1 obtains the file c that remaining ratio is 0.5 from base station again.When user 1 needs file c, from user 2, The 3 file c for obtaining its caching respectively, user 1 can not obtain file c from user 4~6, and user 1 obtains remaining ratio from base station again Example is 0.6667 file c.When user 1 needs file a or b, it is necessary to directly be downloaded from base station.
The user coalitions that file cache is shared are formed present invention is primarily based on collective intelligence network, is transmitted by locality connection reduction Postpone.This method devises one kind and obtains with individual rationality, Dhp stability and contract stabilization according to Cooperative reference The distributed algorithm of the user coalitions general layout of property.Introduce the concept of file popularity, it is determined that always transmission is prolonged to make user coalitions The optimal cache policy for minimizing late.The local cache file sharing system based on mobile collective intelligence network obtained by the present invention Mobile network's transmission delay can be reduced.
It should be appreciated that the part that this specification is not elaborated belongs to prior art.
It should be appreciated that the above-mentioned description for preferred embodiment is more detailed, therefore can not be considered to this The limitation of invention patent protection scope, one of ordinary skill in the art is not departing from power of the present invention under enlightenment of the invention Profit requires under protected ambit, can also make replacement or deform, each falls within protection scope of the present invention, this hair It is bright scope is claimed to be determined by the appended claims.

Claims (7)

1. it is a kind of based on the local cache sharing files method for moving collective intelligence network, it is characterised in that to comprise the following steps：
Step 1：User coalitions general layout based on gunz sharing files network, the user coalitions are built based on Cooperative reference General layout is the set that multiple user files that user is formed share alliance；
Step 2：It is that specific user alliance formulates optimal file cache strategy according to the user coalitions general layout formed using step 1 With sharing files strategy；
Step 3：According to file cache strategy and sharing files strategy that step 2 is obtained, user downloads corresponding proportion from base station File is to local mobile device.
2. it is according to claim 1 based on the local cache sharing files method for moving collective intelligence network, it is characterised in that step Rapid 1 implements including following sub-step：
Step 1.1：Define a kind of good and bad relation for weighing alliance general layout S and alliance general layout R
Alliance general layout S is better than alliance general layout R, and the service delay of and if only if all users under alliance general layout S is all not more than and exists Service delay under alliance general layout R, and service delay of at least one user under alliance general layout S is strictly less than in alliance Service delay under general layout R, i.e., And at least strict holding one kind is less than relation, its In, ci(S) service delay of the user i under alliance general layout S is represented；
Step 1.2：Define the principle that alliance's general layout updates：Combination principle, separation principle and addition principle；
Combination principle：If there is multiple alliances, the alliance's general layout after its merging is more excellent, i.e., Then merge all scattered alliance { S1,S2,…,SlBe
Separation principle：If there is an alliance, the alliance's general layout that can be split as after multiple alliances, and fractionation is more excellent, i.e.,Then by allianceIt is decomposed into { S1,S2,…,Sl}；
Add principle：If an alliance S1Middle to there is a Ge Zi alliances S ', it departs from alliance S1Coalize S2Alliance's general layout afterwards It is more excellent, i.e.,Then by alliance S1Subset S ' coalize S2；
Step 1.3：Initialization alliance general layout is the alliance S0 comprising all isolated users；
Step 1.4：Judge whether to meet the alliance of combination principle；
If it is present updating alliance's general layout according to combination principle, new alliance's general layout is obtained for S；And the circulation that continues performs step Rapid 1.4；
If it does not exist, then performing following step 1.5；
Step 1.5：Judge whether to meet the alliance of separation principle；
If it is present updating alliance's general layout according to separation principle, new alliance's general layout is obtained for S；And the circulation that continues performs step Rapid 1.5；
If it does not exist, then performing following step 1.6；
Step 1.6：Judge whether to meet the alliance for adding principle；
If it is present according to adding principle to update alliance's general layout, obtaining new alliance's general layout for S；And the circulation that continues performs step Rapid 1.6；
If it does not exist, then revolution performs the step 1.7；
Step 1.7：Judge whether S0 is equal to S；
If it is not, revolution performs step 1.4；
If so, then exporting alliance's general layout of stabilization, this flow terminates.
3. it is according to claim 1 based on the local cache sharing files method for moving collective intelligence network, it is characterised in that step File cache strategy described in rapid 2 is implemented including following sub-step：
Step 2.1：User-file is set up to (i, m) list
Step 2.2：Based on user preference file distribution, user's locality connection speed, user and base station transmission rate, each is calculated Popularity of the user-file to (i, m)
d i m = [ Σ j ≠ i ( 1 R j , 0 - 1 R j , i ) p j m - 1 - p i m R i , 0 ] s m ;
Wherein Ri,0It is the transmission rate between user i and base station, Rj,iIt is the local transmission speed between user i and user j, It is user i to the preference of file m, smIt is the size of file m；
Step 2.3：From listIt is middle to remove user-file pair that all popularities are negative value；
Step 2.4：Judge listWhether it is empty；
If so, then this flow terminates；
If it is not, then continuing executing with step 2.5；
Step 2.5：CalculateIn all user-files pair pre-cache ratio
x i m ~ = m i n { 1 , γ i / s m , y m } ;
Wherein γiIt is the mobile device free space of user i, ymIt is the ratio of the uncached part of file m；
Step 2.6：Choose listMiddle popularity and pre-cache ratio productMaximum user-file pair, and from row TableMiddle removal this document pair；
Step 2.7：The ratio for specifying user's i cache files m is
Step 2.8：The mobile device free space for updating user i is
Step 2.9：Whether the mobile device free space for judging user i is 0；
If so, then from listIt is middle to remove all user-files pair comprising user i；And perform following step 2.10；
If it is not, then performing following step 2.10；
Step 2.10：The ratio of the uncached part of more new file m is
Step 2.11：Judge whether the ratio of the uncached part of file m is changed into 0；
If so, then from listIt is middle to remove all user-files pair comprising file m；And turn round the execution step 2.4；
If it is not, then revolution performs the step 2.4.
4. it is according to claim 1 based on the local cache sharing files method for moving collective intelligence network, it is characterised in that step The process that implements of sharing files strategy described in rapid 2 is：When user i needs file m, local mobile device is first looked at In whether the full content of storage file m；If it is not, the user j obtained by locality connection in same alliance is moved and set The file m of standby middle caching, the ratio of the file m that user j is shared is all parts of the file m of its caching；If same There is no caching whole file m, user i that the remainder of file m is downloaded from base station in user's mobile device in alliance.
5. the local cache sharing files method based on mobile collective intelligence network according to claim 1-4 any one, its It is characterised by：After forming user coalitions general layout, each alliance specifies an alliance director, is calculated and is supervised by alliance director Perform optimal file cache strategy and sharing files strategy.
6. the local cache sharing files method based on mobile collective intelligence network according to claim 1-4 any one, its It is characterised by：If all users have identical to base station communication speed, locality connection speed, file preference in user coalitions With mobile device memory space, then the file cache strategy of each user is identical with sharing files strategy；
Wherein, the realization of file cache strategy A includes following sub-step：
Step A1：Calculate the popularity q of All Files mm；
q m : = [ n R - ( n - 1 ) R 0 R p m - 1 ] s m ;
Wherein n is the number of users in alliance, smIt is the size of file m, R is the identical that has of all users to base station communication Speed, R0It is all two two users to the identical locality connection speed that has, pmThe identical having for all users is to file The preference of m；
Step A2：All popularities will not be buffered for the file of negative value, Lm={ m1,m2... } and for popularity be on the occasion of Listed files, with qmNon-increasing sorts；
Step A3：Judge total memory space of mobile device of user in alliance whether less than LmThe size of middle All Files it is total With；
If so, then caching LmIn preceding k file, k meetPreceding k-1 file quilt All cache；The k-1 1/n of file before each user cache, i.e., K-th file is by part Cache, the ratio of each user cache isWherein, γ is that the identical that all users have is moved Dynamic equipment free space,It is LmIn i-th size of file；
If it is not, then caching LmIn All Files, i.e.,
Wherein, the realization of sharing files strategy A is including process：When user i needs file m, first look at local movement and set In standby whether the full content of storage file m；If it is not, the user j obtained by locality connection in same alliance is moved The ratio of the file m cached in equipment, the file m that user j is shared is all parts of the file m of its caching；If same There is no caching whole file m, user i that the remainder of file m is downloaded from base station in user's mobile device in alliance.
7. the local cache sharing files method based on mobile collective intelligence network according to claim 6 any one, it is special Levy and be：If all users are two classes in user coalitions, the user in each of which class is respectively provided with identical to base station communication Speed, locality connection speed, file preference and mobile device memory space；And transmission rate is higher in fellow users group group, with RhRepresent, and Rh＞ R0, R0Represent identical that all users have to base station transmission rate；Transmitted between inhomogeneity user's group group Speed is relatively low, with RlRepresent；Then file cache strategy is with the implementation process of sharing files strategy：
When intercorrelation is strong, that is, meet condition Rl＞ NRhR0/(2Rh+(n-2)R0), calculate the definition of All Files m popularities value ForIts file cache strategy is identical with file cache strategy A principles, text It is identical with sharing files strategy A principles that part shares strategy；
When intercorrelation is weak, that is, meet condition Rl＜ nRhR0/(2Rh+(n-2)R0)), calculate the definition of All Files m popularities value ForIts file cache strategy is identical with file cache strategy A principles, sharing files plan Slightly be when user i needs file m, first look in local mobile device whether the full content of storage file m；If not yet Have, then the file m cached in the user's j mobile devices in same alliance is obtained by locality connection, if user j and user i It it is same group, then the ratio of the file m that user j is shared is all parts of the file m of its caching, if user j and user i It it is different groups, then user j does not share cached file m with user i；If do not had in the user's mobile device in same alliance Whole file m are cached, user i downloads the remainder of file m from base station.
CN201610985297.0A 2016-11-09 2016-11-09 A kind of local cache sharing files method based on mobile collective intelligence network Active CN106708923B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610985297.0A CN106708923B (en) 2016-11-09 2016-11-09 A kind of local cache sharing files method based on mobile collective intelligence network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610985297.0A CN106708923B (en) 2016-11-09 2016-11-09 A kind of local cache sharing files method based on mobile collective intelligence network

Publications (2)

Publication Number Publication Date
CN106708923A true CN106708923A (en) 2017-05-24
CN106708923B CN106708923B (en) 2019-07-09

Family

ID=58940865

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610985297.0A Active CN106708923B (en) 2016-11-09 2016-11-09 A kind of local cache sharing files method based on mobile collective intelligence network

Country Status (1)

Country Link
CN (1) CN106708923B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109756908A (en) * 2017-11-01 2019-05-14 上海交通大学 Optimization method/system, storage medium and the equipment of wireless network cache policy
CN112597388A (en) * 2020-12-18 2021-04-02 南京邮电大学 Cache-enabled D2D communication joint recommendation and caching method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110153773A1 (en) * 2009-12-23 2011-06-23 Apple Inc. Efficient service advertisement and discovery in a peer-to-peer networking environment with cooperative advertisement
CN103763334A (en) * 2013-05-28 2014-04-30 大连理工大学 Multimedia cooperative sharing method based on P2P-BT in VANET
CN104967685A (en) * 2015-06-25 2015-10-07 广东德诚网络科技有限公司 Streaming media multi-level cache network acceleration method based on Flash P2P
CN105791391A (en) * 2016-01-29 2016-07-20 西安交通大学 Method for calculating optimal cooperation distance of D2D fusion network based on file popularity

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110153773A1 (en) * 2009-12-23 2011-06-23 Apple Inc. Efficient service advertisement and discovery in a peer-to-peer networking environment with cooperative advertisement
CN103763334A (en) * 2013-05-28 2014-04-30 大连理工大学 Multimedia cooperative sharing method based on P2P-BT in VANET
CN104967685A (en) * 2015-06-25 2015-10-07 广东德诚网络科技有限公司 Streaming media multi-level cache network acceleration method based on Flash P2P
CN105791391A (en) * 2016-01-29 2016-07-20 西安交通大学 Method for calculating optimal cooperation distance of D2D fusion network based on file popularity

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHIWEN HU: "Game theoretic Approaches for Wireless Proactive Caching", 《IEEE》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109756908A (en) * 2017-11-01 2019-05-14 上海交通大学 Optimization method/system, storage medium and the equipment of wireless network cache policy
CN109756908B (en) * 2017-11-01 2021-10-15 上海交通大学 Method/system for optimizing wireless network cache strategy, storage medium and equipment
CN112597388A (en) * 2020-12-18 2021-04-02 南京邮电大学 Cache-enabled D2D communication joint recommendation and caching method
CN112597388B (en) * 2020-12-18 2022-10-14 南京邮电大学 Cache-enabled D2D communication joint recommendation and caching method

Also Published As

Publication number Publication date
CN106708923B (en) 2019-07-09

Similar Documents

Publication Publication Date Title
Cave How disruptive is 5G?
He et al. Integrated networking, caching, and computing for connected vehicles: A deep reinforcement learning approach
Wang et al. Social data offloading in D2D-enhanced cellular networks by network formation games
Liu et al. Service pricing decision in cyber-physical systems: Insights from game theory
Zhang et al. Hierarchical caching for statistical QoS guaranteed multimedia transmissions over 5G edge computing mobile wireless networks
Jedari et al. A game-theoretic incentive scheme for social-aware routing in selfish mobile social networks
Hu et al. Public cloud storage-assisted mobile social video sharing: A supermodular game approach
CN107734482B (en) The content distribution method unloaded based on D2D and business
Liu et al. Data sharing in VANETs based on evolutionary fuzzy game
Sinky et al. Responsive content-centric delivery in large urban communication networks: A LinkNYC use-case
Richerzhagen et al. Bypassing the cloud: Peer-assisted event dissemination for augmented reality games
Jiang et al. Efficient D2D content caching using multi-agent reinforcement learning
CN106708923A (en) Shared method of native cache file based on mobile intelligence network
Zhang et al. A game-theoretic approach for optimal distributed cooperative hybrid caching in D2D networks
Zhang et al. Two time-scale caching placement and user association in dynamic cellular networks
CN108810139A (en) A kind of wireless caching method based on Monte Carlo tree search auxiliary
Zhang et al. Buffer-aided device-to-device communication: Opportunities and challenges
Li et al. Computing cost optimization for multi-bs in mec by offloading
Ren et al. Recommender system for mobile users: Enjoy Internet of Things socially with wireless device-to-device physical links
Lian et al. Mobile edge cooperative caching strategy based on spatio-temporal graph convolutional model
Zhang et al. Power control in D2D network based on game theory
La et al. Dynamic network formation game with social awareness in D2D communications
CN109640298A (en) Mobile D2D content sharing method and system based on alliance formation game
Chen et al. A multi-agent reinforcement learning based power control algorithm for D2D communication underlaying cellular networks
Zhang et al. A bankruptcy game for optimize caching resource allocation in small cell networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant