Relevant bibliographies by topics / Queuing time

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Queuing time'

Author: Grafiati
Published: 5 June 2025
Last updated: 24 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Queuing time.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Queuing time"

1

Sun, Pey-Yuan, and Chen-Hsiu Laih. "Eliminate the Queuing Time in the New Suez Canal: Predicting Adjustment on Ships’ Arrival Time under Optimal Non-Queuing Toll Scheme." Journal of Marine Science and Engineering 9, no. 1 (2021): 70. http://dx.doi.org/10.3390/jmse9010070.

Full text
Abstract:
In 2016, the construction of the New Suez Canal was completed, enabling most large-size vessels to pass through and causing more ships to queue into the canal. As the queueing problem at the entrance of the canal was anticipated to be serious, an optimal non-queueing toll scheme was previously established to eliminate the queueing phenomenon at the anchorage of the canal. However, no information about each ship’s arrival time adjustment under the optimal non-queueing toll scheme is available from the previous literature. To solve this problem, we derive a series of mathematical formulae for each ship’s arrival time, length of queuing time and entry time before, and after, implementing the optimal non-queueing toll scheme. The arrival time adjustments, which enable ships to enter the canal without queueing, could then be obtained. These results enable the Suez Canal authorities to draw up the ship’s arrival timetable under the optimal non-queueing toll scheme, so that the captain could follow to enter the canal. The above information that we provide would be conducive to the management decision for the canal authorities to implement such a toll scheme. Once a tolled ship could enter the canal at the scheduled time without queueing, the ship owner could accurately control the sailing schedule, and the use of the ship could be more efficient.
APA, Harvard, Vancouver, ISO, and other styles
2

Sun, Pey-Yuan, and Chen-Hsiu Laih. "Eliminate the Queuing Time in the New Suez Canal: Predicting Adjustment on Ships’ Arrival Time under Optimal Non-Queuing Toll Scheme." Journal of Marine Science and Engineering 9, no. 1 (2021): 70. http://dx.doi.org/10.3390/jmse9010070.

Full text
Abstract:
In 2016, the construction of the New Suez Canal was completed, enabling most large-size vessels to pass through and causing more ships to queue into the canal. As the queueing problem at the entrance of the canal was anticipated to be serious, an optimal non-queueing toll scheme was previously established to eliminate the queueing phenomenon at the anchorage of the canal. However, no information about each ship’s arrival time adjustment under the optimal non-queueing toll scheme is available from the previous literature. To solve this problem, we derive a series of mathematical formulae for each ship’s arrival time, length of queuing time and entry time before, and after, implementing the optimal non-queueing toll scheme. The arrival time adjustments, which enable ships to enter the canal without queueing, could then be obtained. These results enable the Suez Canal authorities to draw up the ship’s arrival timetable under the optimal non-queueing toll scheme, so that the captain could follow to enter the canal. The above information that we provide would be conducive to the management decision for the canal authorities to implement such a toll scheme. Once a tolled ship could enter the canal at the scheduled time without queueing, the ship owner could accurately control the sailing schedule, and the use of the ship could be more efficient.
APA, Harvard, Vancouver, ISO, and other styles
3

Hu, Jun, Zhongwen Li, Lei You, Hong Zhang, Juan Wei, and Mei Li. "Simulation of queuing time in crowd evacuation by discrete time loss queuing method." International Journal of Modern Physics C 30, no. 08 (2019): 1950057. http://dx.doi.org/10.1142/s0129183119500578.

Full text
Abstract:
We have proposed a new evacuation model based on discrete time loss queuing method in order to effectively depict the queuing of pedestrians in an indoor space and its effect over evacuation performance. In this model, the calculation formula of pedestrian movement probability is given first based on field value and average queuing time; the average queuing time is depicted with the discrete time loss queuing method and the adopted evacuation strategy is set forth through defining cellular evolution process. Moreover, with the use of the established simulation platform for experiment, we have made a deep study of relations of parameters such as evacuation time, pedestrian density, exit number and average queuing time to obtain the pedestrian flow characteristic more in line with the reality. The result has shown that there is a great change in the evacuated population in the change of crowded state at the exit, and in the background of high population density, it is beneficial for reducing queuing time to prefer faraway exit to overcrowded exit for evacuation.
APA, Harvard, Vancouver, ISO, and other styles
4

