Browse Prior Art Database

Node Identification in a Distributed System with Multiple Communication Mechanisms

IP.com Disclosure Number: IPCOM000111366D
Original Publication Date: 1994-Feb-01
Included in the Prior Art Database: 2005-Mar-26
Document File: 2 page(s) / 65K

Publishing Venue

IBM

Related People

Truty, GL: AUTHOR [+3]

Abstract

Disclosed is a method for enabling nodes in a distributed system to communicate with each other through multiple mechanisms (for example, a shared disk file and a fast communication line). The method enables each node which joins the network to relate all the communication paths leading to any other node, and to determine if communication paths leading to two nodes with identical names actually lead to the same node, or to two distinct nodes.

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

Node Identification in a Distributed System with Multiple Communication
Mechanisms

      Disclosed is a method for enabling nodes in a distributed
system to communicate with each other through multiple mechanisms
(for example, a shared disk file and a fast communication line).  The
method enables each node which joins the network to relate all the
communication paths leading to any other node, and to determine if
communication paths leading to two nodes with identical names
actually lead to the same node, or to two distinct nodes.

      The first system to execute in the distributed system generates
a unique stamp to associate with the entire distributed system.  This
unique stamp is associated with each communication mechanism such
that all members can access it when connecting to other members.  The
stamp need is not guaranteed to be unique, but it is extremely
unlikely that two or more systems will generate the same value (a
granular time stamp or randomly generated value is typically
sufficient).

      The one-to-one correspondence is guaranteed by the fact that
each member performs the following checks when connecting to the
distributed system:

1.  Verify that all the members involved in any one communication
    mechanism are also involved in all of the others, based on any
    established naming convention.

2.  Verify that the stamps associated with each communication
    mechanism are all equal.

If either check fails, the member must not connect to the distributed
system.

      Not...