{"id":{"repo_id":"marshall","oai_identifier":"oai:mds.marshall.edu:etd-2262"},"canonical_url":"https://search.ndltd.org/etd/marshall/oai:mds.marshall.edu:etd-2262","repository":{"repo_id":"marshall","name":"Marshall University","base_url":"https://mds.marshall.edu/do/oai/"},"display":{"title":"Statistical Analysis of Tandem Queues With Markovian Passages in Porous Mediums","abstract":"Queuing theory is the mathematical study of queues or waiting lines. A queue is formed whenever the demand for service exceeds the capacity to provide service at that point in time. In this thesis, the birth-and-death process is used to model the movement of customers or units into and out of a network of queues in tandem. We start with the theoretical analysis of M/M/1 queues with Poisson arrival and exponential service time with first-come first-served (FCFS) discipline and one service station. We derive the global balance equation for each network. Using both the iterative and the probability generating function, we obtain the probabilities of the state for each service point in the network at equilibrium, and also discuss the statistical properties of the migration of customers from one service point to another. We generalize the probability generating function for the system with n states, and also the marginal for each of the queues in tandem. Specifically, two networks are considered, namely, one that allows customers into the system from the leading queue, and another with porous medium, which allows customers into the system of queues through any service stations. Finally, we simulate a queue network of 10,000 customers and generalize the traffic intensity, the proportion of customers moving from one station to another.","abstract_html":"Queuing theory is the mathematical study of queues or waiting lines. A queue is formed whenever the demand for service exceeds the capacity to provide service at that point in time. In this thesis, the birth-and-death process is used to model the movement of customers or units into and out of a network of queues in tandem. We start with the theoretical analysis of M/M/1 queues with Poisson arrival and exponential service time with first-come first-served (FCFS) discipline and one service station. We derive the global balance equation for each network. Using both the iterative and the probability generating function, we obtain the probabilities of the state for each service point in the network at equilibrium, and also discuss the statistical properties of the migration of customers from one service point to another. We generalize the probability generating function for the system with n states, and also the marginal for each of the queues in tandem. Specifically, two networks are considered, namely, one that allows customers into the system from the leading queue, and another with porous medium, which allows customers into the system of queues through any service stations. Finally, we simulate a queue network of 10,000 customers and generalize the traffic intensity, the proportion of customers moving from one station to another.","abstract_has_math":false,"creators":["Adepoju, Gboyega David"],"institution":null,"degree_name":"Mathematics","degree_level":"Thesis","degree_discipline":"College of Science","degree_department":null,"school":null,"contributors":["Dr. Alfred Akinsete, Committee Chairperson","Dr. Anna Mummert, Co-Chairperson","Dr. Avishek Mallick, Committee Member"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-21T19:57:11Z","subjects":["Computer Sciences","Mathematics","Physical Sciences and Mathematics","Theory and Algorithms","Birth and Death Process","Erlang","Kendal's Notation","Poisson process","Tandem queue"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://mds.marshall.edu/etd/1257","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://mds.marshall.edu/etd/1257","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://mds.marshall.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Amds.marshall.edu%3Aetd-2262","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Alfred Akinsete, Committee Chairperson","Dr. Anna Mummert, Co-Chairperson","Dr. Avishek Mallick, Committee Member"]},{"key":"dc:creator","label":"Author","values":["Adepoju, Gboyega David"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2020-01-22T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2019-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["College of Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Sciences","Mathematics","Physical Sciences and Mathematics","Theory and Algorithms","Birth and Death Process","Erlang","Kendal's Notation","Poisson process","Tandem queue"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://mds.marshall.edu/etd/1257"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Queuing theory is the mathematical study of queues or waiting lines. A queue is formed whenever the demand for service exceeds the capacity to provide service at that point in time. In this thesis, the birth-and-death process is used to model the movement of customers or units into and out of a network of queues in tandem. We start with the theoretical analysis of M/M/1 queues with Poisson arrival and exponential service time with first-come first-served (FCFS) discipline and one service station. We derive the global balance equation for each network. Using both the iterative and the probability generating function, we obtain the probabilities of the state for each service point in the network at equilibrium, and also discuss the statistical properties of the migration of customers from one service point to another. We generalize the probability generating function for the system with n states, and also the marginal for each of the queues in tandem. Specifically, two networks are considered, namely, one that allows customers into the system from the leading queue, and another with porous medium, which allows customers into the system of queues through any service stations. Finally, we simulate a queue network of 10,000 customers and generalize the traffic intensity, the proportion of customers moving from one station to another."]},{"key":"dc:title","label":"Title","values":["Statistical Analysis of Tandem Queues With Markovian Passages in Porous Mediums"]}]}],"canonical_facts":{"dc:contributor":["Dr. Alfred Akinsete, Committee Chairperson","Dr. Anna Mummert, Co-Chairperson","Dr. Avishek Mallick, Committee Member"],"dc:creator":["Adepoju, Gboyega David"],"dc:date.available":["2020-01-22T08:00:00Z"],"dc:date.created":["2019-01-01T08:00:00Z"],"dc:description.abstract":["Queuing theory is the mathematical study of queues or waiting lines. A queue is formed whenever the demand for service exceeds the capacity to provide service at that point in time. In this thesis, the birth-and-death process is used to model the movement of customers or units into and out of a network of queues in tandem. We start with the theoretical analysis of M/M/1 queues with Poisson arrival and exponential service time with first-come first-served (FCFS) discipline and one service station. We derive the global balance equation for each network. Using both the iterative and the probability generating function, we obtain the probabilities of the state for each service point in the network at equilibrium, and also discuss the statistical properties of the migration of customers from one service point to another. We generalize the probability generating function for the system with n states, and also the marginal for each of the queues in tandem. Specifically, two networks are considered, namely, one that allows customers into the system from the leading queue, and another with porous medium, which allows customers into the system of queues through any service stations. Finally, we simulate a queue network of 10,000 customers and generalize the traffic intensity, the proportion of customers moving from one station to another."],"dc:identifier":["https://mds.marshall.edu/etd/1257"],"dc:subject":["Computer Sciences","Mathematics","Physical Sciences and Mathematics","Theory and Algorithms","Birth and Death Process","Erlang","Kendal's Notation","Poisson process","Tandem queue"],"dc:title":["Statistical Analysis of Tandem Queues With Markovian Passages in Porous Mediums"],"thesis:degree_discipline":["College of Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Mathematics"]},"updated_at":"2026-11-21T19:57:11Z"}