Abstract
One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in the ITU-T standard G.694.1. In this specification, the frequency spectrum of an optical fiber link is divided into narrow frequency slots. Any sequence of consecutive slots can be used as a simple channel, and such a channel can be switched in the network nodes to create a lightpath. In this kind of networks, the problem of establishing lightpaths for a set of end-to-end demands that compete for spectrum resources is called the routing and spectrum allocation problem (RSA). Due to its relevance, this problem has been intensively studied in the last couple of years. It has been shown to be NP-hard (Christodoulopoulos et al. in IEEE J Lightw Technol 29(9):1354–1366, 2011; Wang et al. in IEEE J Opt Commun Netw 4(11):906–917, 2012) and several models and formulations have been proposed, leading to different solution approaches. In this work, we explore integer programming models for RSA, analyzing their effectiveness over known instances. We resort to several modeling techniques, to find natural formulations of this problem. Since integer programming techniques are known to provide successful practical approaches for several combinatorial optimization problems, the aim of this work is to explore a similar approach for RSA.
Similar content being viewed by others
References
Altinakar S, Caporossi G, Hertz A (2016) A comparison of integer and constraint programming models for the deficiency problem. Comput Oper Res 68:89–96
Christodoulopoulos K, Tomkos I, Varvarigos EA (2011) Elastic bandwidth allocation in flexible OFDM-based optical networks. IEEE J Lightw Technol 29(9):1354–1366
Jinno M (2010) Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network. IEEE Commun Mag 48(8):138–145
Klinkowski M, Walkowiak K (2011) Routing and spectrum assignment in spectrum sliced elastic optical path network. IEEE Commun Lett 15(8):884–886
Moreno-Camacho C, Montoy a-Torres J, Vélez-Gallego M (2018) A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times. Eng Optim 50–6:917–932
Koné O, Artigues C, Lopez P, Mongeau M (2013) Comparison of mixed integer linear programming models for the resource-constrained project scheduling problem with consumption and production of resources. Flex Serv Manuf J 25(1–2):24–47
Velasco L, Klinkowski M, Ruiz M, Comellas J (2012) Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photon Netw Commun 24:177–186
Velasco L, Klinkowski M, Zotkiewicz M, Pioro M (2013) Optimization models for flexgrid elastic optical networks. In: Proceedings of the 15th international conference on transparent optical networks (ICTON 2013), Cartagena, Spain, 23–27 June 2013
Wang Y, Cao X, Hu Q, Pan Y (2012) Towards elastic and fine-granular bandwidth allocation in spectrum-sliced optical networks. IEEE J Opt Commun Netw 4(11):906–917
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by D-TEC 0017/13 project.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Appendices
Appendix
A consecutive ones proposition
Fix a demand and a link used by this demand. Let \(S \in \mathbb {N}\) be the amount of available slots. If \(s \in \{1, \dots , S\}\) is a slot then call \(X_s\) the binary variable equal to one if and only if the slot s is used by the demand. Fix the demand volume h such that \(h\le S\) and consider the following constraints:
Theorem 1
Constraints (52) and (53) ensure that there are exactly h consecutive variables in \(\{X_1, \dots , X_S\}\) taking value 1.
Proof
Using constraints (53) and a property of constraints (52) we shall prove that there are at least h consecutive variables taking value 1, and using (52) we shall prove that those h variables are the only ones taking this value.
For \(i=1,\dots , s+1-h\), let \(C_i\) be the constraint (53) associated to the index i, and let \(\mathrm{LHS}_i\) and \(\mathrm{RHS}_i\) be the left-hand and the right-hand side of \(C_i\) respectively, i.e.,
Since \(\mathrm{LHS}_i ~ = ~ \mathrm{RHS}_{i+1}\) for \(i=1,\dots ,s-h\), then \(C_i\) takes the form
Let \(L_i\) be the set of indices of \(\mathrm{LHS}_i\), such that \(X_s\) appears in \(\mathrm{LHS}_i\) if and only if \(s \in L_i\). We have \(i\in L_i\) but \(i \not \in L_{i+1},\dots , i \not \in L_{i+h-1}\), implying that i is the largest element in \(L_i\), i.e., \(i = \max (L_i)\). For \(q = 0, \dots , h-1\) and \(i=1,\dots ,S-q\), we conclude that the only index larger than i in \(L_{i+q}\) is \(i+q\), i.e.,
Now we use these results to prove that any feasible solution that satisfies constraints (52) and (53) has at least h consecutive variables set to 1. For \(i=1,\dots ,S\), we have
Thus, constraints (52) imply:
for \(i=1,\dots ,S+1-h\).
Let \(X^* \in \{0,1\}^{S}\) be a feasible solution, and let p be the lowest index such that \(X^*_p = 1\). Let \(i^*\) be the lowest index such that \(X^*_p \in \mathrm{LHS}_{i^*}\). Because of (56) and since \(x_p=1\) then \(\mathrm{LHS}_{i^*} = 1\). Likewise, because of (54) and (56), we have \(\mathrm{LHS}_k=1\) for every \(k\ge i^*\). In particular,
By the definition of p, we have \(X_{p'} = 0\) for \(p'<p\). This implies that in \(\mathrm{LHS}_k\) such that \(i^*<k<i^*+h\) only variables with indices greater than p can take value 1; but because of (55) those are \(\{X_{p+1}, \dots , X_{p+h-1}\}\).
Therefore, we have at least h consecutive variables taking value 1. Consider now the union of the sets \(\{s\in \{1, \dots ,S\}:~s \equiv j~(mod~h)\}\) for \(j \in \{1, \dots , h\}\). Since all their elements are disjoint, then
This implies that there are at most h variables taking value 1, i.e.,
Since there are at least and at most h consecutive variables taking value 1, there are exactly h variables taking value 1, hence concluding the proof. \(\square \)
Rights and permissions
About this article
Cite this article
Bertero, F., Bianchetti, M. & Marenco, J. Integer programming models for the routing and spectrum allocation problem. TOP 26, 465–488 (2018). https://doi.org/10.1007/s11750-018-0483-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-018-0483-6