Relevant bibliographies by topics / Queue discipline

Contents

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

Academic literature on the topic 'Queue discipline'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

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 'Queue discipline.'

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 "Queue discipline"

1

Yamazaki, Genji, Hirotaka Sakasegawa, and J. George Shanthikumar. "A conservation law for single-server queues and its applications." Journal of Applied Probability 28, no. 1 (March 1991): 198–209. http://dx.doi.org/10.2307/3214750.

Full text
Abstract:
We establish a conservation law for G/G/1 queues with any work-conserving service discipline using the equilibrium equations, also called the basic equations. We use this conservation law to prove an extremal property of the first-come firstserved (FCFS) service discipline: among all service disciplines that are work-conserving and independent of remaining service requirements for individual customers, the FCFS service discipline minimizes [maximizes] the mean sojourn time in a G/G/1 queue with independent (but not necessarily identical) service times with a common mean and new better [worse] than used (NBUE[NWUE]) distributions. This extends recent results of Halfin and Whitt (1990), Righter et al. (1990) and Yamazaki and Sakasegawa (1987a,b). In addition we use the conservation law to obtain an approximation for the mean queue length in a GI/GI/1 queue under the processor-sharing service discipline with finite degree of multiplicity, called LiPS discipline. Several numerical examples are presented which support the practical usefulness of the proposed approximation.
APA, Harvard, Vancouver, ISO, and other styles
2

Yamazaki, Genji, Hirotaka Sakasegawa, and J. George Shanthikumar. "A conservation law for single-server queues and its applications." Journal of Applied Probability 28, no. 01 (March 1991): 198–209. http://dx.doi.org/10.1017/s0021900200039528.

Full text
Abstract:
We establish a conservation law forG/G/1 queues with any work-conserving service discipline using the equilibrium equations, also called the basic equations. We use this conservation law to prove an extremal property of the first-come firstserved (FCFS) service discipline: among all service disciplines that are work-conserving and independent of remaining service requirements for individual customers, the FCFS service discipline minimizes [maximizes] the mean sojourn time in aG/G/1 queue with independent (but not necessarily identical) service times with a common mean and new better [worse] than used (NBUE[NWUE]) distributions. This extends recent results of Halfin and Whitt (1990), Righter et al. (1990) and Yamazaki and Sakasegawa (1987a,b). In addition we use the conservation law to obtain an approximation for the mean queue length in aGI/GI/1 queue under the processor-sharing service discipline with finite degree of multiplicity, called LiPS discipline. Several numerical examples are presented which support the practical usefulness of the proposed approximation.
APA, Harvard, Vancouver, ISO, and other styles
3

Hirayama, Tetsuji, Masaaki Kijima, and Shoichi Nishimura. "Further results for dynamic scheduling of multiclass G/G/1 queues." Journal of Applied Probability 26, no. 03 (September 1989): 595–603. http://dx.doi.org/10.1017/s0021900200038183.

Full text
Abstract:
We consider discrete-time dynamic scheduling problems of the following three types ofG/G/1 queue withKdifferent customer classes: (i) aG/DFR/1 queue withKclasses under preemptive resume service discipline, (ii) aG/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) aG/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for aG/M/1 queue by Buyukkoc et al. (1985) to general queues.
APA, Harvard, Vancouver, ISO, and other styles
4

Hirayama, Tetsuji, Masaaki Kijima, and Shoichi Nishimura. "Further results for dynamic scheduling of multiclass G/G/1 queues." Journal of Applied Probability 26, no. 3 (September 1989): 595–603. http://dx.doi.org/10.2307/3214416.

Full text
Abstract:
We consider discrete-time dynamic scheduling problems of the following three types of G/G/1 queue with K different customer classes: (i) a G/DFR/1 queue with K classes under preemptive resume service discipline, (ii) a G/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) a G/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for a G/M/1 queue by Buyukkoc et al. (1985) to general queues.
APA, Harvard, Vancouver, ISO, and other styles
5

De Haan, Roland, Ahmad Al Hanbali, Richard J. Boucherie, and Jan-Kees Van Ommeren. "Transient analysis for exponential time-limited polling models under the preemptive repeat random policy." Advances in Applied Probability 52, no. 1 (March 2020): 32–60. http://dx.doi.org/10.1017/apr.2019.51.

Full text
Abstract:
AbstractPolling systems are queueing systems consisting of multiple queues served by a single server. In this paper we analyze two types of preemptive time-limited polling systems, the so-called pure and exhaustive time-limited disciplines. In particular, we derive a direct relation for the evolution of the joint queue length during the course of a server visit. The analysis of the pure time-limited discipline builds on and extends several known results for the transient analysis of an M/G/1 queue. For the analysis of the exhaustive discipline we derive several new results for the transient analysis of the M/G/1 queue during a busy period. The final expressions for both types of polling systems that we obtain generalize previous results by incorporating customer routeing, generalized service times, batch arrivals, and Markovian polling of the server.
APA, Harvard, Vancouver, ISO, and other styles
6

Grishechkin, Sergei. "On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes." Advances in Applied Probability 24, no. 03 (September 1992): 653–98. http://dx.doi.org/10.1017/s0001867800024459.

Full text
Abstract:
The M/G/1 queue with batch arrivals and a queueing discipline which is a generalization of processor sharing is studied by means of Crump–Mode–Jagers branching processes. A number of theorems are proved, including investigation of heavy traffic and overloaded queues. Most of the results obtained are also new for the M/G/1 queue with processor sharing. By use of a limiting procedure we also derive new results concerning M/G/1 queues with shortest residual processing time discipline.
APA, Harvard, Vancouver, ISO, and other styles
7

Grishechkin, Sergei. "On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes." Advances in Applied Probability 24, no. 3 (September 1992): 653–98. http://dx.doi.org/10.2307/1427484.

Full text
Abstract:
The M/G/1 queue with batch arrivals and a queueing discipline which is a generalization of processor sharing is studied by means of Crump–Mode–Jagers branching processes. A number of theorems are proved, including investigation of heavy traffic and overloaded queues. Most of the results obtained are also new for the M/G/1 queue with processor sharing. By use of a limiting procedure we also derive new results concerning M/G/1 queues with shortest residual processing time discipline.
APA, Harvard, Vancouver, ISO, and other styles
8

Torkki, Markus, Miika Linna, Seppo Seitsalo, and Pekka Paavolainen. "HOW TO REPORT AND MONITOR THE PERFORMANCE OF WAITING LIST MANAGEMENT." International Journal of Technology Assessment in Health Care 18, no. 3 (2002): 611–18. http://dx.doi.org/10.1017/s0266462302000442.

Full text
Abstract:
Objectives: Potential problems concerning waiting list management are often monitored using mean waiting times based on empirical samples. However, the appropriateness of mean waiting time as an indicator of access can be questioned if a waiting list is not managed well, e.g., if the queue discipline is violated. This study was performed to find out about the queue discipline in waiting lists for elective surgery to reveal potential discrepancies in waiting list management. Methods: There were 1,774 waiting list patients for hallux valgus or varicose vein surgery or sterilization. The waiting time distributions of patients receiving surgery and of patients still waiting for an operation are presented in column charts. The charts are compared with two model charts. One model chart presents a high queue discipline (first in—first out) and another a poor queue discipline (random) queue. Results: There were significant differences in waiting list management across hospitals and patient categories. Examples of a poor queue discipline were found in queues for hallux valgus and varicose vein operations. Conclusions: A routine waiting list reporting should be used to guarantee the quality of waiting list management and to pinpoint potential problems in access. It is important to monitor not only the number of patients in the waiting list but also the queue discipline and the balance between demand and supply of surgical services. The purpose for this type of reporting is to ensure that the priority setting made at health policy level also works in practise.
APA, Harvard, Vancouver, ISO, and other styles
9

