In recent years, the network urgently needs a lot of bandwidth resources to meet the explosive growth of traffic demands. Network operators are also constantly speeding up the routing ports and expanding the link bandwidth, but the network resource utilization rate is still very low, so through traffic engineering technology to optimize the utilization of network resources is of great significance. Therefore, focusing on the traffic engineering technology based on segment routing in Software-Defined Networking, we propose the SRTE-L model, and a traffic scheduling scheme. We propose to set a path decision variable L and a path constraint to limit the length of SR path and the number of intermediate nodes, thereby minimizing the maximum link utilization and reducing computation time, and we investigate the trade-off between link utilization and computation time. Finally, the difference between the proposed method and the existing methods in terms of computation time and maximum link utilization is compared. Through extensive simulations,we indeed experimentally show that our method can reduce the computation time while retaining comparable maximum link utilization.

In agent migration process, malicious hosts can compromise the agent. To solve the problem, the paper introduces the measure of agent integrity verification and constructs a novel agent fault-tolerant migration model. The model avoids much agent replicas in migration process. By simulation experiment, the results prove that the model provided by the paper is feasible and efficient, and can save network resource much than other relative works.

Access control is the process of mediating every request to resource and data maintained by an active node system and determining whether the request should be granted or denied. In This work we present an access control policy called family tree policy. The family tree policy can correctly represent active network that cannot be correctly modeled by BLP and Chinese wall model. In the family tree policy, the subjects and objects of the system are classified as different Inheriting classes. A subject cannot access the object of the different inheriting class. In the same inheriting class, the subject and object abide by the BLP model. All different inheriting classes have the same ancestor. The ancestor can access any inheriting class and comply with BLP model.