CN113132466A - Multi-access communication method, device, equipment and medium based on code cache - Google Patents
Multi-access communication method, device, equipment and medium based on code cache Download PDFInfo
- Publication number
- CN113132466A CN113132466A CN202110292467.8A CN202110292467A CN113132466A CN 113132466 A CN113132466 A CN 113132466A CN 202110292467 A CN202110292467 A CN 202110292467A CN 113132466 A CN113132466 A CN 113132466A
- Authority
- CN
- China
- Prior art keywords
- file
- user
- base station
- user side
- acquisition request
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
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/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
- H04W8/20—Transfer of user or subscriber data
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Information Transfer Between Computers (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multi-access communication method, a device, equipment and a medium based on coding cache, wherein the method comprises the following steps: acquiring a target file from a file server through a base station, and reconstructing popularity distribution of the target file; distributing cache for a resident user side in a base station area, and acquiring a subfile of a target file in the base station through the resident user side; sending a file acquisition request to a base station through a first user side, or sending the file acquisition request to a second user side through the first user side; determining the group of the first user side according to the file acquisition request, and feeding back the subfiles of the target file to the first user side through the second user side; the base station acquires the non-target file in the file acquisition request from a cache of the base station or acquires the non-target file in the file acquisition request from a file server; and sending the non-target file to the first user terminal through the base station. The invention can reduce the network flow and ensure the file transmission quality, and can be widely applied to the technical field of communication.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a multi-access communication method, apparatus, device, and medium based on a code cache.
Background
With the construction of 5G, the development of the Internet of things and cloud computing industry and the continuous improvement of audio and video application permeability, the global network flow is increased at a high speed, and particularly, the global network flow is exponentially increased in a population-intensive area. Network throughput is sometimes variable, with significant differences in the number of network users and the user's demand for resources at different time periods. In the off-peak period of network flow, network communication resources are rich, and the user has unsaturated network requirements; during the network flow peak period, network communication resources are in shortage, and the burden of a service provider is increased; how to effectively utilize the network bandwidth, reduce the peak flow and reduce the congestion of the network flow at the peak time, especially the congestion of the backbone network, becomes a problem which needs to be solved urgently.
The D2D communication technique refers to a communication means for direct communication between two peer user nodes. The D2D network is a distributed network consisting of more than two peer user nodes. Mobile users in today's cellular networks use a large number of high data rate services, such as video sharing, gaming, proximity-aware social networks, etc., where they may be in range of direct communication, but their communication services are still provided by the core network, requiring the occupation of backbone network resources. In this case, D2D communication can greatly improve the spectrum efficiency of the network, reduce the backbone network traffic, and improve the network throughput, energy efficiency, latency, and fairness.
The coding cache is a novel communication storage and calculation integrated framework and a transmission mechanism: the server creates and distributes a linear combination of the content required by the different users, and the user then recovers the content he requested from the locally cached content. The communication transmission amount required by the network under the coding buffer scheme is reduced by times compared with the traditional scheme, and the gain depends on the buffer size of the user aggregate in all the networks (namely the accumulated memory size of all the available users).
D2D communication scheme based on code buffer has been proposed, which uses buffer to introduce codes in transmission, to make users closer to each other in actual distance respond to each other to satisfy their requests, further improving network throughput, and reducing network transmission capacity, especially reducing traffic between server and user. The existing D2D communication transmission schemes based on the coding buffer are proposed based on ideal conditions, and the influence of different file popularity and packet loss in an actual network is not considered.
Disclosure of Invention
In view of this, embodiments of the present invention provide a multi-access communication method, apparatus, device and medium based on a code cache, which can reduce network traffic and ensure file quality in a file transmission process.
One aspect of the present invention provides a multi-access communication method based on a code cache, including:
acquiring a first target file from a file server through a base station, and reconstructing popularity distribution of the first target file;
distributing a cache for a resident user side in the base station area, and acquiring a subfile of a second target file in the first target file through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique;
sending a file acquisition request to a base station through the first user terminal, or sending the file acquisition request to the second user terminal through the first user terminal;
determining the group of the first user side according to the file acquisition request, and feeding back a subfile of a second target file to the first user side through the second user side;
the base station acquires non-target files except the second target file in the first target file from a cache of the base station, or acquires the non-target files in the file acquisition request from the file server;
and sending the non-target file to the first user end through a base station so that the first user end obtains all files corresponding to the file obtaining request.
Optionally, the obtaining, by the base station, the first target file from the file server, and reconstructing popularity distribution of the first target file includes:
counting the requested times of each file in an original file set within a preset time period through the file server;
updating the popularity distribution of each file according to the requested times;
acquiring a first target file set with the highest popularity from the file server according to the size of the cache space of the base station;
taking the first target file set as a population, and respectively updating the popularity distribution of each file in the base station and the file server according to the requested times of the population.
Optionally, the allocating a cache to a resident user side in the base station region, and acquiring a subfile of a second target file in the first target file through the resident user side includes:
the base station cuts and divides a second target file set cached in the base station into subfiles with the same size;
the base station acquires the resident user side information in the area;
distributing a cache for the resident user side;
and distributing corresponding subfiles for each resident user side based on the cache of the resident user side according to the popularity distribution of each target file in the base station.
Optionally, the sending, by the first user equipment, a file acquisition request to a base station, or sending, by the first user equipment, the file acquisition request to the second user equipment includes:
when the subfile in the file acquisition request is cached in a local cache of a second user end, the first user end multicasts the file acquisition request to the second user end;
and when the subfile in the file acquisition request is not cached in a local cache of a second user terminal, the first user terminal sends the file acquisition request to the base station.
Optionally, the determining, according to the file obtaining request, the group to which the first user side belongs, and feeding back, to the first user side, a subfile of a target file through the second user side includes:
the second user end determines the group of the first user end according to the received file acquisition request;
the second user terminal sends a subfile to the first user terminal by multicast according to the group of the first user terminal and the group comprising two or more first user terminals; for a group containing a first client, the second client sends a subfile to the first client via a TCP unicast response.
Optionally, the sending, by multicast, a subfile to a group including two or more first clients includes:
adding the user terminals belonging to the same group into a multicast group;
carrying out XOR coding on the file acquisition request of the first user end to obtain a coded file;
cutting the encoded file into a plurality of data blocks of the same size;
adding a user identification number and a serial number into each data block and then packaging to obtain a data packet;
and adding a retransmission mechanism in the multicast group, and sending the data packet to the first user end.
Optionally, the method further comprises:
the first user terminal receives the file sent by the second user terminal, extracts and decodes the file to obtain the content of the requested file, and combines the content of the requested file locally existing in the first user terminal to obtain the requested file;
alternatively, the first and second electrodes may be,
and the first user terminal receives the file sent by the base station as a requested file.
Another aspect of the embodiments of the present invention further provides a multi-access communication apparatus based on a code cache, including:
the system comprises a first module, a second module and a third module, wherein the first module is used for acquiring a first target file from a file server through a base station and reconstructing popularity distribution of the first target file;
the second module is used for distributing cache for a resident user side in the base station area and acquiring a subfile of a second target file in the first target file through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique;
a third module, configured to send a file acquisition request to a base station through the first user end, or send the file acquisition request to the second user end through the first user end;
a fourth module, configured to determine, according to the file acquisition request, a group to which the first user belongs, and feed back, to the first user, a subfile of a second target file through the second user;
a fifth module, configured to acquire, by the base station, a non-target file, excluding the second target file, in the first target file from a cache of the base station, or acquire, by the base station, a non-target file in the file acquisition request from the file server;
a sixth module, configured to send the non-target file to the first user end through a base station, so that the first user end obtains all files corresponding to the file obtaining request.
Another aspect of the embodiments of the present invention further provides an electronic device, including a processor and a memory;
the memory is used for storing programs;
the processor executes the program to implement the method as described above.
Yet another aspect of the embodiments of the present invention provides a computer-readable storage medium, which stores a program, which is executed by a processor to implement the method as described above.
The embodiment of the invention also discloses a computer program product or a computer program, which comprises computer instructions, and the computer instructions are stored in a computer readable storage medium. The computer instructions may be read by a processor of a computer device from a computer-readable storage medium, and the computer instructions executed by the processor cause the computer device to perform the foregoing method.
The embodiment of the invention obtains the target file from the file server through the base station and reconstructs the popularity distribution of the target file; distributing cache for a resident user side in the base station area, and acquiring a subfile of the target file in the base station through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique; sending a file acquisition request to a base station through the first user terminal, or sending the file acquisition request to the second user terminal through the first user terminal; determining the group of the first user side according to the file acquisition request, and feeding back a subfile of a target file to the first user side through the second user side; the base station acquires the non-target file in the file acquisition request from a cache of the base station, or the base station acquires the non-target file in the file acquisition request from the file server; and sending the non-target file to the first user end through a base station so that the first user end obtains all files corresponding to the file obtaining request. The invention can reduce the network flow and ensure the file quality in the file transmission process.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flowchart illustrating the overall steps provided by an embodiment of the present invention;
FIG. 2 is a block diagram of a communication system according to an embodiment of the present invention;
fig. 3 is a user packet multicast example provided by the embodiment of the present invention;
FIG. 4 is a communication embodiment of the present invention including three users;
fig. 5 is a timing diagram of the interaction between the ue and the bs and the server according to an embodiment of the present invention;
fig. 6 is another specific example of communication including three users according to the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
To solve the problems in the prior art, an embodiment of the present invention provides a multi-access communication method based on a code cache, including:
acquiring a first target file from a file server through a base station, and reconstructing popularity distribution of the first target file;
distributing a cache for a resident user side in the base station area, and acquiring a subfile of a second target file in the first target file through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique;
sending a file acquisition request to a base station through the first user terminal, or sending the file acquisition request to the second user terminal through the first user terminal;
determining the group of the first user side according to the file acquisition request, and feeding back a subfile of a second target file to the first user side through the second user side;
the base station acquires non-target files except the second target file in the first target file from a cache of the base station, or acquires the non-target files in the file acquisition request from the file server;
and sending the non-target file to the first user end through a base station so that the first user end obtains all files corresponding to the file obtaining request.
Optionally, the obtaining, by the base station, the first target file from the file server, and reconstructing popularity distribution of the first target file includes:
counting the requested times of each file in an original file set within a preset time period through the file server;
updating the popularity distribution of each file according to the requested times;
acquiring a first target file set with the highest popularity from the file server according to the size of the cache space of the base station;
taking the first target file set as a population, and respectively updating the popularity distribution of each file in the base station and the file server according to the requested times of the population.
Optionally, the allocating a cache to a resident user side in the base station region, and acquiring a subfile of a second target file in the first target file through the resident user side includes:
the base station cuts and divides a second target file set cached in the base station into subfiles with the same size;
the base station acquires the resident user side information in the area;
distributing a cache for the resident user side;
and distributing corresponding subfiles for each resident user side based on the cache of the resident user side according to the popularity distribution of each target file in the base station.
Optionally, the sending, by the first user equipment, a file acquisition request to a base station, or sending, by the first user equipment, the file acquisition request to the second user equipment includes:
when the subfile in the file acquisition request is cached in a local cache of a second user end, the first user end multicasts the file acquisition request to the second user end;
and when the subfile in the file acquisition request is not cached in a local cache of a second user terminal, the first user terminal sends the file acquisition request to the base station.
Optionally, the determining, according to the file obtaining request, the group to which the first user side belongs, and feeding back, to the first user side, a subfile of a target file through the second user side includes:
the second user end determines the group of the first user end according to the received file acquisition request;
the second user terminal sends a subfile to the first user terminal by multicast according to the group of the first user terminal and the group comprising two or more first user terminals; for a group containing a first client, the second client sends a subfile to the first client via a TCP unicast response.
Optionally, the sending, by multicast, a subfile to a group including two or more first clients includes:
adding the user terminals belonging to the same group into a multicast group;
carrying out XOR coding on the file acquisition request of the first user end to obtain a coded file;
cutting the encoded file into a plurality of data blocks of the same size;
adding a user identification number and a serial number into each data block and then packaging to obtain a data packet;
and adding a retransmission mechanism in the multicast group, and sending the data packet to the first user end.
Optionally, the method further comprises:
the first user terminal receives the file sent by the second user terminal, extracts and decodes the file to obtain the content of the requested file, and combines the content of the requested file locally existing in the first user terminal to obtain the requested file;
alternatively, the first and second electrodes may be,
and the first user terminal receives the file sent by the base station as a requested file.
In another aspect, the present invention further provides a multi-access communication device based on a code cache, including:
the system comprises a first module, a second module and a third module, wherein the first module is used for acquiring a first target file from a file server through a base station and reconstructing popularity distribution of the first target file;
the second module is used for distributing cache for a resident user side in the base station area and acquiring a subfile of a second target file in the first target file through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique;
a third module, configured to send a file acquisition request to a base station through the first user end, or send the file acquisition request to the second user end through the first user end;
a fourth module, configured to determine, according to the file acquisition request, a group to which the first user belongs, and feed back, to the first user, a subfile of a second target file through the second user;
a fifth module, configured to acquire, by the base station, a non-target file, excluding the second target file, in the first target file from a cache of the base station, or acquire, by the base station, a non-target file in the file acquisition request from the file server;
a sixth module, configured to send the non-target file to the first user end through a base station, so that the first user end obtains all files corresponding to the file obtaining request.
The embodiment of the invention also provides the electronic equipment, which comprises a processor and a memory;
the memory is used for storing programs;
the processor executes the program to implement the method as described above.
An embodiment of the present invention further provides a computer-readable storage medium, where the storage medium stores a program, and the program is executed by a processor to implement the method described above.
The embodiment of the invention also discloses a computer program product or a computer program, which comprises computer instructions, and the computer instructions are stored in a computer readable storage medium. The computer instructions may be read by a processor of a computer device from a computer-readable storage medium, and the computer instructions executed by the processor cause the computer device to perform the foregoing method.
The following detailed description of the embodiments of the present invention is made with reference to the accompanying drawings:
the invention provides a communication method among user mobile terminal equipment, a base station and a file server, which utilizes a centralized D2D coding caching scheme and a reliable multicast technology based on the file popularity, limitedly lightens the network transmission load, particularly reduces the network flow between the base station and a user and between the base station and the server, improves the data transmission efficiency and reduces the possibility of network congestion.
Referring to fig. 1 and 5, in a first step, the base station allocates a cache and caches more popular files in the file server. Supposing that a file server contains N files, the file server counts the number of times that each file in a file set is requested within a recent period of time, updates the popularity distribution P of the files, maintains a popularity distribution table, records in a file name-popularity key value pair mode, sorts the records according to the popularity of the files in a non-increasing mode, and sets the popularity of the ith file as Pi(ii) a The base station allocates the available buffer, assuming it can buffer Q files, Q<N; because the local cache size of the base station is limited, all files of the file server cannot be cached to the base station, and the base station can acquire the most popular Q files and the popularity information of the files from the file server based on the local available cache size and according to the popularity informationThe popularity of the files in the file server reconstructs the popularity distribution P' taking the part of the files as the whole, wherein the new popularity of the ith file is
Meanwhile, the base station maintains a popularity distribution table, records the popularity of Q files in the base station in a file name-popularity key value pair mode, and sorts the records according to the popularity of the files in a non-increasing mode.
And secondly, the resident users in the base station area distribute the cache and obtain partial subfiles of the popular files in the base station. In particular, because in practical situations, a large number of users may exist in the area under the jurisdiction of the base station, and the caching of the users is limited, the invention reduces the network communication pressure by selecting the users (resident users) which often communicate with the base station and caching partial sub-files of the files popular in the base station in the resident users. The base station firstly cuts the files cached in the base station into subfiles with the same size; a base station acquires user information resident in an area; the resident user allocates available cache; a popularity threshold is set based on the number of resident users and the size of the available cache, and the threshold may be set to the inverse of the sum of the available caches of the resident users, i.e., the threshold
Where K is the number of users, MiThe cache size of the ith user is inversely proportional to the sum of available caches of resident users, and when the number of available caches is more, the threshold value is smaller, so that more popular files can be cached in the user cache; dividing a file set into two parts based on file popularity distribution P' in a base station, wherein the files with popularity higher than a threshold value are called popular files and the rest are unpopular files, and classifying the files which exist in a file server but are not cached in the base station into unpopular files; the resident user acquires partial sub-files of all popular files from the base station.
And thirdly, the user sends a request to the base station or other users in the area. Specifically, if the subfiles of the requested file are cached in a local cache of the user, namely the file requested by the user is a popular file, the subfiles of the file are cached in each resident user, and the user multicasts request information to other users to request the missing subfiles of the requested file; and if no subfile of the requested file is cached in the local cache of the user, namely the file requested by the user is an unpopular file which is not cached in the cache of the user resident in the area, the user sends request information to the base station.
And fourthly, the user determines the group to which the user belongs according to the request information of other users, then sends the same encoding file to the users in the same group through reliable multicast, and responds to the user request in an independent group through TCP unicast. Specifically, the user determines the group to which the user sending the request belongs according to the request information of other users, that is, the users who can create the coding multicast opportunity are classified into the same group, and the other users are independently grouped; according to the group to which the user sending the request belongs, the user carries out XOR coding on files requested by the users in the same group to form a file for the user group which can create the coding multicast opportunity, and then the file is sent to the group of users through reliable multicast. For a user request which cannot create a coding multicast opportunity, namely, the users are individually grouped, the user which caches the requested file sends the file to the user which requests the file through a transmission method based on TCP.
Specifically, the reliable multicast implementation is as follows:
users belonging to the same group join a multicast group;
a user as a sender cuts the coded file into data blocks with a certain size, adds information such as a user identification number, a serial number (the number is from 1) and the like, and encapsulates the information into a data packet;
a user as a sender firstly multicasts a data packet with a serial number of 0 to a user requesting a file, wherein the data packet comprises information such as a user identification number, the number of data packets to be sent and the like, maintains a timer, waits for the confirmation of other users, and retransmits the data packet of the number 0 if the confirmation of all other users is not received within a certain time; after confirming that all users receive the number 0 packet, sequentially sending subsequent data packets, maintaining a timer, starting to send the data packets in sequence from the minimum confirmation number received in a period of time at intervals, and repeating the step until all receivers finish receiving all the data packets;
after receiving the data packet, the user as the receiver sends a piece of response information containing a user identification number and an acknowledgement number (the same as the sequence number of the data packet) to the sender, maintains a timer, sends the acknowledgement information of the received data packet with the maximum sequence number to the sender at intervals, and repeats the step until all the receivers finish receiving all the data packets;
and fifthly, the base station sends the file requested by the user to the user. When a plurality of users request the same file from a base station at the same time, if the file exists in a cache of the base station, the base station sends the file to the users through reliable multicast, updates a local file popularity distribution table and simultaneously informs a file server of updating the file popularity distribution table of the file server; if the file is not in the base station cache, the base station firstly requests the file from the file server, the file server sends the file to the base station through a transmission method based on TCP, the file popularity distribution table is updated, and the base station sends the file to a user through reliable multicast. When a requested file is requested by only one user, if the file exists in a base station cache, the base station unicasts the file requested by the user to the user through a transmission method based on TCP, updates a local file popularity distribution table and simultaneously informs a file server of updating the file popularity distribution table of the file server; if the file is not in the base station cache, the base station firstly requests the file from the file server, the file server sends the file to the base station through a transmission method based on TCP, the file popularity distribution table is updated, and the base station forwards the file to the user through the transmission method based on TCP.
And sixthly, the user receives the files sent by other users and the base station to obtain the requested file. The user receives the files sent by other users, extracts and decodes the files to obtain the content of the requested files, and combines the content of the requested files with the content of the local existing requested files to obtain the requested files; the user receives the file sent by the base station, namely the requested file.
In this embodiment, a communication system framework based on the method is described with reference to fig. 2, where the network model includes a file server, a base station, and K users, the file server stores a whole file set, the base station may communicate with the file server through the internet, the base station may communicate with the users directly, the users may communicate with each other directly, and both the base station and the users have a local cache of a certain size, and it is assumed that the users only request files included in the file server.
In this embodiment, a user grouping and multicasting method in the method is described with reference to fig. 3, where a user 1 caches a file 2 and a file 3, a user 2 caches a file 1 and a file 3, a user 3 caches a file 1 and a file 2, a user 1 requests a file 1, a user 2 requests a file 2, a user 3 requests a file 3, and a user 4 caches files requested by three users. For the user 4, the other three users may be classified into the same group, the three users join a multicast group, and the user 4 multicasts the file obtained by the xor encoding of the three requested files to the multicast group.
This embodiment uses fig. 4 to describe a communication method with three users proposed by the present invention, in which the system includes a file server with 4 files of equal size, a base station capable of caching 3 files, and three users, each of which can cache 3 files
Content of multiple file size. The base station firstly selects three most popular files in the file server to cache to the local, then reconstructs the popularity distribution taking the three files as the whole, the threshold value for distinguishing the popular files from the unpopular files is set to be 25%, the base station divides the two popular files into three parts, and each user caches two subfiles of each popular file. User 1 requests file 1, user 2 requests file 2, user 3 requests file 3, user 1 and user 2 multicast their requests to the other two users, user 3 sends the request to the base station. The first subfile of the file 1 required by the user 1 and the second subfile of the file 2 required by the user 2, namely the file 1-1 and the file 2-2, are cached in the user 3, and the userAnd 3, combining the two sub-files into one file through XOR coding, and multicasting the coded file to the user 1 and the user 2. After receiving the file sent by the user 3, the user 1 performs exclusive or decoding on the file and the local existing file 2-2 to obtain a required file 1-1, and then integrally caches the existing subfile user 1 locally to finally obtain the complete file 1. Similarly, the user 2 also obtains the file 2 by the same method. The base station unicasts file 3 directly to user 3. In this example, the file sent by the user 3 is formed by xoring two subfiles, and compared with the traditional transmission method of one-to-one response request without introducing codes, the transmission amount required is reduced by 50%. In fact, users may request popular files at a high rate, and users' requests for popular files may be responded to by communication between users, which reduces the amount of transmission required from the file server to the base station and from the base station to the users, compared to the conventional transmission method responded by the file server, and the base station only needs to participate in the transmission of unpopular files in response to requests, and the server needs to respond to fewer requests.
In summary, in the invention, during the idle period of the network, the more popular part of the files in the file server file set is cached to the base station closer to the user, when the user becomes a base station resident user, part of the sub-files of the popular files in the base station are cached, and when the user requests the popular files, the request of the user is satisfied through the D2D communication technology based on the encoding cache, so that the network traffic is reduced, and particularly, the traffic between the file server and the base station and between the base station and the user is reduced; the invention uses the transmission technology based on TCP protocol in unicast, considers the situation of network packet loss when using multicast technology, adds response and retransmission, ensures that all files are transmitted without error, and ensures the file quality; in the transmission stage of responding to the user request, the user multicasts the encoded data, and the data is well protected through encryption, so that the security is higher.
The communication process of the present invention is described in detail below with reference to fig. 6 of the specification:
as shown in fig. 6, the file server has N-5 files with the same size, and the popularity of the files in the server is counted upAnd calculating the requested times within a period of time to obtain the popularity distribution in the server as P. The server may be connected to many base stations, and considering one base station, the base station has a base station cache capable of accommodating Q-4 files, so that it obtains the top Q-4 files with the highest popularity to the base station cache according to the popularity of the files in the server. Before the base station caches Q-4 files, after the base station caches Q-4 files, the 4 files are taken as a whole (set), and the popularity distribution P '(P' is different from P, the number of the whole, namely the number of elements is different, and Q is less than or equal to N) of the 4 files in the base station cache is reconstructed according to the original popularity in the server, for example, the popularity of the file 1 in the base station is
Considering that there are 3 resident users, each user has a local cache capable of holding the content with size of 2-M files, the user selectively caches the more popular files in the base station, and the threshold is used according to the file popularity distribution P' in the base station
Dividing files in the base station into popular files and unpopular files, wherein the popularity ratio p in the base stationthFile 1, file 2, and file 3, which are 0.1616 large, are popular files, and file 4 is an unpopular file. File 5 is less popular than file 4. The user caches subfiles of files with a popularity greater than a threshold value, i.e. popular files, in the base station, so the user caches subfiles of files 1, 2 and 3, and the specific caching manner is as shown in fig. 6. When a user requests a popular file, the user can exchange the required content to satisfy the request through D2D communication, and the user sends the request to inform all peers (each user in the D2D communication network is peer-to-peer, and can be used as both a sender and a receiver). In the example where three users request three popular files, user 1 also needs subfiles1-5 and subfiles 1-6, the user 2 further needs subfiles 2-1 and 2-2, the user 3 further needs subfiles 3-3 and 3-4, for the user 1, the subfiles 2-1 and 3-4 needed by the user 2 and the user 3 are cached, so that the user 2 and the user 3 can be regarded as a same group, the content after the subfiles 2-1 and 3-4 are combined according to bitwise XOR is multicast to the user 1, the number of bits of the multicast content is equal to that of the subfile 2-1 and that of the subfile 3-4, after the user 2 receives the content sent by the user 1, the required subfiles 2-1 can be obtained by decoding the subfiles 3-4 and the content sent by the user 1 according to bitwise XOR through the subfiles 3-4 already existing by the user 2, the user 3 can decode subfiles 3-4 from this similarly. Similarly, the user 1 and the user 3 can decode the subfiles 1-5 and 3-3 from the content multicast by the user 2, and the user 1 and the user 2 can decode the subfiles 1-6 and 2-2 from the content multicast by the user 3. In this way, all the files obtain all the subfiles of the requested file, and the requested file can be obtained after combination. (Users requesting popular files can respond via D2D communication technology through the local cache content of all users in the network)
It should be noted that, in the embodiment of the present invention, only the communication mode in which the user requests the popular file is described, if the user requests the unpopular file, if the file exists in the base station, for example, request file 4, the base station directly sends the file to the user; if the file requested by the user does not exist in the base station, for example, the file 5 is requested, the server firstly sends the file to the base station, the base station forwards the file to the user, and the file 5 is discarded after the base station forwards the file in the process, but the file 5 is not cached in the cache of the base station. The updating of the files in the base station is only updated according to the popularity distribution of the set of files.
In the embodiment of the present invention, the popular file refers to a file with a popularity greater than a threshold value in a file set cached by a base station, that is, a file cached by a user; files with a popularity smaller than a threshold in the base station, and files in the server that are not cached in the base station, are unpopular files.
In fact, the base station selects a part of the file cache in the server, and the user set selects a sub-file cache of a part of the file in the base station. That is, file set 1 in the server, file set 2 in the base station, and file set 3 cached in the user set, where file set 1 includes file set 2, and file set 2 includes file set 3.
In alternative embodiments, the functions/acts noted in the block diagrams may occur out of the order noted in the operational illustrations. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved. Furthermore, the embodiments presented and described in the flow charts of the present invention are provided by way of example in order to provide a more thorough understanding of the technology. The disclosed methods are not limited to the operations and logic flows presented herein. Alternative embodiments are contemplated in which the order of various operations is changed and in which sub-operations described as part of larger operations are performed independently.
Furthermore, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise stated to the contrary, one or more of the described functions and/or features may be integrated in a single physical device and/or software module, or one or more functions and/or features may be implemented in a separate physical device or software module. It will also be appreciated that a detailed discussion of the actual implementation of each module is not necessary for an understanding of the present invention. Rather, the actual implementation of the various functional modules in the apparatus disclosed herein will be understood within the ordinary skill of an engineer, given the nature, function, and internal relationship of the modules. Accordingly, those skilled in the art can, using ordinary skill, practice the invention as set forth in the claims without undue experimentation. It is also to be understood that the specific concepts disclosed are merely illustrative of and not intended to limit the scope of the invention, which is defined by the appended claims and their full scope of equivalents.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. The multi-access communication method based on the code cache is characterized by comprising the following steps:
acquiring a first target file from a file server through a base station, and reconstructing popularity distribution of the first target file;
distributing a cache for a resident user side in the base station area, and acquiring a subfile of a second target file in the first target file through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique;
sending a file acquisition request to a base station through the first user terminal, or sending the file acquisition request to the second user terminal through the first user terminal;
determining the group of the first user side according to the file acquisition request, and feeding back a subfile of a second target file to the first user side through the second user side;
the base station acquires non-target files except the second target file in the first target file from a cache of the base station, or acquires the non-target files in the file acquisition request from the file server;
and sending the non-target file to the first user end through a base station so that the first user end obtains all files corresponding to the file obtaining request.
2. The multi-access communication method based on the code cache of claim 1, wherein the obtaining, by the base station, the first target file from the file server and reconstructing the popularity distribution of the first target file comprises:
counting the requested times of each file in an original file set within a preset time period through the file server;
updating the popularity distribution of each file according to the requested times;
acquiring a first target file set with the highest popularity from the file server according to the size of the cache space of the base station;
taking the first target file set as a population, and respectively updating the popularity distribution of each file in the base station and the file server according to the requested times of the population.
3. The method according to claim 2, wherein the allocating a cache for a resident ue in the base station area and obtaining a subfile of a second target file in the first target file through the resident ue comprises:
the base station cuts and divides a second target file set cached in the base station into subfiles with the same size;
the base station acquires the resident user side information in the area;
distributing a cache for the resident user side;
and distributing corresponding subfiles for each resident user side based on the cache of the resident user side according to the popularity distribution of each target file in the base station.
4. The method according to claim 1, wherein the sending a file acquisition request to a base station through the first user equipment or sending the file acquisition request to the second user equipment through the first user equipment comprises:
when the subfile in the file acquisition request is cached in a local cache of a second user end, the first user end multicasts the file acquisition request to the second user end;
and when the subfile in the file acquisition request is not cached in a local cache of a second user terminal, the first user terminal sends the file acquisition request to the base station.
5. The method according to claim 1, wherein the determining the group to which the first ue belongs according to the file acquisition request and feeding back a subfile of a target file to the first ue through the second ue comprises:
the second user end determines the group of the first user end according to the received file acquisition request;
the second user terminal sends a subfile to the first user terminal by multicast according to the group of the first user terminal and the group comprising two or more first user terminals; for a group containing a first client, the second client sends a subfile to the first client via a TCP unicast response.
6. The method according to claim 5, wherein the sending subfiles to the first ue by multicast for a group comprising two or more first ues comprises:
adding the user terminals belonging to the same group into a multicast group;
carrying out XOR coding on the file acquisition request of the first user end to obtain a coded file;
cutting the encoded file into a plurality of data blocks of the same size;
adding a user identification number and a serial number into each data block and then packaging to obtain a data packet;
and adding a retransmission mechanism in the multicast group, and sending the data packet to the first user end.
7. The code cache based multiple access communication method of claim 1, further comprising:
the first user terminal receives the file sent by the second user terminal, extracts and decodes the file to obtain the content of the requested file, and combines the content of the requested file locally existing in the first user terminal to obtain the requested file;
alternatively, the first and second electrodes may be,
and the first user terminal receives the file sent by the base station as a requested file.
8. A multiple-access communication device based on code caching, comprising:
the system comprises a first module, a second module and a third module, wherein the first module is used for acquiring a first target file from a file server through a base station and reconstructing popularity distribution of the first target file;
the second module is used for distributing cache for a resident user side in the base station area and acquiring a subfile of a second target file in the first target file through the resident user side; the resident user side comprises a first user side and a second user side, and the number of the user sides of the first user side and the second user side is not unique;
a third module, configured to send a file acquisition request to a base station through the first user end, or send the file acquisition request to the second user end through the first user end;
a fourth module, configured to determine, according to the file acquisition request, a group to which the first user belongs, and feed back, to the first user, a subfile of a second target file through the second user;
a fifth module, configured to acquire, by the base station, a non-target file, excluding the second target file, in the first target file from a cache of the base station, or acquire, by the base station, a non-target file in the file acquisition request from the file server;
a sixth module, configured to send the non-target file to the first user end through a base station, so that the first user end obtains all files corresponding to the file obtaining request.
9. An electronic device comprising a processor and a memory;
the memory is used for storing programs;
the processor executing the program realizes the method according to any one of claims 1-7.
10. A computer-readable storage medium, characterized in that the storage medium stores a program, which is executed by a processor to implement the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110292467.8A CN113132466B (en) | 2021-03-18 | 2021-03-18 | Multi-access communication method, device, equipment and medium based on code cache |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110292467.8A CN113132466B (en) | 2021-03-18 | 2021-03-18 | Multi-access communication method, device, equipment and medium based on code cache |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113132466A true CN113132466A (en) | 2021-07-16 |
| CN113132466B CN113132466B (en) | 2022-03-15 |
Family
ID=76773569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110292467.8A Active CN113132466B (en) | 2021-03-18 | 2021-03-18 | Multi-access communication method, device, equipment and medium based on code cache |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113132466B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113783933A (en) * | 2021-08-10 | 2021-12-10 | 中山大学 | Double-layer network communication method, device and medium based on coding cache |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109617991A (en) * | 2018-12-29 | 2019-04-12 | 东南大学 | Based on value function approximate super-intensive heterogeneous network small station coding cooperative caching method |
| CN109639813A (en) * | 2018-12-24 | 2019-04-16 | 北京京东尚科信息技术有限公司 | Video file transfer processing method and processing device, electronic equipment and storage medium |
| CN110351780A (en) * | 2019-06-17 | 2019-10-18 | 中山大学 | A kind of communication means based on code cache, system and storage medium |
| CN110536179A (en) * | 2019-06-28 | 2019-12-03 | 三星电子（中国）研发中心 | A kind of content distribution system and method |
| CN112437156A (en) * | 2020-11-23 | 2021-03-02 | 兰州理工大学 | Distributed cooperative caching method based on MEC-D2D |
-
2021
- 2021-03-18 CN CN202110292467.8A patent/CN113132466B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109639813A (en) * | 2018-12-24 | 2019-04-16 | 北京京东尚科信息技术有限公司 | Video file transfer processing method and processing device, electronic equipment and storage medium |
| CN109617991A (en) * | 2018-12-29 | 2019-04-12 | 东南大学 | Based on value function approximate super-intensive heterogeneous network small station coding cooperative caching method |
| CN110351780A (en) * | 2019-06-17 | 2019-10-18 | 中山大学 | A kind of communication means based on code cache, system and storage medium |
| CN110536179A (en) * | 2019-06-28 | 2019-12-03 | 三星电子（中国）研发中心 | A kind of content distribution system and method |
| WO2020263024A1 (en) * | 2019-06-28 | 2020-12-30 | Samsung Electronics Co., Ltd. | Content distribution server and method |
| CN112437156A (en) * | 2020-11-23 | 2021-03-02 | 兰州理工大学 | Distributed cooperative caching method based on MEC-D2D |
Non-Patent Citations (1)
| Title |
|---|
| 牛煜霞: "D2D辅助蜂窝网络中的协作缓存策略", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113783933A (en) * | 2021-08-10 | 2021-12-10 | 中山大学 | Double-layer network communication method, device and medium based on coding cache |
| CN113783933B (en) * | 2021-08-10 | 2022-05-24 | 中山大学 | Double-layer network communication method, device and medium based on coding cache |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113132466B (en) | 2022-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1126344C (en) | Distributed internet protocol-based real-time multimedia streaming architecture | |
| CN101068236B (en) | Streaming media bit rate control method, system and equipment | |
| Kim et al. | A comparison of layering and stream replication video multicast schemes | |
| CN102833691B (en) | D2D (Device-to-Device) multimedia broadcast multicast service method on basis of beam forming and fountain codes | |
| CN113132466B (en) | Multi-access communication method, device, equipment and medium based on code cache | |
| KR101252947B1 (en) | Method and apparatus for push-pull hybrid streaming adaptive to video chunk distribution | |
| CN1735272A (en) | The method of notice is provided for multimedia broadcast-multicast service | |
| CN111314349B (en) | Code caching method based on joint maximum distance code division and cluster cooperation in fog wireless access network | |
| CN113596848A (en) | Content caching and spectrum allocation combined design method for NOMA wireless video multicast | |
| KR20120101942A (en) | Video streaming system and method based on fountain codes | |
| Xylomenos et al. | Support of multiple content variants in the multimedia broadcast/multicast service | |
| Majidi et al. | Optimized joint unicast-multicast panoramic video streaming in cellular networks | |
| JP5814710B2 (en) | Data transmission method and apparatus based on network coding | |
| CN102763408B (en) | SVC-based E-MBMS streaming transmission method and equipment | |
| EP3753229B1 (en) | Devices and methods for coded caching | |
| Li et al. | Scalable video multicast with joint resource allocation and Adaptive Modulation and Coding over multiple base station networks | |
| Chorppath et al. | Network coded caching and D2D cooperation in wireless networks | |
| CN103053183B (en) | video multicast method and apparatus | |
| Shrivastava et al. | Unified service delivery framework for 5G edge networks | |
| Li et al. | An effective transmission scheduling mechanism with network coding for adaptive P2P streaming | |
| Liu et al. | Joint network coding and fronthaul transmission via edge caching in cloud-RANs | |
| Kim et al. | Cross-layer design of adaptive modulation and coding for multicast system with random network coding | |
| Xie et al. | Optimizing Patching‐based multicast for video‐on‐demand in wireless mesh networks | |
| Patil et al. | Clustering and cooperative data transfer in VANETs using index coding | |
| Zhang et al. | Fishery Data Distribution System Based on Distance Prior Network Coding Strategy with Buffer Mapping Mechanism |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |