This paper presents a study of a method termed, Multi-Plane routing, that maximizes path diversity in IP routing and is targeted for IP access networks (AN). The motivation for the work is in the specific shortcomings of the conventional intra-domain IP routing principles such as "shortest-path" and "best-effort" when applied in IP ANs.We generalize these networks as the transit between the access routers and gateway and they range from a simple tree to meshed tree topologies. The method uses MultiTopology OSPF standardized by the IETF and instantiates multiple OSPF installations in networks, each installation utilizing a portion of the topology in the conventional manner, i.e. routing plane (RP). Hence, all links are utilized by having at least one standard OSPF routing installation including them in the paths between access router and gateway. The method functions on extensions in routers and simple packet tagging allowing the routers to install and separate between paths of each RP. Routing is facilitated by the proposed method's algorithms for network planning and traffic engineering. The former is called the offline algorithm rendering the optimum number of RPs in an arbitrary topology by independently setting link weights for each plane. The latter is called the online algorithm that applies a policy-based routing scheme for dynamically selecting the best RP based on the introduced QoS-aware cost function. The paper concludes by significant improvements in throughput, packet loss rate, session
There has been a rapid rise in the IP traffic throughout the Internet which takes advantage of the already established widespread IP infrastructure. Different suggestions are being explored to facilitate the next-generation access networks via IP mechanisms, with a growing trend towards a flat-IP structure and novel topological set-ups in the backhaul. Aligned with this evolution, there are increasingly more user applications flooding the Internet that calls for a consistent routing strategy to minimize loss in data transmission. In this paper, Multi-Plane Routing (MPR), which incorporates various aspects in all-IP infrastructure will be studied under the new access network structure. MPR is based on Multi-Topology Open Shortest Path First (MT-OSPF) principle and divides the physical network topology into several logical Routing Planes (RPs). The offline Traffic Engineering (TE) strategy for MPR has been optimized using a heuristic hop-constraint solution that suits the "flattened" network realized through the incorporation of direct communication between Aggregation Routers. With our approach, despite of a higher number of Ingress −Egress pairs for traffic in the access network, the number of RPs has been kept to the desirable level whilst the reliability indicator and the path diversity index ratio have increased up to 47% and 33% respectively. Our proposed MPR-based offline approach has also shown improvement compared with the Multi-Protocol Label Switching (MPLS) offline approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.