subject:( queueing)

1. Gupta, Neetu. Performance analysis using some Queueing models.

Degree: Mathematics, 2010, INFLIBNET

URL: http://shodhganga.inflibnet.ac.in/handle/10603/3357

►

Objective is to check the performance of queueing models. Here we considered the M/M/1/N queueing system with balking and reneging and checked the performance of… (more)

Subjects/Keywords: Mathematics; Queueing models; Queueing system

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gupta, N. (2010). Performance analysis using some Queueing models. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/3357

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gupta, Neetu. “Performance analysis using some Queueing models.” 2010. Thesis, INFLIBNET. Accessed March 08, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/3357.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gupta, Neetu. “Performance analysis using some Queueing models.” 2010. Web. 08 Mar 2021.

Vancouver:

Gupta N. Performance analysis using some Queueing models. [Internet] [Thesis]. INFLIBNET; 2010. [cited 2021 Mar 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/3357.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gupta N. Performance analysis using some Queueing models. [Thesis]. INFLIBNET; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/3357

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Debrecen

2. Oluwole, Rotimi John. Queueing Theory And Telecommunication .

Degree: DE – TEK – Informatikai Kar, 2013, University of Debrecen

URL: http://hdl.handle.net/2437/169196

► A good telecommunication networks can be represented as queueing networks with state-dependent arrival rates and service rates. We provide necessary and sufﬁcient conditions for such… (more)

Subjects/Keywords: Queueing; System

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oluwole, R. J. (2013). Queueing Theory And Telecommunication . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/169196

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Oluwole, Rotimi John. “Queueing Theory And Telecommunication .” 2013. Thesis, University of Debrecen. Accessed March 08, 2021. http://hdl.handle.net/2437/169196.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Oluwole, Rotimi John. “Queueing Theory And Telecommunication .” 2013. Web. 08 Mar 2021.

Vancouver:

Oluwole RJ. Queueing Theory And Telecommunication . [Internet] [Thesis]. University of Debrecen; 2013. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2437/169196.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oluwole RJ. Queueing Theory And Telecommunication . [Thesis]. University of Debrecen; 2013. Available from: http://hdl.handle.net/2437/169196

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

3. Hamidi Sepehr, Fatemeh. Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications.

Degree: PhD, Electrical Engineering, 2014, Texas A&M University

URL: http://hdl.handle.net/1969.1/152477

► As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering… (more)

▼ As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need to better understand the fundamental limits of forward error correction in non-asymptotic regimes. This dissertation seeks to characterize the performance of block codes over finite-state channels with memory and also evaluate their queueing performance under different encoding/decoding schemes. In particular, a fading formulation is considered where a discrete channel with correlation over time introduces errors. For carefully selected channel models and arrival processes, a tractable Markov structure composed of queue length and channel state is identified. This facilitates the analysis of the stationary behavior of the system, leading to evaluation criteria such as bounds on the probability of the queue exceeding a threshold. Specifically, this dissertation focuses on system models with scalable arrival profiles based on Poisson processes, and finite-state memory channels. These assumptions permit the rigorous comparison of system performance for codes with arbitrary block lengths and code rates. Based on this characterization, it is possible to optimize code parameters for delay-sensitive applications over various channels. Random codes and BCH codes are then employed as means to study the relationship between code-rate selection and the queueing performance of point-to-point data links. The introduced methodology offers a new perspective on the joint queueing-coding analysis for finite-state channels, and is supported by numerical simulations. Furthermore, classical results from information theory are revisited in the context of channels with rare transitions, and bounds on the probabilities of decoding failure are derived for random codes. An analysis framework is presented where channel dependencies within and across code words are preserved. The results are subsequently integrated into a queueing formulation. It is shown that for current formulation, the performance analysis based on upper bounds provides a good estimate of both the system performance and the optimum code parameters. Overall, this study offers new insights about the impact of channel correlation on the performance of delay-aware communications and provides novel guidelines to select optimum code rates and block lengths. Advisors/Committee Members: Pfister, Henry D (advisor), Chamberland, Jean-Francois (advisor), Shakkottai, Srinivas (committee member), Sivakumar, N. (committee member).

Subjects/Keywords: Queueing; Channel Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hamidi Sepehr, F. (2014). Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152477

Chicago Manual of Style (16^th Edition):

Hamidi Sepehr, Fatemeh. “Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications.” 2014. Doctoral Dissertation, Texas A&M University. Accessed March 08, 2021. http://hdl.handle.net/1969.1/152477.

MLA Handbook (7^th Edition):

Hamidi Sepehr, Fatemeh. “Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications.” 2014. Web. 08 Mar 2021.

Vancouver:

Hamidi Sepehr F. Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications. [Internet] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1969.1/152477.

Council of Science Editors:

Hamidi Sepehr F. Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152477

Universiteit Utrecht

4. Schelling, W.D. Analyzing a queueing network.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/307053

► The purpose of the thesis is to help ING Bank to get a better understanding of their ICT landscape. Since the ICT landscape of ING… (more)

Subjects/Keywords: queueing theory; markov chains; simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Schelling, W. D. (2015). Analyzing a queueing network. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/307053

Chicago Manual of Style (16^th Edition):

Schelling, W D. “Analyzing a queueing network.” 2015. Masters Thesis, Universiteit Utrecht. Accessed March 08, 2021. http://dspace.library.uu.nl:8080/handle/1874/307053.

MLA Handbook (7^th Edition):

Schelling, W D. “Analyzing a queueing network.” 2015. Web. 08 Mar 2021.

Vancouver:

Schelling WD. Analyzing a queueing network. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Mar 08]. Available from: http://dspace.library.uu.nl:8080/handle/1874/307053.

Council of Science Editors:

Schelling WD. Analyzing a queueing network. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/307053

Anna University

5. Haridass M. Bulk Queueing models with unreliable server restricted admissions and threshold policies for vacations.

Degree: Mathematics, 2013, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/9924

►

Queueing theory is an important branch of applied probability and it involves the mathematical study of queues or waiting lines. The formation of waiting lines… (more)

▼

Queueing theory is an important branch of applied probability and it involves the mathematical study of queues or waiting lines. The formation of waiting lines is a common phenomenon which occurs whenever the current demand for a service exceeds the current capacity to provide that service. In this thesis, bulk queueing models with re-service, service interruptions, variant threshold policies for secondary jobs (multiple vacations, modified vacations and vacation interruptions), and restricted admissions on arrivals are developed. The proposed models of this research work are theoretically developed and numerically justified. In chapter 2, a bulk queueing system with server s choice of admitting re-service, multiple vacations and setup time is analyzed. A bulk arrival general bulk service queueing system with variant threshold policies for vacations is discussed in chapter 3. In chapter 4, a bulk queueing system with multiple vacations under restricted admissibility policy of arriving batches is considered. A single server bulk service queueing system with interrupted secondary job (vacation) is considered in chapter 5. A single server batch arrival queueing system with unreliable server and single vacation is analyzed in chapter 6. In chapter 7, a batch arrival single server retrial queue with modified vacations under N- policy is analyzed. For this model, the probability generating function of the steady state orbit size distribution at an arbitrary time epoch is obtained. A batch arrival general bulk service retrial queueing model with constant retrial rate is studied in chapter 8. The probability generating function of the steady state orbit size distribution at an arbitrary time epoch is obtained. Chapter 6 is studied by the embedded Markov chain technique and level crossing analysis. All the remaining chapters are discussed by the supplementary variable technique.

References p. 255-273, List of Publications p. 274

Advisors/Committee Members: Arumugananthan R.

Subjects/Keywords: Queueing theory; Mathematics; N policy

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

M, H. (2013). Bulk Queueing models with unreliable server restricted admissions and threshold policies for vacations. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9924

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

M, Haridass. “Bulk Queueing models with unreliable server restricted admissions and threshold policies for vacations.” 2013. Thesis, Anna University. Accessed March 08, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/9924.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

M, Haridass. “Bulk Queueing models with unreliable server restricted admissions and threshold policies for vacations.” 2013. Web. 08 Mar 2021.

Vancouver:

M H. Bulk Queueing models with unreliable server restricted admissions and threshold policies for vacations. [Internet] [Thesis]. Anna University; 2013. [cited 2021 Mar 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9924.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

M H. Bulk Queueing models with unreliable server restricted admissions and threshold policies for vacations. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9924

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

6. Anand, Vidyuth. Energy-aware Models for Warehousing Operations.

Degree: 2014, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/22575

► There is a growing need in industries around the world to become more sustainable and reduce consumption of energy. Due to the rapid increase in… (more)

Subjects/Keywords: Energy control; Queueing; Warehousing; Forklifts

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Anand, V. (2014). Energy-aware Models for Warehousing Operations. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/22575

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Anand, Vidyuth. “Energy-aware Models for Warehousing Operations.” 2014. Thesis, Penn State University. Accessed March 08, 2021. https://submit-etda.libraries.psu.edu/catalog/22575.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Anand, Vidyuth. “Energy-aware Models for Warehousing Operations.” 2014. Web. 08 Mar 2021.

Vancouver:

Anand V. Energy-aware Models for Warehousing Operations. [Internet] [Thesis]. Penn State University; 2014. [cited 2021 Mar 08]. Available from: https://submit-etda.libraries.psu.edu/catalog/22575.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anand V. Energy-aware Models for Warehousing Operations. [Thesis]. Penn State University; 2014. Available from: https://submit-etda.libraries.psu.edu/catalog/22575

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

7. Granville, Kevin. An Application of Matrix Analytic Methods to Queueing Models with Polling.

Degree: 2019, University of Waterloo

URL: http://hdl.handle.net/10012/14936

► We review what it means to model a queueing system, and highlight several components of interest which govern the behaviour of customers, as well as… (more)

▼ We review what it means to model a queueing system, and highlight several components of interest which govern the behaviour of customers, as well as the server(s) who tend to them. Our primary focus is on polling systems, which involve one or more servers who must serve multiple queues of customers according to their service policy, which is made up of an overall polling order, and a service discipline defined at each queue. The most common polling orders and service disciplines are discussed, and some examples are given to demonstrate their use. Classic matrix analytic method theory is built up and illustrated on models of increasing complexity, to provide context for the analyses of later chapters. The original research contained within this thesis is divided into two halves, finite population maintenance models and infinite population cyclic polling models. In the first half, we investigate a 2-class maintenance system with a single server, expressed as a polling model. In Chapter 2, the model we study considers a total of C machines which are at risk of failing when working. Depending on the failure that a machine experiences, it is sorted into either the class-1 or class-2 queue where it awaits service among other machines suffering from similar failures. The possible service policies that are considered include exhaustive, non-preemptive priority, and preemptive resume priority. In Chapter 3, this model is generalized to allow for a maintenance float of f spare machines that can be turned on to replace a failed machine. Additionally, the possible server behaviours are greatly generalized. In both chapters, among other topics, we discuss the optimization of server behaviour as well as the limiting number of working machines as we let C go to infinity. As these are systems with a finite population (for a given C and f), their steady-state distributions can be solved for using the algorithm for level-dependent quasi-birth-and-death processes without loss of accuracy. When a class of customers are impatient, the algorithms covered in this thesis require their queue length to be truncated in order for us to approximate the steady-state distribution for all but the simplest model. In Chapter 4, we model a 2-queue polling system with impatient customers and k_i-limited service disciplines. Finite buffers are assumed for both queues, such that if a customer arrives to find their queue full then they are blocked and lost forever. Finite buffers are a way to interpret a necessary truncation level, since we can simply assume that it is impossible to observe the removed states. However, if we are interested in approximating an infinite buffer system, this inconsistency will bias the steady-state probabilities if blocking probabilities are not negligible. In Chapter 5, we introduce the Unobserved Waiting Customer approximation as a way to reduce this natural biasing that is incurred when approximating an infinite buffer system. Among the queues considered within this chapter is a N-queue system with exhaustive…

Subjects/Keywords: queueing theory; matrix analytic methods

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Granville, K. (2019). An Application of Matrix Analytic Methods to Queueing Models with Polling. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14936

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Granville, Kevin. “An Application of Matrix Analytic Methods to Queueing Models with Polling.” 2019. Thesis, University of Waterloo. Accessed March 08, 2021. http://hdl.handle.net/10012/14936.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Granville, Kevin. “An Application of Matrix Analytic Methods to Queueing Models with Polling.” 2019. Web. 08 Mar 2021.

Vancouver:

Granville K. An Application of Matrix Analytic Methods to Queueing Models with Polling. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10012/14936.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Granville K. An Application of Matrix Analytic Methods to Queueing Models with Polling. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14936

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

8. Sarhangian, Vahid. Certain Static and Dynamic Priority Policies in Queueing Systems.

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/31431

►

In this thesis, we first study delay systems with different classes of impatient customers. We analyze the M/GI/1+M queue serving two priority classes under the… (more)

Subjects/Keywords: Queueing Theory; Service Engineering; 0546

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sarhangian, V. (2011). Certain Static and Dynamic Priority Policies in Queueing Systems. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31431

Chicago Manual of Style (16^th Edition):

Sarhangian, Vahid. “Certain Static and Dynamic Priority Policies in Queueing Systems.” 2011. Masters Thesis, University of Toronto. Accessed March 08, 2021. http://hdl.handle.net/1807/31431.

MLA Handbook (7^th Edition):

Sarhangian, Vahid. “Certain Static and Dynamic Priority Policies in Queueing Systems.” 2011. Web. 08 Mar 2021.

Vancouver:

Sarhangian V. Certain Static and Dynamic Priority Policies in Queueing Systems. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1807/31431.

Council of Science Editors:

Sarhangian V. Certain Static and Dynamic Priority Policies in Queueing Systems. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31431

University of Adelaide

9. Branford, Alan John. Secondary processes induced by finite birth-and-death processes.

Degree: 1980, University of Adelaide

URL: http://hdl.handle.net/2440/122019

Subjects/Keywords: Queueing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Branford, A. J. (1980). Secondary processes induced by finite birth-and-death processes. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/122019

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Branford, Alan John. “Secondary processes induced by finite birth-and-death processes.” 1980. Thesis, University of Adelaide. Accessed March 08, 2021. http://hdl.handle.net/2440/122019.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Branford, Alan John. “Secondary processes induced by finite birth-and-death processes.” 1980. Web. 08 Mar 2021.

Vancouver:

Branford AJ. Secondary processes induced by finite birth-and-death processes. [Internet] [Thesis]. University of Adelaide; 1980. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2440/122019.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Branford AJ. Secondary processes induced by finite birth-and-death processes. [Thesis]. University of Adelaide; 1980. Available from: http://hdl.handle.net/2440/122019

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Debrecen

10. Alhaj mohammad, Mazin. Queueing Theory Software Packages .

Degree: DE – Informatikai Kar, University of Debrecen

URL: http://hdl.handle.net/2437/276904

► At the beginning of the thesis, I talked about the Theoretical part of the queuing theory and its principles. Introducing the types of programs used… (more)

Subjects/Keywords: Queueing Theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alhaj mohammad, M. (n.d.). Queueing Theory Software Packages . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/276904

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Alhaj mohammad, Mazin. “Queueing Theory Software Packages .” Thesis, University of Debrecen. Accessed March 08, 2021. http://hdl.handle.net/2437/276904.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Alhaj mohammad, Mazin. “Queueing Theory Software Packages .” Web. 08 Mar 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Alhaj mohammad M. Queueing Theory Software Packages . [Internet] [Thesis]. University of Debrecen; [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2437/276904.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Alhaj mohammad M. Queueing Theory Software Packages . [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/276904

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Virginia Tech

11. Hochendoner, Philip Louis. Entrainment of Bacterial Synthetic Oscillators using Proteolytic Queueing and Aperiodic Signaling.

Degree: PhD, Physics, 2015, Virginia Tech

URL: http://hdl.handle.net/10919/64373

► The bulk of this thesis considers how biological rhythms (oscillators) can be made to synchronize their rhythms by virtue of coupling to an external signal.… (more)

Subjects/Keywords: Biophysics; Synthetic Biology; Entrainment; Queueing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hochendoner, P. L. (2015). Entrainment of Bacterial Synthetic Oscillators using Proteolytic Queueing and Aperiodic Signaling. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/64373

Chicago Manual of Style (16^th Edition):

Hochendoner, Philip Louis. “Entrainment of Bacterial Synthetic Oscillators using Proteolytic Queueing and Aperiodic Signaling.” 2015. Doctoral Dissertation, Virginia Tech. Accessed March 08, 2021. http://hdl.handle.net/10919/64373.

MLA Handbook (7^th Edition):

Hochendoner, Philip Louis. “Entrainment of Bacterial Synthetic Oscillators using Proteolytic Queueing and Aperiodic Signaling.” 2015. Web. 08 Mar 2021.

Vancouver:

Hochendoner PL. Entrainment of Bacterial Synthetic Oscillators using Proteolytic Queueing and Aperiodic Signaling. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10919/64373.

Council of Science Editors:

Hochendoner PL. Entrainment of Bacterial Synthetic Oscillators using Proteolytic Queueing and Aperiodic Signaling. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/64373

University of Southern California

12. Li, Chih-ping. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

► This dissertation addresses several optimal stochastic scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems… (more)

▼ This dissertation addresses several optimal stochastic scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems under different channel connectivity assumptions and different scheduling constraints. Our goals are two-fold: To identify stochastic scheduling problems of practical interest, and to develop analytical tools that lead to efficient control algorithms with provably optimal performance. ❧ In wireless networks, we study three sets of problems. First, we explore how the energy and timing overhead due to channel probing affects network performance. We develop a dynamic channel probing algorithm that is both throughput and energy optimal. The second problem is how to exploit time correlations of wireless channels to improve network throughput when instantaneous channel states are unavailable. Specifically, we study the network capacity region over a set of Markov ON/OFF channels with unknown current states. Recognizing that this is a difficult restless multi-armed bandit problem, we construct a non-trivial inner bound on the network capacity region by randomizing well-designed round robin policies. This inner bound is considered as an operational network capacity region because it is large and easily achievable. A queue-dependent round robin policy is constructed to support any throughput vector within the inner bound. In the third problem, we study throughput utility maximization over partially observable Markov ON/OFF channels (specifically, over the inner bound provided in the previous problem). It has applications in wireless networks with limited channel probing capability, cognitive radio networks, target tracking of unmanned aerial vehicles, and restless multi-armed bandit systems. An admission control and channel scheduling policy is developed to achieve near-optimal throughput utility within the inner bound. Here we use a novel ratio MaxWeight policy that generalizes the existing MaxWeight-type policies from time-slotted networks to frame-based systems that have policy-dependent random frame sizes. ❧ In multi-class queueing systems, we study how to optimize average service cost and per-class average queueing delay in a nonpreemptive multi-class M/G/1 queue that has adjustable service rates. Several convex delay penalty and service cost minimization problems with time-average constraints are investigated. We use the idea of virtual queues to transform these problems into a new set of queue stability problems, and the queue-stable policies are the desired solutions. The solutions are variants of dynamic c-mu rules, and implement weighted priority policies in every busy period, where the weights are functions of past queueing delays in each job class. ❧ Throughout these problems, our analysis and algorithm design uses and generalizes an achievable region approach driven by Lyapunov drift theory. We study the performance region (in throughput, power, or delay) of interest and identify, or design, a policy space so… Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Krishnamachari, Bhaskar (Committee Member), Ward, Amy R. (Committee Member).

Subjects/Keywords: stochastic network optimization; queueing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, C. (2011). Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

Chicago Manual of Style (16^th Edition):

Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.” 2011. Doctoral Dissertation, University of Southern California. Accessed March 08, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.

MLA Handbook (7^th Edition):

Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.” 2011. Web. 08 Mar 2021.

Vancouver:

Li C. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Mar 08]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.

Council of Science Editors:

Li C. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

Georgia Tech

13. Suk, Tonghoon. Resource allocation algorithms in stochastic systems.

Degree: PhD, Industrial and Systems Engineering, 2016, Georgia Tech

URL: http://hdl.handle.net/1853/56341

► My dissertation work examines resource allocation algorithms in stochastic systems. I use applied probability methodology to investigate large-scaled stochastic systems. Specifically, my research focuses on… (more)

▼ My dissertation work examines resource allocation algorithms in stochastic systems. I use applied probability methodology to investigate large-scaled stochastic systems. Specifically, my research focuses on proposing and analyzing stochastic algorithms in large systems. A brief outline is below. The first topic is randomized scheduling in a many-buffer regime. The goal of this research is to analyze the performance of the randomized longest-queue-first scheduling algorithm in parallel-queueing systems. Our model consists of n buffers and a server. Tasks arrive to each buffer independently and have independent and identically distributed (i.i.d.) exponential service requirements. To complete the description of the model, we need to specify a scheduling algorithm for determining how and when the server allocates service to tasks. We are interested in the asymptotic regime n goes to infinity and networks with a large number of buffers are related to mean-field models in physics. This asymptotic regime could be called the many-buffer regime. In this research task, we aim to investigate the influence of the scheduling algorithms on quality of service in the many-buffer regime. Second, we propose a low-complexity and high-performance scheduling scheme in constrained queueing networks. Scheduling of resources among various entities con- tending for their access is one of the fundamental problems in operations research and our goal is to design a scheduling algorithm with high performance and low complexity for large-scale networks. In the network we are interested in, packets arrive at buffers and packets in buffers are served according to interference restrictions. Since Tassiulas and Ephremides proposed the maximum weight algorithm of through-put optimality, extensive research efforts have been expended for mitigating its high complexity by studying various types of scheduling algorithms. In this research, we develop a generic framework to design scheduling algorithms of high throughput and low complexity. Our algorithm updates current schedules under the interactions with a given oracle system which solves a combinatorial optimization problem in a finite number of steps. Our algorithm using any such oracle is throughput optimal for general combinatorial resource allocation problems including wireless networks and input queued switch networks. Advisors/Committee Members: Dieker, Antonius (advisor), Hackman, Steven (committee member), Goldberg, David (committee member), Nemirovski, Arkadi (committee member), Shin, Jinwoo (committee member).