Liang, Chih-Chin. "Enjoyable queuing and waiting time." Time & Society 28, no. 2 (2017): 543–66. http://dx.doi.org/10.1177/0961463x17702164.

Full text
Abstract:
Time theory studies abstractly argue that, depending on the customer experience, time spent waiting may be positive, negative, or even neutral, and it can affect the perceived passing of time and enjoyment of the overall customer experience. However, a company can manipulate customer perceptions of waiting time. Positive perceptions of waiting time can then be used for marketing purposes. Customer perceptions of waiting time can be reduced by making the queuing process enjoyable, by improving the waiting environment, and by making promotional activities enjoyable. To validate the aforementioned factors and develop the enjoyable queuing model, this study surveyed 1571 customers queuing at service companies in Taiwan, including 409 customers of upscale restaurants, 430 customers of restaurants, 439 customers of food stands, and 293 customers queuing at consumer electronics shops to purchase newly released iPhones. The applicability of the enjoyable queuing model was evaluated by partial least squares structural equation modeling, and group differences were evaluated by partial least squares multi-group analysis. The analytical results for each case and managerial implications are presented.
APA, Harvard, Vancouver, ISO, and other styles
5

Бронза, Семен Давыдович, Наталия Семеновна Юрчак, Ольга Александровна Гончарова, and Мурад Жораевич Овчиев. "Queuing time and utilization ratio in markov queuing systems." Eastern-European Journal of Enterprise Technologies 3, no. 4(69) (2014): 10. http://dx.doi.org/10.15587/1729-4061.2014.24901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ruth Evangelin, K., and T. Dhikhi. "A Comparative Study of K-Erlang Distribution and M/M/1 Model in Cloud Computing." Asian Journal of Computer Science and Technology 4, no. 1 (2015): 40–43. http://dx.doi.org/10.51983/ajcst-2015.4.1.1743.

Full text
Abstract:
Cloud computing is a new emerging computing paradigm in which information and computer resources can beaccessed from Web browser by the users. Arriving customers who find the server busy may retry for service after a period of time in Queuing systems is a Retrial queue. If a new customer, after connected to the cloud service does not find any server free, the system automatically redirects the request towards a waiting queue. At that moment, if that waiting queue is also fully occupied by other customers, then the newly arrived customer has to retry for service after certain time period. This technique is known as Retrial queues. Priority of service request is an important issue because some requests have to be serviced earlier than others. These are requests which can’t stay for a long time in the queueing system. A comparative study on the waiting time of M/Ek/n ( n=1) and M/M/1 queuing system with cloud computing service station. This influences the queueing system to reduce the mean waiting time.
APA, Harvard, Vancouver, ISO, and other styles
7

Kushvaha, Bhaskar, Dhruba Das, and Asmita Tamuli. "Single server queueing model with Poisson arrival and gamma service time distribution." Global Journal of Computer Sciences: Theory and Research 14, no. 1 (2024): 15–27. http://dx.doi.org/10.18844/gjcs.v14i1.9324.

Full text
Abstract:
Queueing theory is pivotal in understanding waiting lines and their pervasive role in everyday life. Its profound application spans across diverse sectors, including computer programming networks, healthcare, transportation, and so on. Researchers have applied many statistical distributions in analyzing queueing data. This article focuses on the analysis of a single server queueing system with Poisson input and service times distributed according to a two-parameter gamma distribution. The study elaborates on the construction and estimation of key queueing properties such as steady state equations, average number of customers in the system, average queue length, expected size of the non-empty queue, distribution of waiting time, average waiting time in the system, and average waiting time in the queue of the M/Gamma/1 queueing model using the two-parameter gamma distribution. Keywords: Gamma distribution; Poisson; service; single server; queuing model.
APA, Harvard, Vancouver, ISO, and other styles
8

Peng, Edwin. "Exact Response Time Analysis of Preemptive Priority Scheduling with Switching Overhead." ACM SIGMETRICS Performance Evaluation Review 49, no. 2 (2022): 72–74. http://dx.doi.org/10.1145/3512798.3512824.