Ward, Amy R., and Nicholas Bambos. "On stability of queueing networks with job deadlines." Journal of Applied Probability 40, no. 02 (June 2003): 293–304. http://dx.doi.org/10.1017/s0021900200019318.

Full text
Abstract:
In this paper, we consider a single-server queue with stationary input, where each job joining the queue has an associated deadline. The deadline is a time constraint on job sojourn time and may be finite or infinite. If the job does not complete service before its deadline expires, it abandons the queue and the partial service it may have received up to that point is wasted. When the queue operates under a first-come-first served discipline, we establish conditions under which the actual workload process—that is, the work the server eventually processes—is unstable, weakly stable, and strongly stable. An interesting phenomenon observed is that in a nontrivial portion of the parameter space, the queue is weakly stable, but not strongly stable. We also indicate how our results apply to other nonidling service disciplines. We finally extend the results for a single node to acyclic (feed-forward) networks of queues with either per-queue or network-wide deadlines.
APA, Harvard, Vancouver, ISO, and other styles
10

Ward, Amy R., and Nicholas Bambos. "On stability of queueing networks with job deadlines." Journal of Applied Probability 40, no. 2 (June 2003): 293–304. http://dx.doi.org/10.1239/jap/1053003545.

Full text
Abstract:
In this paper, we consider a single-server queue with stationary input, where each job joining the queue has an associated deadline. The deadline is a time constraint on job sojourn time and may be finite or infinite. If the job does not complete service before its deadline expires, it abandons the queue and the partial service it may have received up to that point is wasted. When the queue operates under a first-come-first served discipline, we establish conditions under which the actual workload process—that is, the work the server eventually processes—is unstable, weakly stable, and strongly stable. An interesting phenomenon observed is that in a nontrivial portion of the parameter space, the queue is weakly stable, but not strongly stable. We also indicate how our results apply to other nonidling service disciplines. We finally extend the results for a single node to acyclic (feed-forward) networks of queues with either per-queue or network-wide deadlines.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Queue discipline"

1

Fatnes, Johan Narvestad. "Flow-times in an M/G/1 Queue under a Combined Preemptive/Non-preemptive Priority Discipline. : Scheduled Waiting Time on Single Track Railway Lines." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10031.

Full text
Abstract:

A priority based rule for use during the process of scheduling trains oper- ating on a single track railway line was proposed by the Norwegian railway operator and owner, Jernbaneverket. The purpose of this study is to inves- tigate the effect of the suggested scheduling rule on the scheduled waiting times suffered by trains operating on a segment of the railway line. It is shown that the scheduling rule, under certain limiting assumptions, can be studied in the setting of queuing theory and that it has properties in common with a theoretical priority discipline combining two well docu- mented priority rules. The main part of this study is the development and analysis of a threshold based, combined preemptive/non-preemptive priority discipline. Under the combined discipline, preemptions are allowed during the early stage of processing only. Theoretical expressions for flow-times of jobs passing through the queuing system are reached through detailed studies of the non-preemptive and the preemptive priority discipline. The relationship between the suggested priority based scheduling rule and the theoretical, combined priority discipline is finally illustrated by sim- ulations. When adjusted for actual time spent by trains on traversing the line segment, the steady state solution for flow-times obtained from queuing theory yields an accurate expression for the trains’ average scheduled wait- ing times. The scheduling problem can in fact be modeled accurately by an M/G/1 queue under the combined priority discipline.

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

Klutke, Georgia-Ann. "Problems in feedback queueing systems with symmetric queue disciplines." Diss., Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/52314.

