96 research outputs found
Router-aided Approach for P2P Traffic Localization
èæ”Šć·„æ„性ćŠ201
Exploiting Awareness of NetworkTopology and Relay Capability for P2PTVTraffic Localization
èæ”Šć·„æ„性ćŠ2016ćčŽ
MULTIMEDIA ON GEOGRAPHIC NETWORK
In this thesis we investigate the topic of the multimedia contents distribution on a geo-
graphic network which is a rarefied and huge field. First of all we have to classify the main
parts necessary in the multimedia distribution on a geographic network. The main aspects
of a geographic network that will be highlighted in this thesis are: the mechanism used to
retrieve the sources of the multimedia content; in the case of the peer-to-peer network on
geographic network one of the most important mechanism is the query flooding protocol.
The kind of overlay network (peer-to-peer) used to distribute the multimedia content. The
usage of this overlay network in a multicast network. The security of the overlay network
over a geographic network.
Therefore the first topic which is investigated in this thesis is the query flooding protocol
that can be used in any kind of query operation on a peer-to-peer network. For this protocol
we achieve an analytical model through a complex analysis of the proxies network. In this
analysis we can see how the proxies permit an improvement in the performance with respect
to the routing operations in a generic network of routers. Moreover we address a simple
formulation and framework about the performance of the network with and without layer
7 (proxy) and we apply them in three different types of scenarios to show the advantages
achieved with the usage of proxies instead of routers.
Through the query flooding operation, each peer of the peer-to-peer network can achieve
the list of the peers that hold the desired multimedia content. In a multimedia content dis-
tribution system, after the previous step in which the list of the peers that hold the desired multimedia content is retrieved, it is necessary to establish the kind of peer-to-peer network
used to distribute this multimedia content to the peers that require it. Therefore the second
aspect analysed in this thesis, is how the peer-to-peer network is built so that it is possible to
provide the multimedia content to the vast majority of peers (that require this content) with
the minimum delay. The construction of the peer-to-peer networks used for the distribution
of the multimedia contents is not a very investigated field. Thus in this thesis we produce
new algorithms used to build peer-to-peer networks in an incremental way on asymmetric
and radio channel and we establish which algorithm is better with respect to the maximum
delay of the network, the maximization of the number of peers accepted in the network and
the minimization of the bit error probability of each peer of the peer-to-peer network.
In this thesis, we propose an usage of the overlay network (peer-to-peer network) in
a multicast network. We introduce an innovative mechanism that exploits the peer-to-peer
network to make reliable a standard unreliable multicast network. Moreover we present an
analytical model for this innovative mechanism.
Finally the last aspect of a geographic network is the security of the communications
among a group of peers. Thus to ensure the maximum level of security with secure commu-
nications among a group of three or more peers, in this thesis we propose a new protocol,
based on the Massey Omura protocol, which can allow the communications among the
peers of a peer-to-peer network in a secure way. Moreover we present the security prob-
lems of this Massey Omura Multiple Users Protocol and how it is possible to avoid these
issues through a specific encryption function and a specific decryption function by chang-
ing the encryption and decryption keys of each peer when the source peer changes. Finally
we present a new cryptography protocol which we use to share the decryption shared key
that is used in the Massey Omura Multiple Users Protocol
Recent Trends in Communication Networks
In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges
Intelligent Circuits and Systems
ICICS-2020 is the third conference initiated by the School of Electronics and Electrical Engineering at Lovely Professional University that explored recent innovations of researchers working for the development of smart and green technologies in the fields of Energy, Electronics, Communications, Computers, and Control. ICICS provides innovators to identify new opportunities for the social and economic benefits of society.ă This conference bridges the gap between academics and R&D institutions, social visionaries, and experts from all strata of society to present their ongoing research activities and foster research relations between them. It provides opportunities for the exchange of new ideas, applications, and experiences in the field of smart technologies and finding global partners for future collaboration. The ICICS-2020 was conducted in two broad categories, Intelligent Circuits & Intelligent Systems and Emerging Technologies in Electrical Engineering
Contributions to Vehicular Communications Systems and Schemes
La derniÚre décennie a marqué une grande hausse des applications véhiculaires comme une nouvelle source de revenus et un facteur de distinction dans l'industrie des véhicules. Ces applications véhiculaires sont classées en deux groupes : les applications de sécurité et les
applications d'info divertissement. Le premier groupe inclue le changement intelligent de voie, l'avertissement de dangers de routes et la prévention coopérative de collision qui comprend la vidéo sur demande (VoD), la diffusion en direct, la diffusion de météo et de nouvelles et les jeux
interactifs. Cependant, Il est à noter que d'une part, les applications véhiculaires d'info divertissement nécessitent une bande passante élevée et une latence relativement faible ; D'autre part, les applications de sécurité requiÚrent exigent un délai de bout en bout trÚs bas et un canal de
communication fiable pour la livraison des messages d'urgence. Pour satisfaire le besoin en applications efficaces, les fabricants de véhicules ainsi que la
communautĂ© acadĂ©mique ont introduit plusieurs applications Ă lâintĂ©rieur de vĂ©hicule et entre vĂ©hicule et vĂ©hicule (V2V). Sauf que, l'infrastructure du rĂ©seau sans fil n'a pas Ă©tĂ© conçue pour gĂ©rer les applications de vĂ©hicules, en raison de la haute mobilitĂ© des vĂ©hicules, de l'imprĂ©visibilitĂ©
du comportement des conducteurs et des modÚles de trafic dynamiques. La relÚve est l'un des principaux défis des réseaux de véhicules, car la haute mobilité exige au
réseau sans fil de faire la relÚve en un trÚs court temps. De plus, l'imprévisibilité du comportement du conducteur cause l'échec des protocoles proactifs traditionnels de relÚve, car la prédiction du prochain routeur peut changer en fonction de la décision du conducteur. Aussi, le réseau de véhicules peut subir une mauvaise qualité de service dans les régions de relÚve en raison d'obstacles naturels, de véhicules de grande taille ou de mauvaises conditions météorologiques. Cette thÚse se concentre sur la relÚve dans l'environnement des véhicules et son effet sur les
applications vĂ©hiculaires. Nous proposons des solutions pratiques pour les rĂ©seaux actuellement dĂ©ployĂ©s, principalement les rĂ©seaux LTE, l'infrastructure vĂ©hicule Ă vĂ©hicule (V2V) ainsi que les outils efficaces dâĂ©mulateurs de relĂšves dans les rĂ©seaux vĂ©hiculaires.----------ABSTRACT: The last decade marked the rise of vehicular applications as a new source of revenue and a key differentiator in the vehicular industry. Vehicular Applications are classified into safety and infotainment applications. The former include smart lane change, road hazard warning, and
cooperative collision avoidance; however, the latter include Video on Demand (VoD), live streaming, weather and news broadcast, and interactive games. On one hand, infotainment
vehicular applications require high bandwidth and relatively low latency; on the other hand, safety applications requires a very low end to end delay and a reliable communication channel to deliver emergency messages. To satisfy the thirst for practical applications, vehicle manufacturers along with research institutes introduced several in-vehicle and Vehicle to Vehicle (V2V) applications. However, the wireless
network infrastructure was not designed to handle vehicular applications, due to the high mobility of vehicles, unpredictability of driversâ behavior, and dynamic traffic patterns. Handoff is one of the main challenges of vehicular networks since the high mobility puts pressure on the wireless network to finish the handoff within a short period. Moreover, the unpredictability of driver behavior causes the traditional proactive handoff protocols to fail, since the prediction of the next router may change based on the driverâs decision. Moreover, the vehicular network may
suffer from bad Quality of Service (QoS) in the regions of handoff due to natural obstacles, large vehicles, or weather conditions. This thesis focuses on the handoff on the vehicular environment and its effect on the vehicular
applications. We consider practical solutions for the currently deployed networks mainly Long Term Evolution (LTE) networks, the Vehicle to Vehicle (V2V) infrastructure, and the tools that can be used effectively to emulate handoff on the vehicular networks
- âŠ