Distributed Application Addressing in 6G Network

To ensure the extreme performances of the new 6G services,applications will be deployed at deep edge,resulting in a serious challenge of distributed application addressing.This paper traces back the latest development of mobile network application addressing,analyzes two novel addressing methods in carrier network,and puts forward a 6G endogenous application addressing scheme by integrating some of their essence into the 6G network architecture,combining the new 6G capabilities of computing&network convergence,endogenous intelligence,and communication-sensing integration.This paper further illustrates how that the proposed method works in 6G networks and gives preliminary experimental verification.

Smart control plane for information centric network-internet service provider networks

The information centric network(ICN)has been widely discussed in current researches.The ICN interoperation with a traditional IP network and caching methods are one of the research topics of interest.For economic reasons,the capability of applying the ICN to internet service providers(ISPs)with various traditional IP protocols already implemented,especially IGP,MPLS,VRF,and TE,does not require any change on the IP network infrastructure.The biggest concern of ISPs is related to their customers’contents delivery speed.In this paper,we consider ICN caching locations in ISP by using the concept of locator/ID separation protocol(LISP)for interoperation between a traditional IP address and name-based ICN.To be more specific,we propose a new procedure to determine caching locations in the ICN by using the cuckoo search algorithm(CSA)for finding the best caching locations of information chunks.Moreover,we create the smart control plane(SCP)scheme which is an intelligent controlling,managing,and mapping system.Its function is similar to the software defined network concept.We show how the proposed SCP system works in both synthetic small network and real-world big network.Finally,we show and evaluate the performance of our algorithm comparison with the simple search method using the shortest path first algorithm.

HHR:Hierarchical Hybrid Routing Scheme for Information-Centric Network

Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN is no exception.ICN network would be divided into core domain and many edge domains as today's internet does.HHR(Hierarchy Hybrid Routing scheme) is presented for ICN:A Chord-like routing scheme is used in core domain,while edge domains routing structure can be classified into three categories,Local Routing(LR),Delivery of Local Publication to Core domain(DLPC),and Remote Publication Routing into edge domain(RPR).LR can be decided by each edge domain,which determined by many factors,such as locality characteristic for pub/sub information and local policies.A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously.Simulation results demonstrate that HHR can be fast deployed,and can be applied in large scale network or dynamic subscription environment.

Protecting User Privacy in a Multi-Path Information-Centric Network Using Multiple Random-Caches

In-network caching is a fundamental mechanism advocated by information-centric networks （ICNs） for efficient content delivery. However, this new mechanism also brings serious privacy risks due to cache snooping attacks. One effective solution to this problem is random-cache, where the cache in a router randomly mimics a cache hit or a cache miss for each content request/probe. In this paper, we investigate the effectiveness of using multiple random-caches to protect cache privacy in a multi-path ICN. We propose models for characterizing the privacy of multi-path ICNs with random-caches, and analyze two different attack scenarios： 1） prefix-based attacks and 2） suffix-based attacks. Both homogeneous and heterogeneous caches are considered. Our analysis shows that in a multi-path ICN an adversary can potentially gain more privacy information by adopting prefix-based attacks. Furthermore, heterogeneous caches provide much better privacy protection than homogeneous ones under both attacks. The effect of different parameters on the privacy of multi-path random-caches is further investigated, and the comparison with its single-path counterpart is carried out based on numerical evaluations. The analysis and results in this paper provide insights in designing and evaluating multi-path ICNs when we take privacy into consideration.