论文信息 - Combinatorial Optimization of Capacity and Flow Assignment Problem for Unicast and Anycast Connections with Linear and Convex Objective Functions - Exact and heuristic Algorithms

Combinatorial Optimization of Capacity and Flow Assignment Problem for Unicast and Anycast Connections with Linear and Convex Objective Functions - Exact and heuristic Algorithms

Abstract In this work we focus on Capacity and Flow Assignment (CFA) problem for simultaneous unicast and anycast flows. Anycast flow is a new technique to deliver packets in computer networks, in which user can download or send packets to any one of several possible servers. In our work we consider two models of CFA problem. In the first model as the criterion we assume the total average delay function with the budget constraint. In the second model as the objective we use the linear function of cost. The considered problems are NP-complete – therefore, to solve larger problem instances we propose new heuristic algorithms that can be applied.

Krzysztof Walkowiak | Jakub Gladysz

[1] Bezalel Gavish,et al. A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[2] Deep Medhi,et al. Routing, flow, and capacity design in communication and computer networks , 2004 .

[3] Manuel Laguna,et al. Tabu Search , 1997 .

[4] Harry G. Perros,et al. Connection-Oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks , 2005 .

[5] Klaus Wehrle,et al. Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science) , 2005 .

[6] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[7] Klaus Wehrle,et al. Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.