C-Share: Optical Circuits Sharing for Software-Defined Data-Centers

被引:2
作者
Vargaftik, Shay [1 ,3 ]
Caba, Cosmin [2 ]
Schour, Liran [3 ]
Ben-Itzhak, Yaniv [1 ,3 ]
机构
[1] VMware Res, Palo Alto, CA 94304 USA
[2] DTU Foton, Lyngby, Denmark
[3] IBM Res Lab, Haifa, Israel
关键词
data center networks; hardware; networks; photonic and optical interconnect;
D O I
10.1145/3390251.3390253
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Integrating optical circuit switches in data-centers is an on-going research challenge. In recent years, state-of-the-art solutions introduce hybrid packet/circuit architectures for different optical circuit switch technologies, control techniques, and traffic re-routing methods. These solutions are based on separated packet and circuit planes that cannot utilize an optical circuit with flows that do not arrive from or delivered to switches directly connected to the circuit's end-points. Moreover, current SDN-based elephant flow re-routing methods require a forwarding rule for each flow, which raises scalability issues. In this paper, we present C-Share - a scalable SDN-based circuit sharing solution for data center networks. C-Share inherently enables elephant flows to share optical circuits by exploiting a flat top-of-rack tier network topology. C-Share is based on a scalable and decoupled SDN-based elephant flow re-routing method comprised of elephant flow detection, tagging and identification, which is utilized by using a prevalent network sampling method (e.g., sFlow). C-Share requires only a single OpenFlow rule for each optical circuit, and therefore significantly reduces the required OpenFlow rule entry footprint and setup rule rate. It also mitigates the OpenFlow outbound latency for subsequent elephant flows. We implement a proof-of-concept system for C-Share based on Mininet, and test the scalability of C-Share by using an event-driven simulation. Our results show a consistent increase in the mice/elephant flow separation in the network, which, in turn, improves both network throughput and flow completion time.
引用
收藏
页码:3 / 9
页数:7
相关论文
共 34 条
  • [1] Abts D, 2010, CONF PROC INT SYMP C, P338, DOI 10.1145/1816038.1816004
  • [2] Ahn J. H., 2009, P C HIGH PERF COMP N
  • [3] Al-Fares M., 2010, Hedera: dynamic flow scheduling for data center networks, P19
  • [4] Data Center TCP (DCTCP)
    Alizadeh, Mohammad
    Greenberg, Albert
    Maltz, David A.
    Padhye, Jitendra
    Patel, Parveen
    Prabhakar, Balaji
    Sengupta, Sudipta
    Sridharan, Murari
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) : 63 - 74
  • [5] [Anonymous], 2010, P ACM SIGCOMM C INT
  • [6] [Anonymous], 2014, PHOTONICS SWITCHING
  • [7] Chen Kai, 2014, NETWORKING IEEE ACM
  • [8] Efficient Coflow Scheduling with Varys
    Chowdhury, Mosharaf
    Zhong, Yuan
    Stoica, Ion
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (04) : 443 - 454
  • [9] Chowdhury M, 2012, PROCEEDINGS OF THE 11TH ACM WORKSHOP ON HOT TOPICS IN NETWORKS (HOTNETS-XI), P31
  • [10] DevoFlow: Scaling Flow Management for High-Performance Networks
    Curtis, Andrew R.
    Mogul, Jeffrey C.
    Tourrilhes, Jean
    Yalagandula, Praveen
    Sharma, Puneet
    Banerjee, Sujata
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (04) : 254 - 265