Yes / A new generation of satellite systems that support regenerative on-board processors (OBPs) and multiple spot beam technology have opened new and efficient possibilities of implementing IP multicast communication over satellites. These new features have widened the scope of satellite-based applications and also enable satellite operators to efficiently utilize their allocated bandwidth resources. This makes it possible to provide cost effective satellite network services. IP multicast is a network layer protocol designed for group communication to save bandwidth resources and reduce processing overhead on the source side. The inherent broadcast nature of satellites, their global coverage (air, land, and sea), and direct access to a large number of subscribers imply satellites have unrivalled advantages in supporting IP multicast applications. IP mobility support in general and IP mobile multicast support in particular on mobile satellite terminals like the ones mounted on long haul flights, maritime vessels, continental trains, etc., still remain big challenges that have received very little attention from the research community. This paper proposes how Proxy Mobile IPv6 (PMIPv6)-based IP multicast mobility support defined for terrestrial networks can be adopted and used to support IP mobile multicast in future satellite networks, taking cognizance of the trend in the evolution of satellite communications.

<p>The study of Internet traffic behavior in a real IP network is the subject of this thesis. Traffic Matrix of a telecommunication network represents the exchanged traffic volume between the source and destination nodes in the network and is a critical input for network studies. However, in most cases, traffic matrices are not readily available. Existing network management protocols such as the ‘Simple Network Management Protocol’ (SNMP) have been used to gather other observable measures, such as link load observations. The first part of this thesis reviews famous methods and approaches that try to infer and estimate the source-destination traffic matrix from the observable link loads.</p> <p>Another important subject in networks is to predict bandwidth requirements in the future. The second part of this thesis reviews some existing methods and approaches of traffic prediction. Recently a traffic prediction method which uses multiple Time-Series analysis, each operating on a different time-scale, has been proposed. This method uses multiple ‘AutoRegressive Integrated Moving Average’ (ARIMA) filters to predict the future bandwidth requirements. Each ARIMA filter operates on a different time scale, i.e., quarter-hour, hour, day, and week. The proposed method associates a weight with each ARIMA filter, and adjusts the weights according to which filter is currently the most accurate predictor. A review of this newly proposed method is presented. Extensive experimental results have been gathered to test the robustness of the method. The filter coefficients of each ARIMA filter have been varied, and the accuracy of the predicted traffic has been measured. Extensive experimental measurements indicate that the model is very robust, and that large changes to each filter's coefficients have only a small effect on the accuracy. In all cases we evaluated, the method is very robust, predicting short-term future traffic demands with typically ≈95% success rates.</p> / Master of Applied Science (MASc)

The problem of providing Quality of Service (QoS) in the Internet has been an extremely active area of research and various mechanisms have been proposed related to this subject. Developing network applications have requirements such as bounded delay, jitter, minimum bandwidth and maximum loss rate. There is also a need to support large bandwidth networks because of growing link speeds. Previous QoS efforts did not fully satisfy all these needs of future networks but more recent approaches aim to be both scalable and rich in the provision of guaranteed services. Consequently core-stateless systems received much attention in recent years because of their scalability in supporting per-flow QoS. The property of not maintaining any per-flow state in the core routers is known as being core-stateless. In this thesis study, the need for core-stateless network architectures is pointed out and a literature survey about these schemes is carried out. Core-Stateless Guaranteed Fair (CSGF) network architecture, which provides deterministic fairness guarantees in a work-conserving manner, is selected and evaluated. Simulation studies about stateful Virtual Clock (VC) algorithm and CSGF&rsquo / s sub-protocols Core-Stateless Virtual Clock (CSVC), Core-Stateless Guaranteed Throughput (CSGT) and Core-Stateless Guaranteed Fairness (CSGF) are presented. Finally, the deficiencies in fairness of CSGF are demonstrated.

La quantité de données devant être transportée via les réseaux de cœur croit de près de 25% par an. Pour maîtriser les coûts, les différentes couches du réseau doivent mettre des informations en commun pour inclure de plus en plus de paramètres lors du dimensionnement du réseau. Cela s’appelle « dimensionnement multicouche ». Nous étudions le dimensionnement multicouche de réseaux statiques composés de deux couches utilisant la commutation en mode circuit (typiquement IP-sur-WDM). Nous proposons un modèle semi-analytique expliquant le comportement des algorithmes responsables de l’agrégation et du routage dans les deux couches. Ce cadre théorique permet de comparer les algorithmes de dimensionnement multicouche entre eux, mais aussi d’expliquer et d’améliorer leur efficience. Nous décrivons ensuite comment la contrainte de portée optique affecte les résultats d’un algorithme de dimensionnement multicouche. Enfin, nous expliquons comment ces résultats s'appliquent au dimensionnement des réseaux de nouvelle génération (dynamiques et hétérogènes en capacité optique) / The traffic passing through core networks grows by nearly 25% each year. To bring the costs under control, the different network layers of the network should work together to include more and more parameters during the network planning phase. This is called “multilayer network planning”. We study the multilayer network planning of static networks composed of two circuit switched layers (typically IP-over-WDM). We propose a semi-analytical model explaining the behavior of algorithms responsible for aggregation and routing in both layers. This theory allows comparing multilayer planning algorithms between them, but also explaining and enhancing their efficiency. We then describe the impact of the optical reach constraint in WDM networks on the results of a multilayer planning algorithm. Finally, we explain how these results apply to the design of future networks (dynamic and with heterogeneous optical layers)

Orientador: Leonardo de Souza Mendes / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-14T09:31:29Z (GMT). No. of bitstreams: 1 Garcia_MarcosEduardoCoelho_M.pdf: 1970364 bytes, checksum: 9f8f5fa500e4831f5d7be68883a34f05 (MD5) Previous issue date: 2009 / Resumo: O comportamento de tráfegos VoIP em enlaces de rede é abordado neste trabalho. As aplicações VoIP possuem requisitos rígidos de Qualidade de Serviço (QoS) que devem ser previstos no projeto da rede. Neste sentido, é apresentado o Processo Poissoniano Modulado por Markov (MMPP) como um processo de chegadas adequado para caracterizar o comportamento de tráfegos VoIP sobrepostos. É levado em conta que as aplicações VoIP usam o mecanismo Supressão de Silêncio para economizar largura de banda, o que torna o tráfego muito variável e com chegadas em rajadas. Para análise do comportamento do enlace, é utilizado o modelo de fila MMPP/M/1. Para avaliar a viabilidade do modelo, foram feitos estudos comparativos com resultados do simulador ns-2. / Abstract: The behavior of VoIP traffic in network links is addressed in this work. VoIP applications have strict requirements for quality of service (QoS) that should be provided for in the network design. In this sense, the Markov Modulated Poisson Process (MMPP) is displayed as model of process of arrivals that is appropriate to characterize the behavior of superposition of VoIP traffic sources. It is taken into account that VoIP applications use the mechanism Suppression of Silence to save bandwidth, which makes the traffic very variable and with bursty arrivals. In order to analyze the behavior of the link, the MMPP/M/1 queue model is used. To evaluate the viability of the model, comparative studies were made with results of the ns-2 simulator. / Mestrado / Telecomunicações / Mestre em Engenharia Elétrica

Made available in DSpace on 2016-08-17T14:52:57Z (GMT). No. of bitstreams: 1 Jose Coelho de Melo.pdf: 1424511 bytes, checksum: 76fbc2d3ff58f82123072e2b8323be1a (MD5) Previous issue date: 2005-03-14 / This work presents several ways of using mechanisms of Quality of Service (QoS) in networks hardwired for links of short band. It is demonstrated that the use of mechanisms of QoS brings profits of performance for priority applications and rationality in the use of band resources. The work is developed in a test platform of Previdência Social. Implementations of the PHBs EF, Afs and BE are tested. The work has evaluated the capacities to offer guaranteed band, traffic priority, conditioning of traffic and the impact of the competition between traffic classes. The experiments are mounted using the architecture of differentiated services (DiffServ) of platform Cisco, that is the standard in the network of the Previdência Social and are manipulated the mechanisms of classification, control of congestion, policing and conformation of traffic. The results give subsidy for implementation of some models of QoS in IP networks, mainly for those that serve short band. / Este trabalho apresenta diversas maneiras de utilização dos mecanismos de Qualidade de Serviço (QoS) em redes ligadas por enlaces de banda estreita. É demonstrado que o uso de mecanismos de QoS traz ganhos de performance aos aplicativos prioritários e racionalidade no uso de recursos de banda. O trabalho é desenvolvido em uma plataforma de teste que retrata um seguimento da rede da Previdência Social. São testadas possíveis implementações dos PHBs EF, Afs e BE. São avaliadas as capacidades de oferecer largura de banda garantida, priorização de tráfego, condicionamento de tráfego e o impacto da concorrência entre classes de tráfego. Os experimentos são montados utilizando a arquitetura de serviços diferenciados (DiffServ) da plataforma Cisco, que é o padrão na rede da Previdência Social, e são manipulados os mecanismos de classificação, controle de congestionamento, policiamento e conformação de tráfego. O resultado apresentado dá subsídio para implementação de vários modelos de QoS em redes IP, principalmente para redes servidas por banda estreita.

This thesis deals with the Longest Prefix Matching (LPM), which is a time-critical operation in packet forwarding. To achieve 100Gbps throughput, this operation has to be implemented in hardware and a forwarding table has to fit into the on-chip memory, which is limited by its small size. Current LPM algorithms need large memory to store IPv6 forwarding tables or cannot be simply implemented in HW. Therefore we performed an analysis of available IPv6 forwarding tables and several LPM algorithms. Based on this analysis, we propose a new algorithm which is able to provide very low memory demands for IPv4/IPv6 lookups. To the best of our knowledge, the proposed algorithm has the lowest memory requirements in comparison to existing LPM algorithms. Moreover, the proposed algorithm is suitable for IP lookup in 100Gbps networks, which is shown on new pipelined hardware architecture with 140Gbps throughput.

<p>  </p> <p>Advances in technology have led to the availability of data from different platforms such as the web and social media platforms. Much of this data can be represented in the form of a network consisting of a set of nodes connected by edges. The nodes represent the items in the networks while the edges represent the interactions between the nodes. Community detection methods have been used extensively in analyzing these networks. However, community detection in evolving networks has been a significant challenge because of the frequent changes to the networks and the need for real-time analysis. Using Static community detection methods for analyzing dynamic networks will not be appropriate because static methods do not retain a network’s history and cannot provide real-time information about the communities in the network.</p> <p>Existing incremental methods treat changes to the network as a sequence of edge additions and/or removals; however, in many real-world networks, changes occur when a node is added with all its edges connecting simultaneously. </p> <p>For efficient processing of such large networks in a timely manner, there is a need for an adaptive analytical method that can process large networks without recomputing the entire network after its evolution and treat all the edges involved with a node equally. </p> <p>We proposed a node-centric community detection method that incrementally updates the community structure in the network using the already known structure of the network to avoid recomputing the entire network from the scratch and consequently achieve a high-quality community structure. The results from our experiments suggest that our approach is efficient for incremental community detection of node-centric evolving networks. </p>