Subjects/Keywords: Queueing systems; Scheduling algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Suk, T. (2016). Resource allocation algorithms in stochastic systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56341

Chicago Manual of Style (16^th Edition):

Suk, Tonghoon. “Resource allocation algorithms in stochastic systems.” 2016. Doctoral Dissertation, Georgia Tech. Accessed March 08, 2021. http://hdl.handle.net/1853/56341.

MLA Handbook (7^th Edition):

Suk, Tonghoon. “Resource allocation algorithms in stochastic systems.” 2016. Web. 08 Mar 2021.

Vancouver:

Suk T. Resource allocation algorithms in stochastic systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1853/56341.

Council of Science Editors:

Suk T. Resource allocation algorithms in stochastic systems. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56341

University of Victoria

14. Li, Hang. Parameter estimation of queueing system using mixture model and the EM algorithm.

Degree: Department of Computer Science, 2016, University of Victoria

URL: http://hdl.handle.net/1828/7647

► Parameter estimation is a long-lasting topic in queueing systems and has attracted considerable attention from both academia and industry. In this thesis, we design a… (more)

Subjects/Keywords: EM algorithm; Queueing Theory; Mixture Model; Tandem Queueing System

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, H. (2016). Parameter estimation of queueing system using mixture model and the EM algorithm. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7647

Chicago Manual of Style (16^th Edition):

Li, Hang. “Parameter estimation of queueing system using mixture model and the EM algorithm.” 2016. Masters Thesis, University of Victoria. Accessed March 08, 2021. http://hdl.handle.net/1828/7647.

MLA Handbook (7^th Edition):

Li, Hang. “Parameter estimation of queueing system using mixture model and the EM algorithm.” 2016. Web. 08 Mar 2021.

Vancouver:

Li H. Parameter estimation of queueing system using mixture model and the EM algorithm. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1828/7647.

Council of Science Editors:

Li H. Parameter estimation of queueing system using mixture model and the EM algorithm. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7647

University of Debrecen

15. Pál, Márk János. Sorbanállási elméleti problémák elemzése .

Degree: DE – Informatikai Kar, University of Debrecen

URL: http://hdl.handle.net/2437/276960

► A dolgozatban sorbanállási problémákat fogok elemezni és vizsgálni; megnézni, hogy hogyan lehet a sorbanállási rendszerekben lévő problémákat kezelni, javítani, s sorbanállási rendszereket elemző alkalmazások segítségével… (more)

Subjects/Keywords: sorbanállás; queueing; queueing systems; sorbanállás elmélet; queueing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pál, M. J. (n.d.). Sorbanállási elméleti problémák elemzése . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/276960

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pál, Márk János. “Sorbanállási elméleti problémák elemzése .” Thesis, University of Debrecen. Accessed March 08, 2021. http://hdl.handle.net/2437/276960.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pál, Márk János. “Sorbanállási elméleti problémák elemzése .” Web. 08 Mar 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Pál MJ. Sorbanállási elméleti problémák elemzése . [Internet] [Thesis]. University of Debrecen; [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2437/276960.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Pál MJ. Sorbanállási elméleti problémák elemzése . [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/276960

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

University of California – Berkeley

16. Pedarsani, Ramtin. Robust Scheduling for Queueing Networks.

Degree: Electrical Engineering & Computer Sciences, 2015, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/1c54x9b9

► Queueing networks are used to model complicated processing environments such as data centers, call centers, transportation networks, health systems, etc. A queueing network consists of… (more)

▼ Queueing networks are used to model complicated processing environments such as data centers, call centers, transportation networks, health systems, etc. A queueing network consists of multiple interconnected queues with some routing structure, and a set of servers that have different and possibly overlapping capabilities in processing tasks (jobs) of different queues. One of the most important challenges in designing processing systems is to come up with a low-complexity and efficient scheduling policy.In this thesis, we consider the problem of robust scheduling for various types of processing networks. We call a policy robust if it does not depend on system parameters such as arrival and service rates. A major challenge in designing efficient scheduling policies for new large-scale processing networks is the lack of reliable estimates of system parameters; thus, designing a robust scheduling policy is of great practical interest. We develop a novel methodology for designing robust scheduling policies for queueing networks. The key idea of our design is to use the queue-length changes information to learn the right allocation of service resources to different tasks by stochastic gradient projection method. Our scheduling policy is oblivious to the knowledge of arrival rates and service rates of tasks in the network. Further, we propose a new fork-join processing network for scheduling jobs that are represented as directed acyclic graphs. We apply our robust scheduling policy to this fork-join network, and prove rate stability of the network under some mild assumptions. Next, we consider the stability of open multiclass queueing networks under longest-queue (LQ) scheduling. LQ scheduling is of great practical interest since (a) it requires only local decisions per group of queues; (b) the policy is robust to knowledge of arrival rates, service rates and routing probabilities of the network. Throughput-optimality of LQ scheduling policy for open multiclass queueing network is still an open problem. We resolve the open problem for a special case of multiclass queueing networks with two servers that can each process two queues, and show that LQ is indeed throughput-optimal.Finally, we consider transportation networks that can be well modeled by queueing networks. We abstractly model a network of signalized intersections regulated by fixed-time controls as a deterministic queueing network with periodic arrival and service rates. This system is characterized by a delay-differential equation. We show that there exists a unique periodic trajectory of queue-lengths, and every trajectory or solution of the system converges to this periodic trajectory, independent of the initial conditions.

Subjects/Keywords: Electrical engineering; Dynamical Systems; Networks; Queueing; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pedarsani, R. (2015). Robust Scheduling for Queueing Networks. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1c54x9b9

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pedarsani, Ramtin. “Robust Scheduling for Queueing Networks.” 2015. Thesis, University of California – Berkeley. Accessed March 08, 2021. http://www.escholarship.org/uc/item/1c54x9b9.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pedarsani, Ramtin. “Robust Scheduling for Queueing Networks.” 2015. Web. 08 Mar 2021.

Vancouver:

Pedarsani R. Robust Scheduling for Queueing Networks. [Internet] [Thesis]. University of California – Berkeley; 2015. [cited 2021 Mar 08]. Available from: http://www.escholarship.org/uc/item/1c54x9b9.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pedarsani R. Robust Scheduling for Queueing Networks. [Thesis]. University of California – Berkeley; 2015. Available from: http://www.escholarship.org/uc/item/1c54x9b9

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

17. Seelhorst, Michael. Flight Cancellation Behavior and Aviation System Performance.

Degree: Civil and Environmental Engineering, 2014, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/3045w49k

► Flight cancellations are costly events for both airlines and passengers, yet are poorly understood. This dissertation expands upon literature that has studied flight cancellations by… (more)

▼ Flight cancellations are costly events for both airlines and passengers, yet are poorly understood. This dissertation expands upon literature that has studied flight cancellations by incorporating more variables and using advanced model specifications. In addition, it is necessary to understand the drivers of flight cancellations to quantify the relationship between flight cancellations and flight delay forecasts, which has been poorly documented in the literature. This dissertation investigates the factors leading to flight cancellations and quantifies the effect of flight cancellations on flight delay forecasts.First, econometric choice models are applied to a large dataset of historical flight information to determine the preferences and behaviors of airlines with respect to flight cancellations. The binary logit estimation results show that flight characteristics, such as load factor, distance, and flight frequency, are significant for determining the likelihood of flight cancellations, even when accounting for adverse weather effects. Airline-specific logit models indicate large heterogeneity with respect to flight cancellation tendencies across the industry. Inter-flight heterogeneity is explored through the use of mixed logit and latent class models, but lack of significant heterogeneity and long computation times provide evidence that a basic binary model can be sufficient for capturing the flight cancellation behavior of airlines. Cancellation predictions are made at an airport-level, but the distribution of predicted cancellations does not match well with the actual distribution observed in the data. Second, deterministic queueing methods are used to quantify the effect flight cancellations have on queueing delay forecasts. The cancellation model estimates are used to predict flight cancellations for a sample of all flights for 160 airport-days. The reductions in delay due to cancellations are captured using Monte Carlo simulation and a first-order approximation. The simulation results show that delays are reduced by 22% when considering the effect of cancellations and the first-order approximation results are no more than 4% larger than those from the Monte Carlo simulation.Finally, a case study was performed based on the current operating environment at San Francisco International Airport, where capacity reductions are expected during the summer of 2014 due to runway construction. Moreover, airlines are proposing schedules with 5% more demand. The increased schedule combined with the capacity decrease leads to an large increase in the queueing delay forecasts. A cancellation model is used to predict the changes in delay that result from cancellations induced by the change in operating conditions. The results from the cancellation model indicate that departure cancellations will increase at an almost one-to-one ratio with the proposed demand increase, thus negating any benefit to airlines from a denser schedule. The feedback of cancellations on queueing delay is further explored with analytical models. As…

Subjects/Keywords: Civil engineering; Aviation; Behavior; Cancellations; Delays; Queueing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Seelhorst, M. (2014). Flight Cancellation Behavior and Aviation System Performance. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/3045w49k

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Seelhorst, Michael. “Flight Cancellation Behavior and Aviation System Performance.” 2014. Thesis, University of California – Berkeley. Accessed March 08, 2021. http://www.escholarship.org/uc/item/3045w49k.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Seelhorst, Michael. “Flight Cancellation Behavior and Aviation System Performance.” 2014. Web. 08 Mar 2021.

Vancouver:

Seelhorst M. Flight Cancellation Behavior and Aviation System Performance. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2021 Mar 08]. Available from: http://www.escholarship.org/uc/item/3045w49k.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seelhorst M. Flight Cancellation Behavior and Aviation System Performance. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/3045w49k

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

18. Babin, Paul D. Simulation modeling and analysis of adjustable service-rate queueing models that incorporate feedback control.

Degree: PhD, Industrial and Systems Engineering, 2015, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202015-052959/ ;

► Research shows that in a system model, when the production rate is adjusted based on the number of items in queue, the nature of… (more)

Subjects/Keywords: feedback control; queueing models; discrete event simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Babin, P. D. (2015). Simulation modeling and analysis of adjustable service-rate queueing models that incorporate feedback control. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202015-052959/ ;

Chicago Manual of Style (16^th Edition):

Babin, Paul D. “Simulation modeling and analysis of adjustable service-rate queueing models that incorporate feedback control.” 2015. Doctoral Dissertation, Mississippi State University. Accessed March 08, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202015-052959/ ;.

MLA Handbook (7^th Edition):

Babin, Paul D. “Simulation modeling and analysis of adjustable service-rate queueing models that incorporate feedback control.” 2015. Web. 08 Mar 2021.

Vancouver:

Babin PD. Simulation modeling and analysis of adjustable service-rate queueing models that incorporate feedback control. [Internet] [Doctoral dissertation]. Mississippi State University; 2015. [cited 2021 Mar 08]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202015-052959/ ;.

Council of Science Editors:

Babin PD. Simulation modeling and analysis of adjustable service-rate queueing models that incorporate feedback control. [Doctoral Dissertation]. Mississippi State University; 2015. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202015-052959/ ;

19. Shiv Prasad. On some models in Queueing and sequencing theory with applications; -.

Degree: Mathematics, 2014, Hemwati Nandan Bahuguna Garhwal University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/22044

None

-

Advisors/Committee Members: Ansari, S R.

Subjects/Keywords: Mathematics; Queueing; Sequencing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Prasad, S. (2014). On some models in Queueing and sequencing theory with applications; -. (Thesis). Hemwati Nandan Bahuguna Garhwal University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22044

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Prasad, Shiv. “On some models in Queueing and sequencing theory with applications; -.” 2014. Thesis, Hemwati Nandan Bahuguna Garhwal University. Accessed March 08, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/22044.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Prasad, Shiv. “On some models in Queueing and sequencing theory with applications; -.” 2014. Web. 08 Mar 2021.

Vancouver:

