cache strategy
Recently Published Documents


TOTAL DOCUMENTS

38
(FIVE YEARS 17)

H-INDEX

4
(FIVE YEARS 3)

Electronics ◽  
2022 ◽  
Vol 11 (1) ◽  
pp. 160
Author(s):  
Youngjun Kim ◽  
Jinwoo Park ◽  
Yeunwoong Kyung

Due to the dynamic mobility feature, the proactive flow rule cache method has become one promising solution in software-defined networking (SDN)-based access networks to reduce the number of flow rule installation procedures between the forwarding nodes and SDN controller. However, since there is a flow rule cache limit for the forwarding node, an efficient flow rule cache strategy is required. To address this challenge, this paper proposes the mobility-aware hybrid flow rule cache scheme. Based on the comparison between the delay requirement of the incoming flow and the response delay of the controller, the proposed scheme decides to install the flow rule either proactively or reactively for the target candidate forwarding nodes. To find the optimal number of proactive flow rules considering the flow rule cache limits, an integer linear programming (ILP) problem is formulated and solved using the heuristic method. Extensive simulation results demonstrate that the proposed scheme outperforms the existing schemes in terms of the flow table utilization ratio, flow rule installation delay, and flow rules hit ratio under various settings.


2022 ◽  
Vol 71 (2) ◽  
pp. 3277-3291
Author(s):  
Siyuan Sun ◽  
Junhua Zhou ◽  
Jiuxing Wen ◽  
Yifei Wei ◽  
Xiaojun Wang
Keyword(s):  

Author(s):  
Weiguang Wang ◽  
Hui Li ◽  
Yang Liu ◽  
Wei Cheng

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1579
Author(s):  
Yingjie Duan ◽  
Hong Ni ◽  
Xiaoyong Zhu

Reliable multicast distribution is essential for some applications such as Internet of Things (IoT) alarm information and important file distribution. Traditional IP reliable multicast usually relies on multicast source retransmission for recovery losses, causing huge recovery delay and redundancy. Moreover, feedback implosion tends to occur towards multicast source as the number of receivers grows. Information-Centric Networking (ICN) is an emerging network architecture that is efficient in content distribution by supporting multicast and in-network caching. Although ubiquitous in-network caching provides nearby retransmission, the design of cache strategy greatly affects the performance of loss recovery. Therefore, how to recover losses efficiently and quickly is an urgent problem to be solved in ICN reliable multicast. In this paper, we first propose an overview architecture of ICN-based reliable multicast and formulate a problem using recovery delay as the optimization target. Based on the architecture, we present a Congestion-Aware Probabilistic Cache (CAPC) strategy to reduce recovery delay by caching recently transmitted chunks during multicast transmission. Then, we propose NACK feedback aggregation and recovery isolation scheme to decrease recovery overhead. Finally, experimental results show that our proposal can achieve fully reliable multicast and outperforms other approaches in recovery delay, cache hit ratio, transmission completion time, and overhead.


Author(s):  
Xiaohui Huang ◽  
Ze Deng ◽  
Lizhe Wang ◽  
Tao Liu ◽  
Chengyu Zhang

Current location-based services (LBS) continuously generate a massive amount of geo-message streams. The cluster-based subscription matching method is an effective means to feed subscribers with related geo-messages from geo-message streaming. However, current cluster-based subscription matching methods only consider the spatial relationship and textual relationship and ignore users’ social relationship. As a result, the matching results may not completely satisfy the requirements of users. In this paper, we proposed a social-aware subscription matching method by taking spatial, textual, and social factors into consideration. Then, we used a cache strategy and a Flink-based acceleration process to reduce the extra time overhead caused by computing the social relationships. A set of extensive experiments have been conducted on a real dataset. The experimental results indicate that our method improves the recall of matching results. Besides, the Flink-based acceleration process with caching can speed up the subscription matching process by a ratio of up to 3.299 compared with the state-of-the-art.


2021 ◽  
pp. 140-153
Author(s):  
Pingshan Liu ◽  
Shaoxing Liu ◽  
Guimin Huang

Sign in / Sign up

Export Citation Format

Share Document