Rule-Based Forwarding Architecture Used For Resource Addressing And Searching

In view of the case that the network forwarding architecture used for resource addressing and searching in present Internet is too simple,ability-limited and there is an increasing requirement that forwarding architecture be improved to provide greater flexibility, this dissertation introduces present research achievements and presents a network architecture called Rule-based Forwarding Architecture used for Resource Addressing and Searching, RFA called for short. It can provide flexible and policy-compliance forwarding. RFA draws lessons from active network’s foundation:packet carrying codes.It centers around a new architecture concept:rule. The rule is a simple if-then-else construct which describes the manner in which the network should forward packets. The router forward the packet based on its rule. On one hand, rules are flexible, as they can explicitly specify paths and invoke packet processing inside the network. This enables RFA to support many previously proposed Internet extensions, such as explicit middleboxes, multiple paths, source routing and support for host mobility. On the other hand, rules are certified, which guarantees that packets comply with the policies of the parties forwarding them. This property also enables a more secure architecture, since unwanted packets can be dropped in the network, allowing RFA to stop denial of service (DoS) attacks.RFA is divided into data plane and control plane, they are introduced in detail respectively. This dissertation analyses the safety of the dissertation and concludes that the architecture is safe.This dissertation introduces many forwarding situations using RFA and fully proves that RFA improves the network’s flexibility greatly. Using our simulated router implementation we show that the overhead RFA imposes is within the capabilities of modern network equipment.