On the capacity assignment problem in packet-switching computer networks
type: Item
instance of: scholarly article
title: On the capacity assignment problem in packet-switching computer networks
zbMATH Open document ID: 0635.68026
DOI: 10.1016/0307-904X(86)90094-6
author: E. D. Sykas
published in: Applied Mathematical Modelling
publication date: 1986-01-01T00:00:00Z
review text: The capacity assignment problem in a packet-switching communication network is examined with a new look and under general assumptions about the form of the network cost function and a general class of delay measures, which includes as special cases all the previously proposed delay criteria. Four optimal functions: the optimal delay (cost) versus the maximum permissible cost (delay), and the optimal capacities versus the maximum permissible cost or delay, are defined. Several propositions describing the relations between these functions are given and their form is found if a separability property holds. An interesting application of these results to the flow and capacity assignment problem is also presented. The relations between different versions of the capacity assignment problem (CAP) are given together with sufficient conditions for the uniqueness of the solution. Finally, algorithms for the solution of the CAP are proposed. Emphasis is given to the analysis of an algorithm appropriate for minimax delay criteria. Numerical results and comparisons with other delay measures are also included.
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 4035127
zbMATH Keywords: computer networks
zbMATH Keywords: delay measures
zbMATH Keywords: flow assignment
zbMATH Keywords: capacity assignment
zbMATH Keywords: packet-switching
zbMATH Keywords: communication network
MaRDI profile type: Publication
cites work: A delay dependent queue discipline
cites work: The delay capacity product for store-and-forward communication networks: tree networks
cites work: Networks of Waiting Lines
cites work: A conservation law for a wide class of queueing disciplines
cites work: Analytic Inequalities
cites work: Q4134686
cites work: Q4168506
cites work: Q4135211
description: scientific article; zbMATH DE number 4035127