Abstract
The paper investigates a problem of allocating three types of flows (unicast, anycast, multicast) in elastic optical network (EON) with dedicated path protection (DPP). We model the problem using integer linear programming (ILP) and propose solution methods: two greedy algorithms and column generation (CG)-based approach. The main paper focus is put on proposal and comparison of several CG versions that differ in the method used to calculate initial set of columns. To this end, we use five heuristic algorithms of different quality. The results of the simulations show that the proposed CG method performs very good (average gap to optimal result was at most 2.1%), wherein its efficiency depends on the method used to calculate initial set of columns. The findings show that a good quality set of initial columns results in relatively short processing time while the low quality set brings unacceptably long CG calculations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