Prasad S. On some models in Queueing and sequencing theory with applications; -. [Internet] [Thesis]. Hemwati Nandan Bahuguna Garhwal University; 2014. [cited 2021 Mar 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22044.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Prasad S. On some models in Queueing and sequencing theory with applications; -. [Thesis]. Hemwati Nandan Bahuguna Garhwal University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22044

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University

20. Xiong, Kaiqi. Resource Optimization and Security in Distributed Computing.

Degree: PhD, Computer Science, 2009, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/3581

► With the number of e-Business applications dramatically increasing, service level agreements (SLA) will play an important part in distributed service computing. An SLA is a… (more)

▼ With the number of e-Business applications dramatically increasing, service level agreements (SLA) will play an important part in distributed service computing. An SLA is a combination of several quality of service (QoS) metrics, such as security, performance, and availability, agreed between a customer and a service provider. Due to the complexity of these metrics, most existing research typically addresses only one of these QoS metrics. In the case of the response time as a performance metric, the average time to process and complete a job is typically used in the literature. However, this may not be of real interest to a customer. A statistically bounded metric, that is, a percentile response time, is more realistic than the average response time. Moreover, in enterprise service computing, customer requests are typically distinguished by different request characteristics and service requirements. This dissertation includes a study of trustworthiness, percentile response time, service availability, and authentication among service stations or sites that may be owned by different service providers. The first part of this dissertation contains an analysis of percentile response time, which is one of the most important SLA metrics. Effective and accurate numerical solutions for the calculation of the percentile response time in single-class and multi-class queueing networks are obtained. Then, the numerical solution is incorporated in a resource allocation problem. Specifically, we present an approach for the resource optimization that minimizes the total cost of computer resources required while preserving a given percentile of the response time. In the second part of this dissertation, we extend the approach to consider trustworthiness, service availability, and the percentile of response time in Web services. We clearly define these QoS metrics and provide their quantitative analysis. Then, we take into account these QoS metrics in a trust-based resource allocation problem in which a set of computer resources is used by a service provider to host a typical Web services application for single-class customer services and multiple-class customer services respectively. We formulate the trust-based resource allocation problem as an optimization problem under SLA constraints in which we calculate the number of servers in each service site that minimize a cost function that reflects operational costs for single-class customer services and multiple-class customer services respectively. We solve this problem using an efficient numerical procedure. Experimental results show the applicability of the procedure and validate its accuracy. Finally, in the third part of this dissertation we first present a thorough performance evaluation of two notable public key cryptography-based authentication techniques, Public-Key Cross Realm Authentication in Kerberos (PKCROSS) and Public Key Utilizing Tickets for Application Servers (PKTAPP, a.k.a. KX.509/KCA), in terms of computational and communication times. We then demonstrate their… Advisors/Committee Members: Mihail Devetsikiotis, Committee Member (advisor), Matthias Stallmann, Committee Member (advisor), Dr. David Thuente, Committee Member (advisor), Harry Perros, Committee Chair (advisor).

Subjects/Keywords: Authenticaiton Protocol; Security; Queueing Network; Resource Optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xiong, K. (2009). Resource Optimization and Security in Distributed Computing. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/3581

Chicago Manual of Style (16^th Edition):

Xiong, Kaiqi. “Resource Optimization and Security in Distributed Computing.” 2009. Doctoral Dissertation, North Carolina State University. Accessed March 08, 2021. http://www.lib.ncsu.edu/resolver/1840.16/3581.

MLA Handbook (7^th Edition):

Xiong, Kaiqi. “Resource Optimization and Security in Distributed Computing.” 2009. Web. 08 Mar 2021.

Vancouver:

Xiong K. Resource Optimization and Security in Distributed Computing. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2021 Mar 08]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3581.

Council of Science Editors:

Xiong K. Resource Optimization and Security in Distributed Computing. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3581

University of Toronto

21. Tran, Tony. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/31609

►

The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally… (more)

Subjects/Keywords: Combinatorial Scheduling; Queueing Theory; Dynamic Network; 0546

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tran, T. (2011). Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31609

Chicago Manual of Style (16^th Edition):

Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Masters Thesis, University of Toronto. Accessed March 08, 2021. http://hdl.handle.net/1807/31609.

MLA Handbook (7^th Edition):

Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Web. 08 Mar 2021.

Vancouver:

Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1807/31609.

Council of Science Editors:

Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31609

Iowa State University

22. Dai, Dong. Statistical analysis of queueing problems using real data.

Degree: 2020, Iowa State University

URL: https://lib.dr.iastate.edu/etd/17854

► There are three topics in the thesis. In the ﬁrst topic, the problem is a staﬃng problem for queues: we need to decide the number… (more)

Subjects/Keywords: call-centers; emergency departments; queueing theory; staffing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dai, D. (2020). Statistical analysis of queueing problems using real data. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17854

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Dai, Dong. “Statistical analysis of queueing problems using real data.” 2020. Thesis, Iowa State University. Accessed March 08, 2021. https://lib.dr.iastate.edu/etd/17854.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Dai, Dong. “Statistical analysis of queueing problems using real data.” 2020. Web. 08 Mar 2021.

Vancouver:

Dai D. Statistical analysis of queueing problems using real data. [Internet] [Thesis]. Iowa State University; 2020. [cited 2021 Mar 08]. Available from: https://lib.dr.iastate.edu/etd/17854.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dai D. Statistical analysis of queueing problems using real data. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17854

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Boston University

23. Simhon, Eran. Advance reservations and information sharing in queues with strategic customers.

Degree: PhD, Systems Engineering, 2016, Boston University

URL: http://hdl.handle.net/2144/19499

► In many branches of the economy, including transportation, lodging, and more recently cloud computing, users can reserve resources in advance. Although advance reservations are gaining… (more)

▼ In many branches of the economy, including transportation, lodging, and more recently cloud computing, users can reserve resources in advance. Although advance reservations are gaining popularity, little is known about the strategic behavior of customers facing the decision whether to reserve a resource in advance or not. Making an advance reservation can reduce the waiting time or the probability of not getting service, but it is usually associated with an additional cost. To evaluate this trade-off, we develop a game-theoretic framework, called advance reservation games, that helps in reasoning about the strategic behavior of customers in systems that allow advance reservations. Using this framework, we analyze several advance reservation models, in the context of slotted loss queues and waiting queues. The analysis of the economic equilibria, from the provider perspective, yields several key insights, including: (i) If customers have no a-priori information about the availability of servers, then only customers granted service should be charged a reservation fee; (ii) Informing customers about the exact number of available servers is less profitable than only informing them that servers are available; (iii) In many cases, the reservation fee that leads to the equilibrium with maximum possible profit leads to other equilibria, including one resulting with no profit; (iv) If the game repeats many times and customers update their strategy after observing actions of other customers at previous stage, then the system converges to an equilibrium where no one makes an advance reservation, if such an equilibrium exists. Else, the system cycles and yields positive profit to the provider Finally, we study the impact of information sharing in M/M/1 queues with strategic customers. We analyze the intuitive policy of sharing the queue length with customers when it is small and hiding it when it is large. We prove that, from the provider perspective, such a policy is never optimal. That is, either always sharing the queue length or always hiding it maximizes the average number of customers joining the queue.

Subjects/Keywords: Operations research; Game theory; Queueing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Simhon, E. (2016). Advance reservations and information sharing in queues with strategic customers. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/19499

Chicago Manual of Style (16^th Edition):

Simhon, Eran. “Advance reservations and information sharing in queues with strategic customers.” 2016. Doctoral Dissertation, Boston University. Accessed March 08, 2021. http://hdl.handle.net/2144/19499.

MLA Handbook (7^th Edition):

Simhon, Eran. “Advance reservations and information sharing in queues with strategic customers.” 2016. Web. 08 Mar 2021.

Vancouver:

Simhon E. Advance reservations and information sharing in queues with strategic customers. [Internet] [Doctoral dissertation]. Boston University; 2016. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2144/19499.

Council of Science Editors:

Simhon E. Advance reservations and information sharing in queues with strategic customers. [Doctoral Dissertation]. Boston University; 2016. Available from: http://hdl.handle.net/2144/19499

