Inria Associated Team EfDyNet

EfDyNet

Efficient Dynamic Resource Allocation in Networks

Programme INRIA “Equipes Associées” 2019-2021


Inria Project-Team : COATI Foreign Partner: Concordia University, Montréal
Inria Sophia Antipolis — Méditerranée
Thème INRIA : Com B
Country: Canada (Québec)
French coordinator Canadian coordinator
Name, surname Frédéric Giroire Brigitte Jaumard
Title Chargé de Recherche CNRS (Research officer) Professor
Institution Project-team COATI, common team
INRIA Sophia Antipolis – I3S (CNRS UMR 7271, University Nice-Sophia Antipolis)
Computer Science and Software Engineering (CSE) Department, Concordia University, Montréal, Québec, Canada
Address
INRIA Sophia-Antipolis Méditerranée
2004, route des Lucioles — B.P. 93
06902 Sophia-Antipolis Cedex
France
Concordia University
Sir George Williams Campus
1455 De Maisonneuve Blvd. W.
Montreal, Quebec, Canada
H3G 1M8
URL http://www-sop.inria.fr/members/Frederic.Giroire/ http://users.encs.concordia.ca/~bjaumard/

Activity reports

Participants

Documents

Visits in 2019

Publications of the Project

Automatic extraction from HAL if contains “EfDyNet” in field “collaborations”

Publications HAL

Publications HAL

–>


Scientific programme and objectives

Context

Networks are evolving rapidly in two directions. On the one hand, new network technologies are developed for different layers, and in particular flexible optical technologies (enabling to allocate a fraction of the optical spectrum rather than a fixed wavelength), Software Defined Networks, and Network Function Virtualization. On the other hand, the traffic patterns evolve and become less predictable due to the increase of cloud and mobile traffic. In this context, there are new possibilities and needs for dynamic resource allocations. We will study this problem mainly in two directions: network reconfiguration and the allocation of virtualized resources.

  • Network Reconfiguration.
    Network reconfiguration is required in order to adapt to traffic changes, network failures, or new deployment of network resources. It occurs at the optical layer in order to make sure that the upper layer traffic, e.g., IP layer traffic, can be efficiently carried. In such a case, we deal with lightpath reconfigurations and the primary objective is to reduce disruptions to user traffic carried by existing lightpaths, measured by the number of disrupted lightpaths or the duration of lightpath disruptions [1, 2, 3]. Network reconfiguration may also arise at the logical layer, in order to attain a better resource utilization [4, 5]. In heavily loaded networks, dynamic connection addition and drop actions may result in a set of connections where some paths are not the shortest possible ones, leading to poor resource utilization compared to an optimal or at least optimized state. Thus, global connection re-optimization is proposed at certain time intervals (e.g., daily, weekly) to improve the network performance. While several works already exist on network reconfigurations, most of the approaches used in practice (i.e., by network operators) are greedy heuristics, with no information on the quality of their solutions. Our recent joint investigations on reconfiguration both for optical [6] and for the logical layer [7, 8] let us think that it is possible to solve the reconfiguration problem exactly and at scale, in addition to be able to estimate the maximum load that should be allowed in the network in order to be able to do it without any disruption, or a very limited number of them. We will benefit from a collaboration of Brigitte Jaumard with CIENA, which is helping us for assessing the accuracy of our algorithmic solutions.
  • Virtualized Software Defined Networks.
    Software-defined networking (SDN) has been attracting a growing attention in the networking research community in recent years. SDN is a new networking paradigm that decouples the control plane from the data plane. It provides a flexibility to develop and test new network protocols and policies in real networks, see e.g. the experiment of Google for its inter-datacenter network [9]. Network Function Virtualization (NFV) is an emerging approach in which network functions are no longer executed by proprietary software appliances but instead, can run on generic-purpose servers located in small cloud nodes [10]. Examples of network functions include firewalls, load balancing, content filtering, and deep packet inspection. This technology aims at dealing with the major problems of today’s enterprise middlebox infrastructure, such as cost, capacity rigidity, management complexity, and failures [11]. One of the main advantages of this approach is that Virtual Network Functions (VNFs) can be instantiated and scaled on demand without the need of installing new equipment. These new technologies bear the promise of important cost savings and of new possibilities but introduces new complex problems [10, 12, 13], which need to be addressed: how to do efficiently (dynamic) resource allocations (paths and virtualized resources)?

Objectives

We will design exact and approximate methods for optimizing the usage of network resources. We will consider resource allocation and network reconfiguration in physical and logical networks as well as in SDN. Our main objectives are:

  • Network Reconfiguration.
    Reconfiguration can be performed with two strategies. For both strategies, we assume that we are given the current network provisioning, and we aim at moving to an optimized one, requiring less bandwidth while granting the same set of requests. Along the first strategy, the idea is to compute an optimized provisioning, and then find the most seamless transition from the current provisioning to the optimized one [14, 3, 15]. In the second strategy, the idea is to iteratively improve the current provisioning with one rerouting at a time [16, 4, 7, 8], assuming each rerouting can be made before the break move, i.e., a rerouting with no disruption. While with the first strategy, we usually reach a more efficient provisioning, it is at the expense of a number of disruptions.
    Based on the expertise of B. Jaumard for solving efficiently the RWA (Routing and Wavelength Assignment) and RSA (Routing and Spectrum Assignment) problems [17, 18, 19] and the expertise of D. Coudert on graph algorithms [20] and routing reconfiguration [21, 2, 14, 5, 22], our objectives are as follows:

    • Investigate further the RWA reconfiguration problem. We currently completed a first study with the minimization of the number of disruptions. We plan to extend it as explained in the following in the plan for next year.
    • Study the RSA reconfiguration problem, as backbone networks are moving towards it, following the huge increase in bandwidth requirements. This is an even more challenging optimization problem than for RWA.
    • Use the gained expertise to study network reconfiguration in SDN, possibly including the live migration of virtual machines or functions.

  • Virtualized Software Defined Networks.
    The same virtual function can be replicated and executed on several servers. It follows that a fundamental problem arising when dealing with network functions is how to map these functions to nodes (servers) in the network while achieving a specific objective. Moreover, SDN allows to do the allocation dynamically on the fly, when new requests arrive. This means that classic networking problems (e.g. routing, scheduling, failure protection) have to be readdressed in a new context in which virtualized resources may be allocated, migrated, and removed on the fly on top of a physical infrastructure.

    To address this problem, we will use the expertise of both groups, in particular the corpus of works done in the context of WDM optical networks. Indeed, optical networks also are layered graphs in which a logical topology has to be mapped onto a physical fiber topology. Similarly, a set of virtualized resources has to be mapped into the physical network. We will explore different directions.

    • Complex optimization methods, such as decomposition techniques, and in particular column generation. These techniques are used when classical optimization techniques such as integer linear programs do not scale. The main idea is to decompose the problem into subproblems, which can then be solved independently and efficiently. Brigitte Jaumard is specialist in optimization methods and will bring her expertise to the project.
    • Algorithmics and in particular approximation algorithms. If, as stated, the main problems are very complex, some the subproblems may be solved efficiently. In particular, some variant of constrained shortest paths or of covering problems appear. COATI is expert in this area.
    • Last, we will use the knowledge gained working on optical and IP network reconfigurations to study how to re-optimize on the fly the usage of virtual resources (e.g. virtual network functions). Indeed, a shared virtual resource may have to be updated and/or moved when the demand has evolved. We will study the problem in the context of network slicing which is the topic of the Ph.D. of Adrien Gausseran (supervised by J. Moulierac). A network slice is a virtual network that is embedded on top of a physical network in a way that creates the illusion of the slice tenant of operating its own dedicated physical network. Network slicing is foreseen to be a key component of 5G to provision isolated and personalized network services to different applications (e.g., connected vehicles, smart factories) [23, 24].

Work-program

