CN111327707B - Cache replacement method based on network coding in wireless network - Google Patents
Cache replacement method based on network coding in wireless network Download PDFInfo
- Publication number
- CN111327707B CN111327707B CN202010146791.4A CN202010146791A CN111327707B CN 111327707 B CN111327707 B CN 111327707B CN 202010146791 A CN202010146791 A CN 202010146791A CN 111327707 B CN111327707 B CN 111327707B
- Authority
- CN
- China
- Prior art keywords
- node
- cache
- data packet
- coding
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000012217 deletion Methods 0.000 claims description 14
- 230000037430 deletion Effects 0.000 claims description 14
- 230000003139 buffering effect Effects 0.000 claims description 6
- 238000012544 monitoring process Methods 0.000 claims description 5
- 241000486463 Eugraphe sigma Species 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
Abstract
The invention relates to the technical field of cache management under network coding, in particular to a cache replacement method based on network coding in a wireless network, which comprises the following steps: the source node sends data stream, the downstream node monitors and caches effective data packet, and feeds back the cached data packet information to the intermediate node; the intermediate node selects a data packet with coding value to cache according to the feedback information, and generates a coding packet to forward to a downstream node when a coding opportunity occurs; after receiving the coding packet, the downstream node decodes the coding packet, the data item of the successfully decoded coding packet is reserved, and the data item which is not successfully decoded and has the longest cache time is replaced by the retrieved data item; when the cache replacement is carried out, the node can reserve the valuable data packet and replace the data item without the coding and decoding values, the method can increase the coding and decoding probability of the node and replace the data item without the value and with longer cache time, thereby effectively reducing the cache expense of the node and improving the cache efficiency.
Description
Technical Field
The invention relates to the technical field of cache management under network coding, in particular to a cache replacement method based on network coding in a wireless network.
Background
In the traditional wireless network, the nodes only store and forward information, and the upper bound of the transmission throughput and the high bandwidth utilization rate of the wireless network are difficult to achieve. Ahlswede et al first put forward the concept of Network Coding (NC) in 2000, which changed the processing and transmission modes of information in the conventional communication Network and allowed the Network intermediate node to forward the received information after encoding processing. The effectiveness of retransmitted encoded packets based on network coding is largely influenced by the number of original packets (i.e., the degree of coding) and the coding opportunities involved in the coding. The network coding opportunity is greatly reduced due to the rate mismatch between different streams, or the intermediate node may not have enough data packets to participate in coding due to the characteristics of routing protocols, packet loss, path delay differences and the like. On the downstream side, since the encoded packets are usually only partially decodable at the receiving node, when a large number of non-decodable encoded packets are received downstream, the conventional method mostly directly discards the encoded packets with the downstream decoding failure as useless data packets, which reduces decoding efficiency and wastes potential decoding opportunities. At present, relevant research focuses on a reasonable node caching mechanism and a scheduling strategy, and data packets participating in encoding are increased as much as possible at an intermediate node while the caching overhead and the transmission cost are balanced, so that more encoding opportunities are obtained. And the temporary undecodable packets are cached and managed at the downstream nodes, the potential decoding opportunities of the packets are mined, the advantages of network coding are exerted to the maximum extent, and the throughput and the data packet transmission efficiency of the network are effectively improved. These cache management schemes treat the node cache space as infinite and do not perform efficient replacement or deletion operations on cached packets. The node cache space is caused to store a large number of useless cache data packets, the cache overhead of the node is increased, and meanwhile, the cache efficiency of a real cache system is reduced.
Aiming at the problem of the complaint, the data packet in the cache space of the network node is reasonably and effectively deleted and replaced by combining the LRU cache replacement algorithm and the technical characteristics of the network coding. The cache time and the hit rate of the data packets are the indexes concerned by the LRU algorithm, the cache data packets are encoded at the middle node to generate the encoded packets, and the network encoding is technically characterized in that the cache data packets are used for successfully decoding the encoded packets at the downstream node. The two are combined to provide a cache replacement algorithm based on a network coding technology.
In an actual wireless network node, the buffer space is not infinite, and an intermediate node needs to decide which data packets to keep according to a certain buffer replacement strategy and replace some useless buffer data packets in time. The cache replacement strategy has a great relationship with the coding opportunity and the cache efficiency of the node, and the function of caching the data packet can be fully exerted only through a reasonable cache replacement method, so that the performance advantage of network coding is highlighted, and the performance of a wireless network is improved. For the downstream node, the cache data packet is used for decoding operation of the encoding packet, and the hit rate of the cache data packet changes along with the cache condition. Reasonable cache replacement strategies have a significant impact on cache space hit rates.
Disclosure of Invention
In order to solve the above problems, the present invention provides a cache replacement method based on network coding in a wireless network.
A cache replacement method based on network coding in a wireless network comprises the following steps:
s1, when a source node sends data stream, a request for building a tree is sent to a middle node and a downstream node, after the tree is built successfully, a coding node is searched according to the node traversed by each tree, and the coding node sends the identity information of the coding node and the quantity information of the data stream to flow to the downstream node;
s2, the downstream node monitors the source node according to the information sent by the coding node, selects a data packet with decoding value from the data stream sent by the source node for caching, sets a caching time for each cached data packet, and feeds the cached data packet information back to the intermediate node;
s3, the intermediate node selects data packets with coding value from the data stream sent by the source node to cache according to the feedback information of the downstream node, sets a cache time for each cached data packet, generates coding packets by XOR operation by using the cached data packets with coding value when coding opportunities appear, and forwards the coding packets to the downstream node;
s4, when the downstream node receives the coded packet, the buffered data packet with decoding value is used for decoding the received coded packet, and when the buffered data packet is successfully decoded, the data packet is stored into the head of the queue; and when the cache data packet fails to decode the coding packet successfully, storing the cache data packet into the tail of the queue, deleting the cache data packet when monitoring a new cache data packet, and storing the new data packet into the head of the queue.
Further, the intermediate node constantly monitors the use condition of the cache space, judges whether the cache space of the intermediate node is full, and executes cache replacement operation of the intermediate node when the cache space is not full; when the cache space is full, executing cache deletion operation of the intermediate node;
the cache replacement operation of the intermediate node comprises: and the intermediate node replaces the data packet which has participated in encoding and has the longest cache time with a new valuable data packet, and directly caches the new data packet if no replacing object exists. The function of the cache data packet is to enable the intermediate node to use the data packet nearby without going to other places for requesting; the cache replacement operation is to ensure real-time update of the cache data packet, improve the hit rate when the node requests, reduce other unnecessary expenses and improve the efficiency of the whole system; in addition, the cache replacement operation of the intermediate node takes the coding condition of network coding into consideration, and replaces the data packet which participates in coding at the intermediate node, so that the sufficient coding opportunity can be ensured and the node cache efficiency can be improved; the cache deletion operation of the intermediate node comprises the following steps: and deleting the data packets which participate in the encoding and have longer buffering time. The advantages of performing the cache delete operation of the intermediate node are as follows: because the cache space of the node is limited, some obsolete and obsolete data are deleted, the cache space is vacated for new data, and the intermediate node is ensured to have enough cache space to maintain normal work.
Further, the downstream node monitors the use condition of the cache space at any moment, and when the cache space is not full, the cache replacement operation of the downstream node is executed; when the cache space is full, executing cache deletion operation of a downstream node;
the cache replacement operation of the downstream node comprises: and replacing the data packet which is not successfully decoded and has the longest cache time with a new valuable data packet, and directly caching the new data packet if the object is not replaced. The function of caching the data packet is to enable the downstream node to use the data packet nearby without going to other places for requesting, so that the efficiency is improved; the cache replacement operation is used for replacing the data packet which is not successfully decoded at the downstream node, so as to ensure the real-time updating of the cache data packet, improve the hit rate of the node when requesting, reduce other unnecessary expenses, ensure the decoding efficiency of the node and improve the efficiency of the whole system; the cache deletion operation of the downstream node comprises: the downstream node deletes the data packet which is partially unsuccessfully decoded and has long buffer time directly. Benefits of performing cache delete operations for downstream nodes: because the buffer space of the downstream node is limited, the obsolete data packets are deleted, the buffer space is vacated for new data packets, and the downstream node is ensured to have enough buffer space to maintain normal operation.
Further, the data packets cached by a downstream node with decoding value include two types: one type is a data packet sent by a node in the neighborhood of the downstream node, if the monitored data packet contains a data packet in a stream passing through the coding node, the data packet is a data packet with decoding value to be cached, and other monitored data packets are invalid data packets; the other type is a data packet sent by the downstream node, if the data packet sent by the downstream node is opposite to the data flow passing through the coding node, the data packet is a data packet with decoding value and is cached; otherwise, the data packet is an invalid data packet.
Further, the step of judging whether the cache space of the intermediate node and the downstream node is full comprises the following steps: the buffer space capacity of the intermediate node and the downstream node is M, and the data packet capacity of the node buffer is U ═ Sigma PiWhen U < M, i.e. sigma Pi< M, the buffer space is not full, when U ═ M, i.e., Σ PiWhen M is equal, the buffer space is determined to be full, where U represents the capacity occupied by all buffer packets, and P is the capacity occupied by all buffer packetsiRepresenting the size of a single buffered packet.
The invention has the beneficial effects that:
1. the method of the invention considers that the cache space of the node is limited and executes the replacement operation according to the actual condition of the cache space, thereby ensuring the normal work of the node and reducing the cache cost.
2. The method is based on the application scene of the network coding, the replacement strategy takes the coding and decoding conditions of the network coding into consideration, and the data packets participating in the coding are replaced at the intermediate node, so that the sufficient coding opportunity is ensured and the node caching efficiency is improved; and the data packet which is not successfully decoded is replaced at the downstream node, so that the decoding efficiency of the node is ensured.
3. The invention considers the cache time of each cache data packet and improves the hit rate of the cache data packet by combining the characteristics of network coding.
Drawings
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
FIG. 1 is a network model of an embodiment of the present invention;
FIG. 2 is a flow chart of an embodiment of the present invention;
FIG. 3 is a schematic diagram of a data flow traversal spanning tree according to an embodiment of the present invention;
fig. 4 is an example of determining a buffered packet according to an embodiment of the present invention;
FIG. 5 is a schematic diagram illustrating an intermediate node cache replacement operation according to an embodiment of the present invention;
fig. 6 is a schematic diagram illustrating a cache replacement operation of a downstream node according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The technical idea of the invention is as follows: the source node sends a data packet to the downstream node through the intermediate node, the intermediate node provides an encoding opportunity by using the cache data packet, and the downstream node provides a decoding opportunity by using the cache data packet. The replacement strategy carries out reasonable replacement or deletion operation on the cached data packet, so that the normal work of the node cache space is ensured and the caching efficiency is improved. As shown in fig. 1, the multi-stream network scenario includes a plurality of source nodes S, a plurality of intermediate nodes D, and a plurality of downstream nodes R, and the number of nodes is not limited in the present invention, where the source node is denoted as S ═ { S ═ Si|i∈{1,2,...,N}}，SiAnd N represents the number of source nodes, and N is more than or equal to 1. And the following assumptions:
(1) the source node is in the monitoring range of the downstream node;
(2) the node can monitor the use condition of the cache space all the time.
Fig. 2 is a flowchart of a network coding retransmission method based on cache according to the present invention, which specifically includes the following steps:
when a source node sends a data stream, a request for building a tree is sent to an intermediate node and a downstream node in a network, after the tree is successfully built, a coding node is searched according to a node traversed by each tree, and the coding node sends identity information of the coding node and data stream quantity information to be flowed to the downstream node.
The specific implementation mode of building the tree comprises the following steps: when a source node sends a data stream, each source node sends a tree building request to a middle node and a downstream node in a network, all nodes with zero out degree are taken as leaf nodes, feedback information containing self identity information and hop count information is sent to the previous node of the node from the leaf node of each tree, the node receiving the feedback information adds the self information into the feedback information and then sends the feedback information to the previous node of the node until the feedback information reaches the source node, and the tree building is completed.
Searching for a coding node according to the node traversed by each tree specifically includes: non-leaf nodes that appear in two or more trees at the same time are coding nodes. As shown in fig. 3, source nodes 1 and 4 send a build tree request, generating spanning tree a and spanning tree b, where nodes 3 and 7 appear in tree a and tree b, respectively, and are not leaf nodes, so nodes 3 and 7 are judged to be encoding nodes.
The downstream node monitors the source node according to the information sent by the coding node, selects a data packet with decoding value from the data stream sent by the source node for caching, sets a caching time for each cached data packet, and feeds back the cached data packet information to the intermediate node.
The data packets with decoding value cached by a downstream node comprise two types: one type is a data packet sent by a node in the neighborhood of the downstream node, if the monitored data packet contains a data packet in a stream passing through the encoding node, the data packet is cached, and other monitored data packets are regarded as invalid data packets. The other type is a data packet sent by the downstream node, and if the data packet sent by the downstream node is opposite to the data flow passing through the coding node, the data packet is cached; otherwise, the data packet is an invalid data packet.
The network topology shown in fig. 4 can be obtained according to the spanning tree in fig. 3, as shown in fig. 4, three data streams a, b, and c pass through the coding node 3, the node 1 sends the data streams a and b to the coding node 3, the node 4 sends the data stream c to the coding node 3, the nodes 1 and 4 also have the opposite stream from the coding node 3, and the data packets sent by the nodes 1 and 4 are buffered by the nodes 1 and 4 themselves, which are judged to have decoding value. Because the coding node 3 performs coding forwarding on the two data streams b and c, the nodes 1 and 4 can perform effective decoding operation by using the data packets sent by the nodes.
How the downstream node monitors and processes the data stream, and feeds back the data stream to the intermediate node: when a node moves in a network, the node may enter an area where communication ranges of other nodes are overlapped, and when the node receives and sends control information or data packets, neighbor nodes can monitor the control information or data packets, and then information beneficial to coding and decoding is discovered. The downstream node brings the source node into a monitoring range after receiving the tree building request of the source node, continuously monitors the data stream sent by the source node, and caches data with decoding value selected from the monitored data stream sent by the source node according to the data stream information given by the coding node.
The intermediate node selects data packets with coding value from the data stream sent by the source node to cache according to the feedback information of the downstream node, and sets a caching time T for each cached data packet, wherein the caching time T is { T ═ T }i|i∈{1,2,...,N}}，TiThe buffering time of each buffering data packet is represented, N represents the number of the buffering data packets, and when coding opportunities occur, the intermediate node generates coding packets from the buffering data packets with coding value by means of XOR operation and forwards the coding packets to the downstream node.
The cache time T is used for judging the cache time of the data packet, and the specific description of the set cache time is as follows: when a downstream node successfully monitors a data packet, firstly judging whether the data packet is a data packet with decoding value, if so, caching the data packet, setting the caching time T of the data packet to be zero and storing the data packet into a caching queue, and setting the caching time T of the data packet cached before to be T + 1.
The intermediate node constantly monitors the use condition of the cache space, judges whether the cache space of the intermediate node is full or not, and executes cache replacement operation of the intermediate node when the cache space is not full; and when the cache space is full, executing the cache deletion operation of the intermediate node.
The cache replacement operation of the intermediate node comprises: and the intermediate node continues to cache the data packet with the coding value according to the feedback information of the downstream node, and replaces the data packet which participates in coding and has the longest cache time with a new data packet with the coding value. The cache replacement operation of the intermediate node takes the coding condition of network coding into consideration, and replaces the data packet which participates in coding at the intermediate node, so that the sufficient coding opportunity can be ensured and the node cache efficiency can be improved. As shown in fig. 5, the data packet 3 encoded packet is stored at the end of the queue after transmission, and when a new data packet is buffered, the data packet 3 at the end of the queue is deleted and the new data packet 6 is stored at the head of the queue; if the object is not replaced, the new data packet is directly cached.
The cache deletion operation of the intermediate node comprises the following steps: and deleting the data packet which participates in encoding and has the longest cache time according to the cache time, so that the intermediate node has enough cache space to maintain normal work.
When the downstream node receives the coded packet, the buffered data packet with decoding value is used for decoding the received coded packet. As shown in fig. 6, when the buffered data packet successfully decodes the encoded packet, the buffered data packet is stored in the head of the queue; and when the cache data packet fails to decode the coding packet, storing the cache data packet into the tail of the queue, and deleting the cache data packet at the tail of the queue and storing the new cache data packet into the head of the queue when monitoring a new cache data packet.
The downstream node monitors the use condition of the cache space at any moment, and when the cache space is not full, the cache replacement operation of the downstream node is executed; and when the cache space is full, executing the cache deletion operation of the downstream node.
The cache replacement operation of the downstream node comprises: replacing the data packet which is not successfully decoded and has the longest cache time with a new valuable data packet, if no replacement object exists, directly caching the new data packet, and replacing the data packet which is not successfully decoded at a downstream node, so that the decoding efficiency of the node is ensured; the cache deletion operation of the downstream node comprises: the downstream node directly deletes the data packet which is not successfully decoded and has the longest cache time, so that the downstream node has enough cache space to maintain normal operation.
The specific implementation mode that the intermediate node and the downstream node judge whether the cache space of the intermediate node and the downstream node is full comprises the following steps: the buffer space capacity of the intermediate node and the downstream node are both M, and the data packet capacity of the node buffer is U ═ Sigma PiWhen U < M, i.e. sigma Pi< M, the buffer space is not full, when U ═ M, i.e., Σ PiWhen M is equal, the buffer space is determined to be full, where U represents the capacity occupied by all buffer packets, and P is the capacity occupied by all buffer packetsiRepresenting the size of a single buffered packet.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (6)
1. A cache replacement method based on network coding in a wireless network is characterized by comprising the following steps:
s1, when sending data stream to a source node, first sending a request for building a tree to a downstream node and an intermediate node, after successfully building the tree, searching a coding node according to the node traversed by each tree, and sending the identity information of the coding node and the quantity information of the data stream to flow to the downstream node by the coding node;
s2, the downstream node monitors the source node according to the information sent by the coding node, selects a data packet with decoding value from the data stream sent by the source node for caching, sets a caching time for each cached data packet, and feeds the cached data packet information back to the intermediate node;
s3, the intermediate node selects data packets with coding value from the data stream sent by the source node to cache according to the feedback information of the downstream node, sets a cache time for each cached data packet, generates coding packets by XOR operation by using the cached data packets with coding value when coding opportunities appear, and forwards the coding packets to the downstream node;
s4, when the downstream node receives the coded packet, the buffered data packet with decoding value is used for decoding the received coded packet, and when the buffered data packet successfully decodes the coded packet, the buffered data packet is stored in the head of the queue; and when the cache data packet fails to decode the coding packet, storing the cache data packet into the tail of the queue, and deleting the cache data packet at the tail of the queue and storing the new cache data packet into the head of the queue when monitoring a new cache data packet.
2. The method according to claim 1, wherein the intermediate node constantly monitors the usage of the buffer space and determines whether the buffer space is full, and if not, performs the buffer replacement operation of the intermediate node; when the cache space is full, executing cache deletion operation of the intermediate node;
the cache replacement operation of the intermediate node comprises: replacing the data packet which has participated in encoding and has the longest cache time by the intermediate node with a new data packet with encoding value, and directly caching the new data packet with encoding value if no replacing object exists; the cache deletion operation of the intermediate node comprises the following steps: and deleting the data packets which participate in the encoding and have longer buffering time.
3. The method according to claim 2, wherein the specific way for the intermediate node to determine whether its cache space is full includes: the buffer space capacity of the intermediate node is M, and the data packet capacity of the node buffer is U ═ Sigma PiWhen U < M, i.e. sigma Pi< M, the buffer space is not full, when U ═ M, i.e., Σ PiWhen M is equal, the buffer space is determined to be full, where U represents the capacity occupied by all buffer packets, and P is the capacity occupied by all buffer packetsiRepresenting a single buffered data packetThe size of (2).
4. The network coding-based cache replacement method in the wireless network according to claim 1, wherein the downstream node constantly monitors the usage of the cache space and determines whether the cache space is full, and when the cache space is not full, the cache replacement operation of the downstream node is executed; when the cache space is full, executing cache deletion operation of a downstream node;
the cache replacement operation of the downstream node comprises: replacing the data packet which is not successfully decoded and has the longest cache time with a new valuable data packet, and directly caching the new data packet if no replacing object exists; the cache deletion operation of the downstream node comprises: and the downstream node directly deletes part of the data packets which are not successfully decoded and have long buffer time, so that the normal work of the node is ensured.
5. The method according to claim 4, wherein the specific way for the downstream node to determine whether its cache space is full includes: the buffer space capacity of the downstream node is M, and the data packet capacity of the node buffer is U ═ Sigma PiWhen U < M, i.e. sigma Pi< M, the buffer space is not full, when U ═ M, i.e., Σ PiWhen M is equal, the buffer space is determined to be full, where U represents the capacity occupied by all buffer packets, and P is the capacity occupied by all buffer packetsiRepresenting the size of a single buffered packet.
6. The method of claim 1, wherein the data packets with decoding value buffered by a downstream node include two types: one type is a data packet sent by a node in the neighborhood of the downstream node, if the monitored data packet contains a data packet in a stream passing through the coding node, the data packet is a data packet with decoding value to be cached, and other monitored data packets are invalid data packets; the other type is a data packet sent by the downstream node, if the data packet sent by the downstream node is opposite to the data flow passing through the coding node, the data packet is a data packet with decoding value and is cached; otherwise, the data packet is an invalid data packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010146791.4A CN111327707B (en) | 2020-03-05 | 2020-03-05 | Cache replacement method based on network coding in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010146791.4A CN111327707B (en) | 2020-03-05 | 2020-03-05 | Cache replacement method based on network coding in wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111327707A CN111327707A (en) | 2020-06-23 |
| CN111327707B true CN111327707B (en) | 2022-04-05 |
Family
ID=71171480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010146791.4A Active CN111327707B (en) | 2020-03-05 | 2020-03-05 | Cache replacement method based on network coding in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111327707B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0565849A2 (en) * | 1992-04-14 | 1993-10-20 | International Business Machines Corporation | A method and system for synchronizing threads within a process |
| CN103561445A (en) * | 2013-11-12 | 2014-02-05 | 北京工业大学 | Wireless sensor network multi-path routing method based on network coding |
| CN103957085A (en) * | 2014-05-21 | 2014-07-30 | 西北大学 | Media access control method for wireless mesh network based on network coding |
| CN106603204A (en) * | 2016-12-19 | 2017-04-26 | 中国电子科技集团公司第二十研究所 | Network code broadcast retransmission method based on improved redundancy avoidance |
| CN110324255A (en) * | 2019-07-05 | 2019-10-11 | 中南大学 | A kind of switch/router buffer queue management method of data-oriented central site network coding |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9578099B2 (en) * | 2014-01-22 | 2017-02-21 | Alcatel Lucent | Devices and methods for content distribution in a communications network |
-
2020
- 2020-03-05 CN CN202010146791.4A patent/CN111327707B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0565849A2 (en) * | 1992-04-14 | 1993-10-20 | International Business Machines Corporation | A method and system for synchronizing threads within a process |
| CN103561445A (en) * | 2013-11-12 | 2014-02-05 | 北京工业大学 | Wireless sensor network multi-path routing method based on network coding |
| CN103957085A (en) * | 2014-05-21 | 2014-07-30 | 西北大学 | Media access control method for wireless mesh network based on network coding |
| CN106603204A (en) * | 2016-12-19 | 2017-04-26 | 中国电子科技集团公司第二十研究所 | Network code broadcast retransmission method based on improved redundancy avoidance |
| CN110324255A (en) * | 2019-07-05 | 2019-10-11 | 中南大学 | A kind of switch/router buffer queue management method of data-oriented central site network coding |
Non-Patent Citations (3)
| Title |
|---|
| Coordinated Multimedia Object Replacement in Transcoding Proxies for Tree Networks;Keqiu Li等;《IEEE》;20061231;全文 * |
| Replacement Policies for a Proxy Cache;Luigi Rizzo 等;《IEEE》;20001231;全文 * |
| 基于预测的机会式网络编码;刘外喜 等;《通信学报》;20131231;第36-45页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111327707A (en) | 2020-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109347983B (en) | Multi-path forwarding method in named data network based on network coding | |
| Cohen et al. | Cross-layer hybrid FEC/ARQ reliable multicast with adaptive modulation and coding in broadband wireless networks | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| WO2018184487A1 (en) | Bier message forwarding method and device | |
| CN111385201A (en) | RPL routing method based on bidirectional father node decision | |
| Harold Robinson et al. | SMR: a synchronized multipath re-broadcasting mechanism for improving the quality of conversational video service | |
| CN109587488B (en) | Long reference frame selection method based on rate distortion optimization and frame loss prediction | |
| CN108135020A (en) | A kind of wireless sensor network opportunistic routing protocol design method based on network code | |
| CN102438207B (en) | Real-time multicast method in wireless multi-hop network | |
| CN111327707B (en) | Cache replacement method based on network coding in wireless network | |
| CN111065146B (en) | Ad hoc network route determining method based on link quality | |
| CN103560966A (en) | Opportunistic network route mixing method based on network coding and copying | |
| CN111314349B (en) | Code caching method based on joint maximum distance code division and cluster cooperation in fog wireless access network | |
| CN100348006C (en) | Communication subsystem controlled information dissemination | |
| CN101119307A (en) | Routing method | |
| CN114499777A (en) | Data transmission method for cluster unmanned system | |
| Yin et al. | On the design of timeout-based recoders for batched network codes in the MU-MIMO regime | |
| Ning et al. | A novel localised network coding-based overhearing strategy | |
| Panju et al. | Queueing theoretic models for uncoded and coded multicast wireless networks with caches | |
| Zhao et al. | Bss: A burst error-correction scheme of multipath transmission for mobile fog computing | |
| Maheswari et al. | An ECDD technique to optimize QoS in wireless overlay network for multipath video streaming | |
| Akabri et al. | Packet loss recovery schemes for peer-to-peer video streaming | |
| CN106911433A (en) | A kind of chance forwarding Design of Routing Protocol method that nodes encoding is perceived | |
| KR102657709B1 (en) | Transmission methods and devices for data streams | |
| Wu et al. | Cross-layer routing optimization for video transmission over wireless ad hoc networks |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231122 Address after: Room 4-9, Unit 1, Building 21, No. 18 Qixia Road, Beibu New Area, Yubei District, Chongqing, 401122 Patentee after: Chongqing Cloud Computing Communication Technology Co.,Ltd. Address before: 400065 Chongwen Road, Nanshan Street, Nanan District, Chongqing Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
| TR01 | Transfer of patent right |