Design and Experimental Evaluation of a Route Optimisation Solution for NEMO

An important requirement for Internet protocol (IP) networks to achieve the aim of ubiquitous connectivity is network mobility (NEMO). With NEMO support we can provide Internet access from mobile platforms, such as public transportation vehicles, to normal nodes that do not need to implement any special mobility protocol. The NEMO basic support protocol has been proposed in the IETF as a first solution to this problem, but this solution has severe performance limitations. This paper presents MIRON: Mobile IPv6 route optimization for NEMO, an approach to the problem of NEMO support that overcomes the limitations of the basic solution by combining two different modes of operation: a Proxy-MR and an address delegation with built-in routing mechanisms. This paper describes the design and rationale of the solution, with an experimental validation and performance evaluation based on an implementation.Publicad

Securing route optimisation in NEMO

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc,and Wireless Networks. 4-6 April 2005. Riva del Garda, Trentino, ItalyThe network mobility (NEMO) basic support protocol enables mobile networks to change their point of attachment to the Internet, while preserving established sessions of the nodes within the mobile network. When only a nonnested mobile network is considered, the so-called triangle routing is the main problem that should be faced. In mobile IPv6, the route optimisation mechanism solves this problem, and the return routability mechanism aims to limit the security concerns originated because of the route optimisation. Nowadays return routability is considered a weak solution (i.e., based on strong assumptions). In this article we explore different approaches to route optimisation in NEMO and we devise how to adapt some of the terminal mobility solutions to a NEMO environment, where, as we propose, a delegation of signalling rights from the mobile network node to the mobile router is necessary.Publicad

ROUTE OPTIMIZATION IN NESTED MOBILE NETWORKS (NEMO) USING OLSR

International audienceInternet edge mobility has been possible for a number of years: mobile IP[8], allows a host to change its point of at- tachment to the Internet and NEMO [6] allows the same functionality for a group of hosts along with a mobile router. The virtue of NEMO and mobile IP is transparency: a host remains identifiable through the same IP address, and traffic sent to that IP address will be tunneled to arrive at the intended node. NEMO allows "nested networks": a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encap- sulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology). In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network

Performance aAnalysis of HRO-B+ scheme for the nested mobile networks using OPNet

As a demand of accessing Internet is increasing dramatically, host mobility becomes insufficient to fulfill these requirements. However, to overcome this limitation, network mobility has been introduced. One of its implementation is NEMO Basic Support protocol which is proposed by Internet Engineering Task Force (IETF). In NEMO, one or more Mobile Router(s) manages the mobility of the network in a way that its nodes would be unaware of their movement. Although, it provides several advantages, it lacks many drawbacks in term of route optimization especially when multiple nested mobile networks are formed. This paper presents a new hierarchical route optimization scheme for nested mobile networks using Advanced Binding Update List (BUL+), which is called HRO-B+. From performance evaluation, it shows that this scheme performs better in terms of throughput, delay, response time, and traffic, and achieves optimal routing. Keywords: Mobile IPv6, Network Mobility (NEMO), Route Optimization, OPNe

IPv6 Network Mobility

Network Authentication, Authorization, and Accounting has been used since before the days of the Internet as we know it today. Authentication asks the question, “Who or what are you?” Authorization asks, “What are you allowed to do?” And fi nally, accounting wants to know, “What did you do?” These fundamental security building blocks are being used in expanded ways today. The fi rst part of this two-part series focused on the overall concepts of AAA, the elements involved in AAA communications, and highlevel approaches to achieving specifi c AAA goals. It was published in IPJ Volume 10, No. 1[0]. This second part of the series discusses the protocols involved, specifi c applications of AAA, and considerations for the future of AAA

Performance analysis of HRO-B+ scheme for the nested mobile networks using OPNet

As a demand of accessing Internet is increasing dramatically, host mobility becomes insufficient to fulfill these requirements. However, to overcome this limitation, network mobility has been introduced. One of its implementation is NEMO Basic Support protocol which is proposed by Internet Engineering Task Force (IETF). In NEMO, one or more Mobile Router(s) manages the mobility of the network in a way that its nodes would be unaware of their movement. Although, it provides several advantages, it lacks many drawbacks in term of route optimization especially when multiple nested mobile networks are formed. This paper presents a new hierarchical route optimization scheme for nested mobile networks using Advanced Binding Update List (BUL+), which is called HRO-B+. From performance evaluation, it shows that this scheme performs better in terms of throughput, delay, response time, and traffic, and achieves optimal routing

Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle