A substantial increase in the number of internet users and the traffic volume bring new challenges for network router design. The current routers need to support higher link data rates and large number of line cards to accommodate the growth of the internet traffic, which necessitate an increase in physical space, power and memory use. Packet forwarding, which is one of the major tasks of a router, has been a performance bottleneck in internet infrastructure. In general, most of the packet forwarding algorithms are implemented in software. However, hardware based solutions has also been popular in recent years because of their high throughput performance. Besides throughput, memory efficiency, incremental/dynamic updates and power consumption are the basic performance challenges for packet forwarding architectures. Hardware-based packet forwarding engines for network routers can be categorized into two groups that are ternary content addressable memory (TCAM) based and dynamic/static random access memory (DRAM/SRAM) based solutions. TCAM-based architectures are simple and hence popular solutions for today&rsquo / s routers. However, they are expensive, power-hungry, and oer little adaptability to new addressing and routing protocols. On the other hand, SRAM has higher density, lower power consumption, and higher speed. The common data structure used in SRAM-based solutions for performing longest prefix matching (LPM) is some type of a tree. In these solutions, multiple memory accesses are required to find the longest matched prefix. Therefore, parallel and pipelining techniques are used to improve the throughput. This thesis studies TCAM and SRAM based parallel and pipelined architectures for high performance packet forwarding. We proposed to use a memory efficient disjoint prefix set algorithm on TCAM based parallel IP packet forwarding engine to improve its performance. As a fundamental contribution of this thesis, we designed an SRAM based parallel, intersecting and variable length multi-pipeline array structure (SAFIL) for trie-based internet protocol (IP) lookup. We also proposed a novel dual port SRAM based high throughput IP lookup engine (SAFILD) which is built upon SAFIL. As an alternative to traditional binary trie, we proposed a memory efficient data structure called compact clustered trie (CCT) for IP lookup. Furthermore, we developed a novel combined length-infix pipelined search (CLIPS) architecture for high performance IPv4/v6 lookup on FPGA. Finally, we designed a memory efficient clustered hierarchical search structure (CHSS) for packet classification. A linear pipelined SRAM-based architecture for CHSS which is implemented on FPGA is also proposed.

<p>A design of anautomatic network capacity markets, oftenreferred to as a bandwidth market, is presented. Three topicsare investigated. First, a network model is proposed. Theproposed model is based upon a trisection of the participantroles into network users, network owners, and market middlemen.The network capacity is defined in a way that allows it to betraded, and to have a well defined price. The network devicesare modeled as core nodes, access nodes, and border nodes.Requirements on these are given. It is shown how theirfunctionalities can be implemented in a network. Second, asimulated capacity market is presented, and a statisticalmethod for estimating the price dynamics in the market isproposed. A method for pricing network services based on sharedcapacity is proposed, in which the price of a service isequivalent to that of a financial derivative contract on anumber of simple capacity shares.Third, protocols for theinteraction between the participants are proposed. The marketparticipants need to commit to contracts with an auditableprotocol with a small overhead. The proposed protocol is basedon a public key infrastructure and on known protocols for multiparty contract signing. The proposed model allows networkcapacity to be traded in a manner that utilizes the networkeciently. A new feature of this market model, compared to othernetwork capacity markets, is that the prices are not controlledby the network owners. It is the end-users who, by middlemen,trade capacity among each-other. Therefore, financial, ratherthan control theoretic, methods are used for the pricing ofcapacity.</p><p><b>Keywords:</b>Computer network architecture, bandwidthtrading, inter-domain Quality-of-Service, pricing,combinatorial allocation, financial derivative pricing,stochastic modeling</p>

