Browse Prior Art Database

Dynamic Resource Distribution Amongst Streams

IP.com Disclosure Number: IPCOM000123396D
Original Publication Date: 1998-Oct-01
Included in the Prior Art Database: 2005-Apr-04
Document File: 2 page(s) / 81K

Publishing Venue

IBM

Related People

Dixit, A: AUTHOR [+4]

Abstract

This disclosure relates to a method of allocating resources to message streams in an Encina(*) Publish/Subscribe system according to a weighting by importance of each stream. The weightings of streams in each Distribution Agent are compared, and resources are allocated dynamically to the streams within the Distribution Agent.

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

Dynamic Resource Distribution Amongst Streams

   This disclosure relates to a method of allocating
resources to message streams in an Encina(*) Publish/Subscribe
system according to a weighting by importance of each stream.  The
weightings of streams in each Distribution Agent are compared, and
resources are allocated dynamically to the streams within the
Distribution Agent.

   The Publish/Subscribe system consists of a number of
Distribution Agents (DAs), each hosting a number of streams.  A
message published in the Publish/Subscribe system passes through one
of these streams.  This requires that each of these streams use some
part of the total memory (resource) available to the DA in order to
cache these messages as they pass through the streams.

   The DAs through which a stream might pass are not
guaranteed to have the same amount of memory available to them to
use.  The amount of memory would vary according to the machine used.
Also a stream passes through a DA only if the DA has seen at least
one subscription on that stream.  A stream is made to pass through a
DA dynamically whenever the DA is requested a subscription on it.  In
such a dynamic system of creation of streams and routing messages
through them, with the streams passing through DAs with a varying
amount of memory available for them to use, it is a challenge to
design a system which would automatically use the resources available
on the DA through which the stream is passing and also at the same
time make sure that each stream does not use the resources in a
manner which would be unfair to the system as a whole.

   In other words, a preferred solution is to have streams
with relative importance to each other on a particular DA.  For all
the streams passing through a particular DA, each stream should be
allowed to use the resources in proportion to the importance of that
stream relative to the other streams which pass through the DA.  So
in effect each stream has a certain importance level assigned to it
and if it passes through a particular DA, then it should use the
resources on that DA relative to the other streams which happen to
pass through that particular DA.  Streams which do not pass through a
particular DA should not affect...