During the first year of the project, we will address the following tasks:

  • Network reconfiguration. (COATI: D. Coudert, A. Gausseran | CSE: H. Duong, B. Jaumard, Quang Anh Nguyen)
    • Write a survey on the lightpath reconfiguration problem in WDM networks. To this end, we need to compare existing methods and build a framework for experiments (implement all models, build traffic instances, etc.)
    • Investigate tradeoffs in the RWA reconfiguration problem. The number of disruptions in the migration depends on the optimized RWA provisioning. Can we define metrics enabling to build an optimized RWA solution inducing the minimum number of disruptions?
      Can we avoid disruptions while maintaining the quality of the provisioning ?
    • Start studying the RSA reconfiguration problem. Based on the particularities of RSA, we plan to look at how to combine the push-pull mechanism proposed for dynamic RSA [25] with the classical reconfiguration tools in order to minimize the number of disruptions. Additionally, we would like to extend our recent work on the logical layer [7, 8] in order to design a scalable model and algorithm for the RWA reconfiguration problem.
  • Tolerance for failures and dynamics of virtual resources. (COATI: F. Giroire, A. Gausseran, J. Moulierac, A. Tomassilli | CSE: B. Jaumard, Shima Ghanei Zare, Adham Mohammed)

    Network flows are often required to be processed by an ordered sequence of network functions. For instance, an Intrusion Detection System may need to inspect the packet before compression or encryption are performed. Moreover, different customers can have different requirements in terms of the sequence of network functions to be performed [26]. This notion is known as Service Function Chaining (SFC) [27].
    This is a very complex objective as it adds a constraint of order to a set of already NP-complete problems.
    In the first year, we will consider this problem of mapping with the additional constraints (1) first of tolerating failures and (2) second of considering very dynamic traffic.

    1. Indeed, failures are very frequent in network and data centers. In particular, it is reported in [28], that, in the monitored Data Center Network, each link experienced in average 16 failures per year, considering a five years time period [28]. We will investigate with A. Tomassilli different protection techniques (link or path protection, dedicated or shared protection) for different kinds of failures (link failures, node failures, network function failures). In collaboration with B. Jaumard and during the visit in Concordia of F. Giroire, we will build scalable decomposition models to solve the problem, first in a static case in which the requests are given offline. The next step will be to consider the dynamic case.
    2. We will consider a dynamic setting in which network slices requiring virtual resources have to be set up on the fly for clients. From time to time, the virtual resources have to be updated. We will investigate how the use of reconfiguration algorithms may improve their usage. This will be the goal of the 3 month visit of A. Gausseran and of the 2 week visit of J. Moulierac in Concordia in 2019.


References