Current telecommunication infrastructure is undergoing significant changes. Such changes involve the type of traffic traveling through the network as well as the requirements imposed by the new traffic mix (e.g. strict delay control and low end-to-end delay). In this new networking scenario, the current infrastructure, which remained almost unchanged for the last several decades, is struggling to adapt, and its limitations in terms of power consumption, scalability, and economical viability have become more evident. In this dissertation we explore the potential advantages of using periodic data structures to handle efficiently bandwidth-intensive transactions, which constitute a significant portion of today's network traffic. We start by implementing an approach that can work as a standalone system aiming to provide the same advantages promised by all-optical approaches such as OBS and OFS. We show that our approach is able to provide similar advantages (e.g. energy efficiency, link utilization, and low computational load for the network hardware) while avoiding the drawbacks (e.g. use of optical buffers, inefficient resource utilization, and costly deployment), using commercially available hardware. Aware of the issues of large scale hardware redeployment, we adapt our approach to work within the current transport network architecture, reusing most of the hardware and protocols that are already in place, offering a more gradual evolutionary path, while retaining the advantages of our standalone system. We then apply our approach to Data Center Networks (DCNs), showing its ability to achieve significant improvements in terms of network performance stability, predictability, performance isolation, agility, and goodput with respect to popular DCN approaches. We also show our approach is able to work in concert with many proposed and deployed DCN architectures, providing DCNs with a simple, efficient, and versatile protocol to handle bandwidth-intensive applications within the DCs. / Graduate

Orientador: Eleri Cardozo / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-16T06:51:09Z (GMT). No. of bitstreams: 1 Badan_TomasAntonioCosta_D.pdf: 1510212 bytes, checksum: 73618c2b1cfc1df892bb1bd071694ef9 (MD5) Previous issue date: 2010 / Resumo: A próxima geração da telefonia celular, 4G, será totalmente baseada no protocolo IP. Para o usuário final, a expectativa é estar constantemente conectado à esta rede, no qual a característica fundamental será a mobilidade transparente do dispositivo móvel, entre as várias subredes que compõem um domínio administrativo. Esta tese tem por objetivo propor uma solução para o problema da mobilidade transparente do dispositivo móvel em redes IP. Como consequência, duas contribuições são alcançadas. A primeira é a especificação de uma arquitetura que permita localizar e rastrear o dispositivo móvel em um domínio administrativo, que seja independente da tecnologia de túneis utilizada na camada de rede. A segunda é a proposição de um método de rastreamento do dispositivo móvel em redes MPLS, preservando as especificações do protocolo MPLS. É mostrado também como este método foi integrado com a arquitetura previamente definida. Por fim, é descrita como essa proposta de rastreamento em redes MPLS foi implementada sobre o sistema operacional Linux e os testes realizados para avaliar, tanto a implementação desta proposta, quanto a sua integração com essa arquitetura / Abstract: The next generation of cellular telephony, 4G, is going to be totally based on the IP protocol. The end user expects to be constantly connected to this network, in which the key feature Will be the seamless mobility of the mobile device among the various subnets within an administrative domain. This thesis has as objective to propose a solution to the problem of seamless mobility of the mobile device in IP networks. As such, two contributions are achieved. The first one is the specification of an architecture able to locate and track the mobile device inside an administrative domain, being independent of the tunnel technology used in the network layer. The second one is the proposition of a method to track the mobile device inside a MPLS networks, keeping intact the specifications of the MPLS protocol. It is also shown how this method was integrated with the previously defined architecture. Finally, it is described how the proposed method to track mobile devices inside a MPLS network was implemented on the Linux operating system, and the tests performed in order to assess both the implementation of this proposal and its integration with this architecture / Doutorado / Engenharia de Computação / Doutor em Engenharia Elétrica

