Link layer multi-priority frame forwarding

With increasing demand for multimedia and real-time applications, local area network (LAN) technologies are rapidly being upgraded to support Quality-of-Service (QoS). Many QoS-enabled LANs are making use of resource allocation mechanisms that can discriminate among traffic classes of different priorities. When such LANs are interconnected by bridges to form an extended LAN, it is necessary to upgrade the bridges so that they are QoS-enabled as well. For example, the IEEE 802.1p standard defines a framework for priority queuing in bridges. Alternatively, frame forwarding decisions at the link layer may be modified to recognize frame priorities and alternate paths may be used for differentiating QoS. In this paper, we describe a novel bridge protocol that can forward frames of different priorities using different paths. Our protocol ensures that the forwarding path of a higher priority frame is never longer than the forwarding path of a lower priority frame.published_or_final_versio

Bandwidth sensitive routing in diffServ networks with heterogeneous bandwidth requirements

This paper studies the problem of finding optimal routes for premium class traffic in a DiffServ network such that (1) loop-freedom is guaranteed in the entire network under hop-by-hop routing assumption; and (2) the maximum relative congestion among all links is minimized. This problem is called the Extended Optimal Premium Routing (eOPR) problem, which is proven to be NP-hard. We use the integer programming method to mathematically formulate the eOPR problem and find the optimal solutions for small scale networks. We also study heuristic algorithms in order to handle large scale networks. Simulation results are compared with the optimal solutions obtained by solving the integer programming models. The results show that the Bandwidth-inversion Shortest Path (BSP) algorithm can be a good candidate to route premium traffic in DiffServ networks.published_or_final_versio

QoS Multicast Routing with Heterogeneous Receivers

When supporting source-specific heterogeneous-receiver multimedia applications, a multicast tree is built among a source and the receivers such that the path from the source to each receiver satisfies the delay and bandwidth constraints. To optimize the network usage, it is desirable to find a multicast tree that minimizes the total bandwidth used while satisfying the different delay and bandwidth requirements of the receivers. For scalability reason, the desired protocol should require little or minimum storage in the sender and other on-tree routers. Moreover, to allow dynamic member join or leave, a receiver-initiated approach is more appropriate. In this paper, we describe our receiver-initiated QoS multicast protocol that aims at reducing the bandwidth used in building a multicast tree for heterogeneous receivers by actively identifying better sub-optimal paths. Our protocol does not require additional information to be stored in the on-tree routers, and it is able to construct a better sub-optimal tree than existing protocols.published_or_final_versio

Analysis of topology aggregation techniques for QoS routing

We study and compare topology aggregation techniques used in QoS routing. Topology Aggregation (TA) is defined as a set of techniques that abstract or summarize the state information about the network topology to be exchanged, processed, and maintained by network nodes for routing purposes. Due to scalability, aggregation techniques have been an integral part of some routing protocols. However, TA has not been studied extensively except in a rather limited context. With the continuing growth of the Internet, scalability issues of QoS routing have been gaining importance. Therefore, we survey the current TA techniques, provide methodology to classify, evaluate, and compare their complexities and efficiencies. ©2007 ACM.postprin

SELINDA: a secure, scalable and light-weight data collection protocol for smart grids

Security in the smart grid is a challenge as an increasing number of sensors and measurement devices are connected to the power grid. General purpose security protocols are not suitable for providing data security to devices with limited memory, computational power and network connectivity. In this paper, we develop a secure and light-weight scalable security protocol that allows a power system operator (PO) to collect data from measurement devices (MDs) using data collectors (DCs). The security protocol trades off between computations and device memory requirements and provides flexible association between DC and MDs. These features allow data to be securely transferred from MDs to PO via mobile or untrustworthy DCs. We analyze the complexity and security of the protocol and validate its performance using experiments. Our results confirm that our proposed protocol collects data in a secure, fast and efficient manner. © 2013 IEEE.published_or_final_versio

Encaminhamento óptimo do tráfego em redes Triple Play

A Internet é responsável pelo surgimento de um novo paradigma de televisão – IPTV (Televisão sobre IP). Este serviço distingue-se de outros modelos de televisão, pois permite aos utilizadores um elevado grau de interactividade, com um controlo personalizado sobre os conteúdos a que pretende assistir. Possibilita ainda a oferta de um número ilimitado de canais, bem como o acesso a conteúdos de Vídeo on Demand (VoD). O IPTV apresenta diversas funcionalidades suportadas por uma arquitectura complexa e uma rede convergente que serve de integração a serviços de voz, dados e vídeo. A tecnologia IPTV explora ao máximo as características da Internet, com a utilização de mecanismos de Qualidade de Serviço. Surge ainda como uma revolução dentro do panorama televisivo, abrindo portas a novos investimentos por parte das empresas de telecomunicações. A Internet também permite fazer chamadas telefónicas sobre a rede IP. Este serviço é denominado VoIP (Voz sobre IP) e encontra-se em funcionamento já há algum tempo. Desta forma surge a oportunidade de poder oferecer ao consumidor final, um serviço que inclua os serviços de Internet, de VoIP e de IPTV denominado serviço Triple Play. O serviço Triple Play veio obrigar a revisão de toda a rede de transporte de forma a preparar a mesma para suportar este serviço de uma forma eficiente (QoS), resiliente (recuperação de falhas) e optimizado (Engenharia de tráfego). Em redes de telecomunicações, tanto a quebra de uma ligação como a congestão nas redes pode interferir nos serviços oferecidos aos consumidores finais. Mecanismos de sobrevivência são aplicados de forma a garantir a continuidade do serviço mesmo na ocorrência de uma falha. O objectivo desta dissertação é propor uma solução de uma arquitectura de rede capaz de suportar o serviço Triple Play de uma forma eficiente, resiliente e optimizada através de um encaminhamento óptimo ou quase óptimo. No âmbito deste trabalho, é realizada a análise do impacto das estratégias de encaminhamento que garantem a eficiência, sobrevivência e optimização das redes IP existentes, bem como é determinado o número limite de clientes permitido numa situação de pico de uma dada rede. Neste trabalho foram abordados os conceitos de Serviços Triple Play, Redes de Acesso, Redes Núcleo, Qualidade de Serviço, MPLS (Multi-Protocolo Label Switching), Engenharia de Tráfego e Recuperação de falhas. As conclusões obtidas das simulações efectuadas através do simulador de rede NS-2.33 (Network Simulator versão 2.33) serviram para propor a solução da arquitectura de uma rede capaz de suportar o serviço Triple Play de uma forma eficiente, resiliente e optimizada.Orientador: Paulo Nazareno Maia Sampai