Skip to main content
SpringerLink
Log in

A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net

  • Published:
Computing Aims and scope Submit manuscript

transport net

corresponding to an undirected biconnected graph on a distributed or network model of computation. The algorithm is resilient to transient faults and does not require initialization. In addition, it is capable of handling topology changes in a transient manner. The paper includes a correctness proof of the algorithm. Finally, it concludes with some final remarks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Engineering Kuwait University P.O. Box 5969 Safat-13060 Kuwait e-mail: karaata@eng.kuniv.edu.kw, , , , , , KW

    M. H. Karaata

  2. Department of Computer Science, Mathematics and Physics University of the West Indies Cave Hill Campus PO Box 64 Bridgetown Barbados, W.I. e-mail: pchaudhuri@uwichill.edu.bb, , , , , , BB

    P. Chaudhuri

Authors
  1. M. H. Karaata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received November 26, 2001 Published online February 18, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karaata, M., Chaudhuri, P. A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net. Computing 68, 143–161 (2002). https://doi.org/10.1007/s00607-001-1436-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-001-1436-7

Search

Navigation