Full text
Abstract:
The study of preemptive scheduling is essential to computer systems [15, 12, 3, 4]. Motivated by this, decades of queueing theory research have been done on the subject [19, 18, 16, 13, 21, 8, 17, 2, 11, 20, 10, 1]. However, almost all queuing theoretic literature on preemptive scheduling concerns systems without switching overhead - pausing or resuming a job is assumed to be instant. Practically speaking, switching in computer systems incurs some overhead [14], which causes a divide between models in research and the real world.
APA, Harvard, Vancouver, ISO, and other styles
9

Laih, Chen-Hsiu. "Maximizing Efficiency in the Suez Canal: A New Approach to Evaluate the Impact of Optimal Time-Varying Tolls on Ship Arrival Times." Journal of Marine Science and Engineering 12, no. 1 (2023): 76. http://dx.doi.org/10.3390/jmse12010076.

Full text
Abstract:
In the existing literature, an optimal time-varying toll scheme has been proposed for the Suez Canal to address the inefficiency of numerous ships queuing and waiting at the anchorage area to enter the canal. The primary objective of this tolling strategy is to alleviate the significant issue of ships queuing at the canal’s anchorage area. This stands in contrast to the current tolling system employed by the Suez Canal, which primarily aims to recover the management and operational costs associated with ship passage through the canal. However, the existing literature has yet to explore how the arrival times of ships at the anchorage area will change after implementing the optimal time-varying toll scheme. The goal is to ensure that the equilibrium cost of each tolled ship does not result in losses and achieve maximum efficiency in eliminating queueing at the anchorage area. To address this gap, this paper adopts the principle of cost equilibrium conservation and utilizes the Point-Slope Form to derive two mathematical formulas representing all ships’ post-toll arrival times at the anchorage area of the Suez Canal. These formulas are specifically derived for two categories of tolled ships: those that enter the canal earlier than the latest entry time regulated by the canal authorities and those that enter later. The derived formulas are concise and comparative, strengthening the theoretical underpinnings of the current pricing model for a queuing canal. Furthermore, they serve as valuable references for canal authorities in devising pertinent measures, such as organizing the scheduling of canal pilots, to facilitate the implementation of the optimal time-varying toll scheme.
APA, Harvard, Vancouver, ISO, and other styles
10

Kumala Jaya, Arsan, Akbar Hendra, Muhammad Sabirin Hadis, Muhammad Rizal, Randy Angriawan, and Annisa Nurul Puteri. "Development of Client Server-Based Queuing Applications at The Samsat Gowa Office." Ceddi Journal of Information System and Technology (JST) 1, no. 2 (2022): 14–23. http://dx.doi.org/10.56134/jst.v1i2.19.

Full text
Abstract:
The government has established a SAMSAT (One-Stop Manunggal Administration System) office which has duties in the motor vehicle tax service. Queuing activities make people spend their time waiting. Therefore, it is necessary to create a queuing system that can inform the estimated queue time remotely. The queuing system does not require users to wait physically, so the waiting time needed to queue can be used by taxpayers to carry out their own personal and work activities that are more useful. Queuing application development aims to develop queuing service features from previous applications which only provide queued information on taxpayers. Features developed in the form of queuing data processing with different activities, monitoring information on time and queue status periodically. The research method used is SDLC (Software Development Life Cycle) with a prototype model. The test results using the Gray Box Testing method show that queuing applications in government agencies providing motorized vehicle tax services have been successfully developed.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Queuing time"

1

Flick, Allen E. Liao Ming. "Time dependent queuing systems." Auburn, Ala., 2008. http://hdl.handle.net/10415/1487.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fountanas, Leonidas. "Active queue management mechanisms for real-time traffic in MANETs /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2001. http://handle.dtic.mil/100.2/ADA401102.

Full text
Abstract:
Thesis (Electrical Engineer and M.S. in Electrical Engineering) Naval Postgraduate School, Dec. 2001.<br>"December 2001." Thesis advisor(s): Tummala, Murali ; Ives, Robert W. ; Parker, Robert E. Includes bibliographical references (p. 101-104). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
3

Gangalic, Catalin. "Improving Queuing Time in a Pull Based Containerized Continuous Integration Build System." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-303114.

