Browse Prior Art Database

Algorithm for Telpack Optimization

IP.com Disclosure Number: IPCOM000075537D
Original Publication Date: 1971-Oct-01
Included in the Prior Art Database: 2005-Feb-24
Document File: 2 page(s) / 35K

Publishing Venue

IBM

Related People

Cooper, DW: AUTHOR

Abstract

The Telpack Problem. The discount on per line cost offered users of telephone Telpacks over the single line cost has a sizable economic impact on all leased telephone networks. Such networks may be designed to utilize the Telpacks in a manner which greatly reduces the network rental cost.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 62% of the total text.

Page 1 of 2

Algorithm for Telpack Optimization

The Telpack Problem.

The discount on per line cost offered users of telephone Telpacks over the single line cost has a sizable economic impact on all leased telephone networks. Such networks may be designed to utilize the Telpacks in a manner which greatly reduces the network rental cost. The problem of finding the optimum utilization of Telpacks in a network, which attaches a computer at some city to terminals located at other cities may be expressed as an integer programming problem. However, current integer programming codes have failed when applied. This heuristic algorithm, based on dynamic programming concepts, has given optimum or near optimum results. Nomenclature N = Set of coefficients n3n epsilon n whose position (pos(n)) references a set of cities in a tree structure of Telpacks whose root is at the computer city; the value (val(n)) of the coefficients is the unutilized line capacity for that Telpack connecting with the computer city. T = Set of coefficients t~tepsilon T whose position references a city with terminals to be connected to the computer city; the value of a coefficient t is the number of single telephone lines required to attach the terminals at city t. Sn = set of cities in a Telpack network referenced by pos(n). K = Telpack size,
i.e., the number of telephone lines available in one Telpack. cjk =Cost of a single telephone line between cities j and k (for the computer city k = 0). djk =Cost of a Telpack...