Path selection and bandwidth allocation in MPLS networks
Performance Evaluation - Special issue: Internet performance and control of network systems
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Distributed Admission Control for Anycast Flows
IEEE Transactions on Parallel and Distributed Systems
Minimum DVS gateway deployment in DVS-based overlay streaming
Computer Communications
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new function for optimization of working paths in survivable MPLS networks
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Heuristic algorithm for anycast flow assignment in connection-oriented networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
A unified approach to survivability of connection-oriented networks
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Unsplittable anycast flow problem: formulation and algorithms
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Lagrangean heuristic for anycast flow assignment in connection-oriented networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
QoS routing for anycast communications: motivation and an architecture for DiffServ networks
IEEE Communications Magazine
IPv6 anycast for simple and effective service-oriented communications
IEEE Communications Magazine
User Access to Popular Data on the Internet and Approaches for IP Traffic Flow Optimization
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Anycasting in connection-oriented computer networks: Models, algorithms and results
International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
| Hi-index | 0.00 |
Our discussion in this article centers around a new heuristic algorithm based on Flow Deviation (FD) method deployed for joint optimization of unicast and anycast flows in connection-oriented networks. The optimization problem is NP-complete. Anycast is a one-to-one-of-manytechnique to deliver a packet to one of many hosts. Current computer networks convey mostly unicast traffic. However, the quantity of anycast traffic will grow in near future, since many new services that can use anycast paradigm are developed, e.g. peer-to-peer networks, content delivery networks, sensor networks, etc. In this work we focus on connection-oriented networks, in view of the fact that many transport networks are based on technologies like MPLS, GMPLS, and DWDM. Results of numerical experiments that compare performance of our approach against other heuristics are presented and discussed.