Full text
Abstract:
In this paper we study properties of a queue with instantaneous Bernoulli feedback where the service discipline is one of two symmetric disciplines. For the processor sharing queue with exponentially distributed service requirements we analyze the departure process, imbedded queue lengths, and the input and output processes. We determine the semi-Markov kernel of the internal flow processes and compute their stationary interval distributions and forward recurrence time distributions. For generally distributed service times, we analyze the output process using a continuous state Markov process. We compare the case where service times are exponentially distributed to the case where they are generally distributed. For the infinite server queue with feedback, we show that the output process is never renewal when the feedback probability is non-zero. We compute the time until the next output in three special cases.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
3

Horký, Miroslav. "Modely hromadné obsluhy." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-232033.

Full text
Abstract:
The master’s thesis solves models of queueing systems, which use the property of Markov chains. The queueing system is a system, where the objects enter into this system in random moments and require the service. This thesis solves specifically such models of queueing systems, in which the intervals between the objects incomings and service time have exponential distribution. In the theoretical part of the master’s thesis I deal with the topics stochastic process, queueing theory, classification of models and description of the models having Markovian property. In the practical part I describe realization and function of the program, which solves simulation of chosen model M/M/m. At the end I compare results which were calculated in analytic way and by simulation of the model M/M/m.
APA, Harvard, Vancouver, ISO, and other styles
4

Lin, Chih-Hao, and 林志豪. "Reduce Flight Waiting Time In The Queue By Adjusting Queueing Discipline." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/z2983d.

Full text
Abstract:
碩士
國立交通大學
統計學研究所
105
The purpose of this paper is to find out the queuing discipline for flight which reduces delays caused by runway restrictions and wake turbulence at busy airports. Use the data from Los Angeles International Airport to estimate the parameters. Assuming that the flights arriving at the queue is poisson process is designed to take off and land flights, and the distribution of the service time is the normal distribution which average is on condition previously flight type used the runway. Finally, the flight delay can be reduced by simulating and testing the results.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Queue discipline"

1

Sepúlveda, Jovanny, ed. Interdisciplinariedad, pedagogía y proyectos formativos. CUA - Medellin, 2020. http://dx.doi.org/10.52441/edu202003.