Orientador: Edmundo Roberto Mauro Madeira / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-08T13:56:53Z (GMT). No. of bitstreams: 1 Malheiros_NeumarCosta_M.pdf: 2725607 bytes, checksum: f54c00065fc570ea3f84ae73359abcf8 (MD5) Previous issue date: 2006 / Resumo: Um plano de controle distribuído, como a arquitetura GMPLS (Generalized Multiprotocol Label Switching), permite o aprovisionamento dinâmico de conexões em redes de transporte de camada 1, como redes ópticas ou redes TDM (Time Division Multiplexing). Dessa forma, essas redes podem oferecer serviços mais sofisticados como serviços VPN (Virtual Private Network). Esses serviçõs, então denominados VPN de camada 1 (L1VPN - Layer 1 VPN), permitem que a infra-estrutura de transporte do provedor seja compartilhada entre múltiplas redes clientes. Neste trabalho, é proposta uma arquitetura para gerência de serviços L1VPN. A abordagem foi utilizar o paradigma de Gerência Baseada em Políticas (PBM ? Policy-Based Management) para prover aos clientes um certo nível de controle e gerência sobre suas L1VPNs. Além disso, é apresentada a implementação de um protótipo da arquitetura proposta, assim como uma discussão das implicações de diferentes políticas para a gerência de configuração de serviços L1VPN, a partir de um estudo de caso / Abstract: A distributed control plane architecture as GMPLS enhances transport networks with dynamic connection control. As a result, it allows the provisioning of advanced connectivity services, like Virtual Private Networks (VPNs), on layer 1 switching networks as optical and TDM networks. Such Layer 1 VPN (L1VPN) services enable multiple customer networks to share a single transport network. In this work, an architecture for L1VPN management is proposed. The approach is based on Policy-Based Management (PBM) to provide customers with some level of control and management over their L1VPNs. Furthermore, a prototype implementation of the proposed architecture is presented and from a case study implications of different policies for L1VPN service configuration management are discussed. / Mestrado / Mestre em Ciência da Computação

