SWRR: The Link Scheduling Algorithm Based on Weighted Round-Robin
- 1 January 2019
- journal article
- research article
- Published by Computers, Materials and Continua (Tech Science Press) in Computers, Materials & Continua
- Vol. 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
This publication has 4 references indexed in Scilit:
- A data-driven method for future Internet route decision modelingFuture Generation Computer Systems, 2019
- A Data Leakage Prevention Method Based on the Reduction of Confidential and Context Terms for Smart Mobile DevicesWireless Communications and Mobile Computing, 2018
- Expression Preserved Face Privacy Protection Based on Multi-mode Discriminant AnalysisComputers, Materials & Continua, 2018
- Intestinal Goblet Cells and Mucins in Health and Disease: Recent Insights and ProgressCurrent Gastroenterology Reports, 2010