Browse Prior Art Database

Symmetrical Stabilized Binary Tree Protocol

IP.com Disclosure Number: IPCOM000107368D
Original Publication Date: 1992-Feb-01
Included in the Prior Art Database: 2005-Mar-21
Document File: 2 page(s) / 43K

Publishing Venue

IBM

Related People

King, RE: AUTHOR

Abstract

Disclosed is an improvement to the Stabilized Binary Tree Protocol (*) by consistently applying the principle of remaining at the same level in the tree when messages are correctly received (without collision in the distributed control case) to all levels in the tree. This may be applied to the distributed case. It may also be applied to the centrally controlled case where responses to a probe include the message. This invention has an important implementation advantage. It will allow a single implementation to effectively work at optimum performance for any number of terminals. One could create a large tree and use, however, many levels that would be required by choosing the terminal addresses properly. To illustrate, the figure is a copy of the Stabilized Binary Tree Protocol (*) with three state transition arcs, added.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

Symmetrical Stabilized Binary Tree Protocol

       Disclosed is an improvement to the Stabilized Binary Tree
Protocol (*) by consistently applying the principle of remaining at
the same level in the tree when messages are correctly received
(without collision in the distributed control case) to all levels in
the tree.  This may be applied to the distributed case.  It may also
be applied to the centrally controlled case where responses to a
probe include the message.  This invention has an important
implementation advantage.  It will allow a single implementation to
effectively work at optimum performance for any number of terminals.
One could create a large tree and use, however, many levels that
would be required by choosing the terminal addresses properly.  To
illustrate, the figure is a copy of the Stabilized Binary Tree
Protocol (*) with three state transition arcs, added.  These three
arcs, (3,2), (7,4), and (5,6), are shown as heavy dashed lines.
These new transitions are used only when a message is correctly
received.  This protocol becomes symmetrical for all levels in the
tree and, therefore, possesses the properties previously described.

      Reference
(*)  U.S. Patent 4,796,023.