Graceful reassignment of excessively long communications paths in networks

DOI10.1016/J.EJOR.2003.08.035MaRDI QIDQ1887906zbMATH OpenOpenAlexFDO

Authors Hanan Luss, Richard T. Wong

Publication date 22 November 2004

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

Full work available at URL https://doi.org/10.1016/j.ejor.2003.08.035

zbMATH Keywords

HeuristicsRoutingTelecommunicationsNetwork flowsIP networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Communication networks in operations research (90B18)

Recommendations

• Reroute sequence planning in telecommunication networks and compact vector summation.
• On the solution of reroute sequence planning problem in MPLS networks.
• An Efficient Approach to Real-Time Traffic Routeing for Telephone Network Management
• A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks
• On the selection of primary paths for a communication network

Cites work

• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1175958 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• A Minimum Delay Routing Algorithm Using Distributed Computation
• A survey of dynamic network flows
• ATM layouts with bounded hop count and congestion
• ATM network design: Traffic models and optimization-based heuristics
• Finding the K Shortest Loopless Paths in a Network
• Network flows. Theory, algorithms, and applications.
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design

Cited in

(2)

• scientific article; zbMATH DE number 1792668 (Why is no real title available?)
• Reroute sequence planning in telecommunication networks and compact vector summation.

This page was built for publication: Graceful reassignment of excessively long communications paths in networks

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