TY - JOUR
T1 - Investigation on static routing and resource assignment of elastic all-optical switched intra-datacenter networks
AU - Peng, Limei
AU - Park, Kiejin
AU - Youn, Chan Hyun
N1 - Publisher Copyright:
© 2016, Science China Press and Springer-Verlag Berlin Heidelberg.
PY - 2016/10/1
Y1 - 2016/10/1
N2 - In this paper, we explore the issue of static routing and spectrum/IT resource assignment (RSIA) of elastic all-optical switched intra-datacenter networks (intra-DCNs) by proposing anycast- and manycast-based integer linear programming (ILP) models. The objective is to jointly optimize the DCN resources, i.e., network transmission bandwidth and IT resources, under different situations. First, for given service-request matrices with unknown network transmission bandwidth and IT resources, we propose anycast and manycast ILP models to minimize the maximum numbers of required network and IT resources to accommodate all the service requests. For anycast RSIA issue, we proposed two different ILP models that are based on node-arc and link-path methods, respectively. Node-arc based manycast ILP model is also proposed for the first time to our knowledge. Second, for given network transmission bandwidth and IT resources and known service-request matrices, we propose node-arc based anycast ILP models to maximize the total number of successfully served service requests. To evaluate the efficiency of anycast and manycast models, all proposed ILP models are evaluated and compared with unicast ILP models. Simulation results show that anycast and manycast ILP models perform much better in efficiently using DCN resources and successfully accommodating more service requests when compared to unicast ILP models under the same network conditions.
AB - In this paper, we explore the issue of static routing and spectrum/IT resource assignment (RSIA) of elastic all-optical switched intra-datacenter networks (intra-DCNs) by proposing anycast- and manycast-based integer linear programming (ILP) models. The objective is to jointly optimize the DCN resources, i.e., network transmission bandwidth and IT resources, under different situations. First, for given service-request matrices with unknown network transmission bandwidth and IT resources, we propose anycast and manycast ILP models to minimize the maximum numbers of required network and IT resources to accommodate all the service requests. For anycast RSIA issue, we proposed two different ILP models that are based on node-arc and link-path methods, respectively. Node-arc based manycast ILP model is also proposed for the first time to our knowledge. Second, for given network transmission bandwidth and IT resources and known service-request matrices, we propose node-arc based anycast ILP models to maximize the total number of successfully served service requests. To evaluate the efficiency of anycast and manycast models, all proposed ILP models are evaluated and compared with unicast ILP models. Simulation results show that anycast and manycast ILP models perform much better in efficiently using DCN resources and successfully accommodating more service requests when compared to unicast ILP models under the same network conditions.
KW - anycast
KW - datacenter networks (DCNs)
KW - ILP models
KW - intra-DCN
KW - manycast
KW - RSIA
UR - http://www.scopus.com/inward/record.url?scp=84989291279&partnerID=8YFLogxK
U2 - 10.1007/s11432-016-0312-7
DO - 10.1007/s11432-016-0312-7
M3 - Article
AN - SCOPUS:84989291279
SN - 1674-733X
VL - 59
JO - Science China Information Sciences
JF - Science China Information Sciences
IS - 10
M1 - 102304
ER -