[1] [doi] H. Li and J. Wu, “Survey of WDM network reconfiguration: topology migrations and their impact on service disruptions,” Telecommunication systems, vol. 60, p. 349–366, 2015.
[Bibtex]
@article{li15,
author = {H. Li and J. Wu},
title = {Survey of {WDM} network reconfiguration: topology migrations
and their impact on service disruptions},
journal = {Telecommunication Systems},
volume = {60},
issue = {3},
year = {2015},
pages = {349--366},
month = nov,
doi="10.1007/s11235-015-0050-5",
}
[2] [pdf] [doi] N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse, “Tradeoffs in process strategy games with application in the WDM reconfiguration problem,” Theoretical Computer Science, vol. 412, iss. 35, pp. 4675-4687, 2011.
[Bibtex]
@article{CoudertTCS2011,
TITLE = {{Tradeoffs in process strategy games with application in the WDM reconfiguration problem}},
AUTHOR = {Cohen, Nathann and Coudert, David and Mazauric, Dorian and Nepomuceno, Napoleao and Nisse, Nicolas},
OPTURL = {https://hal.inria.fr/inria-00592507},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {412},
NUMBER = {35},
PAGES = {4675-4687},
YEAR = {2011},
DOI = {10.1016/j.tcs.2011.05.002},
PDF = {https://hal.inria.fr/inria-00592507/file/paper-noformat.pdf},
HAL_ID = {inria-00592507},
HAL_VERSION = {v1},
}
[3] [doi] F. Solano, “Analyzing two conflicting objectives of the WDM lightpath reconfiguration problem,” in Ieee global telecommunications conference – globecom, 2009, pp. 1-7.
[Bibtex]
@INPROCEEDINGS{Sol09,
author={F. Solano},
booktitle=GLOBECOM,
title={Analyzing Two Conflicting Objectives of the {WDM} Lightpath Reconfiguration Problem},
year={2009},
pages={1-7},
doi={10.1109/GLOCOM.2009.5426108},
month=nov,
}
[4] [doi] B. G. Józsa and M. Makai, “On the solution of reroute sequence planning problem in MPLS networks,” Computer networks, vol. 42(2), p. 199–210, 2003.
[Bibtex]
@article{joz03,
author = {B. G. J\'ozsa and M. Makai},
title = {On the solution of reroute sequence planning problem in {MPLS} networks},
journal = {Computer Networks},
volume = {42(2)},
year = {2003},
pages = {199--210},
doi = {10.1016/S1389-1286(03)00189-0}
}
[5] [doi] D. Coudert, D. Mazauric, and N. Nisse, “On Rerouting Connection Requests in Networks with Shared Bandwidth,” in DIMAP Workshop on Algorithmic Graph Theory (AGT), Warwick, United Kingdom, 2009.
[Bibtex]
@inproceedings{CoudertAGT2009,
TITLE = {{On Rerouting Connection Requests in Networks with Shared Bandwidth}},
AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
URL = {https://hal.inria.fr/inria-00423452},
BOOKTITLE = {{DIMAP Workshop on Algorithmic Graph Theory (AGT)}},
ADDRESS = {Warwick, United Kingdom},
SERIES = {Electronic Note Discrete Maths.},
VOLUME = {32},
YEAR = {2009},
DOI = {10.1016/j.endm.2009.02.015},
HAL_ID = {inria-00423452},
HAL_VERSION = {v1},
}
[6] B. Jaumard, H. Pouya, and D. Coudert, “Wavelength defragmentation for make-before-break migration,” in International conference on transparent optical networks, Bucharest, Romania, 2018, pp. 1-4.
[Bibtex]
@inproceedings{jau18_Hamed,
TITLE = {Wavelength Defragmentation for Make-Before-Break Migration},
AUTHOR = {Jaumard, Brigitte and Pouya, Hamed and Coudert, David},
BOOKTITLE = {International Conference on Transparent Optical Networks},
YEAR = {2018},
MONTH = jul,
address = {Bucharest, Romania},
pages = {1-4},
}
[7] H. Duong, B. Jaumard, D. Coudert, and R. Armolavicius, “Efficient make before break defragmentation,” in Ieee international conference on high performance switching and routing (hpsr), Bucharest, Romania, 2018.
[Bibtex]
@inproceedings{Duong2018a,
TITLE = {Efficient Make Before Break Defragmentation},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Ron},
BOOKTITLE = {IEEE International Conference on High Performance Switching and Routing (HPSR)},
YEAR = {2018},
MONTH = jun,
address = {Bucharest, Romania},
}
[8] [pdf] H. Duong, B. Jaumard, D. Coudert, and R. Armolavicius, “Modèle d’optimisation pour la défragmentation de la capacité,” in ALGOTEL 2018 – 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, 2018.
[Bibtex]
@inproceedings{Duong2018b,
TITLE = {{Mod{\`e}le d'optimisation pour la d{\'e}fragmentation de la capacit{\'e}}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Ron},
URL = {https://hal.inria.fr/hal-01773572},
BOOKTITLE = {{ALGOTEL 2018 - 20{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Roscoff, France},
YEAR = {2018},
MONTH = May,
KEYWORDS = {Fragmentation des ressources ; r{\'e}seau optique ; couche utilisateur ; reroutage transparent ; reroutage MBB},
PDF = {https://hal.inria.fr/hal-01773572/file/Algotel_2018_final.pdf},
HAL_ID = {hal-01773572},
HAL_VERSION = {v2},
}
[9] [doi] S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu, and others, “B4: experience with a globally-deployed software defined wan,” Acm sigcomm computer communication review, vol. 43, iss. 4, p. 3–14, 2013.
[Bibtex]
@article{jain2013b4,
title={B4: Experience with a globally-deployed software defined WAN},
author={Jain, Sushant and Kumar, Alok and Mandal, Subhasree and Ong, Joon and Poutievski, Leon and Singh, Arjun and Venkata, Subbaiah and Wanderer, Jim and Zhou, Junlan and Zhu, Min and others},
journal={ACM SIGCOMM Computer Communication Review},
volume={43},
number={4},
pages={3--14},
year={2013},
publisher={ACM},
doi = {10.1145/2534169.2486019},
}
[10] [doi] B. Han, V. Gopalakrishnan, L. Ji, and S. Lee, “Network function virtualization: challenges and opportunities for innovations,” Ieee communications magazine, vol. 53, iss. 2, p. 90–97, 2015.
[Bibtex]
@article{han2015network,
title={Network function virtualization: Challenges and opportunities for innovations},
author={Han, Bo and Gopalakrishnan, Vijay and Ji, Lusheng and Lee, Seungjoon},
journal={IEEE Communications Magazine},
volume={53},
number={2},
pages={90--97},
year={2015},
publisher={IEEE},
doi = {10.1109/MCOM.2015.7045396}
}
[11] J. Sherry, S. Hasan, C. Scott, A. Krishnamurthy, S. Ratnasamy, and V. Sekar, “Making middleboxes someone else’s problem: network processing as a cloud service,” Acm sigcomm computer communication review, vol. 42, iss. 4, p. 13–24, 2012.
[Bibtex]
@article{sherry2012making,
title={Making middleboxes someone else's problem: network processing as a cloud service},
author={Sherry, Justine and Hasan, Shaddi and Scott, Colin and Krishnamurthy, Arvind and Ratnasamy, Sylvia and Sekar, Vyas},
journal={ACM SIGCOMM Computer Communication Review},
volume={42},
number={4},
pages={13--24},
year={2012},
publisher={ACM}
}
[12] [doi] R. Mijumbi, J. Serrat, J. Gorricho, N. Bouten, F. De Turck, and R. Boutaba, “Network function virtualization: state-of-the-art and research challenges,” Ieee communications surveys & tutorials, vol. 18, iss. 1, p. 236–262, 2016.
[Bibtex]
@article{mijumbi2016network,
title={Network function virtualization: State-of-the-art and research challenges},
author={Mijumbi, Rashid and Serrat, Joan and Gorricho, Juan-Luis and Bouten, Niels and De Turck, Filip and Boutaba, Raouf},
journal={IEEE Communications Surveys \& Tutorials},
volume={18},
number={1},
pages={236--262},
year={2016},
publisher={IEEE},
doi = {10.1109/COMST.2015.2477041},
}
[13] [doi] J. Lai, Q. Fu, and T. Moors, “Using SDN and NFV to enhance request rerouting in ISP-CDN collaborations,” Computer networks, vol. 113(1), p. 176–187, 2017.
[Bibtex]
@article{lai17,
author = {J. Lai and Q. Fu and T. Moors},
title = {Using {SDN} and {NFV} to enhance request rerouting in {ISP-CDN} collaborations},
journal = {Computer Networks},
volume = {113(1)},
month = feb,
year = {2017},
pages = {176--187},
doi = {10.1016/j.comnet.2016.12.010},
}
[14] [pdf] D. Coudert, S. Pérennes, Q. Pham, and J. Sereni, “Rerouting requests in WDM networks,” in 7eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), Presqu’île de Giens, France, 2005, pp. 17-20.
[Bibtex]
@inproceedings{CoudertALGOTEL2005,
TITLE = {{Rerouting requests in WDM networks}},
AUTHOR = {Coudert, David and P{\'e}rennes, St{\'e}phane and Pham, Quang-Cuong and Sereni, Jean-S{\'e}bastien},
URL = {https://hal.inria.fr/inria-00429173},
BOOKTITLE = {{7eme Rencontres Francophones sur les aspects Algorithmiques des T{\'e}l{\'e}communications (AlgoTel)}},
ADDRESS = {Presqu'{\^i}le de Giens, France},
PAGES = {17-20},
YEAR = {2005},
MONTH = May,
PDF = {https://hal.inria.fr/inria-00429173/file/CPPS-AlgoTel05.pdf},
HAL_ID = {inria-00429173},
HAL_VERSION = {v1},
}
[15] [doi] F. Solano and M. Pióro, “Lightpath reconfiguration in WDM networks,” Ieee/osa journal of optical communications and networking, vol. 2, iss. 12, p. 1010 – 1021, 2010.
[Bibtex]
@article{sol10,
author = {F. Solano and M. Pi\'oro},
title = {Lightpath Reconfiguration in {WDM} Networks},
journal = JOCN,
volume = {2},
number = {12},
month = dec,
year = {2010},
pages = {1010 -- 1021},
doi = {10.1364/JOCN.2.001010}
}
[16] [doi] O. Klopfenstein, “Rerouting tunnels for MPLS network resource optimization,” European journal of operational research, vol. 188(1), p. 293–312, 2008.
[Bibtex]
@article{klo08,
author = {O. Klopfenstein},
title = {Rerouting tunnels for {MPLS} network resource optimization},
journal = {European Journal of Operational Research},
volume = {188(1)},
year = {2008},
pages = {293--312},
doi = {10.1016/j.ejor.2007.04.016}
}
[17] [doi] B. Jaumard and M. Daryalal, “Efficient spectrum utilization in large scale RWA problems,” Ieee/acm transactions on networking, vol. 25, iss. 2, pp. 1263-1278, 2017.
[Bibtex]
@article{jau17_TON,
author = "B. Jaumard and M. Daryalal",
title = {Efficient Spectrum Utilization in Large Scale {RWA} Problems},
journal = "IEEE/ACM Transactions on Networking",
month = apr,
volume = {25},
number = {2},
year = "2017",
pages = "1263-1278",
doi = {10.1109/TNET.2016.2628838},
}
[18] J. Enoch and B. Jaumard, “Towards optimal and scalable solution for routing and spectrum allocation,” in International network optimization conference (inoc), Portugal, Lisboa, 2017.
[Bibtex]
@inproceedings{Enoch2017,
author = {Enoch, Julian and B. Jaumard},
title = {Towards Optimal and Scalable Solution for Routing and Spectrum Allocation},
booktitle = {International Network Optimization Conference (INOC)},
address = {Portugal, Lisboa},
month = feb,
year = {2017},
note = {To appear in Electronic Notes in Discrete Mathematics (ENDM)},
}
[19] J. Enoch and B. Jaumard, “Enhanced rwa exact solution with a new lightpath decomposition algorithm,” in International conference on computing, networking and communications (icnc), Maui, Hawaii, USA, 2018.
[Bibtex]
@inproceedings{Enoch2018_ICNC,
author = {Enoch, Julian and B. Jaumard},
title = {Enhanced RWA Exact Solution with a New Lightpath Decomposition Algorithm},
booktitle = {International Conference on Computing, Networking and Communications (ICNC)},
address = {Maui, Hawaii, USA},
month = mar,
year = {2018},
}
[20] [pdf] [doi] D. Coudert, D. Mazauric, and N. Nisse, “Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth,” ACM Journal of Experimental Algorithmics, vol. 21, iss. 1, p. 23, 2016.
[Bibtex]
@article{CoudertJEA2016,
TITLE = {{Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth}},
AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
JOURNAL = {{ACM Journal of Experimental Algorithmics}},
VOLUME = {21},
NUMBER = {1},
PAGES = {23},
YEAR = {2016},
DOI = {10.1145/2851494},
OPTURL = {https://hal.inria.fr/hal-01266496},
PDF = {https://hal.inria.fr/hal-01266496/file/babpw-20151120.pdf},
HAL_ID = {hal-01266496},
HAL_VERSION = {v1},
}
[21] [pdf] [doi] D. Coudert and J. Sereni, “Characterization of graphs and digraphs with small process number,” Discrete Applied Mathematics, vol. 159, iss. 11, pp. 1094-1109, 2011.
[Bibtex]
@article{CoudertDAM2011,
TITLE = {{Characterization of graphs and digraphs with small process number}},
AUTHOR = {Coudert, David and Sereni, Jean-S{\'e}bastien},
OPTURL = {https://hal.inria.fr/inria-00587717},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {159},
NUMBER = {11},
PAGES = {1094-1109},
YEAR = {2011},
MONTH = Jul,
DOI = {10.1016/j.dam.2011.03.010},
PDF = {https://hal.inria.fr/inria-00587717/file/dam-noformat.pdf},
HAL_ID = {inria-00587717},
HAL_VERSION = {v1},
}
[22] [pdf] S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, and I. Tahiri, “Reconfiguration with physical constraints in WDM networks,” in Workshop on New Trends in Optical Networks Survivability, Canada, 2012, p. 5.
[Bibtex]
@inproceedings{CoudertICC2012,
TITLE = {{Reconfiguration with physical constraints in WDM networks}},
AUTHOR = {Belhareth, Sonia and Coudert, David and Mazauric, Dorian and Nisse, Nicolas and Tahiri, Issam},
URL = {https://hal.archives-ouvertes.fr/hal-00704199},
BOOKTITLE = {{Workshop on New Trends in Optical Networks Survivability}},
ADDRESS = {Canada},
PAGES = {5},
YEAR = {2012},
PDF = {https://hal.archives-ouvertes.fr/hal-00704199/file/ReconfPhysicalConstraintShort.pdf},
HAL_ID = {hal-00704199},
HAL_VERSION = {v1},
}
[23] H. Zhang, N. Liu, X. Chu, K. Long, A. Aghvami, and V. C. Leung, “Network slicing based 5g and future mobile networks: mobility, resource management, and challenges,” Ieee communications magazine, vol. 55, iss. 8, p. 138–145, 2017.
[Bibtex]
@article{zhang2017network,
title={Network slicing based 5G and future mobile networks: mobility, resource management, and challenges},
author={Zhang, Haijun and Liu, Na and Chu, Xiaoli and Long, Keping and Aghvami, Abdol-Hamid and Leung, Victor CM},
journal={IEEE Communications Magazine},
volume={55},
number={8},
pages={138--145},
year={2017},
publisher={IEEE}
}
[24] N. Nikaein, E. Schiller, R. Favraud, K. Katsalis, D. Stavropoulos, I. Alyafawi, Z. Zhao, T. Braun, and T. Korakis, “Network store: exploring slicing in future 5g networks,” in Proceedings of the 10th international workshop on mobility in the evolving internet architecture, 2015, p. 8–13.
[Bibtex]
@inproceedings{nikaein2015network,
title={Network store: Exploring slicing in future 5g networks},
author={Nikaein, Navid and Schiller, Eryk and Favraud, Romain and Katsalis, Kostas and Stavropoulos, Donatos and Alyafawi, Islam and Zhao, Zhongliang and Braun, Torsten and Korakis, Thanasis},
booktitle={Proceedings of the 10th International Workshop on Mobility in the Evolving Internet Architecture},
pages={8--13},
year={2015},
organization={ACM}
}
[25] [doi] R. Wang and B. Mukherjee, “Spectrum management in heterogeneous bandwidth optical networks,” Optical switching and networking, vol. 11, p. 83–91, 2014.
[Bibtex]
@article{wan14,
author = { Wang, Rui and
Mukherjee, Biswanath},
title = {Spectrum management in heterogeneous bandwidth optical networks},
journal = {Optical Switching and Networking},
volume = {11},
pages = {83--91},
year = {2014},
url = {https://doi.org/10.1016/j.osn.2013.09.003},
doi = {10.1016/j.osn.2013.09.003},
}
[26] [doi] M. Savi, M. Tornatore, and G. Verticale, “Impact of processing costs on service chain placement in network functions virtualization,” in Network function virtualization and software defined network (nfv-sdn), 2015 ieee conference on, 2015, p. 191–197.
[Bibtex]
@inproceedings{savi2015impact,
title={Impact of processing costs on service chain placement in network functions virtualization},
author={Savi, Marco and Tornatore, Massimo and Verticale, Giacomo},
booktitle={Network Function Virtualization and Software Defined Network (NFV-SDN), 2015 IEEE Conference on},
pages={191--197},
year={2015},
organization={IEEE},
doi = {10.1109/NFV-SDN.2015.7387426}
}
[27] P. Quinn and T. Nadeau, Problem statement for service function chaining, 2015.
[Bibtex]
@misc{quinn2015problem,
title={Problem statement for service function chaining},
author={Quinn, Paul and Nadeau, Tom},
year={2015},
howpublished = {Internet Engineering Task Force, RFC 7498},
url = {https://tools.ietf.org/html/rfc7498}
}
[28] [doi] D. Turner, K. Levchenko, A. C. Snoeren, and S. Savage, “California fault lines: understanding the causes and impact of network failures,” in Acm sigcomm computer communication review, 2010, p. 315–326.
[Bibtex]
@inproceedings{turner2010california,
title={California fault lines: understanding the causes and impact of network failures},
author={Turner, Daniel and Levchenko, Kirill and Snoeren, Alex C and Savage, Stefan},
booktitle={ACM SIGCOMM Computer Communication Review},
volume={40},
number={4},
pages={315--326},
year={2010},
organization={ACM},
doi = {10.1145/1851275.1851220}
}

Comments are closed.