University of Manitoba

24. Gunasekara, Charith. Optimal threshold policy for opportunistic network coding under phase type arrivals.

Degree: Electrical and Computer Engineering, 2016, University of Manitoba

URL: http://hdl.handle.net/1993/31615

► Network coding allows each node in a network to perform some coding operations on the data packets and improve the overall throughput of communication. However,… (more)

▼ Network coding allows each node in a network to perform some coding operations on the data packets and improve the overall throughput of communication. However, network coding cannot be done unless there are enough packets to be coded so at times it may be advantageous to wait for packets to arrive. We consider a scenario in which two wireless nodes each with its own buffer communicate via a single access point using network coding. The access point first pairs each data packet being sent from each node and then performs the network coding operation. Packets arriving at the access point that are unable to be paired are instead loaded into one of the two buffers at the access point. In the case where one of the buffers is empty and the other is not network coding is not possible. When this happens the access point must either wait for a network coding opportunity, or transmit the unpaired packet without coding. Delaying packet transmission is associated with an increased waiting cost but also allows for an increase in the overall efficiency of wireless spectrum usage, thus a decrease in packet transmission cost. Conversely, sending packets un-coded is associated with a decrease in waiting cost but also a decrease in the overall efficiency of the wireless spectrum usage. Hence, there is a trade-off between decreasing packet delay time, and increasing the efficiency of the wireless spectrum usage. We show that the optimal waiting policy for this system with respect to total cost, under phase-type packet arrivals, is to have a separate threshold for the buffer size that is dependent on the current phase of each arrival. We then show that the solution to this optimization problem can be obtained by treating it as a double ended push-out queueing theory problem. We develop a new technique to keep track of the packet waiting time and the number of packets waiting in the two ended push-out queue. We use the resulting queueing model to resolve the optimal threshold policy and then analyze the performance of the system using numerical approach. Advisors/Committee Members: Alfa, Attahiru (Electrical and Computer Engineering), Yahampath, Pradeepa (Electrical and Computer Engineering) (supervisor), Cai, Jun (Electrical and Computer Engineering), Thulasiraman, Parimala (Computer Science), Down, Douglas (McMaster University) (examiningcommittee).

Subjects/Keywords: Queueing Theory; Network Coding; Markov Decision Process

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gunasekara, C. (2016). Optimal threshold policy for opportunistic network coding under phase type arrivals. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31615

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gunasekara, Charith. “Optimal threshold policy for opportunistic network coding under phase type arrivals.” 2016. Thesis, University of Manitoba. Accessed March 08, 2021. http://hdl.handle.net/1993/31615.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gunasekara, Charith. “Optimal threshold policy for opportunistic network coding under phase type arrivals.” 2016. Web. 08 Mar 2021.

Vancouver:

Gunasekara C. Optimal threshold policy for opportunistic network coding under phase type arrivals. [Internet] [Thesis]. University of Manitoba; 2016. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1993/31615.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gunasekara C. Optimal threshold policy for opportunistic network coding under phase type arrivals. [Thesis]. University of Manitoba; 2016. Available from: http://hdl.handle.net/1993/31615

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

25. Alves, Vasco Filipe Figueiredo. Essays on strategic queueing.

Degree: PhD, 2016, University of Edinburgh

URL: http://hdl.handle.net/1842/26015

► This thesis includes three essays exploring some economic implications of queueing. A preliminary chapter introducing useful results from the literature which help contextualize the original… (more)

▼ This thesis includes three essays exploring some economic implications of queueing. A preliminary chapter introducing useful results from the literature which help contextualize the original research in the thesis is presented first. This introductory chapter starts by surveying queueing results from probability theory and operations research. Then it covers a few seminal papers on strategic queueing, mostly but not exclusively from the economics literature. These cover issues of individual and social welfare in the context of First Come First Served (FCFS) and Equitable Processor Sharing (EPS) queues, with one or multiple servers, as well as a discussion of strategic interactions surrounding queue cutting. Then an overview of some important papers on the impact of queueing on competitive behaviour, mostly Industrial Organization economists, is presented. The first original chapter presents a model for the endogenous determination of the number of queues in an M/M/2 system. Customers arriving at a system where two customers are being served play a game, choosing between two parallel queues or one single queue. Subgame perfect equilibria are obtained, varying with customer characteristics and game specifications. With risk neutrality and when jockeying is not permitted, a single queue is an equilibrium, as is two queues. With risk neutrality and jockeying allowed, there is a unique two queue equilibrium. With risk aversion and no jockeying, there is a unique single queue equilibrium, and with risk aversion and jockeying, the equilibrium depends on the magnitude of risk aversion. The second chapter analyses the individual decisions taken by consumers when deciding whether to join an M/M/1 queue where a subset of customers who interact repeatedly can both cut the queue and be overtaken once they join, by-passing occasional users. This is shown to be an equilibrium in repeated games for sufficiently patient customers. The expected sojourn time for customers under this discipline is described as a solution of a system of difference equations, and this is then used to obtain a threshold joining strategy for arrivals, which is independent of the number of regular customers in the queue, as regulars form a sub-queue under the LCFS discipline. Numerical methods are then employed to contrast sojourn times and thresholds with the equilibrium for a strict First Come First Served queueing discipline, and with the socially optimal joining rule. Finally, the third chapter describes a duopoly market for healthcare where one of the two providers is publicly owned and charges a price of zero, while the other sets a price so as to maximize its profit. Both providers are subject to congestion in the form of an M/M/1 queue, and they serve patient-customers with randomly distributed unit costs of time. Consumer demand (as market share) for both providers is obtained and described with its full complement of comparative statics. The private provider’s pricing decision is explored, and equilibrium existence is proven. Social welfare…

Subjects/Keywords: 519.8; economics; microeconomics; game theory; queueing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alves, V. F. F. (2016). Essays on strategic queueing. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/26015

Chicago Manual of Style (16^th Edition):

Alves, Vasco Filipe Figueiredo. “Essays on strategic queueing.” 2016. Doctoral Dissertation, University of Edinburgh. Accessed March 08, 2021. http://hdl.handle.net/1842/26015.

MLA Handbook (7^th Edition):

Alves, Vasco Filipe Figueiredo. “Essays on strategic queueing.” 2016. Web. 08 Mar 2021.

Vancouver:

Alves VFF. Essays on strategic queueing. [Internet] [Doctoral dissertation]. University of Edinburgh; 2016. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1842/26015.

Council of Science Editors:

Alves VFF. Essays on strategic queueing. [Doctoral Dissertation]. University of Edinburgh; 2016. Available from: http://hdl.handle.net/1842/26015

University of Illinois – Urbana-Champaign

26. Dong, Xiaobo. Power of d choices for large-scale bin packing: a loss model.

Degree: MS, Electrical & Computer Engineering, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/88185

► A system with N parallel servers is considered in our thesis. Each server consists of B units of a resource and jobs arrive at this… (more)

