Dissertations / Theses on the topic 'TCP/IP (Computer network protocol) Computer network protocols. Computer algorithms'

This thesis presents three main contributions that aim to improve the transport layer of the current networking architecture. The transport layer is nowadays dominated by the use of TCP and its congestion control. Recently new congestion control mechanisms have been proposed. Among them, TCP Friendly Hate Control (TFRC) appears to be one of the most complete. Nevertheless this congestion control mechanism, as with TCP, does not take into account either the evolution of the network in terms of Quality of Service and mobility or the evolution of the applications. The first contribution of this thesis is a specialisation of TFRC congestion control to provide a QoS-aware Transport Protocol specifically designed to operate over QoS-enabled networks with bandwidth guarantee mechanisms. This protocol combines a QoS-aware congestion control, which takes into account network-level bandwidth reservations, with full ordered reliability mechanism to provide a transport service similar to TCP. As a result, we obtain the guaranteed throughput at the application level where TCP fails. This protocol is t he first transport protocol compliant with bandwidth guaranteed networks. At the same time the set of network services expands, new technologies have been proposed and deployed at the physical layer. These new technologies are mainly characterised by communications done without wire constraint and the mobility of the end-systems. Furthermore, these technologies are usually deployed on entities where the CPU power and memory storage are limited. The second contribution of this thesis is therefore to propose an adaptation of TFHC to these entities. This is accomplished with the proposition of a new sender-based version of TFHC. This version has been implemented, evaluated and its numerous contributions and advantages compare to usual TFHC version have been demonstrated. Finally, we proposed an optimisation of actual implementations of TFHC. This optimisation first consists in the proposition of an algorithm based on a numerical analysis of the equation used in TFHC and the use of the Newton's algorithm. We furthermore give a first step, with the introduction of a new framework for TFRC, in order to better understand TFHC behaviour and to optimise the computation of the packet loss rate according to loss probability distributions.

Thesis (MSc)--University of Stellenbosch, 2005.
ENGLISH ABSTRACT: The majority of tra c on the Internet uses the Transmission Control Protocol (TCP) as a transport layer protocol for the end-to-end control of information transfer. Measurement, simulation and analytical models are the techniques and tools that can be used to understand and investigate the Internet and its performance. Measurements can only be used to explore existing network scenario or otherwise become costly and in exible with the growth and complexity of the Internet. Simulation models do not scale with the growth of network capacities and the number of users. Computationally e cient analytical models are therefore important tools for investigating, designing, dimensioning and planning IP (Internet Protocol) networks. Existing analytical models of TCP performance are either too simple to capture the internal dynamics of TCP or are too complex to be used to analyze realistic network topologies with several bottleneck links. The literature shows that the xed point algorithm (FPA) is a very useful way of solving analytical models of Internet performance. This thesis presents fast and accurate analytical models of TCP performance with the FPA used to solve them. Apart from what is observed in experimental literature, no comprehensive proof of the convergence and uniqueness of the FPA is given. In this thesis we show how the FPA of analytical models of reliable Internet protocols such as TCP converges to a unique xed point. The thesis speci es the conditions necessary in order to use the FPA for solving analytical models of reliable Internet protocols. We also develop a general implementation algorithm of the FPA of analytical models of TCP performance for realistic and arbitrary network topologies involving heterogenous TCP connections crossing many bottleneck links. The models presented in this thesis give Internet performance metrics, assuming that only basic network parameters such as the network topology, the number of TCP connections, link capacity, distance between network nodes and router bu er sizes are known. To obtain the performance metrics, TCP and network sub{models are used. A closed network of :=G=1 queues is used to develop each TCP sub-model where each queue represents a state of a TCP connection. An M=M=1=K queue is used for each network sub{model which represents the output interface of an IP router with a bu er capacity of K 􀀀��������1 packets. The two sub-models are iteratively solved. We also give closed form expressions for important TCP performance values and distributions. We show how the geometric, bounded geometric and truncated geometric distributions can be used to model reliable protocols such as TCP. We give models of the congestion window cwnd size distribution by conditioning on the slow start threshold ssthresh distribution and vice-versa. We also present models of the probabilities of TCP timeout and triple duplicate ACK receptions. Numerical results based on comparisons against ns2 simulations show that our models are more accurate, simpler and computationally more e cient than another well known TCP model. Our models can therefore be used to rapidly analyze network topologies with several bottlenecks and obtain detailed performance metrics.
AFRIKAANSE OPSOMMING: Die meerderheid van die verkeer op die Internet gebruik die Transmission Control Protocol (TCP) as `n vervoer laag protokol vir die einde-tot-einde kontrole van inligting oordrag. Meting, simulasie en analitiese modelle is die tegnieke en gereedskap wat gebruik kan word om die Internet te ondersoek en verstaan. Meting kan slegs gebruik word om bestaande netwerke scenarios te verken. Meting is duur en onbuigsaam met die groei en samegesteldheid van die Internet. Simulasie modelle skaal nie met die groei van netwerk kapasiteit en gebruikers nie. Analitiese modelle wat berekening e ektief is is dus nodige gereedskap vir die ondersoek, ontwerp, afmeting en beplanning van IP (Internet Protocol) netwerke. Bestaande analitiese TCP modelle is of te eenvoudig om die interne dinamiek van die TCP saam te vat of hulle is te ingewikkeld om realistiese netwerk topologie met heelwat bottelnek skakels te analiseer. Literatuur toon dat die xed point algorithm (FPA) baie handig is vir die oplos van analitiese modelle van Internet verrigting. In hierdie tesis word vinnige en akkurate analitiese modelle van TCP verrigting opgelos deur FPA weergegee. Buiten wat deur eksperimentele literatuur aangedui word is daar geen omvattende bewyse van die konvergensie en uniekheid van die FPA nie. In hierdie tesis word aangedui hoe die FPA van analitiese modelle van betroubare Internet protokolle soos die TCP konvergeer na `n unieke vaste punt. Hierdie tesis spesi seer die voorwaardes benodig om die FPA te gebruik vir die oplos van analitiese modelle van realistiese Internet protokolle. `n Algemene uitvoer algoritme van die FPA van analitiese modelle van TCP vir realistiese en arbitr^ere netwerk topogra e insluitende heterogene TCP konneksies oor baie bottelnek skakels is ontwikkel. Die model in hierdie tesis gee Internet verrigting metodes met die aanname dat slegs basiese netwerk parameters soos netwerk topologie, die aantal TCP konneksies, die konneksie kapasiteit, afstand tussen netwerk nodusse en die roete bu er grotes bekend is. Om die verrigting metodes te verkry, word TCP en netwerk sub-modelle gebruik. `n Geslote netwerk van :=G=1 rye is gebruik om elke TCP sub-model, waar elke ry 'n toestand van `n TCP konneksie voorstel, te ontwikkel. `n M=M=1=K ry is gebruik vir elke netwerk sub-model wat die uitset koppelvlak van `n IP roetemaker met `n bu er kapasiteit van K 􀀀������� 1 pakkies voorstel. Die twee submodelle word iteratief opgelos. Geslote vorm uitdrukkings vir belangrike TCP verrigting waardes en verspreidings word gegee. Daar word getoon hoe geometriese, begrensde geometriese en geknotte geometriese verspreidings gebruik kan word om betroubare protokolle soos die TCP te modelleer. Modelle van die kongestie venster cwnd grootte verspreiding word gegee deur die kondisionering van die stadige aanvang drempel ssthresh verspreiding en andersom. Modelle van die voorspelling van TCP tyduit en trippel duplikaat ACK resepsie word weergegee. Numeriese resultate gebaseer op vergelykings met ns2 simulasies wys dat ons modelle meer akkuraat, eenvoudiger en berekeningsgewys meer e ektief is as ander wel bekende TCP modelle. Ons modelle kan dus gebruik word vir vinnig analise van netwerk topologie met verskeie bottelnekke en om gedetailleerde verrigting metodes te bekom.

Técnicas de gerenciamento de filas e descarte de pacotes são empregadas pelos escalonadores de pacotes presentes nos roteadores internos de uma rede de telecomunicações. Devido às características auto-similares do tráfego presente nas redes, o desenvolvimento de modelos para análise de desempenho de protocolos e de elementos de rede é enormemente dificultado. Tais características auto-similares são oriundas da ação dos protocolos predominantes nas redes em questão, e dos mecanismos fim-a-fim de controle de congestionamento existentes, determinantes no comportamento do fluxo de informações entre diferentes camadas na hierarquia de protocolos TCP/IP. Esta tese tem como objetivo principal propor modelos analíticos de baixo esforço computacional que permitam fazer uma análise de desempenho de um nó de rede (podendo este nó ser do tipo: DiffServ, IntServ, IP, Multi Protocol Label Switching, entre outros) com o escalonador WFQ. O tráfego considerado é do tipo TCP, devido ao fato que este protocolo é o mais utilizado na Internet atualmente, apresentando, portanto, características auto-similares. Foram desenvolvidos modelos para o escalonador WFQ quando o mesmo é alimentado com tráfego Poissoniano e tráfego do tipo auto-similar. O primeiro modelo está baseado em uma cadeia de Markov bidimensional para representar o comportamento do escalonador WFQ alimentado por dois fluxos de prioridades diferentes. O segundo modelo faz uso de duas filas separadas com taxas de serviço ajustadas de modo a simular o comportamento do escalonador WFQ. As filas são do tipo M[X]/M/1/B para levar em conta o comportamento auto-similar do tráfego. Como resultado, mostra-se que o segundo modelo é capaz de estimar as métricas de desempenho, com erro aceitável, dentro de uma faixa adequada de valores dos parâmetros do sistema, conforme demonstra a validação de resultados conduzido com uso do software NS-2.
Internal routers of telecommunication networks employ a variety of queue management and packet discarding techniques. The development of models for analyzing performance of different protocols and devices is made difficult by the self-similar nature of network traffic. Traffic self-similarity stems from the action of predominant protocols and end-to-end congestion control systems, which are key factors in determining the behavior of data flow between layers of the TCP/IP protocol stack. This thesis proposes analytical models that allow for the evaluation of a (DiffServ, IntServ, IP, Multi Protocol Label Switching etc.) network node's performance at a low computational cost. Only TCP traffic is considered, since it accounts for most of current Internet traffic and therefore exhibits self-similar characteristics. Models were developed for the WFQ scheduler with Poisson and self-similar traffic inputs. The former is based on a bi-dimensional Markov chain representing the behavior of the WFQ scheduler with two input flows with different priorities. The latter consists in two separate queues whose service rates are tuned so as to simulate the behavior of a WFQ scheduler. M[X]/M/1/B queues are used to account for the self-similar nature of traffic. As a result, it is shown that the second model accurately estimates performance metrics for certain ranges of parameter values, as confirmed by NS-2 simulations.

Thesis (M.S.)--Worcester Polytechnic Institute.
Keywords: TCP; RED; satellite; PEP; STP; performance enhancing proxy; segment caching; IP-ABR; Internet; bandwidth reservation; IP-VBR; congestion avoidance; bandwidth sharing. Includes bibliographical references (p. 98-99).

This thesis presents an investigation of how to extend the reach of a Bluetooth personal area network by introducing the concept of Bluetooth Hotspots. Currently two Bluetooth devices cannot communicate with each other unless they are within radio range, since Bluetooth is designed as a cable-replacement technology for wireless communications over short ranges. An investigation was done into the feasibility of creating Bluetooth hotspots that allow distant Bluetooth devices to communicate with each other by transporting their communications between these hotspots via an alternative network infrastructure such as an IP network. Two approaches were investigated, masquerading of remote devices by the local hotspot to allow seamless communications and proxying services on remote devices by providing them on a local hotspot using a distributed service discovery database. The latter approach was used to develop applications capable of transporting Bluetooth’s RFCOMM and L2CAP protocols. Quantitative tests were performed to establish the throughput performance and latency of these transport applications. Furthermore, a number of selected Bluetooth services were tested which lead us to conclude that most data-based protocols can be transported by the system.

The Internet Engineering Task Force (IETF) has recently released network mobility standards that allow deployment of TCP/IP networks onboard a vehicle and maintain permanent network connectivity to the Internet via a vehicular mobile router. This recent development opens up new opportunities for providing efficient mobile computing for users on the move, especially for commuters traveling on public transports. Moreover, central and coordinated management of mobility in a single router, rather than by each user device individually, has numerous advantages. In this architecture, however, it becomes challenging to guarantee network performance due to the mobility of the network and inherently vulnerable nature of wireless links. In this thesis, a detailed performance study of onboard networks is conducted. It has been shown that disruptions in the mobile router connectivity can significantly degrade network throughput. Moreover, factors such as the limited wireless bandwidth of the access link, variations in the bandwidth due to technology switching, and the communication diversity of onboard users all contribute to the problem of unfair sharing of wireless bandwidth. By leveraging the fact that all onboard communications go through the mobile router, performance enhancing solutions are proposed that can be deployed in the mobile router to transparently address the throughput and fairness problems. In this architecture, when the route is known in advance and repetitive (e.g. for public transport or a regularly commuting private vehicle), a certain degree of prediction of impending link disruptions is possible. An anticipatory state freezing mechanism is proposed that relies on the prediction of link disruptions to freeze and unfreeze the state machine of TCP, the widely used transport protocol in the Internet. Simulation study shows that TCP throughput has a non-linear relationship with the prediction accuracy. As prediction accuracy increases, throughput problem diminishes quickly. An adaptive mobile router based fairness control mechanism is proposed to address the unfair sharing of wireless bandwidth in highly dynamic scenarios. The fairness is controlled by dynamically estimating the round-trip-times of all onboard TCP connections and transparently adjusting the protocol control parameters at the router. The thesis also discusses implementation issues for the proposed solutions.

Emerging wireless networks are characterized by increased heterogeneity in wireless access technologies as well as increased peer-to-peer communication among wireless hosts. The heterogeneity among wireless access interfaces mainly exists because of the fact that different wireless technologies deliver different performance trade-offs. Further, more and more infrastructure-less wireless networks such as ad-hoc networks are emerging to address several application scenarios including military and disaster recovery. These infrastructure-less wireless networks are characterized by the peer-to-peer communication model. In this thesis, we propose transport protocols that tackle the challenges that arise due to the above-mentioned properties of state-of-the-art wireless data networks. The main contributions of this work are as follows: 1. We determine the ideal nature and granularity of transport adaptation for efficient operation in heterogeneous wireless data networks by performing comprehensive experimental analysis. We then design and implement a runtime adaptive transport framework, *TP, which accommodates the capabilities of the ideal transport adaptation solution. 2. We prove that conversational transport protocols are not efficient under peer-to-peer wireless data networks. We then design and implement NCTP which is a non-conversational transport protocol.

Orientador: Hugo Enrique Hernandez Figueroa
Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-05T07:05:01Z (GMT). No. of bitstreams: 1 Albuquerque_EdisondeQueiroz_D.pdf: 2450262 bytes, checksum: 1142d9b235574921d845ac5246fbe250 (MD5) Previous issue date: 2005
Resumo: Este trabalho está baseado em uma experiência real, vivida no dia-a-dia do nosso trabalho na Empresa Brasileira de Telecomunicações S.A, EMBRATEL, quando da busca de ferramentas capazes de viabilizar o permanente treinamento dos Consultores Técnicos da empresa, localizados em diferentes partes do nosso país, em face da escassez de recursos financeiros e de tempo. Para tanto, iniciamos com uma retrospectiva histórica da Educação a Distância no mundo, seu presente e suas tendências visíveis. Depois, apresentamos uma descrição dos protocolos multicasting existentes, seguido de nossa proposta. Apresentamos, também, uma simulação usando o Simulador ns-2 de maneira a comprovar o correto funcionamento do protocolo proposto e avaliar seu desempenho. O núcleo desta tese é a proposta de um novo protocolo multicasting, elemento essencial para a otimização da rede de suporte, um imperativo para a eficiência de seu funcionamento e, principalmente, da diminuição de seu custo, tendo em vista a situação ideal de se transmitir voz e vídeo para garantir que uma aula a distância será o mais próximo possível de uma aula presencial, conforme aponta o resultado de pesquisas referenciadas no presente texto, uma vez que vídeo é uma aplicação que demanda grande largura de banda
Abstract: This work is based on a real life situation, experienced in our daily work at Empresa Brasileira de Telecomunicações S.A, EMBRATEL, when pursuing tools that would allow the continuous training of its staff of Technical Consultants. The Technical Consultants were spread all over Brasil, a country of continental dimensions. Time and cost were obstac1es to achieve the above mentioned training. This thesis starts providing a short account of the historical milestones on Distance Learning. We added considerations on the state-of-the-art and scenarios of future developments, which were drawn taking into account social and economical policies. Routing and existing multicasting protocols are described and compared with the bidirectional multicast protocol proposed in this thesis. The main purpose of this thesis is the proposal of a new Multicasting Protocol, to support a new concept on which a teacher can be a student on a different subject by taking into account that we aim a Distance Learning environment inside a corporation. The ns-2 Simulator is used to simulate the perfect operation of the proposed protocol and evaluate its performance. The use of video is mandatory in order to achieve a maximum efficiency at c1ass. The rapid switching of video transmission from the teacher to a remote student that asks a question (so that all other students spread around the country can also see who is asking) and back to the teacher is mandatory and is what motivated the development of this new Multicast Protocol
Doutorado
Telecomunicações e Telemática
Doutor em Engenharia Elétrica

Traditionally, real-time communication, such as voice calls, has run on separate, closed networks. Of all the limitations that these networks had, the ability of malicious attacks to cripple communication was not a crucial one. This situation has changed radically now that real-time communication and data have merged to share the same network. The objective of this project is to investigate the securing of softswitches with functionality similar to Private Branch Exchanges (PBX) from malicious attacks. The focus of the project will be a practical investigation of how to secure ILANGA, an ASTERISK-based system under development at Rhodes University. The practical investigation that focuses on ILANGA is based on performing six varied experiments on the different components of ILANGA. Before the six experiments are performed, basic preliminary security measures and the restrictions placed on the access to the database are discussed. The outcomes of these experiments are discussed and the precise reasons why these attacks were either successful or unsuccessful are given. Suggestions of a theoretical nature on how to defend against the successful attacks are also presented.

O controle de congestionamento padrão do TCP apresenta vários problemas; ele não consegue distinguir se o pacote foi perdido por falha no enlace ou por descarte de pacotes devido a um congestionamento de rede (se a falha foi no enlace não há necessidade de ativar os mecanismos de controle de congestionamento); e o correto ajuste de sua taxa de transmissão requer informação de perdas de pacotes. Neste trabalho é apresentado o new generalized window advertising (NGWA), que é um novo esquema de controle de congestionamento para o TCP. O NGWA traz informações da banda disponível da infraestrutura de rede para os pontos finais da conexão TCP. Seu desempenho foi comparado com TCP New Reno, RED e o TCP padrão via simulações com o software NS-3, considerando topologias de rede largamente citadas na literatura. O NGWA foi, também, implementado e testado no Linux (versão 2.6.34). O novo método demonstrou ser superior aos comparados, apresentando uma operação mais estável, melhor justiça e menor taxa de perda de pacotes, considerando o elenco de testes realizados.
The TCP congestion control mechanism in standard implementations presents several problems; he cannot distinguish if the packet was lost by link failure or by congestion in the net (if the fault was in the link there is no need to active congestion control mechanisms); and the right adjust of your transmission rate requires information from packet loss. This work presents the new generalized window advertising (NGWA), which is a new congestion control scheme for TCP. The NGWA provides information considering the available bandwidth of the network infrastructure to the endpoints of the TCP connection. Results obtained by the NGWA approach were compared with those from TCP New Reno, RED, and standard TCP (using the network simulator NS-3), considering network topologies widely cited in the literature. A NGWA Linux implementation is also presented. The new method proved to be superior when compared with the traditional approaches, presenting a more stable operation, better fairness and lower packet loss, considering the set of tests carried out.

Orientador: Eleri Cardozo
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-14T03:43:39Z (GMT). No. of bitstreams: 1 Dolphine_TiagoMarchetti_M.pdf: 1822376 bytes, checksum: 5425d1b4cf2ca6a35df00dc7dc511d69 (MD5) Previous issue date: 2009
Resumo: Arquiteturas de micromobilidade vêm sendo propostas para atender ao crescente interesse por tecnologias de mobilidade IP. MPA (Mobility Plane Architecture), desenvolvida na FEEC/Unicamp, é uma solução de micromobilidade baseada em tunelamento de pacotes que emprega apenas protocolos bem estabelecidos. Quando estudou-se aplicações para melhoria de desempenho em handover e engenharia de tráfego na arquitetura MPA, verificou-se que estas aplicações necessitavam serviços comuns. Este trabalho descreve a plataforma MIS (Mobility Infrastructure Services) que fornece um conjunto de serviços para suporte ás funcionalidades básicas comuns de aplicações de gerência de rede, engenharia de tráfego e gerência de mobilidade. A plataforma proposta facilita o desenvolvimento de tais aplicações compartilhando soluções às necessidades encontradas na arquitetura de micromobilidade MPA e outras arquiteturas similares. São apresentados o projeto, implementação e testes da plataforma, juntamente com dois estudos de casos em gerência de mobilidade e engenharia de tráfego. Palavras-chave: redes IP móveis, micromobilidade, gerência de rede, engenharia de tráfego
Abstract: Micro-mobility architectures have been proposed to meet the growing interest in technologies supporting mobility in IP networks. MPA (Mobility Plane Architecture), developed at the FEEC/Unicamp, is a micro-mobility solution based on tunneling of packets that employs only well standardized protocols. When applications for supporting seamless handover and traffic engineering in MPA started to be designed, it was noticed that these applications demand a set of common services. This dissertation presents the MIS (Mobility Infrastructure Services) platform which provides a set of services that meet the common basic features demanded by applications of network management, traffic engineering and mobility management. The proposed platform facilitates the development of these applications when they are targeted to MPA and other micro-mobility architectures. This dissertation reports the design, implementation, ant test of the MIS platform, along with two case studies in mobility management and traffic engineering. Keywords: IP mobile networks, micro-mobility, network management, traffic engineering
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica

Orientador: Mauricio Ferreira Magalhães
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-04T17:32:51Z (GMT). No. of bitstreams: 1 Sazima_Ricardo_M.pdf: 1107563 bytes, checksum: a1179beaec699c0dcd87b45284e4a99c (MD5) Previous issue date: 2004
Resumo: Dados a banda de transmissão atualmente disponível, o protocolo (IP) utilizado para transmitir a maior parte de tráfego e a quantidade de tráfego e seus requisitos de aos, a Engenharia de Tráfego (TE, de Traffic Engineering) tomou-se um componente cada vez mais importante nas redes de comunicações. O padrão do IETF para enncaminhamento roteamento entitulado Multi-Protocol Label Switching (MPLS) preenche lacunas importantes neste cenário e é peça chave das metodologias de TE mais sofisticadas. Nesta dissertação é apresentado um modelo genérico de TE e uma proposta para uma Plataforma para Experimentos com MPLS (PLEX MPLS) que permite que o usuário defina, execute, e analise configurações de Engenharia de Tráfego com MPLS em uma rede IP. Os principais objetivos da PLEX MPLS são: . Estudo da tecnologia MPLS e suporte a outros trabalhos em andamento no contexto do grupo de estudos em MPLS do DCA . Experimentos com engenharia de tráfego com MPLS: validação das tecnologias e conceitos relacionados . Experimentos didáticos em disciplinas de laboratório de redes. Os principais conceitos de TE e MPLS são apresentados como referência, bem como uma descrição do NIST Switch, a plataforma MPLS escolhida para este trabalho. A análise, projeto e implementação da PLEX MPLS são apresentados, pois formam parte significativa do trabalho desenvolvido. A PLEX não só utiliza, como também estende as funcionalidades oferecidas pelo NIST Switch a fim de oferecer um esquema de TE mais completo e eficiente. Na fase de análise, vemos quais os principais requisitos para a implementação desta plataforma, seguindo uma metodologia de Engenharia de Software. Na fase de projeto, vemos as soluções propostas para os problemas identificados na fase de análise e temos uma especificação dos componentes a serem implementados. Na fase seguinte, discutimos a implementação das principais características dos componentes da PLEX, justificando as decisões tomadas. Para validar a implementação da PLEX de acordo com sua proposta, foram realizados alguns experimentos em uma rede de testes com tráfego real. A execução destes experimentos é descrita e seus resultados analisados. Os resultados obtidos assinalam claramente a importância e utilidade de esquemas de TE baseada em MPLS. Uma interessante metodologia para TE, compilada a partir de várias propostas, é apresentada. Finalmente, apontam-se caminhos a seguir em um trabalho futuro de refinamento da PLEX
Abstract: Given the bandwidth currently available, the protocol (IP) used to transmit most Internet traffic, the quantity of traffic produced and its QoS requirements, Traffic Engineering (TE) has become an increasingly important component of communications networks. IETF's standard for forwarding/routing, which is entitled Multi-Protocol Label Switching (MPLS), presents important solutions in this scenario playing a major role in more sophisticated TE methodologies. This work presents a generic methodology for TE and a proposal for a Platform for Experiments with MPLS (PLEX MPLS) which allows the user to define, execute and analyze Traffic Engineering configurations with MPLS in an IP network. The main goals of PLEX MPLS are: . Study of the M PLS technology and support of other ongoing works with M PLS in the DCA . Traffic Engineering experiments with MPLS: validation of the related concepts and technologies . Support of didactic experiments in academic disciplines. The main concepts of MPLS and TE are presented as reference, as well as a brief description of NIST Switch, the MPLS software chosen for the PLEX MPLS implementation. The analysis, project and implementation of PLEX MPLS are presented, since are significant part of the developed work. PLEX not only uses, but also extends NIST Switch functionalities to offer a more complete and efficient TE scheme. In the analysis phase the main requirements for the PLEX implementation are specified, following a well-known Software Engineering methodology. The solutions found for the problems identified in the analysis phase are presented in the project phase alongside with a specification of the components that will be implemented. In the next phase, the implementation of PLEX is discussed focusing on the most important characteristics of PLEX components and justifying the implementation ecisions. In order to validate PLEX implementation and its proposal, some experiments were made in a test network with reallive traffic. These experiments are described and its results analyzed. The results obtained clearly indicate the importance and utility of TE schemes based on MPLS. Also an interesting TE methodology compiled from several proposals is presented. Finally, possible improvements and future work on PLEX MPLS are indicated.
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica

Siu Chun.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.
Includes bibliographical references (leaves 66-68).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Thesis Overview --- p.3
Chapter 2 --- Background and Related work --- p.4
Chapter 2.1 --- Emergence of IP-over-ATM --- p.4
Chapter 2.2 --- ATM architecture --- p.5
Chapter 2.3 --- Scheduling issues in output-queued switch --- p.6
Chapter 2.4 --- Scheduling issues in input-queued switch --- p.18
Chapter 3 --- The Deadline-ordered Burst-based Parallel Scheduling Strategy --- p.23
Chapter 3.1 --- Introduction --- p.23
Chapter 3.2 --- Switch and queueing model --- p.24
Chapter 3.2.1 --- Switch model --- p.24
Chapter 3.2.2 --- Queueing model --- p.25
Chapter 3.3 --- The DBPS Strategy --- p.26
Chapter 3.3.1 --- Motivation --- p.26
Chapter 3.3.2 --- Strategy --- p.31
Chapter 3.4 --- The Deadline-ordered Burst-based Parallel Iterative Matching --- p.33
Chapter 3.4.1 --- Algorithm --- p.34
Chapter 3.4.2 --- An example of DBPIM --- p.35
Chapter 3.5 --- Simulation results --- p.33
Chapter 3.6 --- Discussions --- p.46
Chapter 3.7 --- Future work --- p.47
Chapter 4 --- The Quasi-static DBPIM Algorithm --- p.50
Chapter 4.1 --- Introduction --- p.50
Chapter 4.2 --- Quasi-static path scheduling principle --- p.51
Chapter 4.3 --- Quasi-static DBPIM algorithm --- p.56
Chapter 4.4 --- An example of Quasi-static DBPIM --- p.59
Chapter 5 --- Conclusion --- p.63
Bibliography --- p.65

The Transmission Control Protocol (TCP) is the most widely used transport protocol in the Internet. TCP is a reliable transport protocol that is tuned to perform well in wired networks where packet losses are mainly due to congestion. Wireless channels are characterized by losses due to transmission errors and handoffs. TCP interprets these losses as congestion and invokes congestion control mechanisms resulting in degradation of performance. TCP is usually layered over the Internet protocol (lP) at the network layer. JP is not reliable and does not provide for any Quality of Service (QoS). The Internet Engineering Task Force (IETF) has provided two techniques for providing QoS in the Internet. These include Integrated Services (lntServ) and Differentiated Services (DiffServ). IntServ provides flow based quality of service and thus it is not scalable on connections with large flows. DiffServ has grown in popularity since it is scalable. A packet in a DiffServ domain is classified into a class of service according to its contract profile and treated differently by its class. To provide end-to-end QoS there is a strong interaction between the transport protocol and the network protocol. In this dissertation we consider the performance of the TCP over a wireless channel. We study whether the current TCP protocols can deliver the desired quality of service faced with the challenges they have on wireless channel. The dissertation discusses the methods of providing for QoS in the Internet. We derive an analytical model for TCP protocol. It is extended to cater for the wireless channel and then further differentiated services. The model is shown to be accurate when compared to simulation. We then conclude by deducing to what degree you can provide the desired QoS with TCP on a wireless channel.
Thesis (M.Sc.Eng.)-University of Natal, Durban, 2001.