Can NEMO BSP RO issue be solved using BGP and OSPF? / Ahmed Muflih

Abstract:
A new Ro mechanism is proposed using BGP and OSFP to solve the problems of NEMO BSP which includes nesting. For this end the BGP routing table is upgraded with the NEXT_MR attribute. This attribute is associated with the MNP and is of the type Optional non-transitive because the update message is confined to the area of network mobility. A new location update and registration process together with a communication method id defined for the area of network mobility. For nested mobility the CoA of root MR appears in extended Prefix Information option in (RA) messages. OSFP routing protocol which is used in the nested NEMO has been extended in the RO mechanism and as a result the mechanism is able to route packets in the nested structure. The feasibility study to find out whether BGP can be used to solve the NEMO problem yielded positive results. The maximum area of the star, dumbbell and mesh topologies was found to be a very large number of nodes from simulations, theoretically infinite. The ring and mesh topology has a standard deviation of 0 therefore these topologies can be used where a low standard deviation is required. The mesh topology is the best topology for broadcast storm with respect to convergence time. Unfortunately the mesh topology was also the most overhead intensive. BGP can be used for NEMO RO but this solution has to be deployed in an "area" and the topology and MRAI setting plays an important role in the deployment.
Keywords: NEMO, BGP, OSFP