Open Access

ARTICLE

SWRR: The Link Scheduling Algorithm Based on Weighted Round-Robin

Tianbo Lu^1,2,*, Ru Yan^1,2, Chao Li^3,*, Lihua Yin³, Hao Chen¹, Xieyu Zou⁴

1 School of Software Engineering, Beijing University of Posts and Telecommunications, Beijing, 100876, China.
2 Key Laboratory of Trustworthy Distributed Computing and Service(Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China.
3 Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, 510006, China.
4 Department Computer Science and Engineering, The University of Texas at Arlington, Arlington, 76091, USA.

* Corresponding Authors: Tianbo Lu. Email: ; Chao Li. Email: .

Computers, Materials & Continua 2019, 59(3), 965-982. https://doi.org/10.32604/cmc.2019.05635

Abstract

With the rapid development of the Internet, people pay more and more attention to the protection of privacy. The second-generation onion routing system Tor is the most commonly used among anonymous communication systems, which can be used to protect user privacy effectively. In recent years, Tor’s congestion problem has become the focus of attention, and it can affect Tor’s performance even user experience. Firstly, we investigate the causes of Tor network congestion and summarize some link scheduling algorithms proposed in recent years. Then we propose the link scheduling algorithm SWRR based on WRR (Weighted Round Robin). In this process, we design multiple weight functions and compare the performance of these weight functions under different congestion conditions, and the appropriate weight function is selected to be used in our algorithms based on the experiment results. Finally, we also compare the performance of SWRR with other link scheduling algorithms under different congestion conditions by experiments, and verify the effectiveness of the algorithm SWRR.

---

Keywords

---