Enhanced Mobility Solution In Mobile Ipv6 Network

The performance of Network Mobility (NEMO) used to manage network mobility does not provide satisfactory result in terms of delay, throughput and session continuity when dealing with multihomed mobile network. Enhanced Mobility Solution in Mobile IPv6 Network is extremely complex; the study addressed the multihoming issues of MIPV6 Networks on the basis of NEMO Basic Support, analyzes the benefits of multihoming and discusses implementation issues of all classes of multihoming possibilities. Additionally, Policy-based routing, as one of the multihoming benefits, is studied in particular. A framework based on policy based routing protocol was proposed for handling both the inbound and the outbound traffic on a mobile network, under specified policies which consider packet characteristics, current network situation and user preferences. The interface selection algorithm was based on NEMO implementation structure using a technique of mutihoming which was extended to MIPv6 concepts The outcome of this research work are: a designed policy protocol for policy messages communication between the Mobile Router and the Home Agent, the framework is simulated using Network Simulator (NS2) with an extension of mobiwan, the result shows the end to end delay, average end to end delay, overhead, optimal routing path, average inter-packet latency and throughput of the developed system. The information from the analysis of the result shows that the enhanced solution has drastically reduced average packet delay to minimum with 72.5 %( 0.040s to 0.011s), and end-end delay with 75 %( 0.020s to 0.005s) compared with NEMO solution. Overhead in the mobile network was maintained by 10bytes per nested level by keeping the session. The solution is important by enterprises in making decision to acquire internet connectivity for the purpose of connectivity redundancy and traffic load distribution optimization. This result is very important for time sensitive application that requires stable network condition

Multihomed mobile network architecture

IP mobility ensures network reachability and session continuity while IPv6 networks are on the move. In the Network Mobility (NEMO) model, the potential for NEMO Mobile Routers (MRs) to interconnect and extend Internet connectivity allows the formation Nested NEMO networks. With MANEMO, nested MRs can be efficiently interconnected in a tree-based structure with Internet access being maintained via a designated Gateway. However, this only supports single-homed Internet connectivity. With the span of wireless access technologies and the popularity of multi-interfaced devices, multihoming support in this scenario becomes critical. A Nested Mobile Network with heterogeneous available Internet access options would allow better overall network performance and optimal utilisation of available resources. In this paper, we present the Multihomed Mobile Network Architecture (MMNA), a comprehensive multihomed mobility solution. It provides a multihoming management mechanism for Gateway Discovery and Selection on top of a multihomed mobility model integrating different mobility and multihoming protocols. It enables a complex nested multihomed topology to be established with multiple gateways supporting heterogeneous Internet access. The results demonstrate that the proposed solution achieves better overall throughput, load sharing, and link failure recovery

Towards an architecture to support complex multihomed mobility scenarios

In this paper, we present the Multihomed Mobile Network Architecture (MMNA), a comprehensive multihomed mobility solution for complex nested mobility scenarios. It provides a multihoming management mechanism for gateway discovery and selection, on top of an efficient multihomed mobility model integrating different mobility and multihoming protocols. We describe how the MMNA was experimentally implemented and evaluated in a testbed setup. We first validated the capabilities of the solution in terms of different multihoming features, namely load sharing, link failure recovery, and preference setting. We then examined the effectiveness and feasibility of the MMNA solution considering a use case example of a search and rescue scenario. The results highlight the practicality and advantages of deploying the MMNA solution into realistic scenarios

Efficient mobility and multihoming support for mountain rescue

Introducing an IP-based communication system into the mountain rescue domain would enable carrying out search and rescue missions in an effective way. With efficient mobility and multihoming support, a Mountain Rescue Team would be able to establish more effective and reliable Internet communication. In this paper, we present the Multihomed Mobile Network Architecture (MMNA), a comprehensive multihomed mobility solution for complex nested mobility scenarios. It provides a multihoming management mechanism for gateway discovery and selection, on top of an efficient multihomed mobility model integrating different mobility and multihoming protocols. The design of the MMNA solution is first presented. We then describe how the MMNA was experimentally implemented and evaluated in a testbed setup to examine its effectiveness and feasibility considering a use case example of a mountain rescue scenario. The results highlight the practicality and advantages of deploying the MMNA into such a critical real-world scenario