Full text
Abstract:
Most of the medium and big size software companies around the world are now using some form of continuous automatic build systems, with smaller companies following through. This approach, towards a more continuous flow, has pushed for more innovation in the domain and the adoption of various orchestration tools for these builds. At the same time, most continuous integration build systems do not leverage the data for improving the total building time. This thesis intends to decrease the overall building time in a pull based build system, named Blazar. This is obtained by decreasing the average time a build waits before being allocated a resource by the orchestration tool, Kubernetes. The improvement of average queuing time is done by leveraging the past data regarding the queue load of the system with the scope of predicting the amount of resources and preemptively allocating them. In the thesis, various time series prediction models are explored in order to find the most relevant one with regards to the available data. The final choice of the model is Facebook’s Prophet due to its ability to leverage multiple seasonalities, handle outliers, accommodate holidays, and provide fast predictions. By tuning various model’s parameters, it was possible to achieve satisfactory results. Thus, for some of the tested periods, the average queuing time was decreased with up to 20%, while maintaining a reasonable resource usage, compared to the time without using any prediction models. Finally, this thesis represents a practical approach that can be applied to other applications and systems. This thesis also details its limitations while discussing other solutions and ideas to further improve the results.<br>De flesta medelstora och större mjukvaruföretag runt om i världen använder idag någon form av kontinuerliga automatiska byggsystem, något som mindre företag även har börjat efterfölja. Detta tillvägagångssätt mot ett mer kontinuerligt flöde har drivit för mer innovation inom domänen och adopteringen av olika orkestreringsverktyg för dessa byggda program. Samtidigt utnyttjar de flesta kontinuerliga integrationssystem inte den data de samlar in för att förbättra den totala byggtiden. Denna uppsats avser att minska den totala byggtiden i ett pull-baserat byggsystem som heter Blazar. Detta uppnås genom att minska den genomsnittliga tid som ett byggt program väntar innan den tilldelas en resurs av orkestreringsverktyget, Kubernetes. Förbättringen av den genomsnittliga kötiden fås genom att utnyttja tidigare data om systemets köbelastning med omfattningen att förutsäga mängden resurser och fördela dem förebyggande. I avhandlingen undersöks olika tidsserieprognosmodeller för att hitta den mest relevanta med avseende på tillgänglig data. Det slutliga valet av modellen är Facebooks Prophet på grund av dess förmåga att utnyttja flera säsongsbestämmelser, hantera avvikelser, helgdagar och ge snabba förutsägelser. Genom att ställa in olika modellparametrar var det möjligt att uppnå tillfredsställande resultat. Under några av de testade perioderna minskade således den genomsnittliga kötiden med upp till 20%, samtidigt som en rimlig resursanvändning bibehölls, jämfört med tiden som ficks utan att använda någon förutsägelsemodell. Slutligen avser denna avhandling inte att ge en toppmodern lösning. Således slutar det med att beskriva sina begränsningar samtidigt som de tillhandahåller andra lösningar och idéer som kan förbättra resultaten.
APA, Harvard, Vancouver, ISO, and other styles
4

Brahimi, Mammar. "Approximating multi-server queues with inhomgeneous arrival rates and continuous service time distributions." Thesis, Lancaster University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liman-Tinguiri, Karim. "Using importance sampling to simulate queuing networks with heavy-tailed service time distributions." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66438.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 81-82).<br>Characterization of steady-state queue length distributions using direct simulation is generally computationally prohibitive. We develop a fast simulation method by using an importance sampling approach based on a change of measure of the service time in an M/G/1 queue. In particular, we present an algorithm for dynamically finding the optimal distribution within the parametrized class of delayed hazard rate twisted distributions of the service time. We run it on a M/G/1 queue with heavy-tailed service time distributions and show simulation gains of two orders of magnitude over direct simulation for a fixed confidence interval.<br>by Karim Liman-Tinguiri.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
6

Siddiqui, Usman Ghani. "The impact of MAC service-time and route discovery time on packet queuing delay in saturated ad hoc networks." Thesis, Wichita State University, 2011. http://hdl.handle.net/10057/3978.

Full text
Abstract:
This thesis presents a quantitative analysis of packet queuing delays in saturated DCF networks. It presents the relationship between medium access control (MAC) delays, routing delays, and the packet queuing delays, in terms of MAC service-time and route discovery time. The effects of network size and data transmission rates on the queuing delays were also analyzed. The simulations reveal that the MAC service-time affects the packet queuing delay in stationary networks; whereas the route discovery time along with the MAC service-time affects the queuing delays in mobile networks. Also, the average queuing delay increased with an increase in the network sizes and data transmission rates, especially for network sizes of 20 and more.<br>Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.
APA, Harvard, Vancouver, ISO, and other styles
7

