Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks

Sandeep K.S. Gupta, Abdelmadjid Bouabdallah, Pradip K. Srimani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

Our objective is to view the topology change as a change in the node adjacency information at one or more nodes and utilize the tools of self-stabilization to converge to a stable global state in the new network graph. We illustrate the concept by designing a new efficient distributed algorithm for multi-cast in a mobile network that can accommodate any change in the network topology due to node mobility.

Original languageEnglish (US)
Title of host publicationEuro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings
EditorsArndt Bode, Thomas Ludwig, Wolfgang Karl, Roland Wismüller
PublisherSpringer Verlag
Pages600-604
Number of pages5
ISBN (Electronic)9783540679561
StatePublished - Jan 1 2000
Externally publishedYes
Event6th International European Conference on Parallel Computing, Euro-Par 2000 - Munich, Germany
Duration: Aug 29 2000Sep 1 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1900
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International European Conference on Parallel Computing, Euro-Par 2000
Country/TerritoryGermany
CityMunich
Period8/29/009/1/00

Keywords

  • Convergence
  • Distributed system
  • Fault tolerance
  • Multi-cast protocol
  • Self-stabilizing protocol
  • System graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks'. Together they form a unique fingerprint.

Cite this