Browse Prior Art Database

Fast Online Line Mangement with Call Preemption

IP.com Disclosure Number: IPCOM000105496D
Original Publication Date: 1993-Aug-01
Included in the Prior Art Database: 2005-Mar-19
Document File: 2 page(s) / 58K

Publishing Venue

IBM

Related People

Garay, JA: AUTHOR [+4]

Abstract

Disclosed is an efficient method that permits high utilization of a communication line serving various calls (line can be a path or a link or a sub-network), regardless of the order and duration of the future calls. This enables on-line line control without the need to know the type of calls that are expected and without losing much of the utilization (at least 1/4 of it is used compared with the best possible utilization).

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

Fast Online Line Mangement with Call Preemption

      Disclosed is an efficient method that permits high utilization
of a communication line serving various calls (line can be a path or
a link or a sub-network), regardless of the order and duration of the
future calls.  This enables on-line line control without the need to
know the type of calls that are expected and without losing much of
the utilization (at least 1/4 of it is used compared with the best
possible utilization).

      Numerous previous works have focussed on the problem of
bandwidth reservation and management.  The objective has been to
maximize the usage of the network facilities while minimizing the
probability that a particular connection will be denied access to the
network or "blocked." The problem remains one of the most actively
studied issues in the area of high-speed networks.

      In this disclosure, this issue is investigated, i.e.,
algorithms in, an on-line fashion, are studied.  Generally speaking,
an on-line problem is one in which an algorithm that solves it must
handle a sequence of requests, satisfying each request without
knowledge of the future requests.  On-line algorithms are evaluated
in terms of their competitiveness A competitive algorithm has the
property that its performance on any sequence of requests is within a
constant fraction of the performance of any algorithm on the same
sequence, including the off-line algorithms for the problem---which
can see all future requests.

      Specifically, look at the problem of maximizing the utilizat...