Full text
Abstract:
La comunicación de la ciencia, en sí misma no es ciencia, pero sí contribuye a ella y a la difusión del conocimiento. ¿Por qué publicamos? Primero porque la investigación científica hoy es epistemología + metodología + tecnología+ comunicación del conocimiento, lo que también plantea la importancia de la gestión del conocimiento. La ciencia hoy no se hace para que se quede en informes o anaqueles, sino para que pueda ser difundida, utilizada y apropiada por otros. La publicación es un paso de puesta en validación en el medio, entre pares o entre beneficiarios finales de los resultados del proceso de investigación, y por tanto, de la gestión del conocimiento iniciada con un proyecto en su momento. La publicación hace visibles los hallazgos, pero también los nuevos saberes, las nuevas ideas, las nuevas explicaciones, los nuevos objetos dentro de la cultura de lo humano. La ciencia, la tecnología y la innovación, como prácticas sociales -tal como lo expresa el prólogo- son además actividades culturales que buscan ser visibles, hacerse públicas para dar pie a una función social y cognitiva más profunda: generar trascendencia del saber humano en la historia. Las publicaciones son solo piezas retóricas de un quehacer mucho más comprometedor: motivar nuevos procesos de búsqueda, nuevos procesos cognitivos en otros. Y es que como dice Bruno Latour (2017), hacer ciencia tiene mucho de ejercicio político y de ejercicio cultural en nuestras sociedades contemporáneas. Los científicos contemporáneos desde su función social, plantean -no todos, pero sí los más conscientes- la batalla contra la dictadura del beneficio (la rentabilidad económica de la ciencia que se inculcó durante el siglo XX), a partir de la libertad y la gratuidad del conocimiento y la investigación. Publicar, y mucho más volver al libro como dispositivo de comunicación, motiva un conocer diferente, un conocer desde el deseo de entregar como acto generoso lo aprendido. La ciencia en la antigüedad, como lo plantea Ordine (2013), nace de la curiosidad y de la admiración. Son los fenómenos de lo cotidiano, de lo común, los que mueven a los primeros filósofos a generar saber. El estudio, como dice Ordine es en primer lugar adquisición de conocimientos que “sin vínculo utilitarista alguno, nos hacen crecer y nos vuelven autónomos” (p. 45). Así pues, el estudio y la investigación están motivados por la gratuidad de la admiración del mundo y de la realización del ser humano en su proceso de búsqueda de sabiduría. Aquí cabe retomar a Poincaré (1904 citado por Ordine, 2013): El hombre de ciencia no estudia la naturaleza porque sea útil; la estudia porque encuentra placer, y encuentra placer porque es bella. Si la naturaleza no fuera bella, no valdría la pena conocerla, ni valdría la pena vivir la vida. No hablo aquí, entendámoslo bien, de esta belleza que impresiona los sentidos, de la belleza de las cualidades y de las apariencias; no es que la desdeñe, lejos de ahí, pero no tiene nada que ver con la ciencia. Quiero hablar de esa belleza, más íntima, que proviene del orden armonioso de las partes y que solo una inteligencia pura puede comprender. Por así decirlo es ella la que da un cuerpo, un esqueleto a las halagadoras apariencias que embellecen nuestros sentidos, y sin este soporte, la belleza de estos sueños fugitivos sería imperfecta, porque sería indecisa y huiría siempre (p. 61). Y finaliza Ordine: Hay que saber poner la mira en “la belleza intelectual” que “se basta a sí misma”. Por ella sola, “más quizá que por el bien futuro de la humanidad”, “el hombre de ciencia se condena a largos y penosos trabajos” (p. 21). Sin este laborioso y desinteresado esfuerzo, sería realmente difícil pensar en hacerse mejores (p. 61). Los autores de la presente compilación han comprendido esta belleza intelectual desde los saberes y disciplinas más diversos: la antropología pedagógica, la educación, la psicología, la comunicación. Si bien el eje central es la educación y este libro se enmarca en una visión de educación desde diferentes intereses, el origen de nuestros autores es variado y multidisciplinar, como podrá evidenciar el lector en las siguientes páginas. La educación, es una práctica cultural propia de nuestras sociedades occidentales que debe hacer visibles sus reflexiones desde la perspectiva científica. La capacidad de sistematización de lo aprendido en el aula, del proceso de conocimiento desde los niveles más básicos hasta los más avanzados, es la clave de una producción científica desde el campo formativo. Hoy encontramos esa evidencia de las búsquedas, de las comprensiones, de las iniciativas de realización del ser humano en muchos de los apartados de estos textos que los autores comparten con nosotros.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Queue discipline"

1

Kamra, Abhinav, Huzur Saran, Sandeep Sen, and Rajeev Shorey. "Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline." In NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 838–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_68.

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

Guo, Yongjiang, and Xiyang Hou. "Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded Case." In Stochastic Models in Reliability, Network Security and System Safety, 315–43. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0864-6_16.

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

Guo, Yongjiang, and Xiyang Hou. "Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Underloaded and Critically Loaded Cases." In Stochastic Models in Reliability, Network Security and System Safety, 344–60. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0864-6_17.

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

"THE STEADY STATE DISTRIBUTION OF THE QUEUE LENGTH FOR A QUEUE WITH BULK ARRIVAL AND PROCESSOR SHARING DISCIPLINE." In Probabilistic Methods in Discrete Mathematics, 131–36. De Gruyter, 1997. http://dx.doi.org/10.1515/9783112314074-012.

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

Miyoshi, Naoto, and Toshiharu Hasegawa. "On-Line Derivative Estimation for the GI/G/1 Queue with Multiple Vacations and Bernoulli Service Discipline." In The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, 709–18. Elsevier, 1994. http://dx.doi.org/10.1016/b978-0-444-82031-0.50076-7.

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

