A Distributed and Robust Election Protocol using Multicast IP

Ljubica Blazevic
1997
Rapport ou document de travail

We present in this paper a distributed protocol that provides an access control mechanism for IP multicast. The protocol distributes a right to multicast between multicast IP group members in a fair manner. The protocol constructs a control tree that includes every host member of a given multicast IP group. The protocol updates dynamically the control tree as group members join and leave the group. The protocol is scalable: the state information kept by each member is constant and independent of the group size and of the tree structure. The paper describes the protocol and its implementation.

À 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.

Concepts associés

Chargement

Publications associées

Chargement

Ljubica Blazevic
1997
Rapport ou document de travail

Résumé

Official source

https://infoscience.epfl.ch/record/23?ln=fr

À propos de ce résultat

Concepts associés (4)

Concepts associés

Chargement

Publications associées (8)

Publications associées

Chargement

A Scalable Protocol For Reporting Periodically Using Multicast IP

Ljubica Blazevic, Eric Gauthier

We propose a protocol that controls the members of a multicast group that send periodically status reports to all members. The protocol, called Multicast Access Protocol (MAP), limits the number of concurrent multicast reports as the group size becomes large. MAP is a decentralised protocol that provides an access control mechanism to an IP multicast group. The protocol supports members joining and leaving the group dynamically as well as changes in the underlying network topology. MAP is a self-configuring mechanism and requires every member to keep only local information independent of the group size. We describe the protocol both formally and informally.

1998

Chargement

Distributed Core Multicast (DCM): a routing protocol for IP with application to host mobility

Ljubica Blazevic, Jean-Yves Le Boudec

We consider the problem of multicast routing in a large single domain network with a very large number of multicast groups with small number of receivers. Such a case occurs, for example, when multicast addresses are statically allocated to mobile hosts, as a mechanism to manage Internet host mobility. For such networks, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. We propose an alternative solution called Distributed Core Multicast (DCM). It is based on an extension of the centre-based tree approach. It uses several core routers, called Distribut ed Core Routers (DCRs) and a special protocol between them. The objectives are: (1) to avoid multicast group state information in backbone routers, (2) to avoid triangular routing across expensive backbone links, (3) to scale well with the number of multicast groups. We describe how our approach can be used to support mobile hosts. We argue that, when DCM is used to route packets to mobile hosts, good performance can be achieved during handoff.

1999

Chargement

Distributed Core Multicast (DCM): a routing protocol for many small groups with application to mobile IP telephony

Ljubica Blazevic, Jean-Yves Le Boudec

This paper specifies a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of small multicast groups. We present how DCM can be used to route packets to mobile hosts in cellular Internet telephony, where each mobile host is assigned a multicast address. The benefits of the multicasting-based approach to route packets to mobile hosts are low latency and no disruption during handover.

2000

Chargement

Routing Information Protocol

(RIP, protocole d'information de routage) est un protocole de routage IP de type Vector Distance (à vecteur de distances) s'appuyant sur l'algorithme de détermination des routes décentralisé Bellman-

Suite des protocoles Internet

La suite des protocoles Internet est l'ensemble des protocoles utilisés pour le transfert des données sur Internet. Elle est aussi appelée suite TCP/IP, DoD Standard (DoD pour Department of Defense) o

Contrôle d'accès au support

La sous-couche de contrôle d'accès au support (abrégée MAC, de l’anglais Media Access Control) est la moitié basse de la couche de liaison de données du modèle OSI, selon les standar