Learning-based QoS Path Prediction Method in SDN Environment

2021 ◽  
Vol 48 (11) ◽  
pp. 1241-1249
Author(s):  
Seunghoon Jeong ◽  
Seondong Heo ◽  
Hosang Yun
2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Yazhuo Gao ◽  
Guomin Zhang ◽  
Changyou Xing

As an important deception defense method, a honeypot can be used to enhance the network’s active defense capability effectively. However, the existing rigid deployment method makes it difficult to deal with the uncertain strategic attack behaviors of the attackers. To solve such a problem, we propose a multiphase dynamic deployment mechanism of virtualized honeypots (MD2VH) based on the intelligent attack path prediction method. MD2VH depicts the attack and defense characteristics of both attackers and defenders through the Bayesian state attack graph, establishes a multiphase dynamic deployment optimization model of the virtualized honeypots based on the extended Markov’s decision-making process, and generates the deployment strategies dynamically by combining the online and offline reinforcement learning methods. Besides, we also implement a prototype system based on software-defined network and virtualization container, so as to evaluate the effectiveness of MD2VH. Experiments results show that the capture rate of MD2VH is maintained at about 90% in the case of both simple topology and complex topology. Compared with the simple intelligent deployment strategy, such a metric is increased by 20% to 60%, and the result is more stable under different types of the attacker’s strategy.


Author(s):  
Kazuhiro Kinkai ◽  
Takanobu Baba ◽  
Hiroyoshi Jutori ◽  
Kanemitsu Ootsu ◽  
Takeshi Ohkawa ◽  
...  

2020 ◽  
Author(s):  
Xuan ZHANG ◽  
Jia WU ◽  
Genghua YU

Abstract With the development of social media, social networks have become an important platform for people to share and communicate. In social network communication, each participant can only pass information correctly if we find the goal of our communication. In other words, when people carry mobile devices for data transmission, they need to find a definite transmission destination to ensure the normal conduct of information exchange activities. In social networks, this is manifested in the process of data transmission by nodes, which requires analysis and judgment of surrounding areas, and finds suitable nodes for effective data classification and transmission. However, the node cache space in social networks is limited, and the process of waiting for the target node will cause end-to-end transmission delay. In order to improve such a transmission environment, this paper proposes a node trajectory prediction method named EDPPM algorithm. This algorithm can guarantee that nodes with high probability are given priority to obtain data information, which realized an effective data transmission mechanism. Through experiments and comparison of opportunistic transmission algorithms in social networks, such as Epidemic algorithm, Spray and Wait algorithm, and PRoPHET algorithm, our algorithm can improve the cache utilization of nodes, reduce data transmission delay, and improve the overall network efficiency.


2013 ◽  
Vol 321-324 ◽  
pp. 2047-2055
Author(s):  
Jaek Wang Kim ◽  
Seung Hoon Lee ◽  
Hye Wuk Jung ◽  
Jee Hyong Lee

In this paper, we propose a path prediction approach using behavioral data of user that it contains the meaningful locations extracting and predicting method. The proposed method has a difference to the previous methods that is considering the interaction data for defining the meaningful location and predicting the future paths. Using these interaction and path data, the proposed method calculates the proximities of adjacency people. For extracting the meaningful locations, we consider the calculated proximity of people around user and stay time based on path data. And we simplify the paths using these extracted meaningful locations. Finally, in prediction step, the method predicts the destination using the simplified paths, and finds detail path from current location to destination using modified Dynamic Time Warping (DTW) algorithm. For verifying the usability of proposed method, first, we analyze the effect of people around the user for predicting the future paths of user. We verify the effectiveness of the proposed method by comparing the prediction accuracies of each method.


2015 ◽  
Vol 11 (7) ◽  
pp. 613473 ◽  
Author(s):  
Sukhoon Lee ◽  
Dongwon Jeong ◽  
Doo-Kwon Baik ◽  
Dae-Kyoo Kim

Sign in / Sign up

Export Citation Format

Share Document