Heterogeneous Access: Survey and Design Considerations

As voice, multimedia, and data services are converging to IP, there is a need for a new networking architecture to support future innovations and applications. Users are consuming Internet services from multiple devices that have multiple network interfaces such as Wi-Fi, LTE, Bluetooth, and possibly wired LAN. Such diverse network connectivity can be used to increase both reliability and performance by running applications over multiple links, sequentially for seamless user experience, or in parallel for bandwidth and performance enhancements. The existing networking stack, however, offers almost no support for intelligently exploiting such network, device, and location diversity. In this work, we survey recently proposed protocols and architectures that enable heterogeneous networking support. Upon evaluation, we abstract common design patterns and propose a unified networking architecture that makes better use of a heterogeneous dynamic environment, both in terms of networks and devices. The architecture enables mobile nodes to make intelligent decisions about how and when to use each or a combination of networks, based on access policies. With this new architecture, we envision a shift from current applications, which support a single network, location, and device at a time to applications that can support multiple networks, multiple locations, and multiple devices

Host Identity Protocol-based Network Address Translator traversal in peer-to-peer environments

Osoitteenmuuntajat aiheuttavat ongelmia vertaisverkkojen yhteyksien luomiselle. Myös koneen identiteetti protokolla (HIP) kärsii osoitteenmuuntajien aiheuttamista ongelmista, mutta sopivilla laajennuksilla sitä voidaan käyttää yleisenä osoitteenmuuntajien läpäisymenetelmänä. Interaktiivinen yhteyden luominen (ICE) on tehokas osoitteenmuuntajien läpäisymenetelmä, joka toimii monissa erilaisissa tilanteissa. Tämän diplomityön tavoitteena on mahdollistaa HIP-pohjainen osoitteenmuuntajien läpäisy käyttämällä ICE-menetelmää, ja arvioida menetelmän toimivuutta implementoinnin ja mittausten avulla. Implementoimme ICE-prototyypin ja testasimme sitä eri tyyppisten osoitteenmuuntajien kanssa. Käytimme mittauksissa verkkoa, jossa kaksi isäntäkonetta olivat eri aliverkoissa, ja suoritimme ICE-yhteystestejä näiden koneiden välillä. Mittasimme testeissä lähetettyjen viestien ja tavujen määrän sekä käytetyn ajan. Mittaustulosten perusteella laskimme myös arvion ICE:n ja HIP:in aiheuttamalle ylimääräisten viestien ja ajankäytön määrälle. ICE onnistui luomaan yhteyden kaikissa testaamissamme tilanteissa, mutta käytti välillä enemmän viestejä ja aikaa kuin olisi tarpeen. Selvitimme työssä syyt ylimääräisille viesteille ja esitimme keinoja viestien määrän vähentämiselle. Saimme myös selville, että suuressa osassa tilanteista 4-5 yhteystestiviestiä riittää yhteyden luomiseksi, mutta tietynlaista osoitteenmuunnosta käyttävät osoitteenmuuntajat voivat helposti tuplata viestien määrän. Joka tapauksessa, yhteystestien luomat liikennemäärät ovat vähäisiä, ja käyttämällä lyhyempiä ajastinaikoja kuin mitä ICE spesifikaatio ehdottaa, voidaan ICE:n tehokkuutta kasvattaa merkittävästi. Käyttämällä HIP:iä ICE:n kanssa vertaisverkko-ohjelmat voivat saada käyttöönsä tehokkaan osoitteenmuuntajien läpäisymenetelmän, joka tukee myös yhteyden turvaominaisuuksia, mobiliteettia, sekä useita yhtäaikaisia verkkoliitäntöjä.Network Address Translators (NATs) cause problems when peer-to-peer (P2P) connections are created between hosts. Also the Host Identity Protocol (HIP) has problems traversing NATs but, with suitable extensions, it can be used as a generic NAT traversal solution. The Interactive Connectivity Establishment (ICE) is a robust NAT traversal mechanism that can enable connectivity in various NAT scenarios. The goal of this thesis is to enable HIP-based NAT traversal using ICE and to evaluate the applicability of the approach by implementation and measurements. We implemented an ICE prototype and tested it with different types of NATs. We used a network where two hosts were in different subnets and run ICE connectivity checks between them. The amount of messages and bytes sent during the process, and also how long the process took, was measured and analyzed. Based on the measurements, we calculated the overhead of using HIP with ICE for NAT traversal. ICE was able to create a connection in all the scenarios, but sometimes using more messages and longer time than expected or necessary. We found reasons why too many messages are exchanged and presented solutions on how some of these redundant messages could be avoided. We also found out that while 4-5 connectivity check messages are enough in many scenarios, NATs with specific address mapping behavior can easily double the amount of needed checks. Still, the generated traffic bitrate is modest, and using shorter timeout values than what the ICE specification suggests can have a significant positive impact on performance. By using HIP with ICE, P2P programs can get an efficient NAT traversal solution that additionally supports security, mobility and multihoming

