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

Sandeep Gupta, Abdelmadjid Bouabdallah, Pradip K. Srimani

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

10 Citations (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages600-604
Number of pages5
Volume1900
ISBN (Print)9783540679561
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Shortest Path Tree
Multicast Routing
Mobile Networks
Wireless networks
Topology
Network protocols
Vertex of a graph
Parallel algorithms
Self-stabilization
Stabilization
Adjacency
Distributed Algorithms
Multicast
Network Topology
Efficient Algorithms
Converge
Graph in graph theory

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Gupta, S., Bouabdallah, A., & Srimani, P. K. (2000). Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 600-604). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1900). Springer Verlag.

Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks. / Gupta, Sandeep; Bouabdallah, Abdelmadjid; Srimani, Pradip K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1900 Springer Verlag, 2000. p. 600-604 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1900).

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

Gupta, S, Bouabdallah, A & Srimani, PK 2000, Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1900, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1900, Springer Verlag, pp. 600-604, 6th International European Conference on Parallel Computing, Euro-Par 2000, Munich, Germany, 8/29/00.
Gupta S, Bouabdallah A, Srimani PK. Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1900. Springer Verlag. 2000. p. 600-604. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Gupta, Sandeep ; Bouabdallah, Abdelmadjid ; Srimani, Pradip K. / Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1900 Springer Verlag, 2000. pp. 600-604 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d9c3d825f3944be4a218ad5a7e147ebf,
title = "Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks",
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.",
keywords = "Convergence, Distributed system, Fault tolerance, Multi-cast protocol, Self-stabilizing protocol, System graph",
author = "Sandeep Gupta and Abdelmadjid Bouabdallah and Srimani, {Pradip K.}",
year = "2000",
language = "English (US)",
isbn = "9783540679561",
volume = "1900",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "600--604",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Gupta, Sandeep

AU - Bouabdallah, Abdelmadjid

AU - Srimani, Pradip K.

PY - 2000

Y1 - 2000

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

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

KW - Convergence

KW - Distributed system

KW - Fault tolerance

KW - Multi-cast protocol

KW - Self-stabilizing protocol

KW - System graph

UR - http://www.scopus.com/inward/record.url?scp=84937391914&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937391914&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84937391914

SN - 9783540679561

VL - 1900

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 600

EP - 604

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -