Handling link failures is the fundamental task of routing schemes. Routing protocols based on link state (e.g., OSPF) require a global state advertisement and re-computation when link failure happens, and will cause inevitable delivery failures. To improve the routing resilience without introducing significant extra overhead, we propose a new routing approach, Keep Forwarding (KF) to achieve k-link failure resilience using inport-aware forwarding. KF is (i) flexible to handle multiple failures (or k-failure) with only small path stretch, (ii) efficient in recovery speed by instant and local lookup, (iii) bounded on memory requirement. Besides, the proposed approach is compatible with existing Internet protocols and routing infrastructures (e.g., requires no packet labeling or state recording), and the pre-computation has a linear temporal complexity. Experimental results on real ISP and datacenter networks reveal that KF guarantees near-optimal resilience (99.9%~100% for single failure and over 99.7% for multiple failures), with the average path stretch increment less than 5%.

Routing on the Internet combines data plane mechanisms for forwarding traffic with control plane protocols for guaranteeing connectivity and optimizing routes (e.g., shortest-paths and load distribution). We propose data-driven connectivity (DDC), a new routing approach that achieves the fundamental connectivity guarantees in the data plane rather than the control plane, while keeping the more complex requirements of route optimization in the control plane. DDC enables faster recovery from failures and easier implementation of control plane optimization.

Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifies its path, this precludes fast local re-routing within the network. We propose SlickPackets, a novel solution that allows packets to slip around failures by specifying alternate paths in their headers, in the form of compactly-encoded directed acyclic graphs. We show that this can be accomplished with reasonably small packet headers for real network topologies, and results in responsiveness to failures that is competitive with past approaches that require much more state within the network. Our approach thus enables fast failure response while preserving the benefits of source-controlled routing.

The distribution of copyright content over peer-to-peer (P2P) networks facilitates misuse of protected digital property and severely violates the rights of creators and owners. Besides, the anonymity and other features of latest P2P applications make law enforcement almost impractical. Unfortunately, current technology efforts attempting to block unauthorized files depend on manually predefined keywords which can be easily modified by the application, and they fail to distinguish between authorized and unauthorized files. In this context, we present PIFF, an intelligent file filtering mechanism for peer-to-peer network, which effectively blocks illegal file distribution based on file signatures automatically generated and deployed by the system. With a hierarchy infrastructure and decision algorithm, our solution discovers and identifies the file signatures much faster than manual analysis, and spreads it among system nodes to perform filtering immediately. Experiment results suggest that compared with unprotected environment, PIFF can reduce over 85% peers for unauthorized files without any affect on the distribution of authorized files