A system for priority routing and capacity assignment in packet switched networks

DOI10.1007/BF02094331zbMath0761.90040MaRDI QIDQ1197787

Irina Neuman

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

lower boundscapacity assignmentconcurrent flowpacket switched network

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Design of computer network topologies: a Vroom inspired psychoclonal algorithm, Configuring wide area computer networks. Problems and models, Asynchronous transfer mode networks with parallel links and multiple service classes

Cites Work

• Unnamed Item
• Unnamed Item
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• A Queueing Network Analysis of Computer Communication Networks with Window Flow Control
• Priority Queuing Networks
• Backbone Network Design Tools with Economic Tradeoffs
• Discrete Link Capacity and Priority Assignments in Communication Networks
• Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets
• A delay dependent queue discipline
• The traveling-salesman problem and minimum spanning trees: Part II
• Class Dependent Routing In Backbone Computer Networks