Discrete Link Capacity and Priority Assignments in Communication Networks

DOI10.1147/RD.213.0254MaRDI QIDQ4133543zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.213.0254

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication networks in operations research (90B18) Algorithms in computer science (68W99)

Recommendations

• On the capacity assignment problem in packet-switching computer networks
• A system for priority routing and capacity assignment in packet switched networks
• scientific article; zbMATH DE number 3908345
• scientific article; zbMATH DE number 4149863
• Optimal capacity assignment in general queueing networks

Cited in

(7)

• Topological design of computer communication networks -- the overall design problem
• Asynchronous transfer mode networks with parallel links and multiple service classes
• A system for priority routing and capacity assignment in packet switched networks
• scientific article; zbMATH DE number 3900475 (Why is no real title available?)
• New formulations and solution procedures for the hop constrained network design problem.
• On the capacity assignment problem in packet-switching computer networks
• The delay capacity product for store-and-forward communication networks: tree networks

This page was built for publication: Discrete Link Capacity and Priority Assignments in Communication Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133543)