IP Flow Mobility support for Proxy Mobile IPv6 based networks

The ability of offloading selected IP data traffic from 3G to WLAN access networks is considered a key feature in the upcoming 3GPP specifications, being the main goal to alleviate data congestion in celular networks while delivering a positive user experience. Lately, the 3GPP has adopted solutions that enable mobility of IP-based wireless devices relocating mobility functions from the terminal to the network. To this end, the IETF has standardized Proxy Mobile IPv6 (PMIPv6), a protocol capable to hide often complex mobility procedures from the mobile devices. This thesis, in line with the mentioned offload requirement, further extends Proxy Mobile IPv6 to support dynamic IP flow mobility management across access wireless networks according to operator policies. In this work, we assess the feasibility of the proposed solution and provide an experimental analysis based on a prototype network setup, implementing the PMIPv6 protocol and the related enhancements for flow mobility support. *** La capacità di spostare flussi IP da una rete di accesso 3G ad una di tipo WLAN è considerata una caratteristica chiave nelle specifiche future di 3GPP, essendo il principale metodo per alleviare la congestione nelle reti cellulari mantenendo al contempo una ragionevole qualità percepita dall'utente. Recentemente, 3GPP ha adottato soluzioni di mobilità per dispositivi con accesso radio basato su IP, traslando le funzioni di supporto dal terminale alla rete, e, a questo scopo, IETF ha standardizzato Proxy Mobile IPv6 (PMIPv6), un protocollo studiato per nascondere le procedure di mobilità ai sistemi mobili. Questa tesi, in linea con la citata esigenza di spostare flussi IP, estende ulteriormente PMIPv6 per consentire il supporto alla mobilità di flussi tra diverse reti di accesso wireless, assecondando le regole e/o politiche definite da un operatore. In questo lavoro, ci proponiamo di asserire la fattibilità della soluzione proposta, fornendo un'analisi sperimentale di essa sulla base di un prototipo di rete che implementa il protocollo PMIPv6 e le relative migliorie per il supporto alla mobilità di flussiope

Multipath inter-domain policy routing

Dissertação submetida para a obtenção do grau de Doutor em Engenharia Electrotécnica e de ComputadoresRouting can be abstracted to be a path nding problem in a graph that models the network. The problem can be modelled using an algebraic approach that describes the way routes are calculated and ranked. The shortest path problem is the most common form and consists in nding the path with the smallest cost. The inter-domain scenario introduces some new challenges to the routing problem: the routing is performed between independently con gured and managed networks; the ranking of the paths is not based on measurable metrics but on policies; and the forwarding is destination based hop-by-hop. In this thesis we departed from the Border gateway Protocol (BGP) identifying its main problems and elaborating on some ideal characteristics for a routing protocol suited for the inter-domain reality. The main areas and contributions of this work are the following: The current state of the art in algebraic modeling of routing problems is used to provide a list of possible alternative conditions for the correct operation of such protocols. For each condition the consequences in terms of optimality and network restrictions are presented. A routing architecture for the inter-domain scenario is presented. It is proven that it achieves a multipath routing solution in nite time without causing forwarding loops. We discuss its advantages and weaknesses. A tra c-engineering scheme is designed to take advantage of the proposed architecture. It works using only local information and cooperation of remote ASes to minimize congestion in the network with minimal signalling. Finally a general model of a routing protocol based on hierarchical policies is used to study how e cient is the protocol operation when the correctness conditions are met. This results in some conclusions on how the policies should be chosen and applied in order to achieve speci c goals.Portuguese Science and Technology Foundation -(FCT/MCTES)grant SFRH/BD/44476/2008; CTS multi-annual funding project PEst OE/EEI/UI0066/2011; MPSat project PTDC/EEA TEL/099074/2008; OPPORTUNISTICCR project PTDC/EEA-TEL/115981/2009; Fentocells project PTDC/EEA TEL/120666/201

