A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
From MaRDI portal
Publication:3512541
DOI10.1007/978-3-540-69848-7_63zbMath1297.90168OpenAlexW1485093583MaRDI QIDQ3512541
Publication date: 18 July 2008
Published in: Computational Science and Its Applications – ICCSA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69848-7_63
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks
- Unsplittable Anycast Flow Problem: Formulation and Algorithms
- Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks
- The flow deviation method: An approach to store‐and‐forward communication network design
This page was built for publication: A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks