Guanglei Li

Fuzzy Theory Based Security Service Chaining for Sustainable Mobile-Edge Computing

Mobile-Edge Computing (MEC) is a novel and sustainable network architecture that enables energy conservation with cloud computing and network services offloading at the edge of mobile cellular networks. However, how to efficiently manage various real-time changing security functions is an essential issue which hinders the future MEC development. To address this problem, we propose a fuzzy security service chaining approach for MEC. In particular, a new architecture is designed to decouple the required security functions with the physical resources. Based on this, we present a security proxy to support compatibility to traditional security functions. Furthermore, to find the optimal order of the required security functions, we establish a fuzzy inference system (FIS) based mechanism to achieve multiple optimal objectives. Much work has been done to implement a prototype, which is used to analyze the performance by comparing with a widely used method. The results prove that the proposed FIS mechanism achieves an improved performance in terms of Inverted Generational Distance (IGD) values and execution time with respect to the compared solution.

Contact Quality Aware Routing for Satellite-Terrestrial Delay Tolerant Network

In space delay tolerant network (DTN), the absence of adequate nodes makes the communication opportunities precious. If the messages are transmitted using a path which exists high bit error, it can increase the delivery delay and reduce the delivery ratio. Therefore, how to distinguish the contact quality and select a path with little bit error is crucial to improve the network performance. In this paper, we propose a contact quality aware routing which operates cooperatively with Licklider Transmission Protocol (LTP). We use the processing signals in LTP to reflect the contact quality. Further more, we propose a contact quality based forwarding scheme to select a path which exists little bit error. The enhancements are verified using a test-bed with 15 simulation nodes. The experiments show that the proposed schemes can reduce the delivery delay, increase the delivery ratio and improve the throughput.

Timeout Strategy-based Mobility Management for Software Defined Satellite Networks

Software Defined Satellite Network (SDSN) is a novel framework which brings Software Defined Network (SDN) technologies in the satellite networks. It has great potential to achieve effective and flexible management in the satellite networks. However, the frequent handovers will lead to an increase in the flow table size in SDSN. Due to the limited flow table space, a lot of flows will be dropped if the flow table is full during the handover. This is a burning issue to be solved for mobility management in SDSN. In this paper, we propose a heuristic Timeout Strategy-based Mobility Management algorithm for SDSN, named TSMM. TSMM aims to reduce the drop-flows during handover by considering two key points, the limited flow table space and satellite link handover. We implement TSMM mechanism and conduct contrast experiments. The experimental results verify the good performance in terms of transmission quality, an 8.2%-9.9% decrease in drop-flow rate, and a 6.9%–11.18% decrease in flow table size during the handover.

Least Popularly Used: A Cache Replacement Policy for Information-Centric Networking

The local caching policy of nodes is always one of the hottest issues in caching networks. It can be further divided into two branches, the decision policy and the replacement policy. In this paper, a replacement policy named Least Popularly Used (LPU) is proposed for cache nodes in Information-Centric Networking (ICN) to improve the network performance. Both the request number and the arrival time of a content are taken into account in LPU for judging content popularity. Thus, recently popular contents are cached near consumers, reducing the consumers’ distance to access contents and the traffic load on the original sever. Based on the string, tree and ISPlike topology, extensive simulations are performed, and the results indicate that the performance of LPU is better than that of other replacement policies, including Most Recently Used (MRU), Least Recently Used (LRU), Random, Greedy Dual-Size (GDS), Most Frequently Used (MFU), Least Frequently Used (LFU) and LFU-Dynamic Aging (LFU-DA), in terms of the average hop counts, the server hit ratio and the cache eviction counts.