Proceedings of Seminar on Network Protocols in Operating Systems

The Linux networking stack tends to evolve rapidly, and while there are some excellent documentation written in the past, most of the past documentation gotten (at least partially) outdated over time. The seminar on Network Protocols in Operating Systems was arranged in Aalto University, fall 2012, Department of Communications and Networking to gain a better understanding of the current status of the networking implementation in the Linux kernel. The seminar had 10 participants and each participant was assigned a module from the Linux networking implementation, on which a short paper was to be written. This publications contain the final output of this work. The papers included in the publication are: Kurnikov, Arseny: Linux kernel application interface. Jaakkola, Antti: Implementation of transmission control protocol in Linux. Arianfar, Somaya: TCP’s congestion control implementation in Linux kernel. Budigere, Karthik: Linux implementation study of stream control transmission protocol. Khattak, Fida Ullah: The IPv4 implementation of Linux kernel stack. Boye, Magnus: Netfilter connection tracking and NAT implementation. Korhonen, Jouni: Mobile IPv6 Linux kernel and user space. Soininen, Jonne: Device agnostic network interface. Kalliola, Aapo: Network device drivers in Linux. Varis, Nuutti: Anatomy of a Linux bridge

Improving internet inter-domain routing scalability

Internetin alueiden välisen reitityksen skaalautuminen on nähty ongelmallisena jo vuosia. Sen välittömiä seurauksia ovat operaattoreille aiheutuvat suuret kustannukset ja tilanteen pahentuessa myös Internetin kasvamisen vaarantuminen. Tähän mennessä toteutetut parannukset ovat vain lieventäneet ongelmia tai viivästyttäneet niiden ilmenemistä. Reitittimien muistia pidetään suurimpana lähitulevaisuuden haasteena, koska reitittimien täytyy pystyä ohjaamaan sisääntulevat paketit nopeasti kohti jotakin jopa useista sadoista tuhansista verkoista. Tämä opinnäytetyö esittelee ongelma-alueen tunnistamalla suurimmat ongelmat sekä niiden perimmäiset syyt, ja kartoittaa näiden ongelmien tärkeyttä. Parannusmenetelmistä muutama oleellisin on esitelty ja analysoitu. Syvempi analyysi kohdistuu työssä ennen kaikkea reititinten muistintarvetta pienentävään Virtual Aggregation -menetelmään, jonka kantavana ideana on sallia virtuaalisten IP-osoiteprefixien käyttö yksittäisten verkkojen sisällä. Työ esittelee myös uuden tavan muodostaa ja käyttää näitä virtuaalisia IP-osoiteprefixejä ja vertailee sitä muihin nopean muistin tarvetta vähentäviin menetelmiin simuloimalla näitä Sprint operaattorin verkkotopologiassa. Simulointitulosten perusteella esittämämme menetelmä kykenee huomattaviin muistisäästöihin välttäen samalla joitain Virtual Aggregation -menetelmästä löydetyistä ongelmista. Menetelmän jatkokehitystä on myös mietitty simulointien pohjalta.For years inter-domain routing scalability has been seen as a problem which increases ISPs costs and may even decelerate the growth of the Internet. Few improvements have been made over the years, but they have only delayed the issue. Router memories (i.e. FIBs) are the most critical concern as they have to be fast and ever larger to handle great amounts of packets to possibly hundreds of thousands of networks. This thesis introduces the problem set by identifying the main issues and their root causes, as well as present analysis on their criticality. The improvement mechanisms are also considered by introducing and comparing few most relevant proposals. Deeper study and analysis in this thesis focuses on Virtual Aggregation which allows networks to individually lower their routers' memory load via the use of virtual IP address pre-fixes. Also, a new solution for allocating Virtual Prefixes and aggregation points for them is introduced and compared against other FIB shrinking mechanisms using extensive simulations on Sprint topology. As a result, the new solution is identified to save FIBs considerably while avoiding some drawbacks found in Virtual Aggregation. Further improvements to the mechanism are also considered although not tested