On the design of resilient protocols for spanning tree problems

Author

Cimet, I. Arieh ; Cheng, C. ; Kumar, Srikanta P R

Author_Institution

AT&T Bell Lab., Naperville, IL, USA

fYear

1989

fDate

5-9 Jun 1989

Firstpage

516

Lastpage

523

Abstract

A method to design resilient protocols for spanning tree problems is proposed. The method consists of a generic resilient protocol that can be used for any spanning tree problem. A resilient protocol for a particular spanning tree problem can be obtained by adjusting various run-time parameters of the generic protocol. The generic protocol is designed by using the concepts of replacement sets that contain the links that can be used to replace a link that fails and replacement values that measure the change in the spanning tree when a link in a replacement set is used to recreate a spanning tree. The approach is as general as the common approach (for the case of spanning trees) because the generic protocol can solve a new spanning tree problem without an individual design. The protocols obtained with this method are efficient and easy to implement and verify because they are all derived from the generic protocol

Keywords

fault tolerant computing; protocols; trees (mathematics); design; replacement sets; resilient protocols; run-time parameters; spanning tree problems; Channel allocation; Communication networks; Design methodology; Local area networks; Radio network; Routing protocols; Runtime; Sorting; Spread spectrum communication; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1989., 9th International Conference on

Conference_Location

Newport Beach, CA

Print_ISBN

0-8186-1953-8

Type

conf

DOI

10.1109/ICDCS.1989.37984

Filename

37984