@article{talebi_rouskas_2017, title={On Distance-Adaptive Routing and Spectrum Assignment in Mesh Elastic Optical Networks}, volume={9}, ISSN={["1943-0639"]}, DOI={10.1364/jocn.9.000456}, abstractNote={The routing and spectrum assignment (RSA) problem has emerged as the key design and control problem in elastic optical networks. Distance-adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. In this paper, we consider the distance-adaptive RSA (DA-RSA) problem with fixed alternate routing. We first show that the DA-RSA problem in networks of general topology is a special case of a well-studied multiprocessor scheduling problem. We then leverage insights from the scheduling theory to 1) present new results regarding the complexity of the DA-RSA problem and 2) build upon the list of scheduling concepts to develop a computationally efficient solution approach that is effective in utilizing the available spectrum resources.}, number={5}, journal={JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING}, author={Talebi, Sahar and Rouskas, George N.}, year={2017}, month={May}, pages={456–465} }
 @inproceedings{talebi_rouskas_katib_2016, title={Offline distance-adaptive routing and spectrum assignment in mesh elastic optical networks}, DOI={10.1109/glocom.2016.7842036}, abstractNote={The routing and spectrum assignment (RSA) problem has emerged as the key design and control problem in elastic optical networks. Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. In this paper, we consider the distance-adaptive RSA (DA-RSA) problem with fixed alternate routing. We first show that the DA-RSA problem in networks of general topology is a special case of a well-studied multiprocessor scheduling problem. We then leverage insights from scheduling theory to (1) present new results regarding the complexity of the DA-RSA problem, and (2) build upon list scheduling concepts to develop a computationally efficient solution approach that is effective in utilizing the available spectrum resources.}, booktitle={2016 ieee global communications conference (globecom)}, author={Talebi, S. and Rouskas, George and Katib, I.}, year={2016} }
 @article{talebi_katib_rouskas_2015, title={Offline Distance-Adaptive Routing and Spectrum Assignment (DA-RSA) in Rings}, ISSN={["2334-0983"]}, DOI={10.1109/glocom.2015.7417037}, abstractNote={Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. We first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem in mesh networks is a special case of a multiprocessor scheduling problem. We then develop a suite of efficient and effective DA-RSA algorithms that build upon list scheduling concepts. Our work explores the tradeoffs involved in DA-RSA algorithm design, and opens up new research directions that may leverage the vast literature in scheduling theory.}, journal={2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)}, author={Talebi, Sahar and Katib, Iyad and Rouskas, George N.}, year={2015} }
 @article{talebi_bampis_lucarelli_katib_rouskas_2015, title={On Routing and Spectrum Assignment in Rings}, volume={33}, ISSN={["1558-2213"]}, DOI={10.1109/jlt.2014.2376871}, abstractNote={We present a theoretical study of the routing and spectrum assignment (RSA) problem in ring networks. We first show that the RSA problem with fixed-alternate routing in general-topology (mesh) networks (and, hence, in rings as well) is a special case of a multiprocessor scheduling problem. We then consider bidirectional ring networks and investigate two problems: 1) the spectrum assignment problem under the assumption that each demand is routed along a single fixed path (e.g., the shortest path), and 2) the general case of the RSA problem whereby a routing decision along the clockwise and counter-clockwise directions must be made jointly with spectrum allocation. Based on insights from multiprocessor scheduling theory, we derive the complexity of the two problems and develop new constant-ratio approximation algorithms with a ratio that is strictly smaller than the best known ratio to date.}, number={1}, journal={JOURNAL OF LIGHTWAVE TECHNOLOGY}, author={Talebi, Sahar and Bampis, Evripidis and Lucarelli, Giorgio and Katib, Iyad and Rouskas, George N.}, year={2015}, month={Jan}, pages={151–160} }
 @inproceedings{talebi_alam_katib_rouskas_2015, title={Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms}, DOI={10.1109/iccnc.2015.7069420}, abstractNote={We study the spectrum assignment (SA) problem in ring networks with shortest path (or, more generally, fixed) routing. With fixed routing, each traffic demand follows a predetermined path to its destination. In earlier work, we have shown that the SA problem can be viewed as a multiprocessor problem. Based on this insight, we prove that, under the shortest path assumption, the SA problem can be solved in polynomial time in small rings, and we develop constant-ratio approximation algorithms for large rings. For rings of size up to 16 nodes (the maximum size of a SONET/SDH ring), the approximation ratios of our algorithms are strictly smaller than the best known ratio to date.}, booktitle={2015 International Conference on Computing, Networking and Communications (ICNC)}, author={Talebi, S. and Alam, F. and Katib, I. and Rouskas, George}, year={2015}, pages={642–647} }
 @misc{talebi_alam_katib_khamis_salama_rouskas_2014, title={Spectrum management techniques for elastic optical networks: A survey}, volume={13}, ISSN={["1872-9770"]}, DOI={10.1016/j.osn.2014.02.003}, abstractNote={In recent years, OFDM has been the focus of extensive research efforts in optical transmission and networking, initially as a means to overcome physical impairments in optical communications. However, unlike, say, in wireless LANs or xDSL systems where OFDM is deployed as a transmission technology in a single link, in optical networks it is being considered as the technology underlying the novel elastic network paradigm. Consequently, network-wide spectrum management arises as the key challenge to be addressed in network design and control. In this work, we review and classify a range of spectrum management techniques for elastic optical networks, including offline and online routing and spectrum assignment (RSA), distance-adaptive RSA, fragmentation-aware RSA, traffic grooming, and survivability.}, journal={OPTICAL SWITCHING AND NETWORKING}, author={Talebi, Sahar and Alam, Furcian and Katib, Lyad and Khamis, Mohamed and Salama, Reda and Rouskas, George N.}, year={2014}, month={Jul}, pages={34–48} }
 @article{azadeh_asadzadeh_jafari-marandi_nazari-shirkouhi_khoshkhou_talebi_naghavi_2013, title={Optimum estimation of missing values in randomized complete block design by genetic algorithm}, volume={37}, journal={Knowledge-based Systems}, author={Azadeh, A. and Asadzadeh, S. M. and Jafari-Marandi, R. and Nazari-Shirkouhi, S. and Khoshkhou, G. B. and Talebi, S. and Naghavi, A.}, year={2013}, pages={37–47} }
 @inproceedings{talebi_bampis_lucarelli_katib_rouskas, title={The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective}, booktitle={2014 International Conference on Optical Network Design and Modeling}, author={Talebi, S. and Bampis, E. and Lucarelli, G. and Katib, I. and Rouskas, G. N.}, pages={55–60} }