"Multiclass Queues under Various Service Disciplines." In Analysis of Queues, 265–334. CRC Press, 2012. http://dx.doi.org/10.1201/b11858-12.

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

Saleh, Salah, and Martin Fleury. "Options for WiMAX Uplink Media Streaming." In Advancing the Next-Generation of Mobile Computing, 87–102. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0119-2.ch006.

Full text
Abstract:
IEEE 802.16e (mobile WiMAX) uplink behavior is a relatively neglected area of investigation, but emerging interactive media services have highlighted the need for closer investigation of uplink issues. In this simulation study of uplink queue management, the authors found that media streaming by TCP-Friendly Rate Control (TFRC) has advantages. However, temporal behavior of the queuing disciplines exhibits oscillations in buffer occupancy with build-up of delay during video streaming. This paper suggests a possible remedy lies in the choice of the more complex H.264/AVC Main profile, but this will impact upon mobile devices. It was also found that WiMAX video delivery is sensitive to choice of transmission frame size.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Queue discipline"

1

Palmei, Jendaipou, Shefali Gupta, Pasquale Imputato, Jonathan Morton, Mohit P. Tahiliani, Stefano Avallone, and Dave Taht. "Design and Evaluation of COBALT Queue Discipline." In 2019 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN). IEEE, 2019. http://dx.doi.org/10.1109/lanman.2019.8847054.

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

Maggi, Lorenzo, and Francesco De Pellegrini. "The Italian Coffee Queue: A dynamic priority discipline for multi-class queues." In 2015 54th IEEE Conference on Decision and Control (CDC). IEEE, 2015. http://dx.doi.org/10.1109/cdc.2015.7402215.

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

Deart, Vladimir, and Andrey Maslennikov. "Fuzzy logic queue discipline processing over bottleneck link." In 2012 11th Conference of Open Innovations Association (FRUCT). IEEE, 2012. http://dx.doi.org/10.23919/fruct.2012.8253107.

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

Saffer, Zsolt, and Wuyi Yue. "Analysis of multi-server queue with synchronous vacations and gated discipline." In the 6th International Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2021216.2021237.

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

Pughat, Anuradha, and Vidushi Sharma. "Queue discipline analysis for dynamic power management in wireless sensor node." In 2015 Annual IEEE India Conference (INDICON). IEEE, 2015. http://dx.doi.org/10.1109/indicon.2015.7443670.

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

GUILLEMIN, Fabrice, and Alain SIMONIAN. "Analysis of the Shortest Queue First service discipline with two classes." In 7th International Conference on Performance Evaluation Methodologies and Tools. ICST, 2014. http://dx.doi.org/10.4108/icst.valuetools.2013.254388.

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

Ramakrishnan, Gautam, Mohit Bhasi, V. Saicharan, Leslie Monis, Sachin D. Patil, and Mohit P. Tahiliani. "FQ-PIE Queue Discipline in the Linux Kernel: Design, Implementation and Challenges." In 2019 IEEE 44th LCN Symposium on Emerging Topics in Networking (LCN Symposium). IEEE, 2019. http://dx.doi.org/10.1109/lcnsymposium47956.2019.9000684.

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

Sakuma, Yutaka. "Tail behavior for many server queueing model with join the shortest queue discipline and jockeying." In the 4th International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1626553.1626562.

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

Velieva, T. R., A. V. Korolkova, and D. S. Kulyabov. "Designing installations for verification of the model of active queue management discipline RED in the GNS3." In 2014 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). IEEE, 2014. http://dx.doi.org/10.1109/icumt.2014.7002164.

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

Dekeris, B., T. Adomkus, and A. Budnikas. "Analysis of qos assurance using weighted fair queueing (WQF) scheduling discipline with low latency queue (LLQ)." In 28th International Conference on Information Technology Interfaces, 2006. IEEE, 2006. http://dx.doi.org/10.1109/iti.2006.1708533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Queue discipline' for particular source types:
Journal articles
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