About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On the Design of Campus Parking Systems With QoS Guarantees
Abstract
Parking spaces are resources that can be pooled together and shared, particularly when there exist complementary daytime and nighttime users. We provide solutions to two design questions. First, given a quality of service requirement, how many spaces should be set aside as contingency during the day for nighttime users? Next, how can we replace the first-come-first-served access method by one that aims for optimal efficiency while keeping user preferences private?