Theses and Dissertations

ORCID

https://orcid.org/0009-0005-0621-934X

Advisor

Young, Maxwell

Committee Member

Banicescu, Ioana

Committee Member

Chaudhary, Vini

Date of Degree

5-15-2026

Original embargo terms

Immediate Worldwide Access

Document Type

Graduate Thesis - Open Access

Major

Computer Science (Cybersecurity)

Degree Name

Master of Science (M.S.)

College

James Worth Bagley College of Engineering

Department

Department of Computer Science and Engineering

Abstract

Contention resolution is a fundamental problem in distributed computing, where multiple devices compete to transmit over a shared channel without centralized coordination. Classical models typically assume a single always-available channel and focus on minimizing makespan. However, modern wireless systems increasingly operate under spectrum-sharing frameworks in which access to high-capacity spectrum is opportunistic and may be interrupted by higher-priority users. These settings introduce new challenges, including asymmetric channel speeds, adversarially scheduled evictions, and non-trivial switching costs. In this thesis, we study contention resolution in a dual-channel model consisting of a slow, always-available channel and a faster channel subject to adversarially scheduled evictions. We design and analyze an online algorithm for this setting that achieves asymptotically optimal latency while attaining a sublinear competitive ratio with respect to switching costs.

Sponsorship (Optional)

Yes

Download

Share

COinS