Advanced Search
Volume 38 Issue 10
Oct.  2016
Turn off MathJax
Article Contents
LIU Zhongjin, ZHUO Zihan, HE Yueying, LI Yong, SU Li, JIN Depeng, ZENG Lieguang. Dynamical Weighted Scheduling Algorithm Supporting Fair Bandwidth Allocation of Virtual Networks[J]. Journal of Electronics & Information Technology, 2016, 38(10): 2654-2659. doi: 10.11999/JEIT151485
Citation: LIU Zhongjin, ZHUO Zihan, HE Yueying, LI Yong, SU Li, JIN Depeng, ZENG Lieguang. Dynamical Weighted Scheduling Algorithm Supporting Fair Bandwidth Allocation of Virtual Networks[J]. Journal of Electronics & Information Technology, 2016, 38(10): 2654-2659. doi: 10.11999/JEIT151485

Dynamical Weighted Scheduling Algorithm Supporting Fair Bandwidth Allocation of Virtual Networks

doi: 10.11999/JEIT151485
Funds:

The National High Technology Research and Development Program of China (2012AA012801)

  • Received Date: 2015-12-29
  • Rev Recd Date: 2016-05-26
  • Publish Date: 2016-10-19
  • Network virtualization is widely deployed in network experiment platforms and data center networks. As a key networking equipment in virtualized environment, the virtual router can build many virtual router instances to run different virtual networks. The key problem for a virtual router lies in how to schedule the packets into different virtual instances according to the virtual networks bandwidth requirement. In this article, a model is given to the scheduling problem and a dynamical weighted scheduling algorithm is proposed. The experimental results show that the proposed algorithm has superiority over miDRR algorithm in terms of the efficiency and the fairness.
  • loading
  • KREUTZ D, RAMOS F M V, ESTEVES V P, et al. Software-defined networking: A comprehensive survey[J]. Proceedings of the IEEE, 2015, 103(1): 14-76. doi: 10.1109/ JPROC.2014.2371999.
    MAHALINGAM M, DUTT D, DUDA K, et al. Virtual extensible local area network (VXLAN): a framework for overlaying virtualized layer 2 networks over layer 3 networks [R]. 2014.
    BERMAN M, CHASE J S, LANDWEBER L, et al. GENI: a federated testbed for innovative network experiments[J]. Computer Networks, 2014, 61: 5-23. doi: 10.1016/j.bjp. 2013.12.037.
    KOPONEN T, AMIDON K, BALLAND P, et al. Network virtualization in multi-tenant data centers[C]. Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, Seattle, USA, 2014: 203-216.
    刘中金, 李勇, 杨懋, 等. 基于可编程硬件的虚拟路由器数据平面设计与实现[J]. 电子学报, 2013, 41(7): 1268-1272. doi: 10.3969/j.issn.0372-2112.2013.07.004.
    LIU Zhongjin, LI Yong, YANG Mao, et al. Design on data plane of programmable hardware-based virtual router[J]. Acta Electronica Sinica, 2013, 41(7): 1268-1272. doi: 10.3969/ j.issn.0372-2112.2013.07.004.
    刘中金, 李勇, 苏厉, 等. 弹性协议可定制的网络数据平面结构及其映射算法[J]. 电子与信息学报, 2014, 36(7): 1713-1719. doi: 10.3724/SP.J.1146.2013.01151.
    LIU Zhongjin, LI Yong, SU Li, et al. Design on the elastic protocol customizable data plane and its mapping algorithm[J]. Journal of Electronics Information Technology, 2014, 36(7): 1713-1719. doi: 10.3724/SP.J.1146.2013.01151.
    PAREKH A K and GALLAGER R G. A generalized processor sharing approach to flow control in integrated services networks: the single-node case[J]. IEEE/ACM Transactions on Networking, 1993, 1(3): 344-357. doi: 10.1109/INFCOM.1992.263509.
    BENNETT J C R and ZHANG H. WF2Q: worst-case fair weighted fair queueing[C]. P roceedings of IEEE INFOCOM'96, 1996, Vol. 1: 120-128. doi: 10.1109/INFCOM.1996.497885.
    GOVAL P, VIN H M, and CHENG H. Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks[J]. IEEE/ACM Transactions on Networking, 1997, 5(5): 690-704.
    BLANQUER J M andZDEN B. Fair queuing for aggregated multiple links[J]. ACM SIGCOMM Computer Communication Review, 2001, 31(4): 189-197. doi: 10.1145/383059.383074.
    高先明, 张晓哲, 王宝生, 等. 面向虚拟路由器的基于历史转发开销的资源调度算法[J]. 电子与信息学报, 2015, 37(3): 686-692. doi: 10.11999/JEIT140491.
    GAO Xianming, ZHANG Xiaozhe, WANG Baosheng, et al. Historical forwarding overhead based the resource scheduling algorithm for the virtual router[J]. Journal of Electronics Information Technology, 2015, 37(3): 686-692. doi: 10.11999/ JEIT140491.
    SHREEDHAR M and VARGHESE G. Efficient fair queuing using deficit round-robin[J]. IEEE/ACM Transactions on Networking, 1996, 4(3): 375-385. doi: 10.1109/90.502236.
    GUO C. SRR: an O (1) time complexity packet scheduler for flows in multi-service packet networks[J]. ACM SIGCOMM Computer Communication Review, 2001, 31(4): 211-222. doi: 10.1109/TNET.2004.838601.
    TSAO S C and LIN Y D. Pre-order deficit round robin: a new scheduling algorithm for packet-switched networks[J]. Computer Networks, 2001, 35(2): 287-305. doi: 10.1016/ S1389-1286(00)00172-9.
    YAP K K, SANDEEP Y Y, and KATTI K S. Scheduling packets over multiple interfaces while respecting user preferences[C]. Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies. Santa Barbara, 2013: 109-120. doi: 10.1145/2535372.2535387.
    CHEN K, SINGLA A, SINGH A, et al. OSA: an optical switching architecture for data center networks with unprecedented flexibility[J]. IEEE/ACM Transactions on Networking, 2014, 22(2): 498-511.
    IYER A, KUMAR P, and MANN V. Avalanche: data center multicast using software defined networking[C]. Proceedings of IEEE Sixth International Conference on Communication Systems and Networks (COMSNETS), Bangalore, India, 2014: 1-8. doi: 10.1109/COMSNETS.2014.6734903.
    LOCKWOOD J W, MCKEOWN N, WATSON G, et al. NetFPGAan open platform for gigabit-rate network switching and routing[C]. Proceedings of the IEEE International Conference on Microelectronic Systems Education, San Diego, USA, 2007: 160-161. doi: 10.1109/MSE.2007.69.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1386) PDF downloads(378) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return