Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qasem Sayah

dblp:277/5243 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 77% Transport protocols and congestion control · 12% Internet architecture and protocols · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
programmable data plane
0.612022
LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless · IEEE/ACM Trans. Netw. 2022
Software-defined and programmable networks › programmable data plane
programmable switching ASIC
0.612022
LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless · IEEE/ACM Trans. Netw. 2022
Parallel and multicore computing › load balancing
datacenter load balancing
0.612022
LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless · IEEE/ACM Trans. Netw. 2022
Parallel and multicore computing › load balancing
per-connection consistency
0.612022
LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless · IEEE/ACM Trans. Netw. 2022
Internet architecture and protocols › network architecture design › layered architecture › protocol layering › network stack
connection state management
0.212022
LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless · IEEE/ACM Trans. Netw. 2022
Transport protocols and congestion control
transport protocols
0.212022
LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless · IEEE/ACM Trans. Netw. 2022

Methods — techniques the papers use, named apart from their topics

programmable switch implementation · 1.1
YearPublicationVenuePosition
2023 On the Protection of a High Performance Load Balancer Against SYN Attacks**This is an extended journal version of [2]
abstract
SYN flooding is a simple and effective denial-of-service attack. In this attack, many TCP SYN requests are sent to the targeted server, in an attempt to consume its resources and make it unresponsive to legitimate traffic. While SYN attacks have traditionally targeted web servers, they are also known to be very harmful to intermediate cloud devices, and in particular to stateful load balancers (LBs). Fighting against a SYN attack without negatively affecting legitimate connections is not easy, especially if the LB needs to perform frequent server pool updates during the attack, which is very likely since attacks can often last for many hours or even days. This paper is the first to propose LB schemes that guarantee high throughput of one million connections per second, while supporting a high pool update rate without breaking connections and fighting against a high rate SYN attack. Using an analysis and a proof of concept, we show that the LB can handle up to 10 million fake SYNs per second when the RTT is 10ms, and up to 5 million fake SYNs per second when the RTT is 20ms.
Reuven Cohen, Matty Kadosh, Alan Lo, Qasem Sayah
IEEE Trans. Cloud Comput.4
2022 LB Scalability: Achieving the Right Balance Between Being Stateful and Stateless
abstract
A high performance Layer-4 load balancer (LB) is one of the most important components of a cloud service infrastructure. Such an LB uses network and transport layer information for deciding how to distribute client requests across a group of servers. A crucial requirement for a stateful LB is per connection consistency (PCC); namely, that all the packets of the same connection will be forwarded to the same server, as long as the server is alive, even if the pool of servers or the assignment function changes. The challenge is in designing a high throughput, low latency solution that is also scalable. This paper proposes a highly scalable LB, called Prism, implemented using a programmable switch ASIC. As far as we know, Prism is the first reported stateful LB that can process millions of connections per second and hundreds of millions connections in total, while ensuring PCC. This is due to the fact that Prism forwards all the packets in hardware, even during server pool changes,while avoiding the need to maintain a hardware state per every active connection. We implemented a prototype of the proposed architecture and showed that Prism can scale to 100 million simultaneous connections, and can accommodate more than one pool update per second.
Reuven Cohen, Matty Kadosh, Alan Lo, Qasem Sayah
IEEE/ACM Trans. Netw.4
2021 Hardware SYN Attack Protection For High Performance Load Balancers
abstract
SYN flooding is a simple and effective denial-of-service attack, in which an attacker sends many SYN requests to a target's server in an attempt to consume server resources and make it unresponsive to legitimate traffic. While SYN attacks have traditionally targeted web servers, they are also known to be very harmful to intermediate cloud devices, and in particular to stateful load balancers (LBs). We propose LB schemes that guarantee high throughput of one million connections per second, while supporting a high pool update rate without breaking connections, and fighting against a high rate SYN attack, of up to 10 million fake SYNs per second.
Reuven Cohen, Matty Kadosh, Alan Lo, Qasem Sayah
HOTI4