Broadcast (informatique)

Résumé

La notion de broadcast est employée par les techniciens en informatique et réseaux ; il s'agit à proprement parler, de transmission ou de liaison. Le principe de base est le même que la télédiffusion, étant donné que l'on diffuse des paquets de données à de nombreux clients éventuellement sans discrimination. Les protocoles de communications réseau prévoient une méthode simple pour diffuser des données à plusieurs machines en même temps (multicast). Au contraire d'une communication « Point à Point » (unicast), il est possible d'adresser des paquets de données à un ensemble de machines d'un même réseau uniquement par des adresses spécifiques qui seront interceptées par toutes les machines du réseau ou sous-réseau. Ces paquets sont en général utilisés dans un environnement LAN pour atteindre une machine dont on ne connaît pas l'adresse MAC (protocole ARP pour le protocole IP version 4) ou pour des annonces faites aux clients potentiels par des machines pouvant offrir des services (co

Source officielle

https://fr.wikipedia.org/wiki/Broadcast_(informatique)

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (8)

Publications associées

Chargement

Personnes associées (1)

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (15)

Concepts associés

Chargement

Cours associés (2)

Computing is nowadays distributed over several machines, in a local IP-like network, a cloud or a P2P network. Failures are common and computations need to proceed despite partial failures of machines or communication links. This course will study the foundations of reliable distributed computing.

This course consists of two parts:

architecture of automation systems, hands-on lab
handling of faults and failures in real-time systems, including fault-tolerant computing

Cours associés

Chargement

Séances de cours associées (13)

Afficher plus

Séances de cours associées

Chargement

Asynchronous Broadcast on the Intel SCC using Interrupts

Darko Petrovic, Thomas Ropars, André Schiper, Omid Shahmirzadi

This paper focuses on the design of an asynchronous broadcast primitive on the Intel SCC. Our solution is based on OC-Bcast, a state-of-the-art k-ary tree synchronous broadcast algorithm that leverages the parallelism provided by on-chip Remote Memory Accesses to Message Passing Buffers. In the paper, we study the use of parallel inter-core interrupts as a means to implement an efficient asynchronous group communication primitive, and present the userspace library we designed to be able to use interrupts in OC-Bcast and make it work asynchronously. Our experimental evaluation shows that our algorithm allows parallel broadcast operations to efficiently progress concurrently and provides low latency for a single broadcast operation. It highlights that parallel interrupts can help implementing efficient group communication primitives on many-core systems.

2012

Chargement

Efficient Key Exchange for Wireless Multi-hop Networks

László Czap, Christina Fragouli, Iris Safaka

We present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protocol works over arbitrary multi-hop networks, unlike previously proposed protocols that only work when nodes are restricted to be within the same broadcast domain. Multi-hop networks enable to support a wider range of applications; we are inspired in this paper by a traffic-anonymization application. Multi-hop networks are also more interesting technically, as they offer a much richer palette of opportunities for secrecy, that include the inherently noisy nature of wireless, the existence of multiple paths between the network nodes, and interference from concurrent transmissions. We propose a protocol that leverages these opportunities, and show that it can create keys at a rate of tens of Kbps.

2015

Chargement

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

David Cavin, Yoav Sasson, André Schiper

We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not require the nodes to know the network size or its diameter. The only information a node has is its identity and its position. On average, only a subset of nodes transmit and they transmit only once to achieve reliable broadcast. The protocol is contention-free and energy-efficient. We show that reliable broadcast can be achieved in O(Dlog n) time-slots despite node mobility, where D is the diameter of the network and n the number of nodes.

2006

Chargement