Orientador: Leonardo de Souza Mendes / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-16T02:53:37Z (GMT). No. of bitstreams: 1 Pires_FelipeMarques_M.pdf: 6804848 bytes, checksum: 1b9ecab60b98ed0975059c3aa99c84b1 (MD5) Previous issue date: 2010 / Resumo: Os avanços nas áreas de comunicação sem fio e microeletrônica têm motivado o desenvolvimento de aplicações utilizando equipamentos sem fio, especialmente dispositivos sensores e atuadores, permitindo assim, a criação de uma ponte tecnológica para conectar o mundo físico com o mundo digital. Com essa interação surge uma demanda crescente por sistemas de monitoramento e controle em ambientes industriais, residenciais e também municipais. Algumas tecnologias já se encontram no mercado, destinadas a este tipo de aplicação e dentre elas destaca-se a especificação ZigBee. Entretanto, aplicações em cenários metropolitanos exigem um paradigma de comunicação com alta capacidade e de larga escala. Este trabalho apresenta uma arquitetura híbrida e hierárquica de rede de sensores/atuadores para aplicação em cenários metropolitanos. A arquitetura proposta faz uso do potencial da especificação ZigBee e da capacidade das Redes Metropolitanas de Acesso Aberto. Baseado em tal arquitetura, um estudo de caso foi desenvolvido na cidade de Pedreira, interior do estado de São Paulo, onde foi implementado um sistema para supervisão do fluxo de pessoas, monitoramento do ambiente e controle de dispositivos em um prédio do setor público. / Abstract: The advances in wireless communication technology and microelectronics have enable interesting new application for wireless devices, especially sensor and actuator devices, allowing to have an interaction between digital and physical worlds. With this interaction appeared an increasing demand for remote monitoring and control systems in industrial, residential and also municipal environments. Some technologies are already met in the market, destined to this type of application and amongst them the ZigBee specification is distinguished. However, these application applied in metropolitan scenarios require a large scale communication paradigm with high capacity. This work presents a hybrid hierarchical architecture to design a sensor and actuator network to operate in metropolitan scenarios. The architecture combines ZigBee specification with Open Access Metropolitan Area Networks. Based on the proposed architecture a case study was developed in the city of Pedreira-SP, where a people-counting system and an environmental monitoring and control prototype were designed in a public building. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Orientadores: Leonardo de Souza Mendes, Gean Davis Breda / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-25T22:42:14Z (GMT). No. of bitstreams: 1 Morbach_RodrigoAparecido_M.pdf: 6817330 bytes, checksum: b3d510c5e32fb48e86b946edc2d3ce43 (MD5) Previous issue date: 2014 / Resumo: As Cidades Digitais, viabilizadas pelo grande desenvolvimento alcançado pelas Tecnologias da Informação e das Comunicações nos últimos 30 anos, surgem hoje como um novo paradigma nestas áreas. As Cidades Digitais promovem grandes benefícios para a população e para o governo, através de ambientes virtuais de oferecimento de serviços, por meio de redes de comunicações digitais. Nesse cenário, as redes de sensores, principalmente as redes sem fio, desempenham papel fundamental para permitir a coleta de dados em tempo real no âmbito municipal, produzindo grande quantidade de informações importantes para fins de análise, previsão e tomada de decisão. Esse cenário permite o monitoramento de uma grande variedade de dados e informações. Sendo assim, são utilizados diferentes tipos de redes de sensores em termos de hardware e software. Essa heterogeneidade de dispositivos e de tecnologia resulta em ilhas de sistemas, restritos à domínios específicos de aplicação, prejudicando o gerenciamento das redes e a interoperabilidade entre as aplicações. Diante desse cenário, esse trabalho propõe uma arquitetura para monitoramento e gerenciamento de redes sensoras em Cidades Digitais. A arquitetura proposta é baseada no conceito de orientação a serviços, proporcionando independência de plataforma e interoperabilidade no monitoramento de redes heterogêneas, além de promover o compartilhamento de dados com sistemas externos de modo padronizado. A arquitetura explora o potencial de Redes Metropolitanas de Acesso Aberto para constituir um sistema sensor em escala municipal. Como prova de conceito, um estudo de caso foi realizado na Cidade Digital de Pedreira, concebida sobre a infraestrutura de uma Rede Metropolitana de Acesso Aberto. Os resultados mostram a viabilidade da proposta e expõem as oportunidades oferecidas pela arquitetura / Abstract: Digital Cities, fostered by the great development reached by Information and Communication Technologies in the last 30 years, arise today as a new paradigm in those areas. A Digital City promotes important benefits for both citizens and government by means of virtual environments for providing services through digital communications networks. In this setting, sensor networks play important role in order to gather real time data in urban scale, providing large and important amount of data for analysis, forecasting and decision making. There are a wide range of variables to be monitored in a Digital City. Thus, heterogeneous sensor networks related to hardware and software have been employed. Such diversity of devices and technologies yields systems islands constrained to specific application domains. This feature impacts on networks management and interoperability between systems. Given this scenario, this work presents an architecture for monitoring and managing sensor networks in Digital Cities. The proposed architecture is based on the concept of services, providing plataform independence and interoperability, and also promoting data sharing. The architeture takes the advantages of Open Access Metropolitan Networks to set up a urban scale sensor network. As proof of concept a study case took place in the Digital City of Pedreira. The results show the feasibility of the proposal and the opportunities presented by the architecture / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

No description available.

