On the capacity assignment problem in packet-switching computer networks

DOI10.1016/0307-904X(86)90094-6MaRDI QIDQ1097689zbMATH OpenFDO

Authors E. D. Sykas

Publication date 1986

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0307-904X(86)90094-6

zbMATH Keywords

capacity assignmentcommunication networkcomputer networksdelay measuresflow assignmentpacket-switching

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Recommendations

• 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

Cites work

• 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

Cited in

(26)

• 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)