Allocating resources in computer systems is a significant challenge due to constraints on resources, coordinating access to those resources, and tolerating malicious behavior. This dissertation investigates two fundamental problems concerning resource allocation. The first addresses the general challenge of sharing server resources among multiple clients, where an adversary may deny the availability of these resources; this is known as a denial-of-service (DoS) attack. Here, we propose a deterministic algorithm that employs resource burning (RB)—the verifiable expenditure of a network resource—to defend against DoS attacks. Specifically, our solution forces an adversary to incur higher RB costs compared to legitimate clients. Next, we develop a general policy-driven framework that utilizes machine learning classification to tune the amount of RB used for mitigating DoS attacks. Finally, we expand the application of RB to defend against DoS attacks on hash tables, which are a popular data structure in network applications. The second problem deals with resource allocation in wireless systems; specifically, the sharing of the wireless medium among multiple participants competing to transmit data. While modern WiFi and cellular standards do solve this problem, several recent theoretical results suggest that superior solutions are possible. Here, we investigate the viability of these solutions and discover that they fall short of their promised performance in practice. Consequently, we identify the cause of this shortcoming and quantify the discrepancy through a combination of analytical and simulation work. Ultimately, we propose a revised theoretical model that aligns better with practical observations.
Identifer | oai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-7101 |
Date | 10 May 2024 |
Creators | Chakraborty, Trisha |
Publisher | Scholars Junction |
Source Sets | Mississippi State University |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Theses and Dissertations |
Page generated in 0.0018 seconds