Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks

DOI10.1007/11758501_84MaRDI QIDQ3545052zbMATH OpenOpenAlexFDO

Authors Krzysztof Walkowiak

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_84

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• Anycasting in connection-oriented computer networks: Models, algorithms and results
• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• Unsplittable Anycast Flow Problem: Formulation and Algorithms
• Delay control and parallel admission algorithms for real-time anycast flow

Cited in

(5)

• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• Delay control and parallel admission algorithms for real-time anycast flow
• A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• Anycasting in connection-oriented computer networks: Models, algorithms and results

This page was built for publication: Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks

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