Browse Prior Art Database

Proactive Hypernet Performance Optimization

IP.com Disclosure Number: IPCOM000104771D
Original Publication Date: 1993-May-01
Included in the Prior Art Database: 2005-Mar-19
Document File: 1 page(s) / 50K

Publishing Venue

IBM

Related People

Eisen, IR: AUTHOR [+2]

Abstract

The traditional multimedia hypertext documents as implemented today, mak no distinction between different links. It is up to the user to traverse a link which may appear to be leading to something interesting and explore the connecting information node. The underlying software to support the hyperlinked document cannot predict which link the user will travel next. This can occasionally lead to poor response times caused by IO and other processing costs.

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

Proactive Hypernet Performance Optimization

      The traditional multimedia hypertext documents as implemented
today, mak no distinction between different links.  It is up to the
user to traverse a link which may appear to be leading to something
interesting and explore the connecting information node.  The
underlying software to support the hyperlinked document cannot
predict which link the user will travel next.  This can occasionally
lead to poor response times caused by IO and other processing costs.

      An improved performance-sensitive hypertext design is needed
which can overcome this handicap.  This invention proposes a daemon
process which is part of the software infrastructure which
continually tracks the usage of the hyperlink document.

      Specifically, this process keeps a cumulative count of the
number of times each link is traversed and the amount of time spent
in the corresponding end node.  These statistics in essence 'travel
with the document' and are used to implement a certain end user
construct.

      This construct proposes that a daemon process continually
monitor the 'cursor' position.  The cursor may be present at a
particular information node.  This node may be connected to several
other nodes - some of which will be more travelled (or visited) than
others.  There is, on average, a greater likelihood of the same nodes
being visited again.  The daemon process may take advantage of prior
statistics which are continuou...