996 research outputs found

    Flexible Application-Layer Multicast in Heterogeneous Networks

    Get PDF
    This work develops a set of peer-to-peer-based protocols and extensions in order to provide Internet-wide group communication. The focus is put to the question how different access technologies can be integrated in order to face the growing traffic load problem. Thereby, protocols are developed that allow autonomous adaptation to the current network situation on the one hand and the integration of WiFi domains where applicable on the other hand

    Worst-case delay control in multigroup overlay networks

    Get PDF
    This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of end host multicast (EMcast) when the traffic load becomes heavy in a multigroup network with real-time flows constrained by (sigma, rho) regulators. The control algorithm is implemented at the overlay networks and provides more regulations through a novel (sigma, rho, lambda) regulator at each group end host who suffers from heavy input traffic. To our knowledge, it is the first work to incorporate traffic regulators into the end host multicast to control heavy traffic output. Our further contributions include a theoretical analysis and a set of results. We prove the existence and calculate the value of the rate threshold rho* such that for a given set of K groups, when the average rate of traffic entering the group end hosts rho macr > rho*, the ratio of the worst-case multicast delay bound of the proposed (sigma, rho, lambda) regulator over the traditional (sigma, rho) regulator is O(1/Kn) for any integer n. We also prove the efficiency of the novel algorithm and regulator in decreasing worst-case delays by conducting computer simulations

    Towards video streaming in IoT environments: vehicular communication perspective

    Get PDF
    Multimedia oriented Internet of Things (IoT) enables pervasive and real-time communication of video, audio and image data among devices in an immediate surroundings. Today's vehicles have the capability of supporting real time multimedia acquisition. Vehicles with high illuminating infrared cameras and customized sensors can communicate with other on-road devices using dedicated short-range communication (DSRC) and 5G enabled communication technologies. Real time incidence of both urban and highway vehicular traffic environment can be captured and transmitted using vehicle-to-vehicle and vehicle-to-infrastructure communication modes. Video streaming in vehicular IoT (VSV-IoT) environments is in growing stage with several challenges that need to be addressed ranging from limited resources in IoT devices, intermittent connection in vehicular networks, heterogeneous devices, dynamism and scalability in video encoding, bandwidth underutilization in video delivery, and attaining application-precise quality of service in video streaming. In this context, this paper presents a comprehensive review on video streaming in IoT environments focusing on vehicular communication perspective. Specifically, significance of video streaming in vehicular IoT environments is highlighted focusing on integration of vehicular communication with 5G enabled IoT technologies, and smart city oriented application areas for VSV-IoT. A taxonomy is presented for the classification of related literature on video streaming in vehicular network environments. Following the taxonomy, critical review of literature is performed focusing on major functional model, strengths and weaknesses. Metrics for video streaming in vehicular IoT environments are derived and comparatively analyzed in terms of their usage and evaluation capabilities. Open research challenges in VSV-IoT are identified as future directions of research in the area. The survey would benefit both IoT and vehicle industry practitioners and researchers, in terms of augmenting understanding of vehicular video streaming and its IoT related trends and issues

    Quality of service aware data dissemination in vehicular Ad Hoc networks

    Full text link
    Des systĂšmes de transport intelligents (STI) seront Ă©ventuellement fournis dans un proche avenir pour la sĂ©curitĂ© et le confort des personnes lors de leurs dĂ©placements sur les routes. Les rĂ©seaux ad-hoc vĂ©hiculaires (VANETs) reprĂ©sentent l'Ă©lĂ©ment clĂ© des STI. Les VANETs sont formĂ©s par des vĂ©hicules qui communiquent entre eux et avec l'infrastructure. En effet, les vĂ©hicules pourront Ă©changer des messages qui comprennent, par exemple, des informations sur la circulation routiĂšre, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusĂ©s par des vĂ©hicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de rĂ©agir Ă  temps (p.ex., ralentir), les messages d'urgence doivent ĂȘtre diffusĂ©s de maniĂšre fiable dans un dĂ©lai trĂšs court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal Ă  pertes, les terminaux cachĂ©s, les interfĂ©rences et la bande passante limitĂ©e, qui compliquent Ă©normĂ©ment la satisfaction des exigences de fiabilitĂ© et de dĂ©lai des messages d'urgence. Dans cette thĂšse, en guise de premiĂšre contribution, nous proposons un schĂ©ma de diffusion efficace Ă  plusieurs sauts, appelĂ© Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; Ă  l'intĂ©rieur de la zone arriĂšre de l'expĂ©diteur, les partitions sont calculĂ©es de sorte qu'en moyenne chaque partition contient au moins un seul vĂ©hicule; l'objectif est de s'assurer que seul un vĂ©hicule dans la partition la plus Ă©loignĂ©e (de l'expĂ©diteur) est utilisĂ© pour diffuser le message, jusqu'au saut suivant; ceci donne lieu Ă  un dĂ©lai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mĂ©canisme d'Ă©tablissement de liaison, qui utilise des tonalitĂ©s occupĂ©es, est proposĂ© pour rĂ©soudre le problĂšme du problĂšme de terminal cachĂ©. Dans les VANETs, la Multidiffusion, c'est-Ă -dire la transmission d'un message d'une source Ă  un nombre limitĂ© de vĂ©hicules connus en tant que destinations, est trĂšs importante. Par rapport Ă  la diffusion unique, avec Multidiffusion, la source peut simultanĂ©ment prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'Ă©conomiser de la bande passante et de rĂ©duire la congestion du rĂ©seau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivitĂ© de l'arbre de multidiffusion est un problĂšme majeur. Comme deuxiĂšme contribution, nous proposons deux approches pour modĂ©liser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la premiĂšre approche considĂšre le nombre de segments de route impliquĂ©s dans l'arbre de multidiffusion et (ii) la seconde approche considĂšre le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposĂ©e pour chaque approche. Pour assurer la qualitĂ© de service de l'arbre de multidiffusion, des procĂ©dures efficaces sont proposĂ©es pour le suivi des destinations et la surveillance de la qualitĂ© de service des segments de route. Comme troisiĂšme contribution, nous Ă©tudions le problĂšme de la congestion causĂ©e par le routage du trafic de donnĂ©es dans les VANETs. Nous proposons (1) une approche de routage basĂ©e sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient dĂ©jĂ  les donnĂ©es dans les VANETs. Les nouvelles demandes de routage sont traitĂ©es de sorte qu'aucun segment de route ne soit surchargĂ© par plusieurs chemins de routage croisĂ©s. Au lieu d'acheminer les donnĂ©es en utilisant des chemins de routage sur un nombre limitĂ© de segments de route, notre approche Ă©quilibre la charge des donnĂ©es en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empĂȘcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basĂ©e sur le rĂ©seau dĂ©fini par logiciel (SDN) pour surveiller la connectivitĂ© VANET en temps rĂ©el et les dĂ©lais de transmission sur chaque segment de route. Les donnĂ©es de surveillance sont utilisĂ©es en entrĂ©e de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach

    Scalable download protocols

    Get PDF
    Scalable on-demand content delivery systems, designed to effectively handle increasing request rates, typically use service aggregation or content replication techniques. Service aggregation relies on one-to-many communication techniques, such as multicast, to efficiently deliver content from a single sender to multiple receivers. With replication, multiple geographically distributed replicas of the service or content share the load of processing client requests and enable delivery from a nearby server.Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. Analytic lower bounds developed in this thesis show that neither of these protocols consistently yields performance close to optimal. New hybrid protocols are proposed that achieve within 20% of the optimal delay in homogeneous systems, as well as within 25% of the optimal maximum client delay in all heterogeneous scenarios considered.In systems utilizing both service aggregation and replication, well-designed policies determining which replica serves each request must balance the objectives of achieving high locality of service, and high efficiency of service aggregation. By comparing classes of policies, using both analysis and simulations, this thesis shows that there are significant performance advantages in using current system state information (rather than only proximities and average loads) and in deferring selection decisions when possible. Most of these performance gains can be achieved using only “local” (rather than global) request information.Finally, this thesis proposes adaptations of already proposed peer-assisted download techniques to support a streaming (rather than download) service, enabling playback to begin well before the entire media file is received. These protocols split each file into pieces, which can be downloaded from multiple sources, including other clients downloading the same file. Using simulations, a candidate protocol is presented and evaluated. The protocol includes both a piece selection technique that effectively mediates the conflict between achieving high piece diversity and the in-order requirements of media file playback, as well as a simple on-line rule for deciding when playback can safely commence

    Avaliação de controlo de sessÔes multicast em redes com contexto

    Get PDF
    Mestrado em Engenharia ElectrĂłnica e TelecomunicaçÔesOs utilizadores pretendem aceder, cada vez mais, a serviços multimĂ©dia com requisitos mais exigentes e personalizados. As limitaçÔes impostas pelos ambientes existentes (internet, 3G) para fornecer estes serviços levam Ă  procura de melhores soluçÔes, nomeadamente uma gestĂŁo eficaz das sessĂ”es multiparty. Neste tipo de soluçÔes Ă© normalmente utilizado o multicast, jĂĄ que este permite reduzir os recursos utilizados, diminuindo o nĂșmero de pacotes na rede. Contudo, o multicast nĂŁo estĂĄ consistente ao nĂ­vel dos cenĂĄrios de mobilidade, fundamentais nas redes de prĂłxima geração. Actualmente existe uma vasta gama de tecnologias de acesso sem fios como WiFi, GPRS, UMTS e WiMAX. No futuro estas tecnologias diferentes complementar-se-ĂŁo convergindo numa infra-estrutura heterogĂ©nea capaz de fornecer um melhor serviço aos utilizadores, denominadas de redes 4G. A evolução dos terminais mĂłveis tambĂ©m permitirĂĄ que estes se liguem simultaneamente a vĂĄrias redes de acesso. Para uma melhor distribuição dos serviços dos utilizadores pelas redes de acesso disponĂ­veis sĂŁo necessĂĄrios novos mecanismos de selecção. Uma nova selecção da rede baseada em informação de contexto (entidades e ambiente) tem tido grande relevo na comunidade cientĂ­fica. Assim, aplicaçÔes e rede reagem a alteraçÔes de contexto para uma melhor selecção da mesma. A dissertação apresentada encontra-se no Ăąmbito do transporte multiparty com informação de contexto e reserva de recursos, permitindo a entrega do conteĂșdo de uma forma personalizada e com Qualidade de Serviço a vĂĄrios utilizadores mĂłveis, independentemente da tecnologia de acesso de cada um e da prĂłpria tecnologia da rede. Em suma, Ă© utilizada uma arquitectura de rede baseada em informação de contexto e que reage eficazmente a alteraçÔes do mesmo. De forma a implementar a proposta apresentada recorreu-se Ă  criação de vĂĄrias entidades no simulador de redes NS-2. Os resultados foram obtidos usando diferentes cenĂĄrios, avaliando a influĂȘncia de cada parĂąmetro individualmente. Demonstrou-se que a arquitectura implementada permite suportar uma entrega dos conteĂșdos de uma maneira personalizada e independente da tecnologia utilizada. Obteve-se ainda uma boa gestĂŁo dos recursos da rede e uma melhoria na experiĂȘncia percepcionada pelo utilizador atravĂ©s da selecção total da rede com base numa entidade de controlo central. A introdução do overlay de transporte multiparty melhora o comportamento geral da rede, minimizando as reconfiguraçÔes frequentes necessĂĄrias.Nowadays, more and more users want to access multimedia services with strong and personalized requirements. The limitations intrinsic to current environments (Internet and 3G) to provide this type of services motivate the research for an efficient management of multiparty sessions. The solution can also be based on multicast implementation, since it reduces resources utilization, decreasing the number of packets in the network. However, current multicast is not a strong solution in mobility scenarios, essential in next generation networks. Currently there is a wide range of wireless access technologies such as WiFi, GPRS, UMTS and WiMAX. In the future, these different technologies will converge in a complementary manner forming a heterogeneous infrastructure able to offer a better service to its users, usually named 4G. The evolution of mobile terminals will also allow them to connect simultaneously to several access networks. In order to a better distribution of the users services throughout available access networks, new selection mechanisms are required. A new network selection based on context information (entities and environments) is having a relevant role in scientific community. So, applications and networks react according to context changes, improving network selection. This Thesis is in the scope of context-aware multiparty transport with resources allocation, allowing the delivery of content in a personalized way with Quality of Service to several users, independently of the technology and the network. Resuming, the solution implements a context-aware network architecture that reacts efficiently to its changes. In order to implement this architecture, new entities were created in the network simulator NS-2. The results were obtained using different scenarios, evaluating the influence of each parameter independently. It was demonstrated that the integration of several components, allows a delivery of contents in a personalized manner and independently of the technology. The results showed a better management of the network resources and users experience, throughout the total network selection, based on a central control unit. The multiparty transport overlay improves the network behaviour, minimizing the necessary frequent reconfigurations

    Network coding meets multimedia: a review

    Get PDF
    While every network node only relays messages in a traditional communication system, the recent network coding (NC) paradigm proposes to implement simple in-network processing with packet combinations in the nodes. NC extends the concept of "encoding" a message beyond source coding (for compression) and channel coding (for protection against errors and losses). It has been shown to increase network throughput compared to traditional networks implementation, to reduce delay and to provide robustness to transmission errors and network dynamics. These features are so appealing for multimedia applications that they have spurred a large research effort towards the development of multimedia-specific NC techniques. This paper reviews the recent work in NC for multimedia applications and focuses on the techniques that fill the gap between NC theory and practical applications. It outlines the benefits of NC and presents the open challenges in this area. The paper initially focuses on multimedia-specific aspects of network coding, in particular delay, in-network error control, and mediaspecific error control. These aspects permit to handle varying network conditions as well as client heterogeneity, which are critical to the design and deployment of multimedia systems. After introducing these general concepts, the paper reviews in detail two applications that lend themselves naturally to NC via the cooperation and broadcast models, namely peer-to-peer multimedia streaming and wireless networkin
    • 

    corecore