On the capacity assignment problem in packet-switching computer networks
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.
- scientific article; zbMATH DE number 4149863
- Discrete Link Capacity and Priority Assignments in Communication Networks
- scientific article; zbMATH DE number 3908345
- A system for priority routing and capacity assignment in packet switched networks
- Optimal capacity assignment in general queueing networks
- A conservation law for a wide class of queueing disciplines
- A delay dependent queue discipline
- Analytic Inequalities
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3603173 (Why is no real title available?)
- Networks of Waiting Lines
- The delay capacity product for store-and-forward communication networks: tree networks
- Kapazitätsoptimierung in paketvermittelten Datennetzen. (Capacity optimization in packet switched data networks)
- Capacity allocation in generalized Jackson networks
- A system for priority routing and capacity assignment in packet switched networks
- The delay capacity product for store-and-forward communication networks: tree networks
- A heuristic approach for capacity expansion of packet networks
- Routing and capacity assignment in backbone communication networks
- Upper bound of network capacity and a static optimal packet routing strategy
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- Optimal double-resource assignment for the robust design problem in multistate computer networks
- Optimal double-resource assignment for a distributed multistate network
- Some complexity results about packet radio networks (Corresp.)
- Optimal capacity assignment in general queueing networks
- scientific article; zbMATH DE number 4149863 (Why is no real title available?)
- scientific article; zbMATH DE number 3900475 (Why is no real title available?)
- scientific article; zbMATH DE number 3908345 (Why is no real title available?)
- scientific article; zbMATH DE number 4008074 (Why is no real title available?)
- Optimal packet sizes in virtual circuit computer networks
- Discrete Link Capacity and Priority Assignments in Communication Networks
- scientific article; zbMATH DE number 484567 (Why is no real title available?)
- The flow deviation method: An approach to store‐and‐forward communication network design
- A combinatorial intelligent computing approach for resolving the delay and flow assignment in computer communication networks.
- Capacity scheduling for data services over digital networks
- Path capacity dimensioning in a multiprotocol label switched network: Analysis of optimal and suboptimal solutions
- Routing optimization in packet switching communication networks
- Minimum hop flow assignment and routing subject to an average message delay constraint
- Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment
This page was built for publication: On the capacity assignment problem in packet-switching computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097689)