Subjects/Keywords: Resource allocation; Markov process; Cloud computing; Queueing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dong, X. (2015). Power of d choices for large-scale bin packing: a loss model. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88185

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Dong, Xiaobo. “Power of d choices for large-scale bin packing: a loss model.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed March 08, 2021. http://hdl.handle.net/2142/88185.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Dong, Xiaobo. “Power of d choices for large-scale bin packing: a loss model.” 2015. Web. 08 Mar 2021.

Vancouver:

Dong X. Power of d choices for large-scale bin packing: a loss model. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2142/88185.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dong X. Power of d choices for large-scale bin packing: a loss model. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88185

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

27. Lee, Ulysses. Backpressure networks with cooperative link augmentation.

Degree: MS, Electrical And Computer Engineering, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/95515

► We investigate a cross-layer communication technique which jointly lever- ages diversity gain from cooperative communications relaying and optimal throughput characteristics of backpressure networking. In particular,… (more)

Subjects/Keywords: Cooperative Diversity; Backpressure Routing; Network Queueing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, U. (2016). Backpressure networks with cooperative link augmentation. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95515

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lee, Ulysses. “Backpressure networks with cooperative link augmentation.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed March 08, 2021. http://hdl.handle.net/2142/95515.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lee, Ulysses. “Backpressure networks with cooperative link augmentation.” 2016. Web. 08 Mar 2021.

Vancouver:

Lee U. Backpressure networks with cooperative link augmentation. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2142/95515.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee U. Backpressure networks with cooperative link augmentation. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95515

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Sydney

28. D'Urso, Giovanni Salvatore. Multi-Robot Refill Scheduling with Queueing for Resource Constrained Coverage .

Degree: 2018, University of Sydney

URL: http://hdl.handle.net/2123/18759

► This thesis addresses the problem of refill scheduling for a team of vehicles or robots that must contend for access to a single physical location… (more)

Subjects/Keywords: multi-robot; coverage; centralised; queueing; agriculture; robotics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

D'Urso, G. S. (2018). Multi-Robot Refill Scheduling with Queueing for Resource Constrained Coverage . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/18759

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

D'Urso, Giovanni Salvatore. “Multi-Robot Refill Scheduling with Queueing for Resource Constrained Coverage .” 2018. Thesis, University of Sydney. Accessed March 08, 2021. http://hdl.handle.net/2123/18759.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

D'Urso, Giovanni Salvatore. “Multi-Robot Refill Scheduling with Queueing for Resource Constrained Coverage .” 2018. Web. 08 Mar 2021.

Vancouver:

D'Urso GS. Multi-Robot Refill Scheduling with Queueing for Resource Constrained Coverage . [Internet] [Thesis]. University of Sydney; 2018. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2123/18759.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

D'Urso GS. Multi-Robot Refill Scheduling with Queueing for Resource Constrained Coverage . [Thesis]. University of Sydney; 2018. Available from: http://hdl.handle.net/2123/18759

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

29. Reddy, Akula Aneesh. On distributed scheduling for wireless networks with time-varying channels.

Degree: PhD, Electrical and Computer Engineering, 2013, University of Texas – Austin

URL: http://hdl.handle.net/2152/25223

► Wireless scheduling is a fundamental problem in wireless networks that involves scheduling transmissions of multiple users in order to support data flows with as high… (more)

▼ Wireless scheduling is a fundamental problem in wireless networks that involves scheduling transmissions of multiple users in order to support data flows with as high rates as possible. This problem was first addressed by Tassuilas and Ephremides, resulting in the celebrated Back-Pressure network scheduling algorithm. This algorithm schedules network links to maximize throughput in an opportunistic fashion using instantaneous network state information (NSI), i.e., queue and channel state knowledge across the entire network. However, the Back-Pressure (BP) algorithm suffers from various drawbacks - (a) it requires knowledge of instantaneous NSI from the whole network, i.e. feedback about time-varying channel and queue states from all links of the network, (b) the algorithm requires solving a global optimization problem at each time to determine the schedule, making it highly centralized. Further, Back-pressure algorithm was originally designed for wireless networks where interference is modeled using protocol interference model. As recent break-throughs in full-duplex communications and interference cancelation techniques provide greatly increased capacity and scheduling flexibility, it is not clear how BP algorithm can be modified to improve the data rates and reduce the delay. In this thesis, we address the drawbacks of Back-Pressure algorithm to some extent. In particular, our first work provides a new scheduling algorithm (similar to BP) that allows users to make individual decisions (distributed) based on heterogeneously delayed network state information (NSI). Regarding the complexity issue, in our second work, we analyze the performance of the greedy version of BP algorithm, known as Greedy Maximal Scheduling (GMS) and understand the effect of channel variations on the performance of GMS. In particular, we characterize the efficiency ratio of GMS in wireless networks with fading. In our third and fourth work, we propose and analyze new scheduling algorithms that can benefit from new advancements in interference cancelation techniques. Advisors/Committee Members: Shakkottai, Sanjay (advisor).

Subjects/Keywords: Wireless networks; Queueing theory; Scheduling algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Reddy, A. A. (2013). On distributed scheduling for wireless networks with time-varying channels. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/25223

Chicago Manual of Style (16^th Edition):

Reddy, Akula Aneesh. “On distributed scheduling for wireless networks with time-varying channels.” 2013. Doctoral Dissertation, University of Texas – Austin. Accessed March 08, 2021. http://hdl.handle.net/2152/25223.

MLA Handbook (7^th Edition):

Reddy, Akula Aneesh. “On distributed scheduling for wireless networks with time-varying channels.” 2013. Web. 08 Mar 2021.

Vancouver:

Reddy AA. On distributed scheduling for wireless networks with time-varying channels. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2013. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2152/25223.

Council of Science Editors:

Reddy AA. On distributed scheduling for wireless networks with time-varying channels. [Doctoral Dissertation]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/25223

30. Divya, V. Analysis of queueing models with working vacations working interruptions and on queueing models with processing of items for service.

Degree: 2020, Cochin University of Science and Technology

URL: http://dyuthi.cusat.ac.in/purl/5563

Subjects/Keywords: Stochastic Modelling; Queueing models; Queueing System

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Divya, V. (2020). Analysis of queueing models with working vacations working interruptions and on queueing models with processing of items for service. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/5563

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Divya, V. “Analysis of queueing models with working vacations working interruptions and on queueing models with processing of items for service.” 2020. Thesis, Cochin University of Science and Technology. Accessed March 08, 2021. http://dyuthi.cusat.ac.in/purl/5563.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Divya, V. “Analysis of queueing models with working vacations working interruptions and on queueing models with processing of items for service.” 2020. Web. 08 Mar 2021.

Vancouver:

Divya V. Analysis of queueing models with working vacations working interruptions and on queueing models with processing of items for service. [Internet] [Thesis]. Cochin University of Science and Technology; 2020. [cited 2021 Mar 08]. Available from: http://dyuthi.cusat.ac.in/purl/5563.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Divya V. Analysis of queueing models with working vacations working interruptions and on queueing models with processing of items for service. [Thesis]. Cochin University of Science and Technology; 2020. Available from: http://dyuthi.cusat.ac.in/purl/5563

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Open Access Theses and Dissertations