Muthuvelu, Sethumadhavan. "Simultaneous Lot sizing and Lead-time Setting (SLLS)Via Queuing Theory and Heuristic search." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9692.

Full text
Abstract:
Materials requirements planning (MRP) is a widely used method for production planning and scheduling. Planned lead-time (PLT) and lot size are two of the input parameters for MRP systems, which determine planned order release dates. Presently, planned lead-time and lot size are estimated using independent methodologies. No existing PLT estimation methods consider factors such as machine breakdown, scrap-rate, etc. Moreover, they do not consider the capacity of a shop, which changes dynamically, because the available capacity at any given time is determined by the loading of the shop at that time. The absence of such factors in calculations leads to a huge lead-time difference between the actual lead-time and PLT, i.e., lead-time error. Altering the size of a lot will have an effect not only on the lead-time of that lot but also on that of other lots. The estimation of lot size and lead-time using independent methodologies currently does not completely capture the inter-dependent nature of lead-time and lot size. In this research, a lot-sizing model is modified in such a way that it minimizes the combination of setup cost, holding cost and work-in-process cost. This proposed approach embeds an optimization routine, which is based on dynamic programming on a manufacturing system model, which is based on open queuing network theory. Then, it optimizes lot size by using realistic estimates of WIP and the lead-time of different lots simultaneously for single-product, single-level bills of material. Experiments are conducted to compare the performance of the production plans generated by applying both conventional and the proposed methods. The results show that the proposed method has great potential and it can save up to 38% of total cost and minimize lead-time error up to 72%.<br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles
8

Yu, Fu. "On statistical analysis of vehicle time-headways using mixed distribution models." Thesis, University of Dundee, 2014. https://discovery.dundee.ac.uk/en/studentTheses/d101df63-b7db-45b6-8a03-365b64345e6b.

Full text
Abstract:
For decades, vehicle time-headway distribution models have been studied by many researchers and traffic engineers. A good time-headway model can be beneficial to traffic studies and management in many aspects; e.g. with a better understanding of road traffic patterns and road user behaviour, the researchers or engineers can give better estimations and predictions under certain road traffic conditions and hence make better decisions on traffic management and control. The models also help us to implement high-quality microscopic traffic simulation studies to seek good solutions to traffic problems with minimal interruption of the real traffic environment and minimum costs. Compared within previously studied models, the mixed (SPM and GQM) mod- els, especially using the gamma or lognormal distributions to describe followers headways, are probably the most recognized ones by researchers in statistical stud- ies of headway data. These mixed models are reported with good fitting results indicated by goodness-of-fit tests, and some of them are better than others in com- putational costs. The gamma-SPM and gamma-GQM models are often reported to have similar fitting qualities, and they often out-perform the lognormal-GQM model in terms of computational costs. A lognormal-SPM model cannot be formed analytically as no explicit Laplace transform is available with the lognormal dis- tribution. The major downsides of using mixed models are the difficulties and more flexibilities in fitting process as they have more parameters than those single models, and this sometimes leads to unsuccessful fitting or unreasonable fitted pa- rameters despite their success in passing GoF tests. Furthermore, it is difficult to know the connections between model parameters and realistic traffic situations or environments, and these parameters have to be estimated using headway samples. Hence, it is almost impossible to explain any traffic phenomena with the param- eters of a model. Moreover, with the gamma distribution as the only common well-known followers headway model, it is hard to justify whether it has described the headway process appropriately. This creates a barrier for better understanding the process of how drivers would follow their preceding vehicles. This study firstly proposes a framework developed using MATLAB, which would help researchers in quick implementations of any headway distributions of interest. This framework uses common methods to manage and prepare headway samples to meet those requirements in data analysis. It also provides common structures and methods on implementing existing or new models, fitting models, testing their performance hence reporting results. This will simplify the development work involved in headway analysis, avoid unnecessary repetitions of work done by others and provide results in formats that are more comparable with those reported by others. Secondly, this study focuses on the implementation of existing mixed models, i.e. the gamma-SPM, gamma-GQM and lognormal-GQM, using the proposed framework. The lognormal-SPM is also tested for the first time, with the recently developed approximation method of Laplace transform available for lognormal distributions. The parameters of these mixed models are specially discussed, as means of restrictions to simplify the fitting process of these models. Three ways of parameter pre-determinations are attempted over gamma-SPM and gamma-GQM models. A couple of response-time (RT) distributions are focused on in the later part of this study. Two RT models, i.e. Ex-Gaussian (EMG) and inverse Gaussian (IVG) are used, for first time, as single models to describe headway data. The fitting performances are greatly comparable to the best known lognormal single model. Further extending this work, these two models are tested as followers headway distributions in both SPM and GQM mixed models. The test results have shown excellent fitting performance. These now bring researchers more alternatives to use mixed models in headway analysis, and this will help to compare the be- haviours of different models when they are used to describe followers headway data. Again, similar parameter restrictions are attempted for these new mixed models, and the results show well-acceptable performance, and also corrections on some unreasonable fittings caused by the over flexibilities using 4- or 5- parameter models.
APA, Harvard, Vancouver, ISO, and other styles
9

