1 June 2018 in Neurocomputing
24 October 2017 in IEEE Transactions on Services Computing
Combining Network Functions Virtualization (NFV) with Software-Defined Networking (SDN) is an emerging and promising solution to provide scalable and elastic network control and service. In such a system, virtualized Network Functions (NFs) need to be consistently migrated from one instance to another in various network applications, such as resource optimization, fault tolerance, load balancing, etc. These migrations involve simultaneously coordinating updates to the NF state and SDN forwarding state. To solve this problem, we design two consistent NF state update schemes: a controller-forwarding based scheme and a tagging-based scheme. Through analysis of the update process, we demonstrate that they both guarantee loss-free and order-preserving migrations. We further implement a prototype and carry out experiments with diverse traffic settings. Results demonstrate that the controller-forwarding based solution achieves 77% migration time compared with the state- of-the-art solution OpenNF, while correcting an error in latter's algorithm. Moreover, the tagging-based solution not only achieves 4.4% migration time, but also reduces up to 75% controller overhead compared with OpenNF at the cost of adding a tag in the unused fields of packet header.
18 August 2024 in The American Journal of Clinical Nutrition
17 May 2019 in IEEE Access
How to reduce the content placement cost of cloud content delivery networks (CCDNs) is a hot topic in recent years. Traditional content placement methods mainly reduce the cost of content placement by constructing delivery trees, but they cannot adapt to the dynamic deployment of cloud proxy servers in CCDNs. In addition, the traditional content placement method only provides delivery paths according to local decision-making without considering global dynamics of the congestion in the CCDNs, which is also one of the main factors causing high cost of content placement. To solve these problems, we propose a content placement model based on Q-learning for dynamic CCDNs, called Q-content placement model (Q-CPM). This Q-learning approach can lead to better routing decisions due to up-to-date and more reliable congestion values. Then, based on the Q-CPM model, an algorithm is proposed to construct the Qadaptive delivery tree (Q-ADT). In this algorithm, local and nonlocal congestion information is propagated over network learning packets. Through this algorithm, the paths with low congestion cost will be selected and can adapt to the dynamic cloud delivery environment. The experimental results show that the method can adapt to the dynamic changes of CCDNs flexibly and reduce the overall congestion cost of content placement effectively.
15 January 2014 in China Journal of Chinese Materia Medica