Dans cette thèse, nous étudions la solution LOCARN : ''Low Opex & Capex Architecture for Resilient Networks''. LOCARN est une architecture de réseaux paquet alternative conçue dans une optique de simplicité de sa structure et ses mécanismes tout en permettant par sa conception la résilience et l'auto-adaptation des services de transport clients. Compte tenu de la complexification croissante des réseaux de transport opérateurs ces dernières décennies, nous prenons ces réseaux comme cas d'usage privilégié. Dans ce cadre, LOCARN permet une simplification considérable des composants et de leur gestion en comparaison des solutions actuelles des opérateurs – ce qui implique respectivement des réductions de CAPEX et d'OPEX. Dans le travail qui suit, nous présentons LOCARN techniquement et mettons en évidence ses intérêts pour les opérateurs par rapport aux autres technologies de transport. Puis, la question prioritaire étant la capacité de mise à l'échelle de LOCARN pour des réseaux de grandes dimensions, nous étudions cette question en détails ce qui nous permet d'établir que l'architecture est tout à fait capable de passer à l'échelle dans des réseaux de transport réalistes. En outre, pour améliorer les performances nous avons également spécifié et évalué deux améliorations de conception permettant à l'architecture de transporter d'un très grand nombre de services, les résultats obtenus sont très encourageants. / In this thesis, we study the LOCARN solution “Low Opex & Capex Architecture for Resilient Networks". LOCARN is an alternative packet network architecture that has been conceived with a special attention to the simplicity of its structure and mechanisms while allowing by design the resiliency and the self-adaptation of clients transportation services. Considering the growing complexification of operators transport networks during the last decades, we consider these latter as the privileged use case. In such a context, LOCARN would allow a drastical simplification of devices and their operation compared to common operator solutions – this involves respectively reductions of CAPEX and OPEX. In this work, we first present LOCARN technically and we bring out its interests for operators beside other transport technologies. Then, since the primary issue of LOCARN is it scalability for large networks, we study this point in details which allow us to establish that the architecture is altogether capable to scale in realistics transport networks. Moreover, to increase the performances we specified two design improvements allowing the architecture to transport a huge amount of clients, the obtained results are very encouraging.

Rather than being randomly wired together, the components of complex network systems are recently reported to represent a scale-free architecture, in which the node degree distribution follows power-law. While social networks are scale-free, it is natural to utilize their structural properties in some social network applications. As a result, this dissertation explores social network architectures, and in turn, leverages these architectures to facilitate some influence and information propagation applications. Social network architectures are analyzed in two different aspects. The first aspect focuses on the node degree snowballing effects (i.e., degree growth effects) in social networks, which is based on an age-sensitive preferential attachment model. The impact of the initial links is explored, in terms of accelerating the node degree snowballing effects. The second aspect focuses on Nested Scale-Free Architectures (NSFAs) for social networks. The scale-free architecture is a classic concept, which means that the node degree distribution follows the power-law distribution. `Nested' indicates that the scale-free architecture is preserved when low-degree nodes and their associated connections are iteratively removed. NSFA has a bounded hierarchy. Based on the social network structure, this dissertation explores two influence propagation applications for the Social Influence Maximization Problem (SIMP). The first application is a friend recommendation strategy with the perspective of social influence maximization. For the system provider, the objective is to recommend a fixed number of new friends to a given user, such that the given user can maximize his/her social influence through making new friends. This problem is proved to be NP-hard by reduction from the SIMP. A greedy friend recommendation algorithm with an approximation ratio of $1-e^{-1}$ is proposed. The second application studies the SIMP with the crowd influence, which is NP-hard, monotone, non-submodular, and inapproximable in general graphs. However, since user connections in Online Social Networks (OSNs) are not random, approximations can be obtained by leveraging the structural properties of OSNs. The modularity, denoted by $\Delta$, is proposed to measure to what degree this problem violates the submodularity. Two approximation algorithms are proposed with ratios of $\frac{1}{\Delta+2}$ and $1-e^{-1/(\Delta+1)}$, respectively. Beside the influence propagation applications, this dissertation further explores three different information propagation applications. The first application is a social network quarantine strategy, which can eliminate epidemic outbreaks with minimal isolation costs. This problem is NP-hard. An approximation algorithm with a ratio of 2 is proposed through utilizing the problem properties of feasibility and minimality. The second application is a rating prediction scheme, called DynFluid, based on the fluid dynamics. DynFluid analogizes the rating reference among the users in OSNs to the fluid flow among containers. The third application is an information cascade prediction framework: given the social current cascade and social topology, the number of propagated users at a future time slot is predicted. To reduce prediction time complexities, the spatiotemporal cascade information (a larger size of data) is decomposed to user characteristics (a smaller size of data) for subsequent predictions. All these three applications are based on the social network structure. / Computer and Information Science