Browse Prior Art Database

Data Model of Information System Connectivity

IP.com Disclosure Number: IPCOM000101359D
Original Publication Date: 1990-Aug-01
Included in the Prior Art Database: 2005-Mar-16
Document File: 5 page(s) / 105K

Publishing Venue

IBM

Related People

Lumsden, MW: AUTHOR

Abstract

Disclosed is a data model of an information system. This model represents the dependence of connections upon each other and upon system resources, such that: the effect of one or more points of failure on a modelled configuration is automatically determined by the model itself, and a connection that consists of two or more connections (an end-to-end connection) becomes undefined if any non-redundant component connection is removed.

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

Data Model of Information System Connectivity

       Disclosed is a data model of an information system.  This
model represents the dependence of connections upon each other and
upon system resources, such that:  the effect of one or more points
of failure on a modelled configuration is automatically determined by
the model itself, and a connection that consists of two or more
connections (an end-to-end connection) becomes undefined if any
non-redundant component connection is removed.

      This model has been designed to be implemented upon a data base
management system that supports entity-relationship data modelling,
with relationship semantics and user-coded data policies.  (The rela
tionship semantics employed in the invention are: Cardinality--the
number of entities that can participate at each end of the
relationship (e.g., 1 to 1, 1 to many); Mandatory--an entity may not
exist without the relationship being present; Controlling--an entity
may come into being without the relationship, but once the
relationship is established, if it is ever deleted, the entity is
automatically deleted by the system.) (See Fig. 1.)

      Three assumptions about configuration behavior are implemented
by the policies.
1.   A connection should have status "DOWN" whenever either
      of the two involved resources has a status of "DOWN".
      The following is pseudocode for the policy on the
      STATUS attribute of RESOURCE:
      if STATUS = "DOWN" then
           for all involving CONNECTIONs
                CONNECTION.STATUS :="DOWN"
           end for
      else
           for all involving CONNECTIONs
                if other involved RESOURCE has STATUS = "UP"
                     CONNECTION.STATUS := "UP"
                end if
           end for
      end if

      2.   A path is down if any connection on the path is down.
      Fig. 1 depicts the entity and relationship types of the
      model, which implement the following assumptions about
      configurations:
       .   Exactly two resources are involved in each connection, and
the connection cannot exist without them.
       .   A r...