{"id":{"repo_id":"odu","oai_identifier":"oai:digitalcommons.odu.edu:computerscience_etds-1146"},"canonical_url":"https://search.ndltd.org/etd/odu/oai:digitalcommons.odu.edu:computerscience_etds-1146","repository":{"repo_id":"odu","name":"Old Dominion University","base_url":"https://digitalcommons.odu.edu/do/oai/"},"display":{"title":"A Probabilistic Analysis of Misparking in Reservation Based Parking Garages","abstract":"Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the first member of the misparking chain. Of interest is the probability distribution of the random variable that represents the length of the misparking chain. The most probable length of the chain as determined from the underlying probability distribution is therefore indicative of the extent of instability caused by a single mispark. In this thesis, reasonably tight bounds for the probability of occurance of a misparking chain of a given length are first determined. Next, the probability distribution of the length of misparking chain is approximated. It can be inferred from the mathematical derivations presented in this work that the most probable misparking chain length is very small compared to the size of the garage, thereby showing that a mispark has negligible effect on the stability of the parking system. Simulation results are also presented to validate the analytical solutions.","abstract_html":"Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the first member of the misparking chain. Of interest is the probability distribution of the random variable that represents the length of the misparking chain. The most probable length of the chain as determined from the underlying probability distribution is therefore indicative of the extent of instability caused by a single mispark. In this thesis, reasonably tight bounds for the probability of occurance of a misparking chain of a given length are first determined. Next, the probability distribution of the length of misparking chain is approximated. It can be inferred from the mathematical derivations presented in this work that the most probable misparking chain length is very small compared to the size of the garage, thereby showing that a mispark has negligible effect on the stability of the parking system. Simulation results are also presented to validate the analytical solutions.","abstract_has_math":false,"creators":["Ashok, Vikas G."],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Stephen Olariu","Michele Weigle","Ravi Mukkamala"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:29:47Z","subjects":["Computer simulation","Parking garages","Simulation methods","Computer Engineering","Numerical Analysis and Scientific Computing","Theory and Algorithms"],"languages":[],"rights":["<p>In Copyright. URI: <a href=\"http://rightsstatements.org/vocab/InC/1.0/\">http://rightsstatements.org/vocab/InC/1.0/</a> This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</p>"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.odu.edu/computerscience_etds/147","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.odu.edu/computerscience_etds/147","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.odu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.odu.edu%3Acomputerscience_etds-1146","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Stephen Olariu","Michele Weigle","Ravi Mukkamala"]},{"key":"dc:creator","label":"Author","values":["Ashok, Vikas G."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-10-23T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-04-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer simulation","Parking garages","Simulation methods","Computer Engineering","Numerical Analysis and Scientific Computing","Theory and Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["<p>In Copyright. URI: <a href=\"http://rightsstatements.org/vocab/InC/1.0/\">http://rightsstatements.org/vocab/InC/1.0/</a> This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</p>"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.odu.edu/computerscience_etds/147"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the first member of the misparking chain. Of interest is the probability distribution of the random variable that represents the length of the misparking chain. The most probable length of the chain as determined from the underlying probability distribution is therefore indicative of the extent of instability caused by a single mispark. In this thesis, reasonably tight bounds for the probability of occurance of a misparking chain of a given length are first determined. Next, the probability distribution of the length of misparking chain is approximated. It can be inferred from the mathematical derivations presented in this work that the most probable misparking chain length is very small compared to the size of the garage, thereby showing that a mispark has negligible effect on the stability of the parking system. Simulation results are also presented to validate the analytical solutions."]},{"key":"dc:title","label":"Title","values":["A Probabilistic Analysis of Misparking in Reservation Based Parking Garages"]}]}],"canonical_facts":{"dc:contributor":["Stephen Olariu","Michele Weigle","Ravi Mukkamala"],"dc:creator":["Ashok, Vikas G."],"dc:date.available":["2023-10-23T07:00:00Z"],"dc:date.created":["2011-04-01T07:00:00Z"],"dc:description.abstract":["Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the first member of the misparking chain. Of interest is the probability distribution of the random variable that represents the length of the misparking chain. The most probable length of the chain as determined from the underlying probability distribution is therefore indicative of the extent of instability caused by a single mispark. In this thesis, reasonably tight bounds for the probability of occurance of a misparking chain of a given length are first determined. Next, the probability distribution of the length of misparking chain is approximated. It can be inferred from the mathematical derivations presented in this work that the most probable misparking chain length is very small compared to the size of the garage, thereby showing that a mispark has negligible effect on the stability of the parking system. Simulation results are also presented to validate the analytical solutions."],"dc:identifier":["https://digitalcommons.odu.edu/computerscience_etds/147"],"dc:rights":["<p>In Copyright. URI: <a href=\"http://rightsstatements.org/vocab/InC/1.0/\">http://rightsstatements.org/vocab/InC/1.0/</a> This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</p>"],"dc:subject":["Computer simulation","Parking garages","Simulation methods","Computer Engineering","Numerical Analysis and Scientific Computing","Theory and Algorithms"],"dc:title":["A Probabilistic Analysis of Misparking in Reservation Based Parking Garages"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:29:47Z"}