06004206

j

06004206 G{\l}adysz, Jakub Optimization of links cost for unicast and anycast traffic. Theor. Appl. Inform. 23, No. 3-4, 163-176 (2011). 2011 Institute of Theoretical and Applied Informatics of Polish Academy of Science, Gliwice; Versita, Warsaw EN unicast anycast capacity CFA heuristic algorithms

doi:10.2478/v10179-011-0011-y

Summary: This work presents optimization model and computational results of Capacity and Flow Assignment Problem for multilayer networks with unicast and anycast traffic. Capacity of each channel is expressed in a set of link proposal. Anycast is a network addressing and routing methodology in which datagrams from a single sender are routed to the topologically nearest node in a group of potential receivers all identified by the same destination address. We propose two heuristic algorithms based on Flow Deviation and Tabu Search method. The results of algorithms will be compared with optimal solution obtained using CPLEX package. To improve execution time of exact algorithm we introduce cut inequalities. Cut inequalities are added to the optimization problem, enabling the branching phase to use this information in calculation of more effective bounds. Next, we want to examine testing networks depend on different percentage of anycast traffic, number of distribution centers (servers or replicas) and the different size of network (number of nodes, links, routes).