This document describes and evaluates strategies to enhance Mobile IPv6 Route Optimization, on the basis of existing proposals, in order to motivate and guide further research in this context. This document is a product of the IP Mobility Optimizations (MobOpts) Research Group. Vogt & Arkko Informational [Page 1] RFC 4651 MIP6 Route Optimization Enhancements February 2007

Mobile IPv6 (MIPv6) allows a Mobile Node to talk directly to its peers while retaining the ability to move around and change the currently used IP address. This mode of operation is called Route Optimization (RO), as it allows the packets to traverse a shorter route than the default one through the Home Agent. In Route Optimization, the peer node learns a binding between the Mobile Node’s perma...

Mobile IPv6 (MIPv6) allows a Mobile Node to talk directly to its peers while retaining the ability to move around and change the currently used IP address. This mode of operation is called Route Optimization (RO), as it allows the packets to traverse a shorter route than the default one through the Home Agent. In Route Optimization, the peer node learns a binding between the Mobile Node’s perma...

In aircraft design, a simultaneous optimization of the airline allocation, mission profile, and the airframe-propulsion design can be advantageous because it can capture how design changes might affect the aircraft utilization at the airline level. As a first step towards this goal, previous research solved the allocation-mission optimization problem by taking a modular adjoint approach, but wi...

Proxy Home Agent (PHA) functionality is proposed for platform nodes in High Altitude Platform (HAP) networks. The solution enables more efficient backhaul link utilization due to path optimization capabilities in an environment with mobile routers. The existing route optimization function of Mobile IP (MIP) cannot solve this problem, while Hierarchical MIP based route optimization does not map ...

This paper is based on an ant colony optimization algorithm (ASDR) for solving FPGA routing for a route based routing constraint model in FPGA design architecture. I n this approach FPGA routing task is transformed into a Boolean Satisfiabilty (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a v alid route. The Satisfiability equation...

This research presents an optimization technique for multiple routes generation using simulated niche based particle swarm optimization for dynamic online route planning, optimization of the routes and proved to be an effective technique. It effectively deals with route planning in dynamic and unknown environments cluttered with obstacles and objects. A simulated niche based particle swarm opti...

This paper introduces the Common Prosody Platform (CPP), a computational platform that implements major theories and models of prosody. CPP aims at a) adapting theory-specific assumptions into computational algorithms that can generate surface prosodic forms, and b) making all the models trainable through global optimization based on automatic analysis-bysynthesis learning. CPP allows examinati...