Multi-period traffic routing in satellite networks

Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances

“…• In the literature, Gamvros and Raghavan [2012] solved the dynamic unsplittable flow problem using a Mixed Integer Linear Program (MILP) inside a Branch and Price approach. After recalling the principle of their approach, we highlight that their pricing scheme has an exponential worst-case complexity.…”

“…• We introduce two new formulations for the dynamic unsplittable flow problem. The first one is a mixed integer linear program that is shown to have a linear relaxation as strong as the formulation of Gamvros and Raghavan [2012]. This formulation yields good empirical results when the paths allowed for each commodity are heuristically restrained to a small carefully chosen set.…”

Network coding‐based multi‐path routing algorithm in two‐layered satellite networks

“…Bayhan et al [8] introduced an adaptive routing scheme to improve the system performance for delay‐sensitive traffic through two‐layered satellite networks. A multi‐period traffic routing procedure was presented by Gamvrosab [9] to deal with the rerouting penalties in consideration of the route changes in satellite networks. Long F [10] proposed a sustainable heuristic routing algorithm in order to provide better service in end‐to‐end delay and package loss.…”

Applications of Evolutionary Computation

“…Moreover, traffic uncertainty is taken into account to protect design solutions against deviations of the traffic input data, that may compromise feasibility and optimality of solutions. To the best of our knowledge, the (MP-NDP) has received little attention and just a few works have investigated it (primarily, [18] and [16]). These works point out the difficulty of solving multiperiod problems already for just two periods and (easier) splittable-flow routing [18], and for a pure routing problem in satellite communications [16].…”

“…To the best of our knowledge, the (MP-NDP) has received little attention and just a few works have investigated it (primarily, [18] and [16]). These works point out the difficulty of solving multiperiod problems already for just two periods and (easier) splittable-flow routing [18], and for a pure routing problem in satellite communications [16]. Our direct and more recent computational experience confirmed this behaviour, even for instances of moderate size considering a low number of time periods and solved by a stateof-the-art commercial mixed-integer programming solver.…”