A new approach for routing plane construction in future multi-plane routing based wireless IP access networks

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.

[1]  Daoud Ait-Kadi,et al.  Network Reliability Evaluation and Optimization : Methods , Algorithms and Software Tools , 2013 .

[2]  Ning Wang,et al.  An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.

[3]  H. Raza A brief survey of radio access network backhaul evolution: part II , 2013, IEEE Communications Magazine.

[4]  Fernando A. C. C. Fontes,et al.  Hop-Constrained Tree-Shaped Networks , 2014, Examining Robustness and Vulnerability of Networked Systems.

[5]  Joseph Naor,et al.  Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Hamid Aghvami,et al.  QoS-aware multi-plane routing for future IP-based access networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[7]  Hamid Aghvami,et al.  Introducing Multi-Plane Routing for next-generation all-IP wireless access networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[8]  Ibrahim Akgün,et al.  New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints , 2011, Comput. Oper. Res..

[9]  Abhay Roy,et al.  Multi-Topology (MT) Routing in OSPF , 2007, RFC.

[10]  Luís Gouveia,et al.  A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem , 2001, Eur. J. Oper. Res..

[11]  Klara Nahrstedt,et al.  Edge-based traffic engineering for OSPF networks , 2005, Comput. Networks.

[12]  Ning Wang,et al.  Adaptive Multi-topology IGP Based Traffic Engineering with Near-Optimal Network Performance , 2008, Networking.

[13]  Stefan Voß,et al.  Requirements of 4G-Based Mobile Broadband on Future Transport Networks , 2012 .

[14]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[15]  Susan L. Albin,et al.  The design of centralized networks with reliability and availability constraints , 1988, Comput. Oper. Res..

[16]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Dario Rossi,et al.  Do Next Generation Networks Need Path Diversity? , 2009, 2009 IEEE International Conference on Communications.