Show simple item record

AuthorBasyoni L.
AuthorErbad A.
AuthorMohamed A.
AuthorRefaey A.
AuthorGuizani M.
Available date2022-04-21T08:58:24Z
Publication Date2020
Publication Name2020 International Symposium on Networks, Computers and Communications, ISNCC 2020
ResourceScopus
Identifierhttp://dx.doi.org/10.1109/ISNCC49221.2020.9297310
URIhttp://hdl.handle.net/10576/30084
AbstractThe number of users adopting Tor to protect their online privacy is increasing rapidly. With a limited number of volunteered relays in the network, the number of clients' connections sharing the same relays is increasing to the extent that it is starting to affect the performance. Recently, Tor's resource allocation among circuits has been studied as one cause of poor Tor network performance. In this paper, we propose two scheduling approaches that guarantee proportional fairness between circuits that are sharing the same connection. In our evaluation, we show that the average-rate-base scheduler allocates Tor's resources in an optimal fair scheme, increasing the total throughput achieved by Tor's relays. However, our second proposed approach, an optimization-based scheduler, maintains acceptable fairness while reducing the latency experienced by Tor's clients. 2020 IEEE.
SponsorQatar University;Western University;Industrial Research and Consultancy Centre
Languageen
PublisherInstitute of Electrical and Electronics Engineers Inc.
SubjectScheduling
Timing circuits
Average rate
Base schedulers
Online privacy
Proportional fairness
Computer networks
TitleProportionally fair approach for tor's circuits scheduling
TypeConference Paper
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record