一種基于動態(tài)配額的虛擬網(wǎng)帶寬公平調(diào)度算法

劉中金; 卓子寒; 何躍鷹; 李勇; 蘇厲; 金德鵬; 曾烈光

doi:10.11999/JEIT151485

一種基于動態(tài)配額的虛擬網(wǎng)帶寬公平調(diào)度算法

doi: 10.11999/JEIT151485

1.
(國家計算機網(wǎng)絡(luò)應(yīng)急技術(shù)處理協(xié)調(diào)中心北京 100029) ②(清華大學(xué)電子工程系北京 100084)

基金項目:

國家高技術(shù)研究與發(fā)展計劃(2012AA012801)

計量
- 文章訪問數(shù): 1436
- HTML全文瀏覽量: 120
- PDF下載量: 378
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2015-12-29
- 修回日期: 2016-05-26
- 刊出日期: 2016-10-19

Dynamical Weighted Scheduling Algorithm Supporting Fair Bandwidth Allocation of Virtual Networks

1.
(National Computer Network Emergency Response Technical Team, Beijing 100029, China)

Funds:

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

摘要

摘要: 網(wǎng)絡(luò)虛擬化被廣泛用于網(wǎng)絡(luò)實驗平臺和數(shù)據(jù)中心等場景中。作為虛擬化網(wǎng)絡(luò)中的核心組網(wǎng)設(shè)備，虛擬路由器可以在同一物理底層上構(gòu)建多個虛擬路由器實例來承載多個虛擬網(wǎng)。其核心調(diào)度問題在于如何根據(jù)不同虛擬網(wǎng)對帶寬的不同需求，將網(wǎng)絡(luò)數(shù)據(jù)包調(diào)度到不同的實例中。該文針對該問題對虛擬化場景下的隊列調(diào)度問題進(jìn)行建模，提出了基于動態(tài)配額的隊列調(diào)度算法，與miDRR等算法相比，該文算法在虛擬網(wǎng)帶寬分配的有效性和公平性上有明顯優(yōu)勢。
- 網(wǎng)絡(luò)虛擬化 /
- 虛擬路由器 /
- 軟件定義網(wǎng)絡(luò) /
- 隊列調(diào)度算法 /
- 公平性
Abstract: 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.
- Network virtualization /
- Virtual router /
- Software Defined Networking (SDN) /
- Queue scheduling algorithm /
- Fairness

HTML全文

參考文獻(xiàn)(21)

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.

劉中金, 李勇, 楊懋, 等. 基于可編程硬件的虛擬路由器數(shù)據(jù)平面設(shè)計與實現(xiàn)[J]. 電子學(xué)報, 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.

劉中金, 李勇, 蘇厲, 等. 彈性協(xié)議可定制的網(wǎng)絡(luò)數(shù)據(jù)平面結(jié)構(gòu)及其映射算法[J]. 電子與信息學(xué)報, 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.

高先明, 張曉哲, 王寶生, 等. 面向虛擬路由器的基于歷史轉(zhuǎn)發(fā)開銷的資源調(diào)度算法[J]. 電子與信息學(xué)報, 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.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問統(tǒng)計