Xiaoke Jiang

A Probabilistic Marking Scheme for Fast Traceback

For existing probabilistic marking technologies for IP traceback, such as Probabilistic Packet Marking (PPM), TTL-based Packet Marking (TPM) and Dynamic Probabilistic Packet Marking (DPPM), it is difficult to reconstruct attack path(s) fast and defend against spoofed marks. In this paper, we present Adaptive Probabilistic Marking scheme (APM), where the TTL value of each packet is set to a uniform number at the first-hop router, and each router deduces the distance that each packet has already traveled, and then adaptively marks the packet with the probability inversely proportional to the distance. We theoretically prove that, in APM, the victim requires the fewest packets for a successful traceback, the effect of spoofed marks can be eliminated. NS2 experiments show, in APM, the time for the victim to collect all the obligatory marks for the path reconstruction is reduced by more than 20% compared with existing schemes, and spoofed marks cannot reach the victim.

A quick survey on selected approaches for preparing programmable networks

Currently, new protocols or architectures related to core network layer or network forwarding equipment are hard to deploy. And the core network evolves slowly. To solve this problem, various programmable Internet architectures and approaches are proposed. Programmable networks allow network researchers (not only the equipment vendors like Cisco and Juniper) to program and manage their customized architectures or protocols. This paper firstly describes the ossification with the current Internet architecture. And then it analyzes several most representative approaches for programmable networks with their mechanisms, advantages, and shortcomings. By the analysis above, this paper at last discusses the future research trends and gives a detailed description of the key issues in the future research of the programmable networks.

A survey on Information-centric Networking: Rationales, designs and debates

The basic function of the Internet is to delivery data (what) to serve the needs of all applications. IP names the attachment points (where) to facilitate ubiquitous interconnectivity as the current way to deliver data. The fundamental mismatch between data delivery and naming attachment points leads to a lot of challenges, e.g., mapping from data name to IP address, handling dynamics of underlying topology, scaling up the data distribution, and securing communication, etc. Information-centric networking (ICN) is proposed to shift the focus of communication paradigm from where to what, by making the named data the first-class citizen in the network, The basic consensus of ICN is to name the data independent from its container (space dimension) and session (time dimension), which breaks the limitation of point-to-point IP semantic. It scales up data distribution by utilizing available resources, and facilitates communication to fit diverse connectivity and heterogeneous networks. However, there are only a few consensuses on the detailed design of ICN, and quite a few different ICN architectures are proposed. This paper reveals the rationales of ICN from the perspective of the Internet evolution, surveys different design choices, and discusses on two debatable topics in ICN, i.e., self-certifying versus hierarchical names, and edge versus pervasive caching. We hope this survey helps clarify some mis-understandings on ICN and achieve more consensuses.

What benefits does NDN have in supporting mobility

Inspired by forwarding hint and previous IP mobility solutions, we adopt forwarding hint, which intent to solve scalability problem, to support producer mobility. In this paper, we point out how those new elements, such as cache, content-oriented security, content-centric data transmission, benefit mobility. We implement a prototype to analyze the benefits that NDN has in supporting mobility. Our analysis and evaluation conclude that during mapping updating delay following mobility, only popular contents can get benefits from caching while unpopular contents gain little. Whats more, only if the content is able to be accessed by partial consumers, caching would amplify the benefits and extend receivers to the rest of consumers, which has significant contribution during routing convergence or mapping updating delay after mobility happens.

nCDN: CDN Enhanced with NDN

Content Delivery Network (CDN) improves large scale data delivery with widely distributed data replicas; But the fundamental goal of IP is to connect two hosts. As a consequence, request routing, which selects the best server to serve the requested data, is introduced to meet the mismatch between CDN and IP. In contrast to IP, Named Data Networking (NDN) makes content the first-class citizen of the network. Its specialties, such as multicast, content multihoming, cache and content-oriented security, are designed for large scale data delivery. Due to the essential consistency between CDN and NDN, we propose Named Content Delivery Network, or nCDN, which embeds NDN into existing CDN framework to simplify the implementation and improve the efficiency. nCDN supports existing running CDN infrastructure, by setting up NDN over UDP/TCP. NDN takes charge of request routing and content delivery only; While other components of CDN, such as billing, accounting, data analysis, data management etc, remain changeless. The advantages of nCDN include: 1) As NDNs routing plane holds content distribution information, requests are routed to the best data copies straightforward. 2) NDNs stateful forwarding plane detects the network state in real time, and responses to congestion, link or node failure quickly. 3) NDN naturally supports multicast and content multihoming. Multicast eliminates identical requests, while content multihoming fully utilizes redundant resources, such as bandwidth and storage.

Mobility support in the internet using identifiers

To support mobility in the Internet is becoming an urgent need in the near future. So far a large number of solutions are proposed providing various methods, but there still exist many open questions on how to add the new feature of mobility into the Internet architecture. In this paper we pay attention to the approaches with a new identifier namespace introduced. We give an overview to such schemes followed by a qualitative comparison, to find out that they differ in many aspects in achieving various design goals. We then focus on core mobility mechanisms of the proposals and abstract their common elements to form an overlay network called ION. By preliminary analyze on ION, we argue that a particular key point towards better identifier-based mobility support is to balance the tradeoff between mapping dynamics and routing path stretch in the overlay. Though lack of detailed modeling and data support (which is in our future work), we consider the viewpoint in this paper to be useful in designing of new identifier-based mobility methods.

Compression of pending interest table with Bloom filter in content centric network

We propose compressed PIT structure based on Bloom Filter. And we argue that United Bloom Filter is better than Counting Bloom Filter in the PIT compression.

Interest set mechanism to improve the transport of named data networking

In this paper, we proposal an Interest Set mechanism which aggregate similar Interest packets from same flow to one packet to improve the efficient of transport of NDN. The trick here is to reset lifetime of corresponding PIT entry in the immediate routers every time when valid Data packet is passed by. This mechanism covers the time and space uncertainty of data generating, reduce the cost of maintaining the pipeline and improve the transport of NDN.

EasyTrace: An easily-deployable light-weight IP traceback on an AS-level overlay network

IP traceback can be used to find the origins and paths of attacking traffic. However, so far, no Internet-level IP traceback system has ever been deployed because of deployment difficulties. In this paper, we present an easily-deployable light-weight IP traceback based on flow (EasyTrace). In EasyTrace, it is not necessary to deploy any dedicated traceback software and hardware at routers, and an AS-level overlay network is built for incremental deployment. We theoretically analyze the quantitative relation among the probability that a flow is successfully traced back various AS-level hop number, independently sampling probability, and the number of packets that the flow comprises.

An Easy Matrix Computation Based Simulator of NDN

This paper presents an easy matrix computation based simulator of NDN network architecture. This simulator is just like Newtonian mechanics in some way, once given the system initial state, routing table, content distribution, initial data requesting information of NDN network, the simulator can figure out all of the subsequent network state based on matrix operation. This simulator turns packet process event, such as interest generating, interest forwarding, content hitting and transmitting, to matrix computation on the network scale. This simulator is much easier to use than NS3 and CCNx, but it can provide similar simulation result and more details. And the computational complexity depends on number of involved contents and nodes, which makes analysis between small group of nodes and contents very simple and fast.