Dissertations / Theses on the topic 'IP Networks'
To see the other types of publications on this topic, follow the link: IP Networks.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'IP Networks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Pérez, Costa Xavier. "Toward All-IP networks : IP and wireless networks convergence." Doctoral thesis, Universitat Politècnica de Catalunya, 2005. http://hdl.handle.net/10803/7051.
Full textAbstract:
In this thesis the state of the art for IP networks and the two most predominant wireless access networks, UMTS and Wireless LANs, has been reviewed with respect to the enhancements required toward the objective of supporting services across different network technologies in a seamless manner. Three main areas of research were identified as key in the path toward All-IP networks: i) IP-based mobility management, ii) IP-based UMTS Radio Access Networks and iii) QoS for Wireless LANs.Future All-IP networks require of an IP-based mobility management protocol to support mobility across heterogeneous networks. Several protocols are being proposed in the IETF for this purpose with Mobile IPv6, Hierarchical Mobile IPv6 and Fast Handovers for Mobile IPv6 being the ones with a higher acceptance. Our contribution in this area has been the thorough study of the performance enhancements provided by each protocol and their associated costs in realistic scenarios to support the design process of Mobile IPv6-based networks where the suitability of the different options has to be evaluated. In addition, we proposed a combination of Hierarchical Mobile IPv6 and Fast Handovers for Mobile IPv6, based on the description provided in the Hierarchical Mobile IPv6 draft, that aims to outperform both proposals by adding the advantages of each of them.
During the evaluation of the IP-based mobility management protocols, the mobility model influence over the performance results led to an additional line of study where the main characteristics of the Random Waypoint mobility model were analyzed. The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. We gave a formal description of this model in terms of a discrete- time stochastic process which provides a deep understanding on the characteristics of the mobility created by its usage. The results of our work are of practical value for performance analysis of communication networks to avoid misinterpretation of simulation results.
UMTS networks being deployed today based on the Release'99 specifications use ATM transport in the Radio Access Network (RAN). The specifications for future releases include options to support IP transport in the RAN, however, several challenges are introduced with regard to a significant increase in the transport protocol overhead and the provision of QoS guarantees. These challenges have to be addressed to ensure an efficient usage of the scarce RAN resources. Our work focused first in reducing the resources needed in the air interface for the expected most relevant application in future 3G networks, Voice over IP (VoIP). We designed a radio access bearer for VoIP when Robust Header Compression (RoHC) is used that reduces in about 50% the resources required in the air interface. Then, a multiplexing scheme for the reduction of the overhead in the wired part of the RAN that allows QoS differentiated scheduling was described and evaluated. The results showed an increase in the efficiency of the RAN resources usage between 100% and 260%, in our scenarios, when combined with RoHC. Finally, we proposed and evaluated a QoS differentiated scheduling mechanism based on Earliest-Deadline-First that fulfills the RAN specific synchronization requirements while providing the QoS differentiation required by the applications.
The IEEE 802.11 standard presents relevant defficiencies in order to support applications with QoS requirements. The integration of the Wireless LAN technology in future All-IP networks heavily depends on the success of the upcoming 802.11e standard which extends the 802.11MAC layer to provide QoS guarantees. With our work in this area we contributed to the 802.11e research standardization effort and designed three extensions of the 802.11 MAC layer to provide delay guarantees (DIME-EF) and bandwidth guarantees, absolute (ARME) or relative (DWFQ).
Moreover, we analyzed the implications of introducing Wireless LAN capabilities in battery limited mobile devices as for example cellular phones. Based on the significant impact observed of the 802.11 power save mode over the 802.11e QoS mechanisms we designed and evaluated a solution that provides a soft upper bound of the data frames downlink delay according to the downlink frame interarrival time while minimizing the battery consumption. Part of this work has been used for the design and configuration of the NEC 3G/WLAN mobile terminal N900iL.
2
Ekici, Eylem. "Routing and multicasting in satellite IP networks." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/15605.
Full text
3
Zhao, Ting. "Fast IP lookup engine /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202004%20ZHAOT.
Full text
4
Arpaci, Mutlu. "Congestion avoidance in TCP/IP networks." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/15356.
Full text
5
Musa, Mohamed Osman Ibrahim. "Energy efficient IP over WDM networks using network coding." Thesis, University of Leeds, 2016. http://etheses.whiterose.ac.uk/16644/.
Full textAbstract:
In this thesis we propose the use of network coding to improve the energy efficiency in core networks, by reducing the resources required to process traffic flows at intermediate nodes. We study the energy efficiency of the proposed scheme through three approaches: (i) developing a mixed integer linear programme (MILP) to optimise the use of network resources. (ii) developing a heuristic based on minimum hop routing. (iii) deriving an analytical bounds and closed form expressions. The results of the MILP model show that implementing network coding over typical networks can introduce savings up to 33% compared to the conventional architectures. The results of the heuristic show that the energy efficient minimum hop routing in network coding enabled networks achieves power savings approaching those of the MILP model. The analytically calculated power savings also confirm the savings achieved by the model. Furthermore, we study the impact of network topology on the savings obtained by implementing network coding. The results show that the savings increase as the hop count of the network topology increases. Using the derived expressions, we calculated the maximum power savings for regular topologies as the number of nodes grows. The power savings asymptotically approach 45% and 23% for the ring (and line) and star topology, respectively. We also investigate the use of network coding in 1+1 survivable IP over WDM networks. We study the energy efficiency of this scheme through MILP, a heuristic with five operating options, and analytical bounds. We evaluate the MILP and the heuristics on typical and regular network topologies. Implementing network coding can produce savings up to 37% on the ring topology and 23% considering typical topologies. We also study the impact of varying the demand volumes on the network coding performance. We also develop analytical bounds for the conventional 1+1 protection and the 1+1 with network coding to verify the results of the MILP and the heuristics and study the impact of topology, focusing on the full mesh and ring topologies, providing a detailed analysis considering the impact of the network size.
6
Ozdem, Mehmet. "Video Distribution Over Ip Networks." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608187/index.pdf.
Full textAbstract:
As applications like IPTV and VoD (Video on demand) are gaining popularity, it is becoming
more important to study the behavior of video signals in the Internet access infrastructures
such as ADSL and cable networks. Average delay, average jitter and packet loss in these
networks affect the quality of service, hence transmission and access speeds need to be
determined such that these parameters are minimized.
In this study the behavior of the above mentioned IP networks under variable bit rate (VBR)
video traffic is investigated. ns-2 simulator is used for this purpose and actual as well as
artificially generated signals are applied to the networks under test. Variable bit rate (VBR)
traffic is generated synthetically using ON/OFF sources with ON/OFF times taken from
exponential or Pareto distributions. As VBR video shows long range dependence with a Hurst
parameter between 0.5 and 1, this parameter was used as a metric to measure the accuracy of
the synthetic sources. Two different topologies were simulated in this study: one similar to
ADSL access networks and the other behaving like cable distribution network. The
performance of the networks (delay, jitter and packet loss) under VBR video traffic and
different access speeds were measured. According to the obtained results, minimum access
speeds in order achieve acceptable quality video delivery to the customers were suggested.
7
Smith, Paxton J. "Voice conferencing over IP networks." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29574.
Full textAbstract:
Traditional telephone conferencing has been accomplished by way of a centralized conference bridge. An Internet Protocol (IP)-based conference bridge is subject to speech distortions and substantial computational demands due to the tandem arrangement of high compression speech codecs. Decentralized architectures avoid the speech distortions and delay, but lack strong control and have a key dependence on silence suppression for endpoint scalability. One solution is to use centralized speaker selection and forwarding, and decentralized decoding and mixing. This approach eliminates the problem of tandem encodings and maintains tight control, thereby improving the speech quality and scalability of the conference. This thesis considers design options and solutions for this model, and evaluates performance through live conferences with real conferees. Conferees found the speaker selection of the new conference model to be transparent, and strongly preferred the resulting speech quality to that of a centralized IP-based conference bridge.
8
Ghita, Bogdan Vladimir. "Performance characterisation of IP networks." Thesis, University of Plymouth, 2004. http://hdl.handle.net/10026.1/1700.
Full textAbstract:
The initial rapid expansion of the Internet, in terms of complexity and number of hosts, was followed by an increased interest in its overall parameters and the quality the network offers. This growth has led, in the first instance, to extensive research in the area of network monitoring, in order to better understand the characteristics of the current Internet. In parallel, studies were made in the area of protocol performance modelling, aiming to estimate the performance of various Internet applications. A key goal of this research project was the analysis of current Internet traffic performance from a dual perspective: monitoring and prediction. In order to achieve this, the study has three main phases. It starts by describing the relationship between data transfer performance and network conditions, a relationship that proves to be critical when studying application performance. The next phase proposes a novel architecture of inferring network conditions and transfer parameters using captured traffic analysis. The final phase describes a novel alternative to current TCP (Transmission Control Protocol) models, which provides the relationship between network, data transfer, and client characteristics on one side, and the resulting TCP performance on the other, while accounting for the features of current Internet transfers. The proposed inference analysis method for network and transfer parameters uses online nonintrusive monitoring of captured traffic from a single point. This technique overcomes limitations of prior approaches that are typically geared towards intrusive and/or dual-point offline analysis. The method includes several novel aspects, such as TCP timestamp analysis, which allows bottleneck bandwidth inference and more accurate receiver-based parameter measurement, which are not possible using traditional acknowledgment-based inference. The the results of the traffic analysis determine the location of the eventual degradations in network conditions relative to the position of the monitoring point. The proposed monitoring framework infers the performance parameters of network paths conditions transited by the analysed traffic, subject to the position of the monitoring point, and it can be used as a starting point in pro-active network management. The TCP performance prediction model is based on the observation that current, potentially unknown, TCP implementations, as well as connection characteristics, are too complex for a mathematical model. The model proposed in this thesis uses an artificial intelligence-based analysis method to establish the relationship between the parameters that influence the evolution of the TCP transfers and the resulting performance of those transfers. Based on preliminary tests of classification and function approximation algorithms, a neural network analysis approach was preferred due to its prediction accuracy. Both the monitoring method and the prediction model are validated using a combination of traffic traces, ranging from synthetic transfers/environments, produced using a network simulator/emulator, to traces produced using a script-based, controlled client and uncontrolled traces, both using real Internet traffic. The validation tests indicate that the proposed approaches provide better accuracy in terms of inferring network conditions and predicting transfer performance in comparison with previous methods. The non-intrusive analysis of the real network traces provides comprehensive information on the current Internet characteristics, indicating low-loss, low-delay, and high-bottleneck bandwidth conditions for the majority of the studied paths. Overall, this study provides a method for inferring the characteristics of Internet paths based on traffic analysis, an efficient methodology for predicting TCP transfer performance, and a firm basis for future research in the areas of traffic analysis and performance modelling.
9
Narváez, Guarnieri Paolo L. (Paolo Lucas). "Routing reconfiguration in IP networks." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86482.
Full text
10
Wahabi, Abdoul Rassaki. "Resource management in IP networks." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52436.
Full textAbstract:
Thesis (MSc)--University of Stellenbosch, 2001.ENGLISH ABSTRACT: lP networks offer scalability and flexibility for rapid deployment of value added lP services. However, with the increased demand and explosive growth of the Internet, carriers require a network infrastructure that is dependable, predictable, and offers consistent network performance. This thesis examines the functionality, performance and implementation aspects of the MPLS mechanisms to minimize the expected packet delay in MPLS networks. Optimal path selection and the assignment of bandwidth to those paths for minimizing the average packet delay are investigated. We present an efficient flow deviation algorithm (EFDA) which assigns a small amount of flow from a set of routes connecting each OD pair to the shortest path connecting the OD pair in the network. The flow is assigned in such a way that the network average packet delay is minimized. Bellman's algorithm is used to find the shortest routes between all OD pairs. The thesis studies the problem of determining the routes between an OD pair and assigning capacities to those routes. The EFDA algorithm iteratively determines the global minimum of the objective function. We also use the optimal flows to compute the optimal link capacities in both single and multirate networks. The algorithm has been applied to several examples and to different models of networks. The results are used to evaluate the performance of the EFDA algorithm and compare the optimal solutions obtained with different starting topologies and different techniques. They all fall within a close cost-performance range. They are all within the same range from the optimal solution as well.
AFRIKAANSE OPSOMMING: lP-netwerke voorsien die skaleerbaarheid en buigsaamheid vir die vinnige ontplooing van toegevoegde-waarde lP-dienste. Die vergrote aanvraag en eksplosiewe uitbreiding van die Internet benodig betroubare, voorspelbare en bestendige netwerkprestasie. Hierdie tesis ondersoek die funksionaliteit, prestasie en implementering van die MPLS(multiprotokoletiketskakel)- meganismes om die verwagte pakketvertraging te minimeer. Ons bespreek 'n doeltreffende algoritme vir vloei-afwyking (EFDA) wat 'n klein hoeveelheid vloei toewys uit die versameling van roetes wat elke OT(oorsprong-teiken)- paar verbind aan die kortste pad wat die OT-paar koppel. Die vloei word toegewys sodanig dat die netwerk se gemiddelde pakketvertraging geminimeer word. Bellman se algoritme word gebruik om die kortste roetes tussen alle OT-pare te bepaal. Die tesis bespreek die probleem van die bepaling van roetes tussen 'n OT-paar en die toewysing van kapasiteite aan sulke roetes. Die EFDA-algoritme bepaal die globale minimum iteratief. Ons gebruik ook optimale vloeie vir die berekening van die optimale skakelkapasiteite in beide enkel- en multikoers netwerke. Die algoritme is toegepas op verskeie voorbeelde en op verskillende netwerkmodelle. Die skakelkapasiteite word aangewend om die prestasie van die EFDAalgoritme te evalueer en dit te vergelyk met die optimale oplossings verkry met verskillende aanvangstopologieë en tegnieke. Die resultate val binne klein koste-prestasie perke wat ook na aan die optimale oplossing lê.
11
Haddadi, H. "Topological characteristics of IP networks." Thesis, University College London (University of London), 2008. http://discovery.ucl.ac.uk/1443962/.
Full textAbstract:
Topological analysis of the Internet is needed for developments on network planning, optimal routing algorithms, failure detection measures, and understanding business models. Accurate measurement, inference and modelling techniques are fundamental to Internet topology research. A requirement towards achieving such goals is the measurements of network topologies at different levels of granularity. In this work, I start by studying techniques for inferring, modelling, and generating Internet topologies at both the router and administrative levels. I also compare the mathematical models that are used to characterise various topologies and the generation tools based on them. Many topological models have been proposed to generate Internet Autonomous System (AS) topologies. I use an extensive set of measures and innovative methodologies to compare AS topology generation models with several observed AS topologies. This analysis shows that the existing AS topology generation models fail to capture important characteristics, such as the complexity of the local interconnection structure between ASes. Furthermore, I use routing data from multiple vantage points to show that using additional measurement points significantly affect our observations about local structural properties, such as clustering and node centrality. Degree-based properties, however, are not notably affected by additional measurements locations. The shortcomings of AS topology generation models stems from an underestimation of the complexity of the connectivity in the Internet and biases of measurement techniques. An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with specific characteristics. I propose a method which allows optimal parameters of a model to be estimated for a given target topology. The optimisation is performed using the weighted spectral distribution metric, which simultaneously takes into account many the properties of a graph. In order to understand the dynamics of the Internet, I study the evolution of the AS topology over a period of seven years. To understand the structural changes in the topology, I use the weighted spectral distribution as this metric reveals differences in the hierarchical structure of two graphs. The results indicate that the Internet is changing from a strongly customer-provider oriented, disassortative network, to a soft-hierarchical, peering-oriented, assortative network. This change is indicative of evolving business relationships amongst organisations.
12
de, Castro Callado Arthur. "Traffic identification in IP networks." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1351.
Full textAbstract:
Made available in DSpace on 2014-06-12T15:49:18Z (GMT). No. of bitstreams: 1
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2009Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
A análise e identificação de tráfego em redes IP ainda é algo muito dependente da interação e expertise humana. A compreensão da composição e dinâmica do tráfego Internet são essenciais para o gerenciamento de redes IP, especialmente para planejamento de capacidade, engenharia de tráfego, diagnóstico de falhas, detecção de anomalias e caracterização do desempenho de serviços. A grande mudança nas aplicações predominantes nos últimos anos, de Web para compartilhamento de arquivos Peer-to-Peer e atualmente de Peer-to-Peer para streaming de vídeo requer uma atenção especial dos administradores de redes, mas não foi completamente prevista por ferramentas de gerência. Ainda hoje, na prática, operadores de rede somente detectam streaming de vídeo baseado no endereço IP de servidores de streaming de vídeo conhecidos. Mas novas aplicações, como Joost, Babelgum and TVU, estão oferecendo um tipo de serviço de streaming de vídeo peer-to-peer em que não é factível fazer a identificação por endereço IP. Algumas redes bloqueiam o acesso a aplicações baseado no endereço IP ou no número de portas bem conhecidas, dois métodos já considerados inviáveis para a identificação de aplicação. Isto é um incentivo a uma briga de gato e rato entre os desenvolvedores de tais aplicações tentando criar aplicações que trocam tráfego mesmo em redes hostis utilizando-se de técnicas de evasão e redes que consideram as algumas aplicações prejudiciais ao negócio ou objetivos e tentam bloqueá-las. Dessa forma, a identificação das aplicações que compõem o tráfego independentemente de configuração de rede é valiosa para operadores de rede. Ela permite uma predição mais efetiva das demandas de tráfego de usuário; a oferta de serviços de valor agregado baseada na demanda dos clientes por outros serviços; a cobrança baseada em aplicação; e no caso de identificação online, também permite Qualidade de Serviço (QoS) baseada na aplicação, formatação de tráfego (shaping) e filtragem de tráfego (firewall). Nos últimos anos, algumas técnicas baseadas em inferência foram propostas como alternativas de identificação de tráfego não-baseadas em portas conhecidas. Entretanto, nenhuma se mostrou adequada a alcançar alta eficiência na identificação de vários tipos de aplicação ao mesmo tempo, usando tráfego real. Portanto, a combinação de técnicas parece ser uma abordagem razoável para lidar com as deficiências de cada técnica e a periódica reconfiguração dos parâmetros de combinação pode mostrar-se uma idéia interessante paralidar com a evolução natural das aplicações e as técnicas de evasão usadas pelas aplicações que geram grande volume de tráfego indesejado. Este trabalho provê um entendimento profundo das deficiências comuns em identificação de tráfego e traz algumas contribuições práticas à área. Após um cuidadoso estudo de desempenho dos principais algoritmos de identificação de tráfego em quatro redes diferentes, esta tese lista várias recomendações para a utilização de algoritmos de identificação de tráfego. Para atingir este objetivo, alguns pré-requisitos para a criação de um ambiente adequado de identificação de tráfego são detalhados. Além disso, são propostos métodos originais para melhorar o desempenho dos algoritmos de identificação de tráfego através da combinação de resultados, sem restrições sobre o tipo de algoritmos de identificação que podem ser usados. Tais métodos são avaliados em um estudo de caso realizado com a utilização dos mesmos cenários de rede
13
PATRIARCA, FABIO. "Mobility management in IP networks." Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2015. http://hdl.handle.net/2108/214297.
Full text
14
Li, Shuo. "Massively Scalable Deterministic IP Networks." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG102.
Full textAbstract:
L'Edge serverless computing est un concept prometteur dans le domaine de l'informatique en nuage qui fusionne les avantages de l'informatique sans serveur avec l'edge computing. Cette approche innovante vise à rapprocher les capacités de calcul de la source des données ou de la périphérie du réseau. Ce faisant, elle permet un traitement rapide en temps réel avec un délai minimal, tout en conservant la convivialité et l'évolutivité qu'offre l'informatique sans serveur. Toutefois, la recherche et la pratique de l'informatique sans serveur en périphérie en sont encore à un stade relativement précoce, et les performances des plateformes actuelles d'informatique sans serveur en périphérie sont encore un peu loin de l'objectif. Parallèlement, l'application à grande échelle de l'intelligence artificielle, de l'internet des objets (IoT) et des technologies de communication de nouvelle génération a considérablement amélioré le trafic réseau, mais a également mis en avant des exigences plus élevées pour le temps de réponse des demandes et le taux de perte de paquets, ainsi que d'autres indicateurs. Ainsi, l'analyse et l'optimisation des réseaux sans serveur à la périphérie deviennent une préoccupation.Dans cet article, notre travail principal consiste à modéliser et à analyser le réseau informatique sans serveur à la périphérie et à utiliser des algorithmes d'apprentissage par renforcement pour optimiser dynamiquement la distribution des fonctions dans le réseau afin que le réseau puisse améliorer le temps de réponse autant que possible et réduire le taux de perte de paquets sous les ressources informatiques limitées.Tout d'abord, nous présentons en détail le contexte et les technologies connexes de l'informatique sans serveur en périphérie et expliquons le caractère inévitable de l'évolution de l'informatique sans serveur traditionnelle vers l'informatique sans serveur en périphérie.Ensuite, nous proposons une structure hiérarchique pour les réseaux d'informatique sans serveur en périphérie basée sur des travaux connexes et nous discutons des tendances actuelles de l'informatique sans serveur en périphérie et des défis auxquels elle est confrontée.Ensuite, nous modélisons la communication et le calcul dans les réseaux informatiques sans serveur à l'aide d'un processus ponctuel de Poisson homogène et de la théorie des files d'attente, respectivement, et nous analysons l'impact des différents environnements de réseau sur les événements demande-réponse.Enfin, nous proposons un algorithme d'allocation dynamique de fonctions sans serveur utilisant des gradients de politique déterministes profonds et nous le comparons aux algorithmes traditionnelsEdge serverless computing is a promising concept in the field of cloud computing that merges the advantages of serverless computing with edge computing. This innovative approach aims to bring computational capabilities closer to the source of data or the network's edge. By doing so, it enables rapid processing in real-time with minimal delay, all while retaining the user-friendly nature and scalability that serverless computing offers. However, the research and practice of edge serverless computing is still in a relatively early stage, and the performance of current edge serverless computing platforms is still a bit far from the target. At the same time, the large-scale application of artificial intelligence, Internet of Things (IoT), and new-generation communication technologies has greatly improved network traffic but also put forward higher requirements for the response time of requests and packet loss rate and other indicators. Thus, analyzing and optimizing serverless networks at the edge becomes a concern.In this article, our main work consists of modeling and analyzing edge serverless computing networks and optimizing edge serverless computing networks using machine learning algorithms.First, we introduce the background and related technologies of edge serverless computing in detail and explain the inevitability of evolving from traditional serverless computing to edge serverless computing. After that, we propose a hierarchical structure for edge serverless computing networks based on related work and discuss the current trends in edge serverless computing and the challenges it faces.Second, we model communication and computation in edge serverless computing networks using homogeneous Poisson point process and queuing theory, respectively, and analyze the impact of different network environments on request-response events.Finally, we propose a dynamic serverless function allocation algorithm utilizing deep deterministic policy gradients and compare it with traditional algorithms
15
Nematbakhsh, Mohammadali. "TCP/IP PROTOCOL BOARD USING SINGLE CHIP PROCESSOR." Thesis, The University of Arizona, 1985. http://hdl.handle.net/10150/275389.
Full text
16
Fan, Dian. "Scalable Video Transport over IP Networks." Scholarly Repository, 2010. http://scholarlyrepository.miami.edu/oa_dissertations/460.
Full textAbstract:
With the advances in video compression and networking techniques, the last ten years have witnessed an explosive growth of video applications over the Internet. However, the service model of the current best-effort network was never engineered to handle video traffic and, as a result, video applications still suffer from varying and unpredictable network conditions, in terms of bandwidth, packet loss and delay. To address these problems, a lot of innovative techniques have been proposed and researched. Among them, scalable video coding is a promising one to cope with the dynamics of the available bandwidth and heterogeneous terminals. This work aims at improving the efficacy of scalable video transport over IP networks. In this work, we first propose an optimal interleaving scheme combined with motion-compensated fine granularity scalability video source coding and unequal loss protection schemes, under an imposed delay constraint. The network is modeled as a packet-loss channel with random delays. The motion compensation prediction, ULP allocation and the depth of the interleaver are jointly optimized based on the network status and the delay constraint. We then proceed to investigate the multiple path transport technique. A unified approach which incorporates adaptive motion compensation prediction, multiple description coding and unequal multiple path allocation, is proposed to improve both the robustness and error resilience property of the video coding and transmission system, while the delivered video quality is improved simultaneously. To analytically investigate the efficacy of error resilient transport schemes for progressively encoded sources, including unequal loss protection, best-effort and FEC transport schemes, we develop evaluation and optimization approaches for these transport schemes. In this part of the work, the network is modeled as an M/D/1/K queue, and then a comprehensive queueing analysis is provided. Armed with these results, the efficacy of these transport schemes for progressively encoded sources are investigated and compared.
17
Maamoun, Khaled. "Survivable IP over optical transport networks." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27475.
Full textAbstract:
Survivability strategies for a single network layer have been investigated for many years in the research and development of communication networks. Some of these networks already have available standards for protection methods and techniques (e.g. SONET). However, using only one survivability technique running in a single-layer is not always the optimal solution if we want to achieve a certain level of QoS for all services without increasing the cost of their use. One of the most promising solutions for overcoming this problem is to use multi-layer survivability techniques running in different network layers. The use of multi-layer survivability strategies requires precise definitions of the survivability functionalities that need to be allocated at each layer and the coordination between the network layers.
This thesis investigates survivability schemes for optical networks that rely only on a single layer, as well as for those that have more than one layer survivability functions and uses different approaches to solve QoS survivability related problems. We have simulated the restoration process of single transport layer: IP; ATM; SONET and OTN, which have been analyzed by similar studies. Also, we have simulated the process of the multi-layer restoration schemes for previously analyzed IP/SONET, IP/OTN and IP-MPLS/OTN by using the hold-off timer concept. We have extended their restoration concept and applied it for IP/OTN and ATM/SONET restoration schemes. Further more, we have introduced IP Restoration/OTN Protection combined multi-layer survivability, IP Restoration/SONET Protection combined multi-layer survivability and IP-MPLS Protection and Restoration/OTN Protection combined multi-layer survivability. In this thesis, we have combined the analyses with simulations to form a comprehensive study for the IP over OTN survivability across different architectures. The study focuses on four of the most commonly used network architectures of the IP over OTN architecture possibilities: IP/POS/OTN; IP/GbE/OTN; IP-MPLS/OTN, and the traditional, still commonly used IP/ATM/SONET/OTN.
18
Eum, Suyong, and suyong@ist osaka-u. ac jp. "Traffic Matrix Estimation in IP Networks." RMIT University. Electrical and Computer Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080215.155526.
Full textAbstract:
An Origin-Destination (OD) traffic matrix provides a major input to the design, planning and management of a telecommunications network. Since the Internet is being proposed as the principal delivery mechanism for telecommunications traffic at the present time, and this network is not owned or managed by a single entity, there are significant challenges for network planners and managers needing to determine equipment and topology configurations for the various sections of the Internet that are currently the responsibility of ISPs and traditional telcos. Planning of these sub-networks typically requires a traffic matrix of demands that is then used to infer the flows on the administrator's network. Unfortunately, computation of the traffic matrix from measurements of individual flows is extremely difficult due to the fact that the problem formulation generally leads to the need to solve an under-determined system of equations. Thus, there has been a major effort f rom among researchers to obtain the traffic matrix using various inference techniques. The major contribution of this thesis is the development of inference techniques for traffic matrix estimation problem according to three different approaches, viz: (1) deterministic, (2) statistical, and (3) dynamic approaches. Firstly, for the deterministic approach, the traffic matrix estimation problem is formulated as a nonlinear optimization problem based on the generalized Kruithof approach which uses the Kullback distance to measure the probabilistic distance between two traffic matrices. In addition, an algorithm using the Affine scaling method is developed to solve the constrained optimization problem. Secondly, for the statistical approach, a series of traffic matrices are obtained by applying a standard deterministic approach. The components of these matrices represent estimates of the volumes of flows being exchanged between all pairs of nodes at the respective measurement points and they form a stochastic counting process. Then, a Markovian Arrival Process of order two (MAP-2) is applied to model the counting processes formed from this series of estimated traffic matrices. Thirdly, for the dynamic approach, the dual problem of the multi-commodity flow problem is formulated to obtain a set of link weights. The new weight set enables flows to be rerouted along new paths, which create new constraints to overcome the under-determined nature of traffic matrix estimation. Since a weight change disturbs a network, the impact of weight changes on the network is investigated by using simulation based on the well-known ns2 simulator package. Finally, we introduce two network applications that make use of the deterministic and the statistical approaches to obtain a traffic matrix respectively and also describe a scenario for the use of the dynamic approach.
19
Neophytou, Constantinos. "Dynamic Tree Switching for IP Networks." Thesis, Queen Mary, University of London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.498910.
Full text
20
Sabri, Gull Hussain. "QoS in MPLS and IP Networks." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1191.
Full textAbstract:
The thesis report provides broader information about IP and MPLS technologies and routing protocols. Internet architecture and problems in an IP networks are illustrated when different internet protocols are used. Small focus is provides on the demand oriented real time applications and data traffic for QoS parameters in IP and MPLS networks. Evaluation of QoS guarantee parameters such as delay, jitter and throughput are described with state of art study results mainly for real time applications in IP and MPLS networks. Finally MPLS TE implementation and working is described and proposed to achieve better network performance.
21
Jammeh, Emmanuel Apapa. "Rate adaptive video over IP networks." Thesis, University of Essex, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.415939.
Full text
22
Mohd, Warip Mohd Nazri Bin. "Energy efficient core optical IP networks." Thesis, University of Strathclyde, 2012. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=18958.
Full textAbstract:
The Internet has become an integral part of modern societies fuelling ever growing opportunities for the provision of new advanced services which better respond to quickly changing societal needs. Previously the deployment of such services have led to significant increases in energy consumption which is in strong contrast with the global drive for a greener and more energy efficient environments. Network infrastructures are required which support these growing needs but at the same time remain zero-carbon emission complaint. Green photonic network designs centre on techniques to reduce and conserve energy within multilayer network scenarios. In this Thesis, hibernation strategies are proposed where network configurations form selective group of nodes, segmentation of links and partitioning of the light paths within connections to enable "sleep" modes. The strategy is founded on the optimisation and improved power management through a control algorithm implemented as a modification of the Generalized Multi-Protocol Label Switching (GMPLS) signalling and routing protocol. The impact of the strategy on network utilization, number of wavelengths, number of connection requests, number of nodes, network connectivity degree, and power ratio in IP routers has been evaluated on representative optical networks using a simulation framework established using OMNeT++. A trade-off is observed between energy consumption and network performance as a result of hibernation; evaluation of this methodology indicates potential reduction in energy power consumption from 30% up to 75% at the expense of reduced network performance.
23
Soma, Reddy Joseph F. "Issues in IP based cellular networks /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3061622.
Full text
24
Griem, J. "Traffic engineering for multiservice IP networks." Thesis, University College London (University of London), 2007. http://discovery.ucl.ac.uk/1446248/.
Full textAbstract:
The central cause of strain on today's IP network infrastructure steins from the industries striving to extend the network to carry voice and other advanced services that it was not designed for. This thesis develops the reasons why more sophisticated mechanisms are required for ensuring that the best-effort infrastructure becomes both predictable and controllable, if the current IP infrastructure is to replace circuit switched networks. The main theme of the thesis are the IP traffic engineering (IPTE) traffic engineering algorithms that were developed by the author. The goal of the proposed approach is to compute a set of Open Shortest Path First (OSPF) link weights to balance network load, while honouring bandwidth, hop count and propagation delay constraints of the traffic. The proposed solution is built on classical OSPF routing and additionally uses the multi topology concepts that were recently proposed as an extension to OSPF. Using Multi Topology OSPF (mt-OSPF), multiple routing planes can be implemented. Each Multi Topology (MT) routing plane is assigned its own link metrics and thus traffic can be routed independently. Given a traffic demand matrix and the network topology, the algorithm computes a set of link weights using a search heuristic. The optimisation is cost function based, so that individual constraints can be taken into account per routing plane. Using this approach, constraint information remains in the "offline" IPTE algorithms and thus no extra constraint awareness is required at layer 3. Since recent Cisco implementations of mt-OSPF and Multi Topology IS-IS (M-ISIS) provide the required multi topology routing support, no major changes at the router level are required for the approach to be realised. Extensive simulations presented in this thesis show that IPTE has the potential to provide the differentiated routing and load balancing that it was designed for. In addition the simulations show that load is balanced more evenly across the network than with standard shortest path routing on inverse capacity link weights. A network management system is discussed that acts as the binding element for all enabling components. A simplified architecture for such a management system is presented and it is discussed how several traffic engineering mechanisms could coexist with IPTE on one network infrastructure. The use of the authors IPTE approach in the context of this management system is discussed in depth: Dangers associated with potential network disruption caused by frequent link weight modifications are analysed from both intra- and inter-domain point of view. A strategy for solving the problem of disruptions caused by link weight changes is presented by using several network planes to migrate traffic, rather than causing disruptions to a "live" plane through link weight modification and resulting OSPF routing table updates. The strategy is simulated, showing that any detrimental effects of the transition are avoidable. However, the work is ongoing and the results presented are indicative. Overall the thesis presents an approach for traffic engineering using traditional routing techniques, to (1) preserve the original intrinsic advantages of the IP design and (2) help ready IP networking for the much more restricting requirements of the future mutiservice network. It presents algorithms, simulations and frameworks showing how the work fits into the current IP networking world.
25
Carter, Steven Michael. "Implementation and analysis of the IP measurement protocol (IPMP)." Master's thesis, Mississippi State : Mississippi State University, 2001. http://library.msstate.edu/etd/show.asp?etd=etd-11152001-090121.
Full text
26
Baccelli, Emmanuel. "IP-Disruptive Wireless Networking: Integration in the Internet." Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2012. http://tel.archives-ouvertes.fr/tel-00770791.
Full textAbstract:
The super collision between the Internet phenomenon and the wireless communication revolution gives birth to a wealth of novel research problems, design challenges and standardization activities. Within this domain, spontaneous wireless IP networking are probably the most extreme example of new ''particles'' born from the collision. Indeed, these particles defy the laws of the Internet in many ways. The absorption of such peculiar particles in the global IP network has already started thanks to pioneering algorithmic and protocol work -- for instance OLSR -- and through the deployment of wireless mesh networks around the world, such as urban community wireless networks. With the recent revolutions in North Africa, and movements such as Occupy Wall Street, the prospect of spontaneous wireless IP networking has become even more attractive on social and political grounds. Dedicated conferences have recently been organized, and as a result, ambitious, multi-million dollar initiatives have been launched (e.g. the US Government-funded project Commotion Wireless, or the EU-funded initiative CONFINE). However, spontaneous IP wireless networks are not yet widely deployed because pioneer work such as OLSR is vastly insufficient to fully bridge the gap between the Internet and these new networks. This thesis presents work that analyzes this gap and proposes some solutions as to how to bridge it. The focus is put on three domains: a first part presents work in the domain of wireless mesh and ad hoc networks. A second part presents work on sensor networks and in the Internet of Things. And the last part presents work in the domain of delay tolerant networking and vehicular networks.
27
Bley, Andreas. "Routing and capacity optimization for IP networks." [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1553.
Full text
28
Sambanis, Konstantinos. "Quality of service for IP-based networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2001. http://handle.dtic.mil/100.2/ADA390400.
Full textAbstract:
Thesis (M.S. in Computer Science and M.S. in Information Technology Management) Naval Postgraduate School, March 2001.Thesis advisor, Carlyle H. Wash. Includes bibliographical references (p. 73-74). Also available online.
29
Más, Ivars Ignacio. "Probe-based admission control in IP networks." Licentiate thesis, KTH, Microelectronics and Information Technology, IMIT, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1571.
Full textAbstract:
The current Internet design is based on a besteffortservice, which combines high utilization of network resourceswith simplicity. As a consequence of this design, the Internetis unable to provide guaranteed or predictable quality ofservice (QoS), required to offer realtime services thathave constraints on endtoend delay, delay jitterand packet loss.
To add QoS capabilities to the present Internet, newfunctions need to be simple to implement, while allowing highnetwork utilization. In recent years, different methods havebeen investigated to provide the required QoS. Most of thesemethods include some form of admission control so that newflows are only admitted to the network if the admission doesnot decrease the quality of connections that are already inprogress below some defined level. To achieve the requiredsimplicity a new family of admission control methods, calledendtoend measurementbased admission control(EMBAC) moves the admission decision to the edges of thenetwork.
This thesis presents the probebased admission control(PBAC), which belongs to the family of EMBAC schemes. PBACprovides a reliable upper bound to the packet loss probabilitya flow will suffer in the network. The delay in the network isbounded by using small, packetscale buffering in therouters. The admission control is done by measuring the lossratio of a stream of probe packets. Probe packets and datapackets of accepted flows are transmitted with low and highpriority respectively, to protect accepted flows from the loadof the probe streams. The probing is done at the peak rate ofthe connection and the flow is accepted if the probe packetloss rate is below a predefined threshold. This procedureensures that the packet loss of accepted flows is always belowthe threshold value.
The thesis offers a description of the probing procedure,with an extensive performance analysis by simulation, as wellas a mathematical model for the admission decision. The authoralso addresses the application of the admission control formulticast communications, and gives a general method to providesecurity features to measurementbased admission controlschemes.
30
Gustafsson, Andreas, and Danijel Hir. "High precision frequency synchronization via IP networks." Thesis, Linköping University, Electronics System, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-54427.
Full textAbstract:
This report is a part of a master thesis project done at Ericsson Linköping incooperation with Linköpings Tekniska Högskola (LiTH). This project is divided intwo different parts. The first part is to create a measurement node that collectsand processes data from network time protocol servers. It is used to determinethe quality of the IP network at the node and detect potential defects on usedtimeservers or nodes on the networks.The second assignment is to analyze the collected data and further improve theexisting synchronization algorithm. Ip communication is not designed to be timecritical and therefore the NTP protocol needs to be complemented with additionalsignal processing to achieve required accuracy. Real time requirements limit thecomputational complexity of the signal processing algorithm.
31
Magnano, Alexander. "Predictive Mobile IP Handover for Vehicular Networks." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34350.
Full textAbstract:
Vehicular networks are an emerging technology that offer potential for providing a variety of new services. However, extending vehicular networks to include IP connections is still problematic, due in part to the incompatibility of mobile IP handovers with the increased mobility of vehicles. The handover process, consisting of discovery, registration, and packet forwarding, has a large overhead and disrupts connectivity. With increased handover frequency and smaller access point dwell times in vehicular networks, the handover causes a large degradation in performance. This thesis proposes a predictive handover solution, using a combination of a Kalman filter and an online hidden Markov model, to minimize the effects of prediction errors and to capitalize on advanced handover registration. Extensive simulated experiments were carried out in NS-2 to study the performance of the proposed solution within a variety of traffic and network topology scenarios. Results show a significant improvement to both prediction accuracy and network performance when compared to recent proposed approaches.
32
Gunnar, Anders. "Towards Robust Traffic Engineering in IP Networks." Licentiate thesis, Stockholm : Elektriska energisystem, Kungliga Tekniska högskolan, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4557.
Full text
33
Ribera, Carlos. "Energy Efficiency in IP over WDM Networks." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-129393.
Full textAbstract:
In the last decade, energy efficiency in backbone networks has become an important problem due to the significant growth in the Internet traffic. A very promising solution to solve this problem in Internet Protocol (IP) over Wavelength Division Multiplexing (WDM) networks is the Virtual Topology Adaptation approach, which permits adapting network resources by following a dynamic daily traffic profile. In this approach, virtual topology in the WDM layer adapts to the changes in the IP traffic, however, IP layer routing is following the conventional shortest path routing strategy being unaware of the lower layer adaptation. This thesis study aims to analyze the possibilities of power savings in WDM and IP layers in coordination and proposes multi-layer approaches for energy-efficient IP over WDM networks. Energy-efficient algorithms on a realistic scenario are considered where commercially available routers and their power consumption parameters are taken into account. Among these IP router systems, power consumption of single and multi-shelf systems are analyzed. Multi shelf system can accommodate multiple chassis in a rack while in the single shelf system only one chassis is employed. For networks with single-shelf routers, we propose an energy-aware IP traffic routing strategy in coordination with a virtual topology adaptation approach to save energy by following a dynamic daily traffic profile. Energy-efficient IP routing strategy offloads the traffic from the network resources running in extreme load levels resulting in stabilization in the virtual topology and improvement in energy-efficiency. It is shown that using this approach a considerable amount of energy is saved compared to the case of virtual topology adaptation without the IP layer involvement. Power consumption in networks composed of multi-shelf routers is studied and three different strategies for energy efficiency are proposed: one in the WDM layer, an Energy and Chassis-Aware Virtual Topology Adaptation (ECA-VTA), another in the IP layer, the Energy and Chassis-Aware IP Routing (ECA-IP), and a multi-layer strategy that combines ECA-VTA and ECA-IP (ECA-IP-VTA). Joint optimization of IP&WDM layers significantly reduces power consumption and number of changes in the virtual-topology compared with single-layer approach.
34
Shoop, Karen Victoria. "Agent-based resource management for IP networks." Thesis, Queen Mary, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423268.
Full text
35
Hurley, J. "Traffic Classification for Next Generation IP Networks." Thesis, Queen's University Belfast, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.527817.
Full text
36
Chiu, Hon-sun, and 邵漢新. "Receiver-driven layered multicast over IP networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29735853.
Full text
37
Mihailovic, Andrej. "Mobility support for IP-based wireless networks." Thesis, King's College London (University of London), 2004. https://kclpure.kcl.ac.uk/portal/en/theses/mobility-support-for-ip--based-wireless-networks(b643754c-5730-4c62-a323-f5bf17768e89).html.
Full text
38
Papagiannaki, Konstantina. "Provisioning IP backbone networks based on measurements." Thesis, University College London (University of London), 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401633.
Full text
39
Awotula, Titus. "Quality of service management in IP networks." Thesis, Loughborough University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.442708.
Full text
40
Huck, Paul E. (Paul Eriksen) 1978. "Zero configuration name services for IP networks." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86716.
Full textAbstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.Includes bibliographical references (leaves 75-78).
by Paul E. Huck, Jr.
M.Eng.
41
Nazir, Sajid. "Multimedia communication over mobile IP wireless networks." Thesis, University of Strathclyde, 2012. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=17816.
Full textAbstract:
The use of Internet Protocol (IP) based mobile wireless transmission is increasing as novel multimedia applications are being deployed. Mobile wireless channels and IP based communications are inherently prone to errors and packet losses. Error resilience features and Forward Error Correction (FEC) at the application layer (AL) are often used to protect the video data against losses. The amount of redundancy added by the FEC attempts to counter the worst channel Signal-to-noise-ratio (SNR) but the protection generally comes at a high complexity and overhead. It is thus imperative to design FEC solutions which are adaptive to the varying wireless channel conditions, i.e., bandwidth and packet loss rate. This adaptive behaviour becomes even more important for transmission to heterogeneous receivers. Fountain codes are rateless codes which can be used to potentially generate an unlimited number of encoded packets from a limited number of source packets. The decoding is possi ble if the number of received encoded packets at the receiver is just a little more than the source packets. As each portion of encoded video data does not have equal importance for the video re-construction, this characteristic can also be advantageously exploited while designing FEC solutions by providing more protection to important portions. Random linear codes (RLC) based schemes have been compared with Raptor codes, and RLC solution is proposed for the mobile television broadcasting standards like Digital Video Broadcasting-Handheld (DVB-H) and DVB-T2 (Second Generation Terrestrial). A reliable unicast video communication solution based on Luby Transform (LT) codes is proposed by exploiting unequal error protection (UEP) for encoded video data partitioned with the Data partitioning (DP) and slicing feature of H264/AVC. A comparison of layered video data transmission with Amplify-and-Forward (AF) and Decode-and-Forward (DF) relay collaboration strategies is provided. A novel scheme for multiple description coding (MDC) has been proposed and its advantages highlighted through simulations over relay based multi hop channels, like Long Term Evolution- Advanced (LTE-A). An algorithm has been proposed which takes into account the PSNR contribution and temporal significance of each slice to prioritize H.264/AVC sliced video data. The simulation results with systematic RLC show the usefulness of the proposed scheme for applications such as video-on-demand (VoD).
42
Thompson, Richard. "Evaluating TCP/IP performance over satellite networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/49954.
Full textAbstract:
Thesis (MScEng) -- Stellenbosch University, 2004.ENGLISH ABSTRACT: Interest in TCP/IP as a communication protocol for use in space communication has increased substantially with the growth of the world wide web (WWW). TCP/IP is a relevant communication protocol for space based communication systems that need to access the broader terrestrial communication network. Low Earth Orbit(LEO) satellites have very short delay times between themselves and the ground, and correspondingly very short connection times. Staying in contact with a LEO satellite continuously through a space-based network requires large constellations of satellites and complex routing strategies. Connectivity with the world wide web using a widely accepted protocol such as TCP/IP is desirable because it would make communication with the satellite over a terrestrial station possible, were it to route communication onto the WWW. This thesis looks at the expected TCP/IP performance over satellite network links, identifies problem areas for current TCP/IP technologies, and makes suggestions for optimizing TCP/IP over such links. The thesis also introduces a new performance benchmark, the equivalence level, allowing for the simplified description of TCP throughput behaviour over a broad range of network parameters. The performance of the Linux kernel release 2.4.18 TCP/IP stack is also evaluated.
AFRIKAANSE OPSOMMING: Die belangstelling in TCP/IP as ’n kommunikasie protokol vir gebruik in die ruimte het kenmerklik toegeneem met die groei van die wereld wye web (WWW). TCP/IP is ’n relevante protokol vir kommunikasie stelsels in die ruimte, veral met die doel om toegang tot land gebaseerde kommunikasie netwerke te kry. Lae wentelbaan sateliete het baie kort vertragingstye tussen die aarde en die sateliet, en gevolglik baie kort verbindingstye. Groot sateliet konstelasies en komplekse verbintenis strategie word benodig om ’n lae wentelbaan sateliet deurentyd in kontak te hou met ’n ruimtegebaseerde netwerk. Verbinding met die wereld wye web deur die gebruik van ’n wyd aanvaarde protokol, soos TCP/IP, is wenslik, want dit sal kommunikasie met die sateliet oor ’n aardgebaseerde stasie moontlik maak, sou dit kommunikasie oor die wereld wye web stuur. Hierdie tesis kyk na die verwagte werking van TCP/IP oor sateliet netwerk konneksies, identifiseer probleme met huidiglike TCP/IP tegnologie, en maak voorstellings vir die optimale funtionering van TCP/IP oor sulke konneksies. Hierdie tesis stel ook ’n nuwe werkverrigtings maatstaf, die gelykheidsvlak, wat die vereenvoudige beskrywing van TCP/IP data tempo gedrag oor ’n groot variasie van netwerk parameters toelaat. Die werking van die Linux Kernel 2.4.18 TCP/IP stapel word ook geevalueer.
43
Kenney, Joshua D., Myron L. Moodie, Gary L. Ragsdale, and Thomas B. Grace. "Technology Trades in IP-Based Telemetry Networks." International Foundation for Telemetering, 2008. http://hdl.handle.net/10150/606196.
Full textAbstract:
ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, CaliforniaThe integrated Network Enhanced Telemetry (iNET) project established a test article standards working group to define open standards for network components and interfaces for test articles in the aeronautical test environment. Its aim is to utilize the growth of Internet technologies for telemetry networks and ensure interoperability among network devices. This paper describes the technology background and the current technology trades of an IP-based network paradigm used in producing standards for test article networks. Specifically, the paper will include descriptions of selected network technologies as applied to test data and time distribution within test articles.
44
Dunkels, Adam. "Towards TCP/IP for Wireless Sensor Networks." Licentiate thesis, SICS, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-20989.
Full textAbstract:
Wireless sensor networks are composed of large numbers-up to thousands-of tiny radio-equipped sensors. Every sensor has a small microprocessor with enough power to allow the sensors to autonomously form networks through which sensor information is gathered. Wireless sensor networks makes it possible to monitor places like nuclear disaster areas or volcano craters without requiring humans to be immediately present. Many wireless sensor network applications cannot be performed in isolation; the sensor network must somehow be connected to monitoring and controlling entities. This thesis investigates a novel approach for connecting sensor networks to existing networks: by using the TCP/IP protocol suite in the sensor network, the sensors can be directly connected to an outside network without the need for special proxy servers or protocol converters. Bringing TCP/IP to wireless sensor networks is a challenging task, however. First, because of their limited physical size and low cost, sensors are severely constrained in terms of memory and processing power. Traditionally, these constraints have been considered too limiting for a sensor to be able to use the TCP/IP protocols. In this thesis, I show that even tiny sensors can communicate using TCP/IP. Second, the harsh communication conditions make TCP/IP perform poorly in terms of both throughput and energy efficiency. With this thesis, I suggest a number of optimizations that are intended to increase the performance of TCP/IP for sensor networks. The results of the work presented in this thesis has had a significant impact on the embedded TCP/IP networking community. The software developed as part of the thesis has become widely known in the community. The software is mentioned in books on embedded systems and networking, is used in academic courses on embedded systems, is the focus of articles in professional magazines, is incorporated in embedded operating systems, and is used in a large number of embedded devices.Contiki
uIP
45
Condeixa, Tiago Silvestre. "Decentralizing IP mobility management in future networks." Doctoral thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/14853.
Full textAbstract:
Doutoramento em Engenharia ElectrotécnicaThe massive adoption of sophisticated mobile devices and applications led to the increase of mobile data in the last decade, which it is expected to continue. This increase of mobile data negatively impacts the network planning and dimension, since core networks are heavy centralized. Mobile operators are investigating atten network architectures that distribute the responsibility of providing connectivity and mobility, in order to improve the network scalability and performance. Moreover, service providers are moving the content servers closer to the user, in order to ensure high availability and performance of content delivery. Besides the e orts to overcome the explosion of mobile data, current mobility management models are heavy centralized to ensure reachability and session continuity to the users connected to the network. Nowadays, deployed architectures have a small number of centralized mobility anchors managing the mobile data and the mobility context of millions of users, which introduces issues related to performance and scalability that require costly network mechanisms. The mobility management needs to be rethought out-of-the box to cope with atten network architectures and distributed content servers closer to the user, which is the purpose of the work developed in this Thesis. The Thesis starts with a characterization of mobility management into well-de ned functional blocks, their interaction and potential grouping. The decentralized mobility management is studied through analytical models and simulations, in which di erent mobility approaches distinctly distribute the mobility management functionalities through the network. The outcome of this study showed that decentralized mobility management brings advantages. Hence, it was proposed a novel distributed and dynamic mobility management approach, which is exhaustively evaluated through analytical models, simulations and testbed experiments. The proposed approach is also integrated with seamless horizontal handover mechanisms, as well as evaluated in vehicular environments. The mobility mechanisms are also speci ed for multihomed scenarios, in order to provide data o oading with IP mobility from cellular to other access networks. In the pursuing of the optimized mobile routing path, a novel network-based strategy for localized mobility is addressed, in which a replication binding system is deployed in the mobility anchors distributed through the access routers and gateways. Finally, we go further in the mobility anchoring subject, presenting a context-aware adaptive IP mobility anchoring model that dynamically assigns the mobility anchors that provide the optimized routing path to a session, based on the user and network context. The integration of dynamic and distributed concepts in the mobility management, such as context-aware adaptive mobility anchoring and dynamic mobility support, allow the optimization of network resources and the improvement of user experience. The overall outcome demonstrates that decentralized mobility management is a promising direction, hence, its ideas should be taken into account by mobile operators in the deployment of future networks.
Na última década verificou-se uma massificação dos dispositivos móveis e das suas aplicações, o que tem vindo a aumentar o consumo de dados móveis. Este aumento dificulta o planeamento e dimensionamento das redes devido principalmente aos modelos extremamente centralizados adoptados por estas. Os operadores móveis têm vindo a estudar modelos mais até para as redes, os quais distribuem a responsabilidade de fornecer conectividade e mobilidade, no sentido de melhorar a escalabilidade e desempenho da rede. Além disso, de forma a garantir um desempenho elevado na entrega dos conteúdos, os fornecedores de serviço têm vindo a mover os servidores de conteúdos para locais mais próximos do utilizador. Apesar do esforço na procura de soluções para o crescente consumo de dados móveis, os modelos atuais de gestão de mobilidade são demasiado centralizados para conseguir assegurar a continuidade de sessão aos utilizadores conectados à rede. As arquiteturas implementadas têm um número muito reduzido de âncoras móveis centralizadas que gerem todos os dados móveis e a informação de contexto da mobilidade, o que leva a uma diminuição de desempenho e escalabilidade, solucionadas através de mecanismos de rede dispendiosos. A gestão da mobilidade precisa de ser repensada de forma a poder lidar com arquiteturas de rede até com a distribuição dos servidores de conteúdos para nós mais próximos dos utilizadores, que é o objectivo principal da Tese apresentada. Primeiro, é apresentada a caracterização da gestão de mobilidade em blocos funcionais, a interação entre eles e potenciais agrupamentos dos mesmos. A gestão da mobilidade descentralizada é estudada através de modelos analíticos e simulações, em que diferentes abordagens distribuem as funcionalidades da mobilidade pela rede. Como resultado deste estudo verificou-se que a descentralização da mobilidade traz vantagens claras. Com base nestes resultados foi proposta uma nova abordagem de gestão de mobilidade distribuída e dinâmica, que é exaustivamente avaliada através de modelos analíticos, simulações e experiências numa bancada de testes. A abordagem proposta é também integrada com mecanismos de handovers horizontais transparentes, assim como é avaliada em ambientes veiculares. Os mecanismos de mobilidade da abordagem proposta são também especificados para cenários de multihoming, de forma a proporcionar o offloading de dados com suporte de mobilidade das redes celulares para outras redes de acesso. Com o objectivo de optimizar o encaminhamento de dados móveis, foi criada uma nova estratégia para o suporte da mobilidade localizada, em que um sistema de replicação de bindings é integrado nas âncoras de mobilidade distribuídas através dos routers de acesso e dos gateways. Finalmente apresenta-se um modelo de ancoramento adaptativo para a mobilidade com base em contexto, o qual dinamicamente determina as âncoras de mobilidade que oferecem a melhor rota para uma dada sessão, baseado na informação do utilizador e da rede. A integração de conceitos de dinamismo e de distribuição na gestão da mobilidade, como o ancoramento adaptativo e o suporte dinâmico da mobilidade, permitem a optimização dos recursos da rede e uma melhor experiência por parte do utilizador. Os resultados demonstram, de uma forma geral, que a gestão descentralizada da mobilidade é um caminho promissor, logo este deve ser tomado em consideração pelas operadoras móveis aquando do desenvolvimento das redes do futuro.
46
Iranmanesh, Seyed Amir. "Security Enhancements in Voice Over Ip Networks." W&M ScholarWorks, 2017. https://scholarworks.wm.edu/etd/1530192357.
Full textAbstract:
Voice delivery over IP networks including VoIP (Voice over IP) and VoLTE (Voice over LTE) are emerging as the alternatives to the conventional public telephony networks. With the growing number of subscribers and the global integration of 4/5G by operations, VoIP/VoLTE as the only option for voice delivery becomes an attractive target to be abused and exploited by malicious attackers. This dissertation aims to address some of the security challenges in VoIP/VoLTE. When we examine the past events to identify trends and changes in attacking strategies, we find that spam calls, caller-ID spoofing, and DoS attacks are the most imminent threats to VoIP deployments. Compared to email spam, voice spam will be much more obnoxious and time consuming nuisance for human subscribers to filter out. Since the threat of voice spam could become as serious as email spam, we first focus on spam detection and propose a content-based approach to protect telephone subscribers' voice mailboxes from voice spam. Caller-ID has long been used to enable the callee parties know who is calling, verify his identity for authentication and his physical location for emergency services. VoIP and other packet switched networks such as all-IP Long Term Evolution (LTE) network provide flexibility that helps subscribers to use arbitrary caller-ID. Moreover, interconnecting between IP telephony and other Circuit-Switched (CS) legacy telephone networks has also weakened the security of caller-ID systems. We observe that the determination of true identity of a calling device helps us in preventing many VoIP attacks, such as caller-ID spoofing, spamming and call flooding attacks. This motivates us to take a very different approach to the VoIP problems and attempt to answer a fundamental question: is it possible to know the type of a device a subscriber uses to originate a call? By exploiting the impreciseness of the codec sampling rate in the caller's RTP streams, we propose a fuzzy rule-based system to remotely identify calling devices. Finally, we propose a caller-ID based public key infrastructure for VoIP and VoLTE that provides signature generation at the calling party side as well as signature verification at the callee party side. The proposed signature can be used as caller-ID trust to prevent caller-ID spoofing and unsolicited calls. Our approach is based on the identity-based cryptography, and it also leverages the Domain Name System (DNS) and proxy servers in the VoIP architecture, as well as the Home Subscriber Server (HSS) and Call Session Control Function (CSCF) in the IP Multimedia Subsystem (IMS) architecture. Using OPNET, we then develop a comprehensive simulation testbed for the evaluation of our proposed infrastructure. Our simulation results show that the average call setup delays induced by our infrastructure are hardly noticeable by telephony subscribers and the extra signaling overhead is negligible. Therefore, our proposed infrastructure can be adopted to widely verify caller-ID in telephony networks.
47
Gurkas, Aydin Gulsum Zeynep. "IP mobility enhancements for heterogeneous wireless networks." Thesis, Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0006/document.
Full textAbstract:
Au cours des dernières décennies, le besoin pour des communications multimédia en mobilité est devenu indéniable dans les réseaux de type IP, ainsi la gestion de la mobilité et la continuité de session est depuis plusieurs années un problème de recherche très important aussi bien pour le milieu académique qu’industriel. Comme l'hétérogénéité des réseaux d’accès est en perpétuelle évolution, l'intégration des différents types de réseaux sans fil au niveau de la couche IP est devenue un domaine de recherche difficile et inévitable. L'un des problèmes les plus importants liés à l'exécution de la gestion de la mobilité concerne le fait que la couche d'application souffre de la modification d'adresses IP au cours du mouvement du nœud mobile alors que celle-ci construit sa session sur la base de l’adresse IP de connexion au réseau. Une nouvelle approche d'amélioration de la prise en charge de la mobilité propose de séparer l'identification de session et l'identification de l’emplacement ou l’attachement au réseau. Donc, par la séparation de ces deux concepts, les sessions ne sont pas identifiés par les adresses IP qui elles sont dynamiques puisque la mobilité dans le réseau impose le changement d’adresse IP, mais les nouveaux identificateurs uniques qui définissent un nœud et qui ne change pas à cause de la mobilité ce qui offrirait une stabilité pour le niveau applicatif. Selon ces concepts, Host Identity Protocol (HIP) est l'une des solutions dominantes en recherches qui est proposé par l'IETF et l’IRTF. Dans cette thèse, le protocole HIP est principalement examiné et de nouvelles améliorations de la mobilité sur la base de ce protocole ont été conçues et mises en placeOver the last decades, with rapid and tremendous growth of IP networks in mobile and wireless environments, mobility management and session continuity has become a more important issue. As the heterogeneity increases in network environments and gradual spread of Internet of Things wave, the integration of different types of wireless networks in the IP layer became a challenging and inevitable research area. One of the most important issues related to mobility management is related to the fact that the application layer suffers from the changing of IP addresses during the movement of the mobile node. It is expected the network layer and above layers to be aware of movement of mobile nodes. New wave in the improvement ideas on this concept is separating the session identification and the location identification. This avoids the applications to suffer when the IP address changes during the mobility. This new approach needs to introduce a new layer in the TCP/IP protocol stack, on top of the IP layer that will handle the new identifiers correspondent with the current IP address or new complete architecture designs which are inheriting locator/identifier separation idea. According to these concepts, Host Identity Protocol (HIP) is one of the dominant and prominent researches that is proposed by IETF and IRTF. This protocol proposes to solve the locator/identifier split problem by also including the security support. In this thesis, predominantly HIP protocol is examined and new mobility enhancements based on this protocol have been designed and introduced
48
Gurkas, Aydin Gulsum Zeynep. "IP mobility enhancements for heterogeneous wireless networks." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0006.
Full textAbstract:
Au cours des dernières décennies, le besoin pour des communications multimédia en mobilité est devenu indéniable dans les réseaux de type IP, ainsi la gestion de la mobilité et la continuité de session est depuis plusieurs années un problème de recherche très important aussi bien pour le milieu académique qu’industriel. Comme l'hétérogénéité des réseaux d’accès est en perpétuelle évolution, l'intégration des différents types de réseaux sans fil au niveau de la couche IP est devenue un domaine de recherche difficile et inévitable. L'un des problèmes les plus importants liés à l'exécution de la gestion de la mobilité concerne le fait que la couche d'application souffre de la modification d'adresses IP au cours du mouvement du nœud mobile alors que celle-ci construit sa session sur la base de l’adresse IP de connexion au réseau. Une nouvelle approche d'amélioration de la prise en charge de la mobilité propose de séparer l'identification de session et l'identification de l’emplacement ou l’attachement au réseau. Donc, par la séparation de ces deux concepts, les sessions ne sont pas identifiés par les adresses IP qui elles sont dynamiques puisque la mobilité dans le réseau impose le changement d’adresse IP, mais les nouveaux identificateurs uniques qui définissent un nœud et qui ne change pas à cause de la mobilité ce qui offrirait une stabilité pour le niveau applicatif. Selon ces concepts, Host Identity Protocol (HIP) est l'une des solutions dominantes en recherches qui est proposé par l'IETF et l’IRTF. Dans cette thèse, le protocole HIP est principalement examiné et de nouvelles améliorations de la mobilité sur la base de ce protocole ont été conçues et mises en placeOver the last decades, with rapid and tremendous growth of IP networks in mobile and wireless environments, mobility management and session continuity has become a more important issue. As the heterogeneity increases in network environments and gradual spread of Internet of Things wave, the integration of different types of wireless networks in the IP layer became a challenging and inevitable research area. One of the most important issues related to mobility management is related to the fact that the application layer suffers from the changing of IP addresses during the movement of the mobile node. It is expected the network layer and above layers to be aware of movement of mobile nodes. New wave in the improvement ideas on this concept is separating the session identification and the location identification. This avoids the applications to suffer when the IP address changes during the mobility. This new approach needs to introduce a new layer in the TCP/IP protocol stack, on top of the IP layer that will handle the new identifiers correspondent with the current IP address or new complete architecture designs which are inheriting locator/identifier separation idea. According to these concepts, Host Identity Protocol (HIP) is one of the dominant and prominent researches that is proposed by IETF and IRTF. This protocol proposes to solve the locator/identifier split problem by also including the security support. In this thesis, predominantly HIP protocol is examined and new mobility enhancements based on this protocol have been designed and introduced
49
KHAN, SARMAD ULLAH. "Key Management in Wireless Sensor Networks, IP-Based Sensor Networks, Content Centric Networks." Doctoral thesis, Politecnico di Torino, 2013. http://hdl.handle.net/11583/2506342.
Full textAbstract:
Cryptographic keys and their management in network communication is considered the main building block of security over which other security primitives are based. These cryptographic keys ensure the privacy, authentication, integrity and non-repudiation of messages. However, the use of these cryptographic keys and their management in dealing with the resource constrained devices (i.e. Sensor nodes) is a challenging task.
A number of key management schemes have been introduced by researchers all over the world for such resource constrained networks. For example, light weight PKI and elliptic curve cryptography schemes are computationally expensive for these resource constrained devices. So far the symmetric key approach is considered best for these constrained networks and different variants of it been developed for these networks (i.e. probabilistic key distribution approach). The probabilistic key distribution approach consumes less memory than the standard symmetric key approach but it suffers from the connectivity issues (i.e. the connectivity depends on the common shared keys between the nodes).
Most of those schemes were proposed by considering static sensor networks (e.g. Industrial process monitoring, Environmental monitoring, movement detection in military applications, forests etc.). However, the use of these existing key management schemes for mobile wireless sensor networks applications introduces more challenges in terms of network connectivity, energy consumption, memory cost, communication overhead and protection of key materials against some well known attacks. Keeping these challenges in mind, previous research has proposed some key management schemes considering the mobility scenarios in ad hoc networks and wireless sensor networks (e.g. vehicular networks, health monitoring systems).However these schemes consume more resource because of a much higher communication packet exchange during the handover phase for the authentication of joining and leaving nodes than the static networks where there is no extra communication for the handover and authentication.
The motivation of this research work is to investigate and propose new algorithms not only to improve the efficiency of these existing authentication and key management schemes in terms of connectivity, memory and security by considering the mobility scenario in wireless sensor networks, but also to develop new algorithms that suit these constrained networks than the existing schemes.
First, we choose the existing key pool approach for authentication and key management and improve its network connectivity and resilience against some well known attacks (e.g. node capturing attacks) while reduce the memory cost by storing those key pools in each sensor node. In the proposed solution, we have divided the main key pool into two virtual mutually exclusive key pools. This division and constructing a key from two chosen keys, one from each key pool, helps to reduce the memory cost of each node by assigning fewer keys for the same level of network connectivity as the existing key pool frameworks.
Although, the proposed key pool approach increases the network resilience against node compromission attacks because of the smaller number of keys assigned to each node, however it does not completely nullify the effect of the attacks. Hence we proposed an online mutual authentication and key establishment and management scheme for sensor networks that provides almost 100\% network connectivity and also nullifies the effect of node compromission attacks. In the proposed online key generation approach, the secret key is dependent on both communicating parties. Once the two communicating parties authenticate each other, they would successfully establish a secret communication key, otherwise they stop communication and inform the network manager about the intruder detection and activity.
The last part of the thesis considers the integration of two different technologies (i.e. wireless sensor networks and IP networks). This is a very interesting and demanding research area because of its numerous applications, such as smart energy, smart city etc.. However the security requirements of these two kind of networks (resource constrained and resourceful) make key management a challenging task. Hence we use an online key generation approach using elliptic curve cryptography which gives the same security level as the standard PKI approach used in IP networks with smaller key length and is suited for the sensor network packet size limitations. It also uses a less computationally expensive approach than PKI and hence makes ECC suitable to be adopted in wireless sensor networks. In the key management scheme for IP based sensor networks, we generate the public private key pair based on ECC for each individual sensor node. However the public key is not only dependent on the node's parameter but also the parameters of the network to which it belongs. This increases the security of the proposed solution and avoids intruders pretending to be authentic members of the network(s) by spreading their own public keys.
In the last part of the thesis we consider Content Centric Networking (CCN) which is a new routing architecture for the internet of the future. Building on the observation that today's communications are more oriented towards content retrieval (web, P2P, etc.) than point-to-point communications (VoIP, IM, etc.), CCN proposes a radical revision of the Internet architecture switching from named hosts (TCP/IP protocols) to named data to best match its current usage. In a nutshell, content is addressable, routable, self-sufficient and authenticated, while locations no longer matter. Data is seen and identified directly by a routable name instead of a location (the address of the server). Consequently, data is directly requested at the network level not from its holder, hence there is no need for the DNS). To improve content diffusion, CCN relies on data distribution and duplication, because storage is cheaper than bandwidth: every content - particularly popular one - can be replicated and stored on any CCN node, even untrustworthy. People looking for particular content can securely retrieve it in a P2P-way from the best locations available.
So far, there has been little investigation of the security of CCNs and there is no specific key management scheme for that. We propose an authentication and key establishment scheme for CCNs in which the contents are authenticated by the content generating node, using pre-distributed shares of encryption keys. The content requesting node can get those shares from any node in the network, even from malicious and intruder ones, in accordance with a key concept of CCNs. In our work we also provide means to protect the distributed shares from modification by these malicious/intruder nodes. The proposed scheme is again an online key generation approach but including a relation between the content and its encryption key. This dependency prevents the attackers from modifying the packet or the key shares.
50
Khan, Shoaib. "Towards a reliable seamless mobility support in heterogeneous IP networks." Thesis, Brunel University, 2009. http://bura.brunel.ac.uk/handle/2438/4065.
Full textAbstract:
Next Generation networks (3G and beyond) are evolving towards all IP based systems with the aim to provide global coverage. For Mobility in IP based networks, Mobile IPv6 is considered as a standard by both industry and research community, but this mobility protocol has some reliability issues. There are a number of elements that can interrupt the communication between Mobile Node (MN) and Corresponding Node (CN), however the scope of this research is limited to the following issues only: • Reliability of Mobility Protocol • Home Agent Management • Handovers • Path failures between MN and CN First entity that can disrupt Mobile IPv6 based communication is the Mobility Anchor point itself, i.e. Home Agent. Reliability of Home Agent is addressed first because if this mobility agent is not reliable there would be no reliability of mobile communication. Next scenario where mobile communication can get disrupted is created by MN itself and it is due to its mobility. When a MN moves around, at some point it will be out of range of its active base station and at the same time it may enter the coverage area of another base station. In such a situation, the MN should perform a handover, which is a very slow process. This handover delay is reduced by introducing a “make before break” style handover in IP network. Another situation in which the Mobile IPv6 based communication can fail is when there is a path failure between MN and CN. This situation can be addressed by utilizing multiple interfaces of MN at the same time. One such protocol which can utilize multiple interfaces is SHIM6 but it was not designed to work on mobile node. It was designed for core networks but after some modification in the protocol , it can be deployed on mobile nodes. In this thesis, these issues related to reliability of IPv6 based mobile communication have been addressed.