Information-centric networking (ICN) separates the identifier and locator of network entities, providing a natural advantage in supporting mobility. To gain the advantage of ICN to support mobility, an urgent challenge is the problem of practical implementation with performance optimization. Software-defined networking (SDN) can be regarded as infrastructure to implement ICN mobility. However, it is difficult for the centralized SDN controller to quickly process mobile signaling. Therefore, this paper proposes enhanced programmable data plane supporting ICN mobility. By offloading mobility-related control plane functions from the controller to the data plane, the data plane can locally process mobile signaling without interacting with the controller. We propose an offloading mechanism for control plane functions, based on a rule table, where the controller authorizes the data plane to process the mobile signaling by loading the programmable rule table to data plane’s control element, and the control element intercepts the mobile signaling, matches the predefined rule table, and executes a series of application logic actions. In addition, we propose an improved SmartSplit algorithm to manage the rule table and speed up packets matching the rule table. Based on Intel’s Data Plane Development Kit (DPDK), we implement the enhanced programmable data plane. Our experimental results prove that the proposed enhanced programmable data plane has a stronger ability to process mobile signaling and reduce latency.
Web caching is a well-known strategy for improving the performance of web systems. The key to better web caching performance is an efficient replacing policy that keeps in the cache popular documents and replaces rarely used ones. When coupled with web log mining, the replacing policy can more accurately decide which documents should be cached. In this paper, we present a PLSA based prediction model to predict the user access patterns and interest to extend the well-known NGRAM-GDSF caching policy. Extensive experiments are conducted on the publicly available web logs datasets. The result shows that our approach gets better web-access performance.
Across a diverse landscape of anonymity designs, the dominant paradigms—onion routing (e.g., Tor) and mix networks (e.g., Loopix)—carry intrinsic constraints: long-lived circuits invite traffic correlation, and mixnets often rely on a network-wide state, making it hard to reconcile anonymity and scalability. This paper presents Draughts, a fully decentralized system in which each packet follows an independent and dynamically determined transmission path. Built upon Jump routing, Draughts introduces three key innovations: (i) replacing global state with local two-hop neighborhood knowledge ; (ii) supporting anonymous replies to enable real-time bidirectional communication; and (iii) proposing a path-length control mechanism that balances anonymity and transmission efficiency. Evaluation results show that Draughts achieves strong sender anonymity, resists predecessor and traffic analysis attacks, and reduces receiver buffer maintenance overhead, achieving a favorable trade-off between anonymity and performance.