A polynomial-time algorithm for message routing in hierarchical communication networks

DOI10.1016/0377-2217(93)E0350-7MaRDI QIDQ1129965zbMATHFDO

Authors George G. Polak, Ravindra K. Ahuja

Publication date 5 November 1998

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithmspanning treehierarchical communication networktwo-level network

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18)

Recommendations

• Synthesis of a Communication Network
• A minimax assignment problem in treelike communication networks
• Link scheduling in polynomial time
• Minimum-delay schedules in layered networks

Cites work

• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3797174 (Why is no real title available?)
• A Descent Algorithm for the Multihour Sizing of Traffic Networks
• A linear programming model for design of communications networks with time varying probabilistic demands
• An Application of Generalized Linear Programming to Network Flows
• Analytic Approximation of Blocking Probabilities in Circuit Switched Communication Networks
• Network design and dynamic routing under queueing demand
• Network flows. Theory, algorithms, and applications.

Cited in

(2)

• Compact routing messages in self-healing trees
• The complexity of routing in~hierarchical PNNI networks

This page was built for publication: A polynomial-time algorithm for message routing in hierarchical communication networks

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