加权轮询算法 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "加权轮询算法" in Chinese language version.

refsWebsite

Global rank Chinese rank

2^nd place

23^rd place

5^th place

12^th place

2web.archive.org

1^st place

1^st place

8,864^th place

low place

low place

low place

800^th place

1,214^th place

low place

low place

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Katevenis, M.; Sidgiropoulos, S.; Courcoubetis, C. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE Journal on Selected Areas in Communications. 1991, 9 (8): 1265–1279. ISSN 0733-8716. doi:10.1109/49.105173.
Chaskar, H.M.; Madhow, U. Fair scheduling with tunable latency: A round-robin approach. IEEE/ACM Transactions on Networking. 2003, 11 (4): 592–601. ISSN 1063-6692. doi:10.1109/TNET.2003.815290.
Brahimi, B.; Aubrun, C.; Rondeau, E. Modelling and Simulation of Scheduling Policies Implemented in Ethernet Switch by Using Coloured Petri Nets: 667–674. 2006. doi:10.1109/ETFA.2006.355373.

espacenet.com (Global: 800^th place; Chinese: 1,214^th place)

worldwide.espacenet.com

20190266019

jyu.fi (Global: 8,864^th place; Chinese: low place)

users.jyu.fi

Semeria, Chuck. Supporting Differentiated Service Classes: Queue Scheduling Disciplines (PDF) (报告): 15–18. [4 May 2020]. （原始内容存档 (PDF)于2017-08-29）.

kfall.net (Global: low place; Chinese: low place)

Fall, Kevin. EECS 122, "Introduction to Communication Networks", Lecture 27, "Scheduling Best-Effort and Guaranteed Connections". 29 April 1999 [4 May 2020]. （原始内容存档于2012-07-22）.

segfaults.net (Global: low place; Chinese: low place)

beaulieu.segfaults.net

Beaulieu, Alain. Real Time Operating Systems -- Scheduling & Schedulers (PDF). Winter 2017 [4 May 2020]. ^{[失效連結]}

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Semeria, Chuck. Supporting Differentiated Service Classes: Queue Scheduling Disciplines (PDF) (报告): 15–18. [4 May 2020]. （原始内容存档 (PDF)于2017-08-29）.
Fall, Kevin. EECS 122, "Introduction to Communication Networks", Lecture 27, "Scheduling Best-Effort and Guaranteed Connections". 29 April 1999 [4 May 2020]. （原始内容存档于2012-07-22）.

worldcat.org (Global: 5^th place; Chinese: 12^th place)

Katevenis, M.; Sidgiropoulos, S.; Courcoubetis, C. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE Journal on Selected Areas in Communications. 1991, 9 (8): 1265–1279. ISSN 0733-8716. doi:10.1109/49.105173.
Chaskar, H.M.; Madhow, U. Fair scheduling with tunable latency: A round-robin approach. IEEE/ACM Transactions on Networking. 2003, 11 (4): 592–601. ISSN 1063-6692. doi:10.1109/TNET.2003.815290.