On the capacity assignment problem in packet-switching computer networks

DOI10.1016/0307-904X(86)90094-6zbMath0635.68026MaRDI QIDQ1097689

E. D. Sykas

Publication date: 1986

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

zbMATH Keywords

communication networkcomputer networksflow assignmentcapacity assignmentdelay measurespacket-switching

Mathematics Subject Classification ID

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

Related Items (2)

Optimal double-resource assignment for the robust design problem in multistate computer networks ⋮ Optimal double-resource assignment for a distributed multistate network

Cites Work

• The delay capacity product for store-and-forward communication networks: tree networks
• Networks of Waiting Lines
• A delay dependent queue discipline
• A conservation law for a wide class of queueing disciplines
• Analytic Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the capacity assignment problem in packet-switching computer networks