Anycasting in connection-oriented computer networks: Models, algorithms and results

DOI10.2478/v10006-010-0015-5zbMath1300.68011OpenAlexW2014003426MaRDI QIDQ2930587

Krzysztof M. Walkowiak

Publication date: 19 November 2014

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10006-010-0015-5

zbMATH Keywords

optimizationsurvivabilityMPLSanycastingconnection-oriented networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

A column generation technique for routing and spectrum allocation in cloud-ready survivable elastic optical networks

Cites Work

• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• A new greedy approach for facility location problems
• The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• The flow deviation method: An approach to store‐and‐forward communication network design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Anycasting in connection-oriented computer networks: Models, algorithms and results