Darshana, Dipika. "DELAY SENSITIVE ROUTING FOR REAL TIME TRAFFIC OVER AD-HOC NETWORKS." Master's thesis, University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2802.

Full text
Abstract:
Wireless ad hoc network consists of inexpensive nodes that form a mobile communication network. Due to limitations of the transmission range, the nodes rely on each other to forward packets such that messages can be delivered across the network. The selection of the path along which a packet is forwarded from the source node to the destination node is done by the routing algorithm. Most commonly used routing algorithms, though effective for non-real time applications, cannot handle real-time applications that require strict delay bounds on packet delivery. In this thesis, we propose a routing protocol that ensures timely delivery of real time data packets. The idea is to route packets in such a way that irrespective of factors like traffic load and node density, the average delay remains within acceptable bounds. This is done by carefully accessing the resources available to a route before a session is admitted along that route. Each link in the route is checked for sufficient bandwidth not only for the new session to be admitted but also for the sessions that are already using that link. The new session is admitted only if the admission does not violate the delay bounds of any on-going sessions. This method of route selection coupled with per-hop link reservations allows us to provide bounds on the delay performance. Extensive simulation experiments have been conducted that demonstrate the performance of the proposed routing protocol in terms of throughput, session blocking probability, packet drop probability, average path length, and delay.<br>M.S.<br>School of Electrical Engineering and Computer Science<br>Engineering and Computer Science<br>Computer Engineering MSCpE
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Jung-Kyung. "Tail asymptotics of queueing networks with subexponential service times." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29734.

Full text
Abstract:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Ayhan, Hayriye; Committee Member: Foley, Robert D.; Committee Member: Goldsman, David M.; Committee Member: Reed, Joshua; Committee Member: Zwart, Bert. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Queuing time"

1

I͡Ashkov, S. F. Analiz ocheredeĭ v ĖVM. "Radio i svi͡azʹ", 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hübner, Frank. Discrete-time performance analysis of finite-capacity queueing models for ATM multiplexers. Verlag Shaker, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lisa, Kuramoto, ed. Analysis of waiting-time data in health services research. Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Resing, Jacobus Adrianus Cornelis. Asymptotic results in feedback systems. Technische Universiteit Delft, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Daduna, Hans. Queueing Networks with Discrete Time Scale. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44592-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Denteneer, Dee. Multiaccess, Reservations & Queues. Springer Berlin Heidelberg, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

J. L. van den Berg. Sojourn times in feedback and processor sharing queues. Centrum voor Wiskunde en Informatica, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jacobs, Patricia A. Inferring finite-time performance in the M/G/1 queueing model. Naval Postgraduate School, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gaver, Donald Paul. Waiting times when service times are stable laws: Tamed and wild. Naval Postgraduate School, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

service), SpringerLink (Online, ed. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System. Springer Science+Business Media, LLC, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Queuing time"

1

Kalashnikov, Vladimir V. "Discrete-Time Markov Queueing Models." In Mathematical Methods in Queuing Theory. Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Thomopoulos, Nick T. "Waiting Time Density, One Server (M/M/1)." In Fundamentals of Queuing Systems. Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-3713-0_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Thomopoulos, Nick T. "Waiting Time Density, Multi Servers (M/M/k)." In Fundamentals of Queuing Systems. Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-3713-0_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fourneau, Jean-Michel, and Franck Quessette. "Monotone Queuing Networks and Time Parallel Simulation." In Analytical and Stochastic Modeling Techniques and Applications. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21713-5_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kumar, Amit, Ashwini Thakare, and Abhay Tawalare. "Strategy to Reduce Queuing Time at Toll Plaza." In Transportation Research. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-32-9042-6_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Lichen, and Yuliang Zhang. "Modeling Real-Time Wormhole Networks by Queuing Theory." In Parallel and Distributed Processing and Applications. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576235_70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lopez, Daphne, and S. V. Kasmir Raja. "Virtual Time Fair Queuing Algorithm for a Computational Grid." In Distributed Computing and Networking. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92295-7_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhao, Wei, Jiali Mao, Shengcheng Cai, et al. "WTPST: Waiting Time Prediction for Steel Logistical Queuing Trucks." In Database Systems for Advanced Applications. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59419-0_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wu, Yunbo, Zhishu Li, Yunhai Wu, et al. "Analysis of Real-Time Communication System with Queuing Priority." In Advances in Computer Systems Architecture. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11572961_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ali, M. Mehmet, X. Zhang, and J. F. Hayes. "A Discrete-Time Queuing Analysis of the Wireless ATM Multiplexing System." In Networking — ICN 2001. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47728-4_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Queuing time"

1

Farman, Mohd, Duli Chand Meena, and Narendra Kumar. "Real Time Pricing Algorithm Considering EV Charging Station Queuing." In 2024 IEEE 4th International Conference on Sustainable Energy and Future Electric Transportation (SEFET). IEEE, 2024. http://dx.doi.org/10.1109/sefet61574.2024.10717972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Liwei, Tong Zhang, Wenxue Wu, Xiaoqin Feng, Guoxi Lin, and Fengyuan Ren. "Fault- Tolerant Cyclic Queuing and Forwarding in Time-Sensitive Networking." In 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2024. http://dx.doi.org/10.23919/date58400.2024.10546689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hagargund, Asha G., Neelavar Shekhar Vittal Shet, and Muralidhar Kulkarni. "Implementation and performance comparison of queuing disciplines for Best-Effort and Time-Sensitive Network." In 2024 Second International Conference on Networks, Multimedia and Information Technology (NMITCON). IEEE, 2024. http://dx.doi.org/10.1109/nmitcon62075.2024.10699160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Carvalho, Andre, and Orlando Belo. "Predicting waiting time in customer queuing systems." In 2016 IEEE International Conference on Knowledge Engineering and Applications (ICKEA). IEEE, 2016. http://dx.doi.org/10.1109/ickea.2016.7803010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lim, Kwan Hui, Jeffrey Chan, Shanika Karunasekera, and Christopher Leckie. "Personalized Itinerary Recommendation with Queuing Time Awareness." In SIGIR '17: The 40th International ACM SIGIR conference on research and development in Information Retrieval. ACM, 2017. http://dx.doi.org/10.1145/3077136.3080778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hashmi, Omar, Sandun Kodituwakku, and Salman Durrani. "Frequency prioritised queuing in real-time electrocardiograph systems." In 2010 4th International Conference on Signal Processing and Communication Systems (ICSPCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icspcs.2010.6238550.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xue, Yijia, and Xiang Zhang. "Restaurant Queuing Time Prediction Using Random Forest Regression." In 2022 12th International Conference on Pattern Recognition Systems (ICPRS). IEEE, 2022. http://dx.doi.org/10.1109/icprs54038.2022.9854075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chu, Hsuan-Kai, Wan-Ping Chen, and Fang Yu. "Simulating Time-Varying Demand Services with Queuing Models." In 2016 IEEE International Conference on Services Computing (SCC). IEEE, 2016. http://dx.doi.org/10.1109/scc.2016.85.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Basumatary, Chanakya, and Hariram Selvamurugan Satheesh. "Queuing Policies for Enhanced Latency in Time Sensitive Networking." In 2020 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT). IEEE, 2020. http://dx.doi.org/10.1109/conecct50063.2020.9198623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wen-Bo, Liu, Guo Yun-Fei, Ma Hai-long, and Zhang Fan. "UBSFQ: An Urgency-Based Start-time Fair Queuing Scheduling." In 2009 International Conference on Communication Software and Networks. IEEE, 2009. http://dx.doi.org/10.1109/iccsn.2009.69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Queuing time' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography