In 3GPP Release 5 and beyond, an All-IP architecture has been specified. This indicates that convergence of mobile applications such as voice, video and gaming to IP is not a "trend" anymore, but a reality. IP mobility has therefore been intensively studied in recent years. Majority of the existing IP mobility schemes, including Mobile IPv6 (MIPv6), the current de facto standard solution for IP mobility, are designed around a two-tier addressing model. In this model, while visiting a foreign link, a mobile node (MN) is identified by its home address assigned by its home link but is located by the care-of-address (CoA) acquired from the foreign link. Incoming packets for the MN are routed to its home link as usual, but are intercepted by the home agent and tunneled to the CoA. This model is simple and is well accepted. However, when it comes to real-time applications, it also has been known to be ineffective in terms of handoff delay and bandwidth consumption due to, respectively, its lengthy CoA acquisition and the extra IP header for tunneling. The latter is especially expensive for the case of real-time applications because of the excessive overhead induced by the extra IP header (20 bytes for IPv4 and 40 bytes for IPv6) to the packet payload size (∼20-160 bytes). / In this thesis, we show that (i) can be overcome when a direct Layer-3 connection between the home and any particular visiting domain is available so that inter-domain routing effectively becomes routing within the same logical hierarchy. We call a global network formed by the directly Layer-3 connected domains the Global Universal Addressing (GUA) framework. When deployed on the GUA framework, the existing local mobility schemes can easily be upgraded to support global mobility as seamlessly as local mobility with no modification needed. / Much work has been devoted to improving the two-tier addressing model, including various local mobility schemes such as HAWAII and Cellular IP. These schemes eliminate the CoA acquisition when the MNs move within one domain, but revert back to the two-tier addressing model when the mobility is across different domains (or so-called global mobility). These schemes therefore inherit all the drawbacks of the two-tier addressing model when it comes to global mobility. It has been argued that mobility across domains is rare. However, looking into the near future, this assumption is certainly not applicable to the upcoming fourth-generation (4G) wireless architecture in which the MNs can dynamically choose the best connected wireless interface among heterogeneous networks (e.g., WiFi, WiMax, etc.) of different domains as they move. Therefore, an efficient solution is needed to handle the frequent inter-domain mobility, or global mobility, in the form of heterogeneous handoffs as well. / To address (ii), we propose a new IP mobility scheme called Cellular Universal IP (CUIP), which runs on the GUA framework and makes use of a home route concept also proposed in this thesis. The home route concept intelligently integrates the efficiency of prefix routing and flexibility of full-address routing to achieve high performance and routing scalability under the universal addressing model. In addition, based on IPv6, CUIP makes use of the IPv6 option header to embed the route-update information of an MN in the outgoing data packets for a short period after handoff, so that global routing information can be effectively updated along the path traversed by the packets. We study the performance of CUIP quantitatively and show the following: (1) the average number of routers updated per handoff is less than three, so that the average handoff delay is minimal. (2) The routing table complexity is asymptotically independent of the depth and monotonically decreasing with the width of the network hierarchy. That is, routing scalability is not a concern even in large networks. / To efficiently support global mobility, a universal addressing model, under which a mobile node is always identified and located by the same IP address globally, is an obvious answer to the problems associated with the two-tier addressing model. However, the universal addressing model has been considered to be infeasible due to difficulties in (i) inter-domain (or cross-prefix) IP routing and (ii) routing table scaling. / by Lam, Pak Kit. / "June 2007." / Adviser: Soung Liew. / Source: Dissertation Abstracts International, Volume: 69-01, Section: B, page: 0553. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 128-130). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

A área de gerência de rede cresce à medida que redes mais seguras e menos vulneráveis são necessárias, e as aplicações que concorrem pelo seu uso, necessitam de alta disponibilidade e qualidade de serviço. Quando estamos focando a gerência da infra-estrutura física das redes de computadores, por exemplo, a taxa de uso de um segmento de rede, podemos dizer que esse tipo de gerenciamento encontra-se em um patamar bastante sedimentado e testado. Por outro lado, há ainda lacunas para pesquisar na área de gerenciamento de protocolos de alto nível. Entender o comportamento da rede como um todo, conhecer quais hosts mais se comunicam, quais aplicações geram mais tráfego e, baseado nessas estatísticas, gerar uma política para a distribuição de recursos levando em consideração as aplicações críticas é um dever nas redes atuais. O grupo de trabalho IETF RMON padronizou, em 1997, a MIB RMON2. Ela foi criada para permitir a monitoração de protocolos das camadas superiores (rede, transporte e aplicação), a qual é uma boa alternativa para realizar as tarefas de gerenciamento recém mencionadas. Outro problema para os gerentes de rede é a proliferação dos protocolos de alto nível e aplicações corporativas distribuídas. Devido a crescente quantidade de protocolos e aplicações sendo executados sobre as redes de computadores, os softwares de gerenciamento necessitam ser adaptados para serem capazes de gerenciá-los. Isso, atualmente, não é fácil porque é necessário usar linguagens de programação de baixo nível ou atualizar o firmware dos equipamentos de monitoração, como ocorre com os probes RMON2. Considerando este contexto, esse trabalho propõe o desenvolvimento de um agente RMON2 que contemple alguns grupos dessa MIB. O agente baseia-se na monitoração protocolos de alto nível e aplicações que são executados sobre o IP (Internet Protocol) e Ethernet (na camada de enlace). Além da implementação do agente, o trabalho apresenta um estudo de como obter estatísticas do agente RMON2 e usá-las efetivamente para gerenciar protocolos de alto nível e aplicações.

Dissertação (Mestrado em Engenharia Elétrica) - Centro Universitário da FEI, São Bernardo do Campo, 2014

Tese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 2008

Tese de mestrado integrado. Engenharia Electrotécnica e de Computadores (Major Telecomunicações). Faculdade de Engenharia. Universidade do Porto. 2009

In today's Internet scenario, the current TCP has performed reasonably well. As the Internet has scaled up in load, speed, size and connectivity by the order of six over the past fifteen years, the TCP has consistently avoided severe congestion throughout this same period. Applications involving high performance computings such as bulk-data transfer, multimedia Web streaming, and computational grids demand high bandwidth. These applications usually operate over wide-area networks and, hence, performance over wide-area networks has become a critical issue. Future applications will need steady transfer rates in the order of gigabits per second to support collaborative work. TCP, which is the most widely used protocol, is expected to be used in these scenarios. It has been shown that TCP doesn't work well in this new environment, and several new TCP versions have been developed in recent years to address this issue. To date, there has not been a performance evaluation of various TCP protocols. In this thesis, various TCP versions 3/4 Tahoe, Reno, Newreno, Vegas, Westwood, Sack, Highspeed TCP, Scalable TCP 3/4 have been evaluated for their performance over high bandwidth delay product networks. It was found that the flow and congestion control mechanism used in TCP was unable to reach full utilization on high-speed links. Also discussed in this Thesis are fairness issues related to these new protocols with respect to themselves and with others.

This thesis examines the current implementations for the distribution of real-time GNSS data over IP networks such as the public Internet, focusing on two essential components of the system, data format and transport protocol. The provision of a suitable data format will allow users to take full advantage of the real-time GNSS data distribution system. Types of GNSS supported, message sizes, data rates, data precision levels, hardware and software support and possible future developments are investigated. An analysis is carried out on commonly known GNSS data formats, highlighting the most suitable standard for each evaluation criterion. A similar investigation is carried out on the transport protocols. An analysis is conducted on various design aspects of NTRIP and RT-IGS protocols, covering factors such as data latency, integrity, firewalls and proxy server compatibility and scalability. The analysis also covers the design aspects of the new draft Version 2 of NTRIP. The latter parts of this thesis report on the experiment results aimed at providing assessment of the current level of implementation of NTRIP. Data latency and integrity using NTRIP over the Internet are examined. Their impacts on users applications as the quality of real-time kinematic positioning is assessed. The results show that the performance of the system satisfies the rigorous requirement of the end-user application. The draft version of the new NTRIP indicates that UDP will be also supported. A similar investigation is carried out, providing the first experiment results on the new option. Tests using similar metrics, data latency and integrity, were carried out to verify the inherent differences between TCP and UDP. It was ascertained that, in most cases, UDP does offer improvement in terms of reduced latency over TCP. However this improvement is not significant enough to affect the performance of users applications tested. Compatibility tests were also carried out and the test results show that the new option experiences some compatibility issues with firewalls and wireless networks.

<p>Nowadays a lot of research efforts focus on Mobile Ad-hoc NETworks (MANETs). A MANET is a collection of mobile autonomous nodes, which can move arbitrary, leading to a constantly changing network topology. However, today most of the information is still stored on wired servers. A wired network has a hierarchical topology, while in a MANET the topology is usually flat to allow for nodes to easily change there position in the network. Due to the different topological natures of these systems, interconnectivity is not trivial.</p><p>To further complicate the situation the Transmission Control Protocol (TCP) is designed for wired networks, in a MANET with different link and route characteristics, as multihop and frequent packet losses, the performance of current TCP proposals drop considerably.</p><p>The purpose of this report is to give an overview of the current MANET – Internet connectivity situation and to evaluate TCP performance in a hybrid MANET where mobile nodes connect to a wired network through a gateway.</p><p>The report is divided into two parts. The first theoretical part will evaluate the different routing and mobility problems that occur in a realistic scenario with multiple gateways. Main problems that will be discussed are: path selection, gateway discovery, handover between gateways and address configuration in current solutions.</p><p>In the last part, a simulation-based evaluation will be made on a simplified scenario where one gateway is linking the two different networks. The simulation will be conducted with ns-2.28, which is extended with support for Uppsala University version of Ad-hoc On-demand Distance Vector (AODVUU) as routing and gateway discovery protocol and TCP AP (Adaptive Pacing) as transport protocol. In the performance evaluation, AODVUU and Destination-Sequenced Distance-Vector Routing (DSDV) combined with TCP Newreno, TCP Vegas and TCP AP will be used. The simulation based evaluation concluded that the best performance was achieved with TCP Vegas in conjunction with AODVUU.</p>

Home networking is becoming an attractive application not only for the Internet access but also for home automation. Being a high-speed and dominant standard presently, HomePlug has an important role in home LAN connecting to the Internet. For industrial applications, the Power Line Communication also has significant advances. However, the PHY/MAC technology provided by HomePlug still cannot be employed with some critical features such as real time performance, implications in the event of link and node loss. In this paper, the characteristics of HomePlug PHY/MAC, the property of power line channel, as well as the noise features of power line are analyzed. Based on HomePlug, a model of high level real-time protocol applied to industrial environment is proposed. The protocol simultaneously belongs to layer two and three, and can support real-time implementation with no loss and small delay according to the requirement in PLC networks, for targeting to develop a real time network with high speed power line media and advanced modulation. / Singapore-MIT Alliance (SMA)

Apparu en 1970, le calcul parallèle permet, contrairement aux applications classiques qui exécutent un algorithme de manière séquentielle, d'exécuter des tâches d'une même application sur plusieurs processeurs en même temps. Les premières architectures -- les supercalculateurs -- qui regroupaient des milliers de processeurs au sein de la même machine, ont fait place aux grappes, à la fin des années 1970 : une interconnexion d'ordinateurs standard par un réseau rapide. Ces architectures s'étant développées un peu partout, les grilles ont fait leur apparition au début des années 1990, de manière à fédérer les ressources de différentes entités en les interconnectant et ainsi disposer d'une plus grande puissance de calcul globale. La grille, telle que nous la considérons dans ce manuscrit sera donc définie comme une interconnexion de grappes par un réseau longue distance.<br /> Les applications parallèles s'appuient la plupart du temps sur le standard MPI qui fonctionne par passage de message. Initialement destiné aux grappes, celui-ci est toujours utilisé pour programmer les communications des applications s'exécutant sur les grilles. Cela permet la réutilisation d'anciennes applications.<br /> Alors que différents problèmes ont été résolus pour les communications au sein des grappes, le réseau longue distance de la grille pose plusieurs problèmes. Tout d'abord, les messages MPI sont transmis de manière fiable sur le réseau longue distance via le protocole TCP. Or TCP, qui reste le protocole de transport utilisé dans la plupart des grilles, est basé sur un transfert de données à l'aide de flux ; il est donc peu adapté aux communications MPI. Ensuite, la grande latence du réseau longue distance implique des communications et des retransmissions de paquets perdus qui sont coûteuses. Enfin, le débit disponible sur le lien d'accès à ce réseau est généralement inférieur à la somme des débits nécessaires si tous les processus communiquent en même temps sur ce lien. Ceci crée de la congestion à la fois au sein d'une même application et à la fois avec les autres applications qui l'utilisent, et il devient nécessaire de gérer ce goulot d'étranglement.<br /> L'objectif principal de cette thèse est d'étudier en détail les interactions entre les applications parallèles et la couche de transport dans les réseaux longue distance des grilles de calcul, puis de proposer des solutions à ces problèmes.