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

DOI10.1016/0377-2217(93)E0350-7zbMATH Open0915.90106MaRDI QIDQ1129965FDOQ1129965

Authors: George G. Polak, Ravindra K. Ahuja 

Publication date: 5 November 1998

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

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

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)

Cites Work

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

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)