Graceful reassignment of excessively long communications paths in networks

DOI10.1016/J.EJOR.2003.08.035zbMATH Open1067.90017OpenAlexW2044463963MaRDI QIDQ1887906FDOQ1887906

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

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

zbMATH Keywords

HeuristicsRoutingTelecommunicationsNetwork flowsIP networks

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Finding the K Shortest Loopless Paths in a Network
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• A survey of dynamic network flows
• Title not available (Why is that?)
• A Minimum Delay Routing Algorithm Using Distributed Computation
• ATM network design: Traffic models and optimization-based heuristics
• ATM layouts with bounded hop count and congestion

Cited In (2)

• Reroute sequence planning in telecommunication networks and compact vector summation.
• Title not available (Why is that?)

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)