Browse Prior Art Database

Cycle Termination in Distributed Relationships

IP.com Disclosure Number: IPCOM000119769D
Original Publication Date: 1991-Feb-01
Included in the Prior Art Database: 2005-Apr-02
Document File: 1 page(s) / 67K

Publishing Venue

IBM

Related People

Austin, JH: AUTHOR [+4]

Abstract

Disclosed is a program design to detect and break cycles in the expansion of distributed membership relations.

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

Cycle Termination in Distributed Relationships

      Disclosed is a program design to detect and break cycles in the
expansion of distributed membership relations.

      Benefits of this invention include the ability to resolve
distributed relations to any depth without endlessly repeating the
same resolution.  It also allows the resolution activity to be fully
distributed among nodes of the network, rather than having a single
node issue all resolution requests synchronously to detect cycles.

      In a distributed membership relation, such as a distributed
directory containing distribution lists, a list may contain entries
that are either unresolvable atomic individuals or are names or other
lists, which may be located at other network nodes.  These other
lists could, in turn, contain names of lists, etc., to arbitrary
depth.  A list member may be resolved by sending a request for its
resolution to the node at which it is defined.  But, if one of the
later lists contains the name of a list already encountered and
resolved at a different node, a 'cycle' exists.  Straightforward
resolution of that list could cause the same sequence of expansion
requests to be endlessly repeated in the network, since no one node
would be aware that some other node had previously resolved that
list.

      Whenever the directory service at one node, in the process of
resolving a distribution list (or similar membership relation),
encounters members that are the names of lists wh...