diff --git "a/DdE2T4oBgHgl3EQfSQc5/content/tmp_files/load_file.txt" "b/DdE2T4oBgHgl3EQfSQc5/content/tmp_files/load_file.txt" new file mode 100644--- /dev/null +++ "b/DdE2T4oBgHgl3EQfSQc5/content/tmp_files/load_file.txt" @@ -0,0 +1,553 @@ +filepath=/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf,len=552 +page_content='A Practical Runtime Security Policy Transformation Framework for Software Defined Networks Yunfei Menga,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Changbo Keb,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Zhiqiu Huangc,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Guohua Shenc,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' ChunQiang Liua,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Xiaojie Fenga aCollege of Information Engineering,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Qingdao Binhai University,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Qingdao 266555,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' China bSchool of Computer Science and Technology,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Nanjing University of Posts and Telecommunications,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Nanjing 210023,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' China cCollege of Computer Science and Technology,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Nanjing University of Aeronautics and Astronautics,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Nanjing 211106,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' China Abstract Software-defined networking (SDN) has been widely utilized to enforce the se- curity of traditional networks,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' thereby promoting the process of transforming traditional networks into SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' However, SDN-based security enforce- ment mechanisms rely heavily on the security policies containing the underlying information of data plane, such as MAC address, IP address or switch ports.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' These security policies need to be specifically developed by the network opera- tors, and loaded into the control plane by manual inputting.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' With increasing the scale of underlying network, the current security policy management mechanism will confront more and more challenges.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The security policy transformation for SDN networks is to research how to transform the high-level security policy without containing the underlying information of data plane into the practical flow entries used by the OpenFlow switches automatically, thereby implement- ing the automation of security policy management.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Based on this insight, a practical runtime security policy transformation framework is proposed in this paper.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, we specify the security policies used by SDN networks as a system model of security policy (SPM).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From the theoretical level, we establish the system model for SDN network and propose a formal method to transform SPM into the system model of flow entries automatically.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From the practical level, we propose a runtime security policy transformation framework to solve the problem of how to find a connected path for each relationship of SPM in the data plane, as well as how to generate the practical flow entries according to the system model of flow entries.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In order to validate the feasibility and ef- fectiveness of the framework, we set up an experimental system and implement the framework with POX controller and Mininet emulator.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental results illustrate the framework can synchronously perceive the changes caused by cutting down one edge or changing SPM, and keep the data plane holding the security properties defined by SPM continuously at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Keywords: SDN, security policy, model transformation, data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Preprint submitted to Elsevier January 11, 2023 arXiv:2301.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='03790v1 [cs.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='CR] 10 Jan 2023 1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Introduction Software-defined networking (SDN) is a novel networking technique or ar- chitecture that changes the limitation of traditional network infrastructures by breaking the vertical integration, decoupling the control logics from the underly- ing forwarding devices, promoting the centralization of control and introducing the abilities to program the network directly[1].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In SDN networks, the control logics of network, such as routing, traffic engineering or security policy devel- oped in the application plane, are loaded into the control plane via the north- bound interfaces (NBI) and transformed into a set of forward entries used by the OpenFlow switches.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After that, the control plane distributes the generated flow entries to the associated switches in the data plane via the southbound interfaces (SBI).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Because of its programmable, centralized intelligent control as well as global traffic view, SDN has been widely utilized to enhance the security of tradition networks, thereby promoting the process of transforming traditional networks into SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' For instances, Garay et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [2] proposed a SDN-based network access control mechanism, flownac, which is a centralized EAP (extensible authentication protocol) for IEEE 802.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1x wireless local area network (WLAN).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Yakasai et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [3] proposed a network access control mech- anism, flowidentity.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' This mechanism integrates EAP security authentication mechanism into the SDN controller.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Hu et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [4] proposed a dynamic firewall mechanism, flowguard, based on SDN.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Koerner et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [5] proposed a device se- curity authentication mechanism based on MAC address and SDN.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' However, SDN-based security enforcement mechanisms rely heavily on the security policies containing the underlying information of the data plane, such as MAC address, IP address or switch ports.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' These security policies need to be specifically developed by the network operators, and loaded into the control plane by means of the manual inputting.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' With increasing the scale of underlying network, the current security policy management mechanism will confront more and more challenges.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, it is nearly impossible for any operator to completely understand all the information of underlying network.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In addition, with the emergence of multi-controller SDN[6], network operators need to man- age a variety of heterogeneous controllers at the same time.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In this case, the same security policy often needs to be developed and deployed for the different types of controller, which inevitably increases the complexity and difficulty for network management.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Therefore, a novel security policy management mecha- nism which can be completely transparent to the underlying information of data plane is urgently needed for SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' That is, it can permit the operators only to define the high-level security policy without containing any underlying information, then by means of the security policy transformation, the high-level security policy can be automatically transformed into its corresponding flow entries used by the OpenFlow switches in the data plane, thereby implementing the automation of security policy management for SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 2 Based on these insights, we have proposed a security policy model transfor- mation and verification approach for SDN networks and published the approach in our previous paper[7].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In that paper, we proposed a security policy transfor- mation method to transform the high-level security policy model (SPM) without containing the underlying information into its corresponding low-level security policy model (LSPM) containing the underlying information.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' To verify the soundness of proposed security policy model transformation method,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' we further proposed a security policy verification method and proved that the problem of whether the data plane can satisfy the security properties defined by SPM is equivalent to the problem of searching the connected paths related with SPM in the data plane,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' that is,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' as long as each access control relationship Ri ∈ SPM can be transformed into a corresponding connected path Pi in the data plane,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' next transforms Pi into a set of flow entries used by the OpenFlow switches,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' then the data plane must can hold the security properties defined by SPM.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' However, that paper only proposed the method from the theoretical level, and did not specifically implement this method.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Moreover, it did not solve the problem of how to find a connected path for each relationship of SPM in the data plane, and how to transform LSPM into the practical flow entries used by the switches.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' And based on the theoretical foundation of that paper, we propose a run- time security policy transformation framework for SDN networks in this paper.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, this paper further improves the system model of SDN networks and solves the problem of how to transform SPM into the flow entries used by the OpenFlow switches from the theoretical level.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Moreover, this paper proposes a runtime security policy transformation framework from the practical level, thereby solving the problem of how to find a connected path Pi for each rela- tionship Ri ∈ SPM in the data plane, as well as how to transform the system model of flow entries into the practical flow entries used by the switches at run- time.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In addition, this paper further implements the proposed framework with an experimental system.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result illustrate the framework is completely effective at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Hence, the contributions of this paper can be summarized as follows: We specify the security policies used by SDN networks, such as access control policies or firewall policies, as a system model of security policy (SPM).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' SPM is of a high-level system model without containing any underlying infor- mation of data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From the theoretical level, we establish the system model for SDN network, and propose a formal method to transform SPM into the system model of flow entries automatically.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The system model of flow entry is of a low-level system model containing the underlying information of data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From the practical level, we propose a runtime security policy transforma- tion framework which consists of the security policy module, topology discovery module, runtime monitoring module, path generation module and flow entry generation module.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Leveraging these functional modules, the framework can solve the problem of how to find a connected path for each relationship of SPM in the data plane, how to transform the path into the system model of flow en- tries, as well we how to generate the practical flow entries by using the system 3 model of flow entries.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In order to validate the feasibility and effectiveness of the framework, we set up an experimental system and implement the framework by using POX con- troller and Mininet emulator.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result illustrate the framework is completely effective at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The remainder of this paper is structured as follows.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Section 2 discusses some related works.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Section 3 proposes the system model and elaborates on how to transform SPM into the flow entries from the theoretical level.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Sec- tion 4 proposes the runtime security policy transformation framework from the practical level and introduces its functional modules.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Section 5 implements the framework with an experimental system and elaborates on how to evaluate the effectiveness and performance of the framework.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Finally, Section 6 concludes this paper and presents some future directions.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Related Work In this section, we discuss some research works related with the policy model transformation and the security policy verification.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Policy Model Transformation According to the definitions of model-driven architecture (MDA), the model transformation refers to the process of transforming the platform independent model (PIM) to its corresponding platform specific model (PSM)[8].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As far as the literatures we have read, the researches towards the policy model transforma- tion can be roughly divided into three categories, they are the template-based transformation, RBAC-oriented transformation as well as the transformation based on the system model and mapping rules[9].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Due to the limitation of tem- plate, the template-based model transformation has very limited transformation capability.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Generally, RBAC-oriented model transformation[10] is only suitable for transforming RBAC (role-based access control) policies, and does not have enough capability to describe the complex system, so that these two methods are not suitable for SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' At present, the model transformation based on the system model and map- ping rules has been widely used for transforming the policy models.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The main idea of this method can be summarized as follows: (1) System Model: it de- fines the objects of system and the relationship between the system objects;' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (2) Policy Model: it defines the policy object and the relationship between the policy objects;' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (3) Mapping Rules: it establishes the mapping rules between the upper-level policy objects and the lower-level system objects[11][12].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The trans- formation based on the system model and mapping rules first establishes the policy model and the system model which can describe the underlying system, then establishes the mapping rules between the policy objects and the system objects, then transforms the upper-level policy model into its corresponding lower-level policy model by means of the established mapping rules.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In partic- ular, Davy et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [13] proposed a policy model transformation method based on 4 mapping rules, in which the policy model is defined as a tuple ( event, condi- tion, behavior, subject, object ) and used the ontology to establish the mapping rules between the different system layers.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Luck et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [14] proposed a method to transform RBAC model defined in service layer into the policy model used in the system layer.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In this method, the system model is divided into three layers: roles and object (RO), subject and resources (SR) and processes and hosts (PH), and the mapping rules between the three layers have been estab- lished.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Based on the Luck’s research, Porto et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [15] further decomposes the PH layer into two sub layers, namely DAS (diagram abstract subsystem) layer and PH layer.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' DAS layer is mainly used to describe the network topology in the original PH layer, while PH layer is used to describe the specific network information in DAS layer.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In addition, the authors also proposed a policy ver- ification framework, which can be used to verify the consistency problems in the process of policy transformation.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In addition, Lampson et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [16] proposed a network policy model transformation method for the distributed computing environment.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Maullo et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [17] proposed a policy transformation system based on the first-order predicate logics, which transforms the high-level policy model into the low-level network configuration policy through the network topology and other information.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Nanxi et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [18] proposed a SDN-oriented access control policy transformation framework.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In this paper, In this paper, we also propose a security policy transformation framework based on the system model and map- ping rules.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' We first establish the system model of security policy (SPM) and data plane, then establish the transformation rules between the policy objects of SPM and the objects of the data plane, thereby transforming SPM into the system model of flow entries automatically.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Security Policy Verification To assure the information systems running securely, security mechanisms of information system need to be validated whether it can satisfy the security properties defined by the security policy.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The traditional validation methods based on the testing and simulation can only confirm the system can work prop- erly under the different testing scenarios, but it is difficult to find some hidden scenarios that occur with little probability.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Formal verification methods have been applied to overcome the shortcomings existed in the traditional valida- tion methods.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' At present, the formal verification methods for validating the security policy mainly include theorem proving and model checking[19].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The- orem proving is unsuitable to validate the properties of complex systems due to its lower efficiency.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Model checking[20] can be used to validate whether the system model can satisfy the expected dynamic behaviors and specific static properties.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Model checking technique has been widely used for the security policy verification.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' For instances, Al-Shaer et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [21] proposed a static policy inconsistency detection method for the firewall policies of network.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Bandara et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [22] proposed a security policy verification framework based on event calcu- lus (EC) and used the reasoning techniques for the policy conflict identification.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' May et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [23] verified the privacy policies by means of an asynchronous model checker.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Rubio-Loyola et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [24] proposed a goal-oriented policy refinement and 5 conflict detection method by means of the model checking technique and linear temporal Logic (LTL).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Graham et al.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [25] proposed a policy conflict detection method with the model checking and an extended decision table.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Baliosan and Serrat[26] proposed a specific finite automata based method for the policy con- flict detection.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Problem Formalization The security policy transformation for SDN networks is to research how to transform the high-level security policy without containing the underlying infor- mation into the set of practical flow entries used by the OpenFlow switches in the data plane automatically, thereby implementing the automation of security policy management in SDN network.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following of this section, we first establish the system model for SDN network, then propose a formal method to transform the security policy (SPM) into the system model of flow entries from the theoretical level.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' System Model Definition 1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (Security Policy): The high-level security policy is defined as a finite set of access control relationships: SPM = { R0, R1,.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='..' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=',Rn | ∀ Ri = ( si, oj, a ) }, where si ∈ S represents the subject of the relationship, oj ∈ O represents the object of the relationship, a represents the access authorization, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', the subject can access the object.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Definition 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (Host): The host existed in the data plane is defined as a tuple: hi=( ipi, swi, portm i ), where ipi represents the host’s IP address in the data plane, swi represents the OpenFlow switch connected with the host, portm swi represents the port connected with the host in swi.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Definition 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (OpenFlow Switch): The OpenFlow switch existed the data plane is defined as a finite set of flow entries: swi = { f0, f1, .' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='..' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', fn }.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Definition 4.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (Flow Entry): The flow entry existed in the OpenFlow switch is defined as a tuple: fi = ( ipsrc, ipdst, portin swi =⇒ portout swi ), where ipsrc represents the traffic’s source IP address, ipdst represents the traffic’s destination IP address, portin swi =⇒ portout swi represents the traffic input from portin swi will be outputted from portout swi in the switch swi.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Definition 5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (Edge): The edge existed in the data plane is defined as: ei = portout start �−→ portin end, where portout start represents the port connected with the edge in the start switch swstart, portin end represents the port connected with the edge in the end switch swend, so that the direction of the edge is from swstart to swend.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Definition 6.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (Topology): The topology of the data plane is defined as an graph: G = ( SW, E ), where SW represents a finite set of OpenFlow switches, E represents a finite set of edges.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 6 Definition 7.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' (Connected Path): The connected path between the host hi and the host hj in the topology G is defined as: Pi = hi �−→ hj = { hi, e0, e1,.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='..' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', en, hj | ∀ei ∈ E }, where the direction of the path is from hi to hj.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Transforming SPM into the Flow Entries Based on the established system model, we propose a formal method to transform SPM into the system model of flow entries from the theoretical level.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The method can be described as Figure 1 and summarized as follows: First of all, for ∀Ri ∈ SPM, the subject si ∈ Ri is transformed into a host h(si) in the data plane, the object oj ∈ Ri is transformed into a host h(oi) in the data plane;' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Next, the access authorization a ∈ Ri is transformed into a connected path Pi between h(si) and h(oj);' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After that, the connected path Pi is transformed into a set of flow entries used by the switches which are passed by Pi;' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Finally, SPM is transformed into the set of flow entries ∆ when all relationships of SPM have been transformed.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 1, the relationship R1 ∈ SPM is transformed into the connected path P1 between h1 and h2, thus P1 is transformed into the flow entries deployed in sw1, so as to implement the security policy transformation from the system model level.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The soundness of the formal method has been proven in our previous paper[7].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' That is, if the security properties defined by SPM is denoted as ϕ, the system model of data plane is denoted as D, the flow entries generated by the method is denoted as ∆, then the method can ensure the data plane D loaded with ∆ can synchronously and continuously hold the security properties ϕ at runtime, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', D(∆) |= ϕ.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Specifically, the formal method to transform SPM into the system model of flow entries is defined as follows.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Transforming the Subject Given an access control relationship Ri ∈ SPM and the subject si ∈ Ri, then si is transformed into a corresponding host existed in the data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The rule of transforming the subject of SPM is formally defined as follows: si ∈ Ri h(si) = (ipsrc, swsrc, portin src, ) (1) where h(si) represents the host mapped with si in the data plane, ipsrc repre- sents the IP address of h(si) in the data plane, swsrc represents the OpenFlow switch connected with h(si) in the data plane, portin src represents the port con- nected with h(si) in swsrc.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Transforming the Object Given an access control relationship Ri ∈ SPM and the object oj ∈ Ri, then oj is transformed into a corresponding host existed in the data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The rule of transforming the object of SPM is formally defined as follows: oj ∈ Ri h(oj) = (ipdst, swdst, portout dst, ) (2) where h(oj) represents the host mapped with oj in the data plane, ipdst repre- sents the IP address of h(oj) in the data plane, swdst represents the OpenFlow 7 Figure 1: The method of transforming SPM into the system model of flow entries.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 8 Si R1 S 0 Application PN h3 P1 sw1 h1 h2 sw2switch connected with h(oj), portout dst represents the port connected with h(oj) in swdst.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Transforming the Authorization Given an access control relationship Ri ∈ SPM and the access authorization a ∈ Ri, if there existing a connected path Pi between h(si) and h(oj) in the topology, then a is transformed into the connected Pi.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The rule of transforming the authorization is formally defined as follows: a ∈ Ri h(si) �−→ h(oj) ⊂ G (3) where h(si) �−→ h(oj) represents a directional connected path from h(si) to h(oj) in the topology.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Transforming the Path The connected path h(si) �−→ h(oj) is trans- formed into a set of flow entries deployed in the OpenFlow switches which are passed by the path.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The rule of transforming the connected path is formally defined as follows: h(si) �−→ h(oj) dst � k=src fi(k) (4) where fi(k) =( ipsrc, ipdst, portin k =⇒ portout k ) represents a flow entry deployed in the switch swk which is passed by h(si) �−→ h(oj).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Leveraging the definitions of the system model, we can proof that the rule of transforming the connected path is sound.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' proof : h(si) �−→ h(oj) = { h(si), e0, e1, .' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='..' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', en, h(oj) } = {(ipsrc, swsrc, portin src), (portout src �−→ portin 0 ) , .' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='..' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', (portout n �−→ portin dst), (ipdst, swdst, portout dst)} = {(portin src =⇒ portout src), (portin 0 =⇒ portout 0 ), , .' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='..' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', (portin n =⇒ portout n ), (portin dst =⇒ portout dst) (ipsrc, ipdst), (swsrc, swdst)} = { dst � k=src (portin k =⇒ portout k )} � (ipsrc, ipdst) = dst � k=src {(portin k =⇒ portout k ) � (ipsrc, ipdst)} = dst � k=src fi(k).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Therefore, ∀Ri ∈ SPM, the subject si ∈ Ri, the object oj ∈ Ri and the autherization a ∈ Ri, if ∃Pi = h(si) �−→ h(oj) in the topology, then Ri can be transformed into a corresponding set of flow entries dst � k=src fi(k) by using the system model step by step, it can be formally defined as follows: Ri dst � k=src fi(k) (5) 9 Transforming SPM SPM is transformed into a corresponding set of flow entries ∆ by using the equation (5).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' If || SPM || = m, then the rule of transforming SPM is formally defined as follows: ∆ = m � i=1 { dst � k=src fi(k)} (6) 4.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The Security Policy Transformation Framework The problem of how to transform SPM into the corresponding flow entries used by the OpenFlow switches has been solved from the theoretical level in Section 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' However, we cannot solve the problem of how to find a connected path in the data plane for each relationship Ri ∈ SPM.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In addition, by means of the security policy transformation method, SPM can be transformed into the corresponding flow entries, but the flow entry transformed from SPM is of the system model, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' it is only the formal description of the real flow entry and cannot be used by the real OpenFlow switch directly, so that we need to further solve the problem of how to generate the practical flow entries by using the system model of flow entries.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Based on this insight, a runtime security policy transformation framework for SDN networks is proposed from the practical level in this section.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' By means of the framework, we can solve the problem of how to find the connected path for each relationship defined by SPM, as well as the problem of how to generate the practical flow entries based on the system model at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 2, this framework consists of 5 functional modules, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', the security policy module, the topology discovery module, the runtime monitoring module, the path generation module and the flow entry generation module.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 4.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Overview of the Framework Security policy module is deployed in the application plane and responsible for maintaining the security policy (SPM).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Each access control relationship Ri ∈ SPM is designed as a 3-tuple: ( si, oj, fixed ) based on the system model, where si is the subject;' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' oj is the object;' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' fixed={ 0, 1 } is a tag bit, fixed=1 represents the relationship has been updated by user, fixed=0 represents it is unchanged.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' SPM is stored as a text document and can be updated by the user at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Topology discovery module is deployed in the control plane and responsible for creating a dynamic real-time topology of the entire data plane by capturing the link events transmitted from the OpenFlow switches.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Based on the system model, each edge in the topology is designed as a tuple: ei = ( swsrc, portsrc, swdst, portdst, using, c ), where using={ True, False } is a tag bit and can be changed by the real-time link events at runtime, using=True represents the edge can be used now, using=False represents the edge is interrupted now.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' For the convenient of researching, the cost of each edge is set to 1, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', c =1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The generated topology is stored as a text document and can also be updated by the real-time link events at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 10 Figure 2: The security policy transformation framework for SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Runtime monitoring module is deployed in the control plane and respon- sible for monitoring all the traffics in the data plane by capturing the real-time packet-in events transmitted from the OpenFlow switches.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' When a new packet- in event arrives in the controller, the module first invokes the path generation module to transform the latest security policy (SPM) into a set of connected paths in the data plane, then invokes the flow entry generation module to trans- form all the connected paths into their corresponding flow entries deployed in the OpenFlow switches which are passed by these paths.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As SPM and the topol- ogy of data plane will be evolved with the runtime environment, this module is designed to be triggered by the real-time packet-in events continuously, so that, when SPM is changed (i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', occurring fixed=1) or the topology is changed (i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', occurring using=False) at runtime, the module will first delete all the current flow entries deployed in the OpenFlow switches, then update all the flow tables by using the latest generated flow entries, so as to ensure the security properties defined by SPM can be synchronously and continuously hold in the data plane at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Path generation module is deployed in the control plane and invoked by the runtime monitoring module at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The module is responsible for trans- forming each Ri ∈ SPM input from the runtime monitoring module into a corresponding path Pi in the data plane by using the latest topology file and the path searching algorithm.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Specifically,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' it first transforms the subject si ∈ Ri and the object oj ∈ Ri into the hosts h(si) and h(oj) in the data plane respec- 11 Security Policy Update SPM Module Application Plane SPM Path Topology Topology Generation Module Control Plane Update Invoke Path Topology Flow Entry Runtime Discovery Generation Path Monitoring Module Module Module Link Events Flow Entries Packet-In Events OpenFlow Switches Data Planetively,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' then finds a shortest connected path Pi between h(si) and h(oj) by using the path searching algorithm,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' finally all the connected paths transformed from SPM are returned to the runtime monitoring module.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Flow entry generation module is also deployed in the control plane and in- voked by the runtime monitoring module at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The module is responsible for transforming the connected path into a set of flow entries deployed in the OpenFlow switches which are passed by the path, then utilizing the instructions provided by the controller to generate the practical flow entries and distributing these flow entries to the corresponding OpenFlow switches at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 4.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Runtime Monitoring Algorithm The runtime monitoring algorithm deployed in the runtime monitoring mod- ule plays the role of coordinator in the framework, and can be described as Al- gorithm 1 in pseudo code.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, the algorithm creates two dynamic lists S and T by reading the latest SPM and Topo file respectively.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' If there existing an access control relationship has been changed by user (Ri.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='fixed=1) or a edge has been shut down in the topology (ei.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='using=False) at runtime, it will clear all the current flow entries deployed in the OpenFlow switches for ready of the updating.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, for each access control relationship Ri ∈ S, it maps the subject si ∈ Ri and the object oj ∈ Ri with the switches swsrc and swdst in the data plane, then transforms Ri into a corresponding connected path Pi by invoking the path searching algorithm djk-route(swsrc, swdst, N).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Based on the transformation rules, Pi can be further transformed into a set of flow entries.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' When all the relationships in the List S having been transformed, SPM has been transformed into a corresponding set of flow entries ∆, the algorithm invokes the flow entry generation module to update the data plane by using ∆.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Since the algorithm is designed to be triggered by the packet-in events at runtime, so that it ensures the framework can perceive any changes in time when the security policy or the topology of data plane has been evolved with the environment, and then update the data plane synchronously at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 4.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Path Searching Algorithm Another important algorithm in the framework is the path searching algo- rithm deployed in the path generation module.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The algorithm is improved from the classic Dijkstra algorithm and can be described as the Algorithm 2 in pseudo code.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, the algorithm creates a dynamic matrix djk[N][N] by using the sum of Openflow switches N and the topology file.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, it cal- culates a shortest connected path between swsrc and swdst in the data plane by using djk[N][N] and the created stacks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After multi-round calculating, the shortest path Pi between swsrc and swdst is found and returned to the runtime monitoring module.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As the cost of each edge has been set to 1 and not consider- ing of the quality of services (QoS) of edges, so that the shortest path Pi found by the algorithm is generated by calculating the minimum number of hops in the topology.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Moreover, since the matrix djk[N][N] is dynamically created by the topology file, so that the searched shortest path will be evolved with the changing of the topology at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 12 5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Implementation and Evaluations In order to validate the feasibility and effectiveness of the framework pro- posed in Section 4, we set up an experimental system and implement the frame- work with POX controller[27] and Mininet emulator[28].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, we im- plement a virtual SDN network by using the Mininet emulator.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 3, the topology of the network consists of 6 hosts (h1 ∼ h6) and 11 Open- Flow switches (sw1 ∼ sw11).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' We further implement the security policy module, topology discovery module, runtime monitoring module, path generation mod- ule and flow entry generation module with Python 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='6.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1 and integrate these modules with the core of POX controller.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental system consists of a Lenovo workstation with Windows OS, Intel-i7 32Cores 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='60GHz CPU, 32GB RAM and a Raspberry platform with Linux OS, ARM-v7 CPU and 945MB RAM.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The POX controller and the functional modules are deployed in Lenovo workstation, Mininet emulator is deployed in Raspberry platform, and Lenovo workstation is connected with Raspberry platform using coaxial cable directly.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Table 1: The high-level security policy (SPM) R1 ( 1, 5, 1 ) R2 ( 5, 1, 1 ) R3 ( 2, 4, 1 ) R4 ( 4, 2, 1 ) 5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Effectiveness Evaluation The security policy used for validating the effectiveness of the framework is shown in Table I.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Since any effective interaction is bidirectional in SDN networks, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', the subject’s host and the object’s host must be ensured they can access each other in the data plane, so that we design the security policy as 4 access control relationships (R1 ∼ R4) to ensure h1 (1) and h5 (5) can access each other, h2 (2) and h4 (4) can access each other, and all the relationships of SPM are set as fixed=1, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', having been updated by user.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, the effectiveness evaluations towards the framework will be carried out under 4 different scenarios at runtime, they are the effectiveness after loading the flow entries, the effectiveness after cutting down the path and the effectiveness after changing SPM.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Effectiveness after Loading the Flow Entries The purpose of this experiment is to validate whether the data plane after loading the generated flow entries can hold the security properties defined by SPM.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, the subjects and objects of SPM shown in Table I, i,e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', the 1, 2, 4 and 5, are transformed into their corresponding hosts in the data plane by using security policy transformation.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Specifically, the 1 is transformed into 13 Figure 3: The topology of the virtual SDN network.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' h1=( 10.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1, sw1, 1 ), the 2 is transformed into h2=( 10.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2, sw2, 1 ), the 4 is transformed into h4=( 10.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='4, sw9, 1 ) and the 5 is transformed into h5=( 10.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='0.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='5, sw10, 1 ) respectively.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, the path searching algorithm, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', Algorithm 2, searches the shortest path between the subject’s host and the object’s host for each Ri ∈ SPM based on the latest topology generated from the topology file.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After that, the relationships shown in Table I have been transformed into 4 corresponding shortest connected paths (P1 ∼ P4) in the data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 4, the R1 is transformed into P1={ h1, e1, e2, e3, h5 }, the R2 is transformed into P2={ h5, e3, e2, e1, h1 }, the R3 is transformed into P3={ h2, e4, e5, h4 } and the R4 is transformed into P4={ h4, e5, e4, h2 }, where the P1 and P2 are depicted with the blue lines, the P3 and P4 are depicted with the orange lines.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, the flow entry generation module transforms each path into a set of flow entries deployed in the switches passed by the path.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Specifically, P1 and P2 are transformed into the flow entries deployed in the switches { sw1, sw5, sw8, sw10 }, while P3 and P4 are transformed into the flow entries deployed in the switches { sw2, sw6, sw9 }.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After that, we execute the pingall instruction in the Mininet CLI and observe the reachability of the entire data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 5, h1 and h5 can access each other, h2 and h4 can access each other either, so that the data plane after loading the generated flow entries has been proven that it can hold all the security properties defined by SPM.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 14 Figure 4: The shortest paths searched by Algorithm 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Figure 5: The result of executing the pingall instruction.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 15 1 e es e3pi@raspberrypi:/mininet/custom 口 X s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 *** Adding links: (hl, sl) (h2, s2) (h3, s7) (h4, s9) (h5, s10) (h6, sl1) (sl, s2) (sl, s3) (sl, s 5) (s2, s4) (s2, s6) (s3, s4) (s3, s7) (s4, s5) (s4, s7) (s4, s8) (s5, s6) (s5, s8) (s5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' s9) (s6, s9) (s7.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' s8) (s7.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' s10) (s8.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' s9) (s8.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' s10) (s8.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' s11) (s9, s11) (s10, sl1) *** Configuring hosts hl h2 h3 h4 h5 h6 *** starting controller c0 *** starting ll switches s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 *** Starting CLI: mininet> pingall *** Ping: testing ping reachability hl > X X X h5 X h2 > x x h4 x x 13 XXXXX<- h4 -> x h2 X X n5 -> hl x x x X X X X X X <- 9u *** Results: 86% dropped (4/30 received) mininet> mininet>5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Effectiveness after Cutting down the Path The purpose of this experiment is to validate whether the security properties defined by SPM can be continuously hold in the data plane after the connected path between the subject’s host and the object’s host is shut down at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' If the framework can synchronously perceive this change from the topology and automatically find another new connected path to keep the data plane holding the security properties at runtime, then the framework will be proven to be effective under this scenario.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, we let h1 and h5 can access each other by loading the corresponding flow entries into the data plane, and the shortest path between h1 and h5 is initialed with { h1, e1, e2, e3, h5 }.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, we make a continuous TCP traffic sent from h1 to h5 by using the iperf instruction in the Mininet CLI, we set the duration time of the experiment equals 60 seconds and record the throughput of the traffics in h5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' When the time reaches 23 seconds, we shut down the edge between sw8 and sw10 existed in the path P1 by using the instruction in the Mininet CLI and let the experiment going on.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' When the experiment is finished, we read the data recorded in h5 and plot them in Figure 6.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 6, the throughput of the traffic sent from h1 to h5 is sharply declined after the edge is shut down at 23 seconds, and completely becomes zero from 25 seconds to 37 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After 38 seconds, the traffic quickly returns to normal until the end of the experiment.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result has illustrated that the framework can synchronously perceive the change caused by cutting down one edge between sw8 and sw10, and automatically find another new shortest connected path between h1 and h5, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', { h1, e6, e7, e8, h5 }, so as to make the traffic returning to normal quickly and keep the data plane holding the security properties defined by SPM at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The new shortest connected path searched by Algorithm 2 after cutting down the using path is shown in Figure 7.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Effectiveness after Changing SPM The purpose of this experiment is to validate whether the security properties defined by SPM can be continuously hold in the data plane after SPM is changed by the user at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' If the framework can synchronously perceive this change from SPM and automatically update the flow entries deployed in the switches to keep the data plane holding the evolved security properties at runtime, then the framework will be proven to be effective under this scenario.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, we let h1 and h5 can access each other by loading a corresponding flow entries into the data plane, then make a continuous TCP traffic sent from h1 to h5 by using the iperf instruction in the Mininet CLI, we set the duration time of the experiment equals 60 seconds and record all the throughput data of the traffic in h5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In the following, we first validate the effectiveness of the framework under the scenario of changing SPM from h1 and h5 can access each other to h2 and h5 can access each other at runtime, and the experimental result under this scenario is plotted in Figure 8.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 8, the throughput of the traffic sent from h1 to h5, which is depicted with the red line, is quickly declined when we load the new SPM into the controller at 29 seconds, and completely becomes 16 Figure 6: The blue line represents the throughput of the traffic sent from h1 to h5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The dotted line represents we shut down the connected path at 23 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Figure 7: The new connected path searched by Algorithm 2 at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 17 Throughput (Gbits/sec) the traffic from h1 to h5 shut down the path at runtime 20 60 Time (sec)e6 eA 1 e7 es es eszero after 31 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From 31 seconds until to the end of the experiment, h5 can only receive the traffic sent from h2 which is depicted with the blue line.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result illustrates the framework can synchronously perceive this change and keep the data plane holding the evolved security properties after changing SPM from h1 and h5 can access each other to h2 and h5 can access each other at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Figure 8: The red line represents the throughput of the traffic sent from h1 to h5, the blue line represents the throughput of the traffic sent from h2 to h5, the dotted line represents we change SPM at 29 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' After that, we further validate the effectiveness of the framework under the scenario of adding a new relationship into SPM, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', adding h2 and h5 can access each other, at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result under this scenario is plotted in Figure 9.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 9, the throughput of the traffic sent from h1 to h5, which is depicted with the red line, still keeps normal before we load the new SPM into the controller at 43 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From 44 seconds until to the end of the experiment, h5 can receive the continuous traffic sent from h2 which is depicted with the blue line, and can also receive the traffic sent from h1 at the same time.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Due to the crowding of the traffic sent from h2, the throughput of the traffic from h1 is declined from 3.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='71GB/s to 1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='99 GB/s.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The throughput of the traffic sent from h2 is still kept between 1.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='6GB/s and 2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2GB/s after 44 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result illustrates the framework can synchronously perceive this change and keep the data plane holding the evolved security properties after adding a new relationship into SPM at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 18 Throughput (Gbits/sec) the traffic from h1 to h5 the traffic from h2 to h5 load the new SPM at runtime Time (sec)Figure 9: The red line represents the throughput of the traffic sent from h1 to h5, the blue line represents the throughput of the traffic sent from h2 to h5, the dotted line represents we change SPM at 43 seconds.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 5.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Performance Evaluation As the critical algorithm used for implementing the security policy trans- formation, the performance of the path searching algorithm, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', Algorithm 2, needs to be further evaluated.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all, the sum of access control relation- ships of the security policy (SPM) is denoted as M, and the sum of OpenFlow switches in the topology is denoted as N in this performance evaluation.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Then by leveraging the Python programming, the execution time of Algorithm 2 have been recorded in milliseconds (ms) for calculating the shortest paths under set- ting the different value of M and N.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result is plotted in Figure 10.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' As shown in Figure 10, with gradually amplifying the value of M from 2 to 10, and the value of N from 11 to 400 respectively, the execution time of Algorithm 2 shows an obvious exponential upward trend.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Moreover, accord- ing to the description of Algorithm 2, the time complexity for calculating only one shortest path will reach O(N 2), because the Algorithm 2 needs to create a dynamic matrix djk[N][N] and further calculates the while loop, so that the time complexity for transforming all the access control relationships defined by SPM into their corresponding shortest paths will reach O(M × N 2).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 6.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Conclusion In this paper, we propose a practical runtime security policy transforma- tion framework for SDN networks.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' First of all,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' we specify the security policies used by SDN networks,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' such as access control policies or firewall policies,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' as a 19 Throughput (Gbits/sec) the traffic from h1 to h5 一the traffic from h2 to h5 load the new SPM at runtime Time (sec)Figure 10: The execution time of Algorithm 2 recorded in milliseconds (ms) for calculating the shortest paths under setting the different value of M and N,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' where M represents the sum of access control relationships of SPM,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' N represents the sum of OpenFlow switches in the topology.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' system model of security policy (SPM).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' SPM is of a high-level system model without containing any underlying information of data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From the theoret- ical level, we establish the system model for SDN network and propose a formal method to transform SPM into the corresponding flow entries automatically.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The flow entry transformed from SPM is of a low-level system model containing the underlying information of data plane.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' From the practical level, we propose a runtime security policy transformation framework which consists of the se- curity policy module, topology discovery module, runtime monitoring module, path generation module, as well as flow entry generation module.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Leveraging these functional modules, the framework can solve the problem of how to find a connected path for each relationship defined by SPM in the data plane, how to transform the path into the system model of flow entries, as well as how to generate the practical flow entries by using the system model of flow entries.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' In order to validate the feasibility and effectiveness of the framework, we set up an experimental system and implement the framework by using POX con- troller and Mininet emulator.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The experimental result illustrate the framework is completely effective at runtime.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' However, there still exists some problems needed to be further researched in the future.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' The current path searching algorithm, i.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='e.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', Algorithm 2, used by the framework is improved from the classic Dijkstra algorithm and finds the shortest path by calculating the minimum number of hops in the topology.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' However,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' in the real SDN networks,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' the problem of searching a connected path between the two hosts need to consider the matters of quality of service (QoS),' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 20 350 when M =2 when M =4 M 300- when M =6 when M =8 when M =10 250 (sw) e 200 Performance W 150 P 100 - 50 - +0 0 50 100 150 200 250 300 350 400 Sum of OpenFlow Switches (N)load balance,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' as well as some specific requirements about the traffic engineering at runtime,' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' so that the framework needs to be further improved by employing some novel path searching algorithms based on multi-object optimization[29] or reinforcement learning[30] methods.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Acknowledgment This paper has been sponsored and supported by National Key Research and Development Program of China (Grant No.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='2018YFB0803400), Doctoral Foundation of Qingdao Binhai University (Grant No.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' BS2022A10), partially supported by Key Program of National Natural Science Foundation of China (Grant No.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='61932013).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' References References [1] D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Kreutz, F.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' V.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Ramos, P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Verissimo, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Rothenberg, S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Azodol- molky, S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Uhlig, Software-defined networking: A comprehensive survey, Proceedings of the IEEE 103 (1) (2014) 10–13.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [2] J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Garay, A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Mendiola, N.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Toledo, E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Jacob, Flownac: Flow-based network access control, in: Third European Workshop on Software-defined Networks, 2014.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [3] S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' T.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Yakasai, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' G.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Guy, Flowidentity: Software-defined network access control, in: IEEE Conference on Network Function Virtualization and Software-defined Networks, 2015.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [4] H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Hu, W.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Han, G.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Ahn, Z.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Zhao, Flowguard: Building robust firewalls for software-defined networks, in: Acm Sigcomm Workshop on Hot Topics in Software Defined Networking, 2014.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [5] M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Koerner, O.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Kao, Mac based dynamic vlan tagging with openflow for wlan access networks, Procedia Computer Science 94 (2016) 497–501.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [6] K.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Phemius, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Bouet, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Leguay, Disco: Distributed sdn controllers in a multi-domain environment, in: Noms IEEE/IFIP Network Operations and Management Symposium, 2014.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [7] Y.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Meng, Z.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Huang, G.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Shen, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Ke, A security policy model transformation and verification approach for software defined networking, Computers & Security 100 (102089).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [8] A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Kleppe, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Warmer, W.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Bast, MDA Explained, Addison-Wesley Profes- sional, 2004.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 21 [9] J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Albuquerque, H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Krumm, P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' L.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Geus, Formal validation of au- tomated policy refinement in the management of network security systems, International Journal of Information Security 9 (2) (2010) 99–125.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [10] K.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Jayaraman, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Rinard, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Tripunitara, V.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Ganesh, S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Chapin, Au- tomatic error finding in access control policies, in: CCS, 2011.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [11] C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Wang, G.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Wang, A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Chen, H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Wang, S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Uczekaj, A policy-based ap- proach for qos specification and enforcement in distributed service-oriented architecture, in: IEEE International Conference on Services Computing, 2005.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [12] C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Kamienski, R.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Dantas, E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Azevedo, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Dias, B.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Ohlman, Unleash- ing the power of policies for service-oriented computing, in: International Conference on Network and Service Management, 2011.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [13] S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Davy, B.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Jennings, Harnessing models for policy conflict analysis, in: AIMS2007, 2007.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [14] I.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Luck, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Schfer, H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Krumm, Model-based tool-assistance for packet-filter design, in: Policies for Distributed Systems and Networks, International Workshop, POLICY 2001 Bristol, UK, January 29-31, 2001, Proceedings, 2001.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [15] J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Albuquerque, H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Krumm, P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' L.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Geus, Policy modeling and refinement for network security systems.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=', in: IEEE International Workshop on Policies for Distributed Systems and Networks, 2005.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [16] B.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Lampson, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Abadi, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Burrows, Authentication in distributed systems: theory and practice, in: ACM SIGOPS Operating Systems Review, 1991.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [17] M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Abadi, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Burrows, B.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Lampson, G.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Plotkin, A calculus for access control in distributed systems, in: International Cryptology Conference, 1991.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [18] N.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Kang, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Reich, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Rexford, D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Walker, Policy transformation in software defined networks, Acm Sigcomm Computer Communication Review 42 (4) (2012) 309.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [19] J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Ma, D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Zhang, G.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Xu, Y.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Yang, Model checking based security pol- icy verification and validation, in: International Workshop on Intelligent Systems and Applications, 2010.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [20] E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Clarke, O.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Grumberg, D.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Peled, Model checking, Springer Berlin Heidelberg, 1997.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [21] E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Alshaer, H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' H.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Hamed, Firewall policy advisor for anomaly discov- ery and rule editing, in: IFIP/IEEE Eighth International Symposium on Integrated Network Management, 2003.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 22 [22] A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Bandara, E.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Lupu, A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Russo, Using event calculus to formalise ppol- icy specification and analysis, in: International workshop on policies for distributed systems and networks, 2003, pp.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 26–39.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [23] M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' May, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Gunter, I.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Lee, Privacy apis: Access control techniques to analyze and verify legal privacy policies, in: IEEE Computer Security Foundations Workshop, 2006, pp.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 85–97.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [24] J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Rubio-Loyola, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Serrat, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Charalambides, P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Flegkas, A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Lluch- Lafuente, Using linear temporal model checking for goal-oriented policy refinement frameworks, in: 6th IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY 2005), 6-8 June 2005, Stockholm, Sweden, 2005.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [25] A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Graham, T.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Radhakrishnan, C.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Grossner, Incremental Validation of Policy-Based Systems, 2004.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [26] J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Baliosian, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Serrat, Finite state transducers for policy evaluation and conflict resolution, in: IEEE International Workshop on Policies for Dis- tributed Systems and Networks, 2004, pp.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 250–259.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [27] POX (2017).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [link].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' URL https://github.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='com/noxrepo/pox [28] Mininet (2012).' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [link].' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' URL http://www.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='mininet.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content='org [29] R.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' T.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Marler, J.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' S.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Arora, Survey of multi-objective optimization methods for engineering, Structural and multidisciplinary optimization 26 (6) (2004) 369–395.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' [30] L.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' P.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Kaelbling, M.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' L.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Littman, A.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' W.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' Moore, Reinforcement learning: A survey, Journal of artificial intelligence research 4 (1996) 237–285.' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'} +page_content=' 23' metadata={'source': '/home/zjlab/wf/langchain-ChatGLM/knowledge_base/DdE2T4oBgHgl3EQfSQc5/content/2301.03790v1.pdf'}