On the Design of Campus Parking Systems with QoS guarantees

TL;DR

This paper addresses the optimal allocation of parking spaces with QoS guarantees and proposes a privacy-preserving, efficient access method to improve campus parking systems.

Contribution

It introduces a framework for allocating parking spaces based on QoS needs and develops a privacy-aware, efficient access protocol as an alternative to first-come-first-served.

Findings

Determined the number of parking spaces needed for QoS compliance.

Developed a privacy-preserving parking access protocol.

Improved parking system efficiency while maintaining user privacy.

Abstract

Parking spaces are resources that can be pooled together and shared, especially when there are complementary day-time and night-time users. We answer two design questions. First, given a quality of service requirement, how many spaces should be set aside as contingency during day-time for night-time users? Next, how can we replace the first-come-first-served access method by one that aims at optimal efficiency while keeping user preferences private?