Relevant bibliographies by topics / Queue mode / Journal articles
To see the other types of publications on this topic, follow the link: Queue mode.

Journal articles on the topic 'Queue mode'

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

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Queue mode.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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
2

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
3

Bambos, Nicholas, and George Michailidis. "Queueing and scheduling in random environments." Advances in Applied Probability 36, no. 01 (March 2004): 293–317. http://dx.doi.org/10.1017/s0001867800012970.

Full text
Abstract:
We consider a processing system, composed of several parallel queues and a processor, which operates in a time-varying environment that fluctuates between various states or modes. The service rate at each queue depends on the processor bandwidth allocated to it, as well as the environment mode. Each queue is driven by a job traffic flow, which may also depend on the environment mode. Dynamic processor scheduling policies are investigated for maximizing the system throughput, by adapting to queue backlogs and the environment mode. We show that allocating the processor bandwidth to the queues, so as to maximize the projection of the service rate vector onto a linear function of the workload vector, can keep the system stable under the maximum possible traffic load. The analysis of the system dynamics is first done under very general assumptions, addressing rate stability and flow conservation on individual traffic and environment evolution traces. The connection with stochastic stability is later discussed for stationary and ergodic traffic and environment processes. Various extensions to feed-forward networks of such nodes, the multi-processor case, etc., are also discussed. The approach advances the methodology of trace-based modelling of queueing structures. Applications of the model include bandwidth allocation in wireless channels with fluctuating interference and allocation of switching bandwidth to traffic flows in communication networks with fluctuating congestion levels.
APA, Harvard, Vancouver, ISO, and other styles
4

Bambos, Nicholas, and George Michailidis. "Queueing and scheduling in random environments." Advances in Applied Probability 36, no. 1 (March 2004): 293–317. http://dx.doi.org/10.1239/aap/1077134474.

Full text
Abstract:
We consider a processing system, composed of several parallel queues and a processor, which operates in a time-varying environment that fluctuates between various states or modes. The service rate at each queue depends on the processor bandwidth allocated to it, as well as the environment mode. Each queue is driven by a job traffic flow, which may also depend on the environment mode. Dynamic processor scheduling policies are investigated for maximizing the system throughput, by adapting to queue backlogs and the environment mode. We show that allocating the processor bandwidth to the queues, so as to maximize the projection of the service rate vector onto a linear function of the workload vector, can keep the system stable under the maximum possible traffic load. The analysis of the system dynamics is first done under very general assumptions, addressing rate stability and flow conservation on individual traffic and environment evolution traces. The connection with stochastic stability is later discussed for stationary and ergodic traffic and environment processes. Various extensions to feed-forward networks of such nodes, the multi-processor case, etc., are also discussed. The approach advances the methodology of trace-based modelling of queueing structures. Applications of the model include bandwidth allocation in wireless channels with fluctuating interference and allocation of switching bandwidth to traffic flows in communication networks with fluctuating congestion levels.
APA, Harvard, Vancouver, ISO, and other styles
5

Suliyanti, Rini. "Waktu Tunggu Antrean Angkutan Kota (Angkot) Di Terminal Kampung Melayu Jakarta Untuk Beroperasi." Warta Penelitian Perhubungan 22, no. 10 (October 31, 2010): 1012–24. http://dx.doi.org/10.25104/warlit.v22i10.1136.

Full text
Abstract:
Decrease in interest of the communitt; use the faci.Iities of public transportation (public transportation)will cause the accumulation mode of public transport occur in Terminal Kampung Melm;u to awaitthe arrival of passengers. Related to the above, it is necessan; to research on the queue waiting time forpublic transportation (public transportation) in Jakarta terminal kampung melm;u to operate. Fromthe analysis shows that the average time it takes public transportation M 18 are in the queue at thetop of queue 1,753 hours, or 106 minutesKeywords: public transport, queues, waiting time
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, Thomas Y. S. "Analysis of Single Buffer Random Polling System With State-Dependent Input Process and Server/Station Breakdowns." International Journal of Operations Research and Information Systems 9, no. 1 (January 2018): 22–50. http://dx.doi.org/10.4018/ijoris.2018010102.

Full text
Abstract:
Models and analytical techniques are developed to evaluate the performance of two variations of single buffers (conventional and buffer relaxation system) multiple queues system. In the conventional system, each queue can have at most one customer at any time and newly arriving customers find the buffer full are lost. In the buffer relaxation system, the queue being served may have two customers, while each of the other queues may have at most one customer. Thomas Y.S. Lee developed a state-dependent non-linear model of uncertainty for analyzing a random polling system with server breakdown/repair, multi-phase service, correlated input processes, and single buffers. The state-dependent non-linear model of uncertainty introduced in this paper allows us to incorporate correlated arrival processes where the customer arrival rate depends on the location of the server and/or the server's mode of operation into the polling model. The author allows the possibility that the server is unreliable. Specifically, when the server visits a queue, Lee assumes that the system is subject to two types of failures: queue-dependent, and general. General failures are observed upon server arrival at a queue. But there are two possibilities that a queue-dependent breakdown (if occurs) can be observed; (i) is observed immediately when it occurs and (ii) is observed only at the end of the current service. In both cases, a repair process is initiated immediately after the queue-dependent breakdown is observed. The author's model allows the possibility of the server breakdowns/repair process to be non-stationary in the number of breakdowns/repairs to reflect that breakdowns/repairs or customer processing may be progressively easier or harder, or that they follow a more general learning curve. Thomas Y.S. Lee will show that his model encompasses a variety of examples. He was able to perform both transient and steady state analysis. The steady state analysis allows us to compute several performance measures including the average customer waiting time, loss probability, throughput and mean cycle time.
APA, Harvard, Vancouver, ISO, and other styles
7

Beier, Simon, Martin Kutrib, Andreas Malcher, and Matthias Wendlandt. "Diving into the queue." RAIRO - Theoretical Informatics and Applications 52, no. 2-3-4 (April 2018): 89–110. http://dx.doi.org/10.1051/ita/2018009.

Full text
Abstract:
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a finite number of turns on the queue is allowed. As one main result we obtain a proper queue head hierarchy, that is, two heads are better than one head, and one head is better than no head. Moreover, it is shown that the model with one queue head, finitely many turns, and no time constraints as well as the model with two queue heads, possibly infinitely many turns, and time constraints is captured by P and has a P-complete membership problem. We obtain also that a subclass of the model with two queue heads is already captured by logarithmic space. Finally, we consider decidability questions and it turns out that almost nothing is decidable for the model with two queue heads, whereas we obtain that at least emptiness and finiteness are decidable for subclasses of the model with one queue head.
APA, Harvard, Vancouver, ISO, and other styles
8

Gupta, U. C., and Karabi Sikdar. "A finite capacity bulk service queue with single vacation and Markovian arrival process." Journal of Applied Mathematics and Stochastic Analysis 2004, no. 4 (January 1, 2004): 337–57. http://dx.doi.org/10.1155/s1048953304403025.

Full text
Abstract:
Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment. This paper analyzes a single-server finite capacity queue wherein service is performed in batches of maximum size “b” with a minimum threshold “a” and arrivals are governed by MAP. The server takes a single vacation when he finds less than “a” customers after service completion. The distributions of buffer contents at various epochs (service completion, vacation termination, departure, arbitrary and pre-arrival) have been obtained. Finally, some performance measures such as loss probability and average queue length are discussed. Numerical results are also presented in some cases.
APA, Harvard, Vancouver, ISO, and other styles
9

Guan, Xinping, Bo Yang, Bin Zhao, Gang Feng, and Cailian Chen. "Adaptive fuzzy sliding mode active queue management algorithms." Telecommunication Systems 35, no. 1-2 (September 18, 2007): 21–42. http://dx.doi.org/10.1007/s11235-007-9040-6.

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

Lemoine-Busserolle, M., K. C. Roth, E. R. Carrasco, B. W. Miller, A. W. Stephens, I. Jorgensen, and B. Rodgers. "Observing GRBs and Supernovae at Gemini Observatory as Target of Opportunity (ToO)." Proceedings of the International Astronomical Union 7, S279 (April 2011): 345–46. http://dx.doi.org/10.1017/s1743921312013270.

Full text
Abstract:
AbstractThe Gemini Observatories primarily operate a multi-instrument queue, with observers selecting observations that are best suited to weather and seeing conditions. The Target of Opportunity (ToO) observing mode is intended to allow observation of targets that cannot be specified in advance but which have a well defined external trigger such as distant supernovae or Gamma Ray bursts. In addition, the instrument and configuration best suited to observe the ToO may depend on properties of the event, such as brightness and redshift which again are impossible to know in advance. Queue observing naturally lends itself to Target of Opportunity (ToO) support since the time required to switch between programs and instruments is very short, and the staff observer is trained to operate all the available instruments and modes. Gemini Observatory has supported pre-approved ToO programs since beginning queue operations, and has implemented a rapid (less than 15 minutes response time) ToO mode since 2005. ToOs comprise a significant fraction of the queue (20–25% of the highest ranking band) nowadays. We discuss the ToO procedures, the statistics of rapid ToOs observing at Gemini North Observatory, the science related to GRBs and supernovae that this important mode has enabled.
APA, Harvard, Vancouver, ISO, and other styles
11

Freilikhman, Alex, Rotem Drori, and Yakov Shor. "Queue Time Sensitivity Analysis Methodology." Solid State Phenomena 205-206 (October 2013): 376–79. http://dx.doi.org/10.4028/www.scientific.net/ssp.205-206.376.

Full text
Abstract:
Queue time (QT) between consecutive process-steps is one of the factors affecting the quality of current products in semiconductors industry. Identification of process steps with queue time sensitivity is not an easy and quick analysis, and it requires a high number of lots. An effective tool for a quick identification of sensitivity of a specific operation to a queue time was developed at Micron Israel and it is applied on production material. The algorithm calculates the average absolute delta of responses between consecutive step QTs, where a minimal value is accepted in steps with a linear correlation between the QT and the response. This calculation results in a snap-shot of the impact of QT for specific responses, or failures modes, for the entire production line, where the step with minimal value of this parameter is easily detected. This algorithm was used on production material and indeed helped to detect a new QT dependency in specific process steps. The Queue Time Sensitivity Analysis (QTSA) algorithm is a novel methodology to detect correlation of QT in a single process step to a certain electrical EOL failure. It can be easily implemented in a fabrication site by the IT team. QTSA methodology is very efficient in detecting QT related issues and it can be used both in routine mode on baseline material and during significant elevation in EOL or in-line failures.
APA, Harvard, Vancouver, ISO, and other styles
12

Li, ShuGuang, and QingHua Zhou. "Dynamic Combined-Mode Traffic Network Model considering Transfer Behaviors." Journal of Advanced Transportation 2020 (September 21, 2020): 1–15. http://dx.doi.org/10.1155/2020/2010875.

Full text
Abstract:
We propose a dynamic combined-mode traffic network model considering transfer behaviors. We assume that travelers can be classified into two classes: one class is pure-mode travelers who complete a trip by single transportation mode, and another is combined-mode travelers who cover a journey by car, bus, and so forth. The multimode point queue model is used to model the interaction of cars and buses on the network. We present an integrated variational inequality formulation to capture the complex traveler choice behaviors such as departure time choices, transfer point, and route choices. Finally, a numerical example is given to illustrate the effectiveness of the proposed heuristic algorithm and model.
APA, Harvard, Vancouver, ISO, and other styles
13

Gubner, John A., B. Gopinath, and S. R. S. Varadhan. "Bounding functions of Markov processes and the shortest queue problem." Advances in Applied Probability 21, no. 04 (December 1989): 842–60. http://dx.doi.org/10.1017/s000186780001908x.

Full text
Abstract:
We prove a theorem which can be used to show that the expectation of a non-negative function of the state of a time-homogeneous Markov process is uniformly bounded in time. This is reminiscent of the classical theory of non-negative supermartingales, except that our analog of the supermartingale inequality need not hold almost surely. Consequently, the theorem is suitable for establishing the stability of systems that evolve in a stabilizing mode in most states, though from certain states they may jump to a less stable state. We use this theorem to show that ‘joining the shortest queue' can bound the expected sum of the squares of the differences between all pairs among N queues, even under arbitrarily heavy traffic.
APA, Harvard, Vancouver, ISO, and other styles
14

Gubner, John A., B. Gopinath, and S. R. S. Varadhan. "Bounding functions of Markov processes and the shortest queue problem." Advances in Applied Probability 21, no. 4 (December 1989): 842–60. http://dx.doi.org/10.2307/1427770.

Full text
Abstract:
We prove a theorem which can be used to show that the expectation of a non-negative function of the state of a time-homogeneous Markov process is uniformly bounded in time. This is reminiscent of the classical theory of non-negative supermartingales, except that our analog of the supermartingale inequality need not hold almost surely. Consequently, the theorem is suitable for establishing the stability of systems that evolve in a stabilizing mode in most states, though from certain states they may jump to a less stable state. We use this theorem to show that ‘joining the shortest queue' can bound the expected sum of the squares of the differences between all pairs among N queues, even under arbitrarily heavy traffic.
APA, Harvard, Vancouver, ISO, and other styles
15

Ayub, Qaisar, Sulma Rashid, and Mohd Soperi bin Mohd Zahid. "Optimization of Epidemic router by new forwarding queue mode TSMF." International Journal of Computer Applications 7, no. 11 (October 10, 2010): 5–8. http://dx.doi.org/10.5120/1294-1781.

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

Dudin, Alexander N., and Shoichi Nishimura. "Optimal control for a BMAP/G/1 queue with two service modes." Mathematical Problems in Engineering 5, no. 3 (1999): 255–73. http://dx.doi.org/10.1155/s1024123x99001088.

Full text
Abstract:
Queueing models with controllable service rate play an important role in telecommunication systems. This paper deals with a single-server model with a batch Markovian arrival process (BMAP) and two service modes, where switch-over times are involved when changing the service mode. The embedded stationary queue length distribution and the explicit dependence of operation criteria on switch-over levels and derived.
APA, Harvard, Vancouver, ISO, and other styles
17

Baruah, Monita, Kailash C. Madan, and Tillal Eldabi. "A Batch Arrival Single Server Queue with Server Providing General Service in Two Fluctuating Modes and Reneging during Vacation and Breakdowns." Journal of Probability and Statistics 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/319318.

Full text
Abstract:
We study the behavior of a batch arrival queuing system equipped with a single server providing general arbitrary service to customers with different service rates in two fluctuating modes of service. In addition, the server is subject to random breakdown. As soon as the server faces breakdown, the customer whose service is interrupted comes back to the head of the queue. As soon as repair process of the server is complete, the server immediately starts providing service in mode 1. Also customers waiting for service may renege (leave the queue) when there is breakdown or when server takes vacation. The system provides service with complete or reduced efficiency due to the fluctuating rates of service. We derive the steady state queue size distribution. Some special cases are discussed and numerical illustration is provided to see the effect and validity of the results.
APA, Harvard, Vancouver, ISO, and other styles
18

Mahdi, Mohammed Bally, and Lee Vien Leong. "Assessment of Queue Length and Delay at Toll Plaza Using Microscopic Traffic Simulation." Applied Mechanics and Materials 802 (October 2015): 387–92. http://dx.doi.org/10.4028/www.scientific.net/amm.802.387.

Full text
Abstract:
Highways and freeways usually experience severe traffic congestion due to the presence of toll plazas which is considered as a bottleneck. In recent years, traffic engineers around the world have utilised microscopic traffic simulation models as tools to evaluate the performance of selected freeway facilities based on known traffic pattern data. This study attempts to analyse the performance of toll plaza by utilizing the microscopic traffic simulation software VISSIM 6.0, based on two different output measures, namely: average queue length and average delay time. At the selected toll plaza, data are collected at toll booths for all three modes of payments, which are: cash mode, Touch n Go, and Smart TAG. Therefore, this study aims to build a microscopic traffic simulation model that is capable of analysing the behaviour of vehicles at toll plaza based on the mentioned output measures for each mode of payment and also to determine the type of payment mode that has the most significant impact on the overall performance of toll plazas and ultimately, to understand the causes of congestion at toll plaza.
APA, Harvard, Vancouver, ISO, and other styles
19

Li, Wenjie, Yiping Gong, and Bin Liu. "Performance Evaluation of Crossbar Switch Fabrics in Core Routers." Journal of Interconnection Networks 04, no. 02 (June 2003): 163–77. http://dx.doi.org/10.1142/s0219265903000805.

Full text
Abstract:
Many researchers have pointed out that using complex scheduling algorithms in input queuing switches with virtual output queuing (VOQ) scheme can achieve 100% throughput. But these algorithms are too complex to be implemented in hardware. In this paper, based on combined input/output queuing (CIOQ) switch fabrics, we propose a simple scheduling algorithm named outlet priority round robin (OPRR). For synthetic workloads we consider, including uniform and bursty traffic models, the performance of OPRR in VOQ mode and single queue mode is evaluated respectively. Through the simulation results we show that 1) OPRR algorithm, coupled with the speedup of 2, can lead to performance very close to output queuing switches, and 2) under the same condition, OPRR algorithm in single queue mode behaves almost identically to VOQ mode. These results are very useful to direct the design and implementation of switch fabrics in core routers.
APA, Harvard, Vancouver, ISO, and other styles
20

Ren, Yuan, Guangyue Lu, and Changyin Sun. "Joint Congestion Control and Resource Allocation in Cache-Enabled Sensor Networks." Sensors 19, no. 13 (July 5, 2019): 2961. http://dx.doi.org/10.3390/s19132961.

Full text
Abstract:
In this paper, we investigate the optimal beamforming design to achieve joint congestion control and energy-efficient resource allocation in cache-enabled sensor networks. The network of interest works in the time-slotted mode. The dynamic buffering queue for each node is introduced to reflect the degree of network congestion and service delay. Then, a time-averaged sum rate maximization problem is proposed under the constraints of queue stability, instantaneous power consumption, average power consumption, and the minimum quality of service requirements. By introducing the method of Lyapunov optimization, the importance of buffering queue backlogs and sum rate maximization can be traded off, then the original queue-aware and time-averaged optimization problem is transformed into a weighted sum rate maximization problem at each time slot. It can be further converted into a second-order cone-programming problem by successive convex approximation, which is convex and can be efficiently solved by off-the-shelf solvers. Numerical results validate that wireless caching can greatly relieve the network congestion by reducing the buffering backlogs, and show that the proposed scheme can trade off the average queue length and time-averaged sum rate by selecting different control parameters.
APA, Harvard, Vancouver, ISO, and other styles
21

Umayabashi, Masaki, Keisuke Takemori, Shigeki Shiokawa, and Iwao Sasase. "Input and output queueing ATM switch with backpressure mode and queue loss mode for nonuniform traffic." Electronics and Communications in Japan (Part I: Communications) 81, no. 11 (November 1998): 14–23. http://dx.doi.org/10.1002/(sici)1520-6424(199811)81:11<14::aid-ecja2>3.0.co;2-p.

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

ZHAO, CHUNJIANG, JUNWEI CAO, HUARUI WU, and FAN ZHANG. "COST ESTIMATION OF ADVANCE RESERVATIONS OVER QUEUED JOBS: A QUANTITATIVE STUDY." International Journal of Modeling, Simulation, and Scientific Computing 01, no. 03 (September 2010): 317–32. http://dx.doi.org/10.1142/s1793962310000249.

Full text
Abstract:
A grid is a geographically distributed resource sharing environment across multiple organizations. The most typical grid resources are clusters with high performance/cost ratio. In general, these clusters are shared as non-dedicated grid resources since local users may run their jobs simultaneously. Local jobs are usually queued and processed in a batch mode with uncertain waiting time, while grid jobs always require advance reservations with guaranteed resource allocation. In this paper, we provide quantitative analysis on the impact of advance reservations over queued jobs, in terms of job waiting time and resource utilization, respectively. It is observed that advance reservations will lead to longer job waiting time and lower resource utilization. That is to say, advance reservations should cost more than queued jobs. In this work, based on quantitative experimental results, an empirical formula for cost estimation of advance reservations over queued jobs is presented. It is suggested that compared with queued jobs, advance reservations should be doubly charged to compensate resource utilization loss. If the notice time of an advance reservation is short below a threshold, additional cost should be applied further since queue waiting time is increased.
APA, Harvard, Vancouver, ISO, and other styles
23

SHI, H., M. RONG, and P. LI. "A Dynamic Mobile Terminal Sleep Mode Operation Scheme Considering Packet Queue Length." IEICE Transactions on Communications E90-B, no. 9 (September 1, 2007): 2464–71. http://dx.doi.org/10.1093/ietcom/e90-b.9.2464.

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

Pagel, Christina, David A. Richards, and Martin Utley. "A Mathematical Modelling Approach for Systems Where the Servers Are Almost Always Busy." Computational and Mathematical Methods in Medicine 2012 (2012): 1–6. http://dx.doi.org/10.1155/2012/290360.

Full text
Abstract:
The design and implementation of new configurations of mental health services to meet local needs is a challenging problem. In the UK, services for common mental health disorders such as anxiety and depression are an example of a system running near or at capacity, in that it is extremely rare for the queue size for any given mode of treatment to fall to zero. In this paper we describe a mathematical model that can be applied in such circumstances. The model provides a simple way of estimating the mean and variance of the number of patients that would be treated within a given period of time given a particular configuration of services as defined by the number of appointments allocated to different modes of treatment and the referral patterns to and between different modes of treatment. The model has been used by service planners to explore the impact of different options on throughput, clinical outcomes, queue sizes, and waiting times. We also discuss the potential for using the model in conjunction with optimisation techniques to inform service design and its applicability to other contexts.
APA, Harvard, Vancouver, ISO, and other styles
25

Nishimura, Shoichi, and Yong Jiang. "An M/G/l Vacation Model with Two Service Modes." Probability in the Engineering and Informational Sciences 9, no. 3 (July 1995): 355–74. http://dx.doi.org/10.1017/s0269964800003922.

Full text
Abstract:
Consider an M/G/1 type queueing system with two service modes: regular speed and high speed. The service rule is characterized by two switch-over levels nR and nH, where nR and nH are given integers with 0 ≤ nH < nR. The server switches from regular speed mode to high speed mode when the number of customers present at a service completion epoch is equal to or larger than nR and switches from high speed mode to regular speed mode when the number of customers present decreases to nH. A key feature of the model is that the server takes a vacation for setup operations before a new service mode is available. This paper derives for the general model an expression for the generating function of the equilibrium queue-length distribution in terms of the switch-over levels. Two unknown parameters appear in the generating functions. Using a recursive method, we solve these unknown parameters and obtain a computationally tractable algorithm for the steady-state probabilities.
APA, Harvard, Vancouver, ISO, and other styles
26

Gelenbe, Erol. "G-Networks with Signals and Batch Removal." Probability in the Engineering and Informational Sciences 7, no. 3 (July 1993): 335–42. http://dx.doi.org/10.1017/s0269964800002953.

Full text
Abstract:
We consider queueing networks containing customers and signals that were recently introduced in Gelenbe [4]. Both customers and signals can be exogenous or can be obtained by a Markovian transition of a customer after service. A signal entering a queue forces a customer to move on to another queue according to a Markovian routing rule or to leave the network in batch mode. This synchronized or triggered motion is useful in representing the effect of tokens in Petri-nets, for systems in which customers and work can be instantaneously moved from one queue to the other on the arrival of a signal as well as for other network behaviors that are encountered in parallel computer system modelling. We show that this network has product form stationary solution and establish the non-linear customer flow equations that govern it. Network stability is discussed in this new context.
APA, Harvard, Vancouver, ISO, and other styles
27

Long, Gary. "Start-Up Delays of Queued Vehicles." Transportation Research Record: Journal of the Transportation Research Board 1934, no. 1 (January 2005): 125–31. http://dx.doi.org/10.1177/0361198105193400113.

Full text
Abstract:
Start-up delays of queued vehicles have been studied in past research for evaluation of their impacts on saturation flow rates at downstream traffic signals. A more crucial issue, however, can be the effect of start-up delays of queued vehicles at upstream locations where queued vehicles back up from a traffic signal across a railroad crossing. The relationship between queue start-up delays and track clearance times is important in establishing traffic signal preemption settings. This paper presents models that are developed for prediction of the expected maximum time required to mobilize a queue of any length. The models consider not only the average delay times but also the limiting delay times that are expected to accommodate high proportions of queues. For design convenience, queue lengths are converted into distance from the leading edge of a queue rather than being described only by the number of vehicles in a queue. Because the variations in start-up times, in addition to the average times reported in the literature, are needed, two sets of field studies were used to obtain data for model calibration and to investigate various traffic operation effects. Other factors that might be expected to influence queue start-up times are also analyzed.
APA, Harvard, Vancouver, ISO, and other styles
28

Saffer, Zsolt, and Miklós Telek. "Analysis of BMAP vacation queue and its application to IEEE 802.16e sleep mode." Journal of Industrial & Management Optimization 6, no. 3 (2010): 661–90. http://dx.doi.org/10.3934/jimo.2010.6.661.

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

Xizheng, Zhang, and Wang Yaonan. "Design and Performance Analysis of a Sliding-mode Prediction Based Active Queue Management." Information Technology Journal 12, no. 7 (March 15, 2013): 1309–17. http://dx.doi.org/10.3923/itj.2013.1309.1317.

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

Burr, W. E., S. Wakid, Xiaomei Qian, and D. Vaman. "A comparison of FDDI asynchronous mode and DQDB queue arbitrated mode data transmission for metropolitan area network applications." IEEE Transactions on Communications 42, no. 2/3/4 (February 1994): 1758–68. http://dx.doi.org/10.1109/tcomm.1994.582884.

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

Khan, Inam Ullah, Asrin Abdollahi, Ryan Alturki, Mohammad Dahman Alshehri, Mohammed Abdulaziz Ikram, Hasan J. Alyamani, and Shahzad Khan. "Intelligent Detection System Enabled Attack Probability Using Markov Chain in Aerial Networks." Wireless Communications and Mobile Computing 2021 (September 9, 2021): 1–9. http://dx.doi.org/10.1155/2021/1542657.

Full text
Abstract:
The Internet of Things (IoT) plays an important role to connect people, data, processes, and things. From linked supply chains to big data produced by a large number of IoT devices to industrial control systems where cybersecurity has become a critical problem in IoT-powered systems. Denial of Service (DoS), distributed denial of service (DDoS), and ping of death attacks are significant threats to flying networks. This paper presents an intrusion detection system (IDS) based on attack probability using the Markov chain to detect flooding attacks. While the paper includes buffer queue length by using queuing theory concept to evaluate the network safety. Also, the network scenario will change due to the dynamic nature of flying vehicles. Simulation describes the queue length when the ground station is under attack. The proposed IDS utilizes the optimal threshold to make a tradeoff between false positive and false negative states with Markov binomial and Markov chain distribution stochastic models. However, at each time slot, the results demonstrate maintaining queue length in normal mode with less packet loss and high attack detection.
APA, Harvard, Vancouver, ISO, and other styles
32

Ignaciuk, P., and M. Karbowańczyk. "Active queue management with discrete sliding modes in TCP networks." Bulletin of the Polish Academy of Sciences Technical Sciences 62, no. 4 (December 1, 2014): 701–11. http://dx.doi.org/10.2478/bpasts-2014-0076.

Full text
Abstract:
Abstract In this paper, a new active queue management (AQM) algorithm for data traffic control in TCP/IP networks is developed. The algorithm design is based on the principles of discrete sliding-mode control. Unlike majority of earlier studies, the design procedure considers the effects of both non-negligible delay in transferring data and feedback information and unpredictable capacity variations. The switching function is selected to incorporate a delay compensation mechanism, which ensures efficient network operation even for large bandwidthdelay product connections. The proposed algorithm, implemented as a packet marking scheme, is tested in discrete event ns-2 simulator. The results show that the algorithm provides fast convergence to steady state after sudden, unanticipated capacity changes. By generating smaller overshoots, the proposed algorithm also allows for reducing buffer space requirements to avoid packet loss as compared to the benchmark AQM solutions.
APA, Harvard, Vancouver, ISO, and other styles
33

IBARRA, OSCAR H., TEVFIK BULTAN, and JIANWEN SU. "ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS." International Journal of Foundations of Computer Science 12, no. 06 (December 2001): 821–36. http://dx.doi.org/10.1142/s0129054101000898.

Full text
Abstract:
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversal-bounded counters (i.e. each counter can be incremented or decremented by 1 and tested for zero, but the number of times it can change mode from nondecreasing to nonincreasing and vice-versa is bounded by a constant, independent of the computation). We extend a CM by augmenting it with some familiar data structures: (i) A pushdown counter machine (PCM) is a CM augmented with an unrestricted pushdown stack. (ii) A tape counter machine (TCM) is a CM augmented with a two-way read/write worktape that is restricted in that the number of times the head crosses the boundary between any two adjacent cells of the worktape is bounded by a constant, independent of the computation (thus, the worktape is finite-crossing). There is no bound on how long the head can remain on a cell. (iii) A queue counter machine (QCM) is a CM augmented with a queue that is restricted in that the number of alternations between non-deletion phase and non-insertion phase on the queue is bounded by a constant. A non-deletion (non-insertion) phase is a period consisting of insertions (deletions) and no-changes, i.e., the queue is idle. We show that emptiness, (binary, forward, and backward) reachability, nonsafety, and invariance for these machines are solvable. We also look at extensions of the models that allow the use of linear-relation tests among the counters and parameterized constants as "primitive" predicates. We investigate the conditions under which these problems are still solvable.
APA, Harvard, Vancouver, ISO, and other styles
34

Kobielnik, Martyna, and Wojciech Kempa. "On the Time to Buffer Overflow in a Queueing Model with a General Independent Input Stream and Power-Saving Mechanism Based on Working Vacations." Sensors 21, no. 16 (August 16, 2021): 5507. http://dx.doi.org/10.3390/s21165507.

Full text
Abstract:
A single server GI/M/1 queue with a limited buffer and an energy-saving mechanism based on a single working vacation policy is analyzed. The general independent input stream and exponential service times are considered. When the queue is empty after a service completion epoch, the server lowers the service speed for a random amount of time following an exponential distribution. Packets that arrive while the buffer is saturated are rejected. The analysis is focused on the duration of the time period with no packet losses. A system of equations for the transient time to the first buffer overflow cumulative distribution functions conditioned by the initial state and working mode of the service unit is stated using the idea of an embedded Markov chain and the continuous version of the law of total probability. The explicit representation for the Laplace transform of considered characteristics is found using a linear algebra-based approach. The results are illustrated using numerical examples, and the impact of the key parameters of the model is investigated.
APA, Harvard, Vancouver, ISO, and other styles
35

Karimov, Sh. "DETERMINATION OF PROBABILITY - TEMPORARY CHARACTERISTICS OF COMMUNICATION CHANNELS WHEN TRANSMITTING PRIORITY AND NON-PRIORITY DATA." Technical science and innovation 2019, no. 3 (September 18, 2019): 20–27. http://dx.doi.org/10.51346/tstu-01.19.3.-77-0037.

Full text
Abstract:
The article discusses the issues of finding the main indicators of the quality of the communication channel in computer networks when transmitting priority and non-priority data at different frame lengths. To solve this problem, methods of the theory of queuing using Petri nets are proposed. The proposed method for calculating the temporal and probabilistic characteristics of computer networks allows determinining the main indicators of the quality of the channel in a stationary mode when transmitting priority and non-priority data of computing tools at various values of the input stream intensity. To simulate the transmission of priority and non-priority frames, a color temporary Petri net is proposed. An algorithm is proposed for determining the basic parameters of information transfer, based on the use of the Little formula and allowing one to determine the number of frames in a queue, the average time a frame has been in a queue, and other distinctive features of the algorithm include the use of the window mode. The proposed technique allows to reduce the loss of priority frames of trajectory information and ensuring their transmission in real time.
APA, Harvard, Vancouver, ISO, and other styles
36

Gaidamaka, Yuliya, Alexander Pechinkin, Rostislav Razumchik, Konstantin Samouylov, and Eduard Sopin. "Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies." International Journal of Applied Mathematics and Computer Science 24, no. 3 (September 1, 2014): 519–34. http://dx.doi.org/10.2478/amcs-2014-0038.

Full text
Abstract:
Abstract Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system M[X]|G|1(L,H)|(H,R) with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given
APA, Harvard, Vancouver, ISO, and other styles
37

Zukerman, M., and I. Rubin. "Queue Size and Delay Analysis for a Communication System Subject to Traffic Activity Mode Changes." IEEE Transactions on Communications 34, no. 6 (June 1986): 622–28. http://dx.doi.org/10.1109/tcom.1986.1096584.

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

Sheng, Li, and Z. B. Dai. "Research on the Maritime Communication Cryptographic Chip’s Compiler Optimization." Polish Maritime Research 24, s2 (August 28, 2017): 60–65. http://dx.doi.org/10.1515/pomr-2017-0065.

Full text
Abstract:
Abstract In the process of ocean development, the technology for maritime communication system is a hot research field, of which information security is vital for the normal operation of the whole system, and that is also one of the difficulties in the research of maritime communication system. In this paper, a kind of maritime communication cryptographic SOC(system on chip) is introduced, and its compiler framework is put forward through analysis of working mode and problems faced by compiler front end. Then, a loop unrolling factor calculating algorithm based on queue theory, named UFBOQ (unrolling factor based on queue), is proposed to make parallel optimization in the compiler frontend with consideration of the instruction memory capacity limit. Finally, the scalar replacement method is used to optimize unrolled code to solve the memory access latency on the parallel computing efficiency, for continuous data storage characteristics of cryptographic algorithm. The UFBOQ algorithm and scalar replacement prove effective and appropriate, of which the effect achieves the linear speedup.
APA, Harvard, Vancouver, ISO, and other styles
39

Akgun, Osman T., Rhonda Righter, and Ronald Wolff. "Partial Flexibility in Routeing and Scheduling." Advances in Applied Probability 45, no. 03 (September 2013): 673–91. http://dx.doi.org/10.1017/s0001867800006534.

Full text
Abstract:
We consider partial customer flexibility in service systems under two different designs. In the first design, flexible customers have their own queue and each server has its own queue of dedicated customers. Under this model, the problem is a scheduling problem and we show under various settings that the dedicated customers first (DCF) policy is optimal. In the second design, flexible customers are not queued separately and must be routed to one of the server's dedicated queues upon arrival. We extend earlier results about the ‘join the smallest work (JSW)’ policy to systems with dedicated as well as flexible arrivals. We compare these models to a routeing model in which only the queue length is available in terms of both efficiency and fairness and argue that the overall best approach for call centers is JSW routeing. We also discuss how this can be implemented in call centers even when work is unknown.
APA, Harvard, Vancouver, ISO, and other styles
40

Akgun, Osman T., Rhonda Righter, and Ronald Wolff. "Partial Flexibility in Routeing and Scheduling." Advances in Applied Probability 45, no. 3 (September 2013): 673–91. http://dx.doi.org/10.1239/aap/1377868534.

Full text
Abstract:
We consider partial customer flexibility in service systems under two different designs. In the first design, flexible customers have their own queue and each server has its own queue of dedicated customers. Under this model, the problem is a scheduling problem and we show under various settings that the dedicated customers first (DCF) policy is optimal. In the second design, flexible customers are not queued separately and must be routed to one of the server's dedicated queues upon arrival. We extend earlier results about the ‘join the smallest work (JSW)’ policy to systems with dedicated as well as flexible arrivals. We compare these models to a routeing model in which only the queue length is available in terms of both efficiency and fairness and argue that the overall best approach for call centers is JSW routeing. We also discuss how this can be implemented in call centers even when work is unknown.
APA, Harvard, Vancouver, ISO, and other styles
41

Chaudhry, M. L., and U. C. Gupta. "On the Analysis of the Discrete-Time Geom(n)/G(n)/1/N Queue." Probability in the Engineering and Informational Sciences 10, no. 3 (July 1996): 415–28. http://dx.doi.org/10.1017/s0269964800004447.

Full text
Abstract:
In this paper, we discuss the late-arrival discrete-time Geom(n)/G(n)/1/N queue with state-dependent arrival and service processes. Whereas the interarrival times are geometrically distributed, service times are conditioned on the system length at the moment of service initiation. The model has wide applications in computer-communications systems, broadband integrated service digital network, asynchronous transfer mode, and so on. The analysis of the model has been carried out, using the supplementary variable technique, and the final results are presented in the form of recursive equations that can be easily implemented on any personal computer. In addition, relations among state probabilities at prearrival, postdeparture, and random epochs have been developed. To demonstrate the effectiveness of our method, some numerical examples have been presented for service-time distributions such as geometric, deterministic, arbitrary, and mixed. The results obtained in this paper should be found useful by system designers who wish to control the congestion by adjusting the service rate if the arrival traffic changes.
APA, Harvard, Vancouver, ISO, and other styles
42

Zhang, Tian Rui, and Tian Biao Yu. "Research on Networked Collaborative Technical Service Based on Cloud Computing." Applied Mechanics and Materials 742 (March 2015): 679–82. http://dx.doi.org/10.4028/www.scientific.net/amm.742.679.

Full text
Abstract:
On the basis of analyzed the modern manufacturing mode and technical service under the cloud computing conditions, the networked cooperative technical service mode based on cloud computing was presented for manufacturing enterprise to fast response the market demand as a new method. Firstly, ontology-based semantic identification technology has been studied, then the basic concept of ontology and created principles and method of ontology were expounded, and the algorithm of semantic identification for technical service information in production process was described. Secondly, made use of fuzzy analytic hierarchy process and Hungarian algorithm, queue and assignment of the technical services task in production process were researched respectively.
APA, Harvard, Vancouver, ISO, and other styles
43

Beshley, Mykola, Natalia Kryvinska, Halyna Beshley, Oleg Yaremko, and Julia Pyrih. "Virtual Router Design and Modeling for Future Networks with QoS Guarantees." Electronics 10, no. 10 (May 11, 2021): 1139. http://dx.doi.org/10.3390/electronics10101139.

Full text
Abstract:
A virtual router model with a static and dynamic resource reconfiguration for future internet networking was developed. This technique allows us to create efficient virtual devices with optimal parameters (queue length, queue overflow management discipline, number of serving devices, mode of serving devices) to ensure the required level of quality of service (QoS). An analytical model of a network device with virtual routers is proposed. By means of the mentioned mathematical representation, it is possible to determine the main parameters of the virtual queue system, which are based on the first in, first out (FIFO) algorithm, in order to analyze the efficiency of network resources utilization, as well as to determine the parameters of QoS flows, for a given intensity of packets arrival at the input interface of the network element. In order to research the guaranteed level of QoS in future telecommunications networks, a simulation model of a packet router with resource virtualization was developed. This model will allow designers to choose the optimal parameters of network equipment for the organization of virtual routers, which, in contrast to the existing principle of service, will provide the necessary quality of service provision to end users in the future network. It is shown that the use of standard static network device virtualization technology is not able to fully provide a guaranteed level of QoS to all present flows in the network by the criterion of minimum delay. An approach for dynamic reconfiguration of network device resources for virtual routers has been proposed, which allows more flexible resource management at certain points in time depending on the input load. Based on the results of the study, it is shown that the dynamic virtualization of the network device provides a guaranteed level of QoS for all transmitted flows. Thus, the obtained results confirm the feasibility of using dynamic reconfiguration of network device resources to improve the quality of service for end users.
APA, Harvard, Vancouver, ISO, and other styles
44

Khalili, Hamzeh, David Rincón, Sebastià Sallent, and José Ramón Piney. "An Energy-Efficient Distributed Dynamic Bandwidth Allocation Algorithm for Passive Optical Access Networks." Sustainability 12, no. 6 (March 13, 2020): 2264. http://dx.doi.org/10.3390/su12062264.

Full text
Abstract:
The rapid deployment of passive optical access networks (PONs) increases the global energy consumption of networking infrastructure. This paper focuses on the minimization of energy consumption in Ethernet PONs (EPONs). We present an energy-efficient, distributed dynamic bandwidth allocation (DBA) algorithm able to power off the transmitter and receiver of an optical network unit (ONU) when there is no upstream or downstream traffic. Our main contribution is combining the advantages of a distributed DBA (namely, a smaller packet delay compared to centralized DBAs, due to less time being needed to allocate the transmission slot) with energy saving features (that come at a price of longer delays due to the longer queue waiting times when transmitters are switched off). The proposed algorithm analyzes the queue size of the ONUs in order to switch them to doze/sleep mode when there is no upstream/downstream traffic in the network, respectively. Our results show that we minimized the ONU energy consumption across a wide range of network loads while keeping delay bounded.
APA, Harvard, Vancouver, ISO, and other styles
45

CHEN, RONG-JAYE, TING-YU LIN, and YI-BING LIN. "ADAPTIVE SCHEMES FOR REDUCING POWER CONSUMPTION OF MOBILE DATA HANDSETS." Journal of Interconnection Networks 02, no. 01 (March 2001): 69–84. http://dx.doi.org/10.1142/s0219265901000269.

Full text
Abstract:
This paper describes a threshold-based wake-up mechanism to reduce the battery power consumption of a mobile data handset. The threshold approach switches the system into the sleep mode when the memory queue for arriving packets is empty, and switches on the system when the number of packets in the memory queue is above a threshold value. We propose several adaptive schemes capable of dynamically selecting the threshold value for the threshold approach. An adaptive algorithm adjusts the threshold value based on a pre-defined packet-dropping probability, for which the switch-on rate is kept reasonably small to maintain the actual packet-dropping probability as close as the pre-defined value. Two strategies are used in the adaptive algorithm to adjust the threshold value: binary-division and fixed-amount. Two calculation strategies are considered to measure the packet-dropping probability: window-averaging and leaky-bucket integration (LBI). Our study indicates that the binary-division strategy outperforms the fixed-amount strategy in adjusting the threshold value. Furthermore, with proper setting, the LBI strategy outperforms the window-averaging strategy.
APA, Harvard, Vancouver, ISO, and other styles
46

Luo, Lijuan, Shaozhi Hong, Shanshan Shang, Xiaoli Zhou, Junyu Yang, and Yu Pan. "Intelligent Boarding Modelling and Evaluation: A Simulation-Based Approach." Journal of Advanced Transportation 2021 (August 6, 2021): 1–12. http://dx.doi.org/10.1155/2021/9973336.

Full text
Abstract:
The boarding efficiency is essential for all airlines due to potential competitive financial pressure. Therefore, the turnaround time needs to be cut down for a shorter boarding time. The paper devised a feasible boarding strategy which combines the management mode decision of passenger boarding with the intelligent deployment of the operation process and will be likely to improve the efficiency of the passenger travel chain. Among which, to decrease the boarding time is an effective method. Firstly, we proposed an improved outside-in strategy, which costs shorter boarding time based on the existing outside-in strategy. However, this method requires passengers to stand in queue in advance. Secondly, we put forward a deterministic queue-ordered boarding method to improve it. Finally, we simulated and applied the strategy to a narrow-body aircraft A320 and a wide-body A380, both representative for their type of airplanes. It turns out that this strategy performs better than the current widely used method and will be able to increase boarding efficiency and thus maximize the profits of airlines.
APA, Harvard, Vancouver, ISO, and other styles
47

Zheng, Guan, Yang Zhijun, Qian Wenhua, and He Min. "On Two-Level State-Dependent Routing Polling Systems with Mixed Service." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/109325.

Full text
Abstract:
Based on priority differentiation and efficiency of the system, we consider anN+1queues’ single-server two-level polling system which consists of one key queue andNnormal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
APA, Harvard, Vancouver, ISO, and other styles
48

Vahdani, Behnam, and Shayan Shahramfard. "A truck scheduling problem at a cross-docking facility with mixed service mode dock doors." Engineering Computations 36, no. 6 (July 8, 2019): 1977–2009. http://dx.doi.org/10.1108/ec-08-2018-0355.

Full text
Abstract:
Purpose The purpose of this study is truck scheduling and assignment of trucks to the doors simultaneously since these issues were considered mainly separately in the previous research. Also, the door service time and its impact on truck scheduling were not taken into account, so this research endeavors to cover this gap. Design/methodology/approach In this research, a novel model has been presented for simultaneous truck scheduling and assignment problem with time window constraints for the arrival and departure of trucks, mixed service mode dock doors and truck queuing. To resolve the developed model, two meta-heuristic algorithms, namely, genetic and imperialist competitive algorithms, are presented. Findings The computational results indicate that the proposed framework leads to increased total costs, although it has a more accurate planning; moreover, these indicate that the proposed algorithms have different performances based on the criteria considered for the comparison. Research limitations/implications There are some limitations in this research, which can be considered by other researchers to expand the current study, among them the specifications of uncertainty about arrival times of inbound and outbound trucks, number of merchandises which has been loaded on inbound trucks are the main factors. If so, by considering this situation, a realistic scheme about planning of cross docking system would be acquired. Moreover, the capacity of temporary storage has been considered unlimited, so relaxing this limitation can prepare a real and suitable situation for further study. Examining the capacity in the front of each type of doors of cross-dock and executive servers are the other aspects, which could be expanded in the future. Originality/value In this study, a mathematical programing model proposed for truck scheduling to minimize total costs including holding, truck tardiness and waiting time for queue of trucks caused by the interference of each carrier’s movement. At the operational levels, this research considered a multi-door cross-docking problem with mixed service mode dock doors and time window constraints for arrival and departure time of trucks. Moreover, M/G/C queue system was developed for truck arrival and servicing of carriers to trucks.
APA, Harvard, Vancouver, ISO, and other styles
49

Yurindra, Yurindra, Ari Amir Alkodri, Anisah Anisah, and Supardi Supardi. "Aplikasi Client Server Berbasis Android pada Barbershop The Barbega Menggunakan Model Multi Channel - Single Phase." Jurnal Sisfokom (Sistem Informasi dan Komputer) 9, no. 1 (April 27, 2020): 138. http://dx.doi.org/10.32736/sisfokom.v9i1.837.

Full text
Abstract:
A common problem that is often faced by almost most Barbershop is in terms of serving customer queues, for barbershops who have many customers and have many service chairs, then of course a good customer queue service management concept is needed as well. One of the concepts of queuing services for customers is how queue information can reach customers without queuing at the location. For this reason, a queue service concept for customers is needed based on Android. Android is preferred because almost all smartphone users are currently based on Android. The application will be built based on the concept of client server so that the queue service will occur in real time. The Queuing model used is Multi Channel Single Phase, because in the queue at barbershop there will only be one stage of the process, but it requires a lot of queue flow. This can be seen in the structure of the development diagram. By using an Android-based application based on a single phase multi channel model that will be built it is ensured that customers will find it helpful, without having to spend time in a queue customers can order queues and see queues in real time so they can rush to barbershop when it is close to the queue
APA, Harvard, Vancouver, ISO, and other styles
50

Jeganathan, K., J. Sumathi, and G. Mahalakshmi. "Markovian inventory model with two parallel queues, jockeying and impatient customers." Yugoslav Journal of Operations Research 26, no. 4 (2016): 467–506. http://dx.doi.org/10.2298/yjor150326018j.

Full text
Abstract:
This article presents a perishable stochastic inventory system under continuous review at a service facility consisting of two parallel queues with jockeying. Each server has its own queue, and jockeying among the queues is permitted. The capacity of each queue is of finite size L. The inventory is replenished according to an (s; S) inventory policy and the replenishing times are assumed to be exponentially distributed. The individual customer is issued a demanded item after a random service time, which is distributed as negative exponential. The life time of each item is assumed to be exponential. Customers arrive according to a Poisson process and on arrival; they join the shortest feasible queue. Moreover, if the inventory level is more than one and one queue is empty while in the other queue, more than one customer are waiting, then the customer who has to be received after the customer being served in that queue is transferred to the empty queue. This will prevent one server from being idle while the customers are waiting in the other queue. The waiting customer independently reneges the system after an exponentially distributed amount of time. The joint probability distribution of the inventory level, the number of customers in both queues, and the status of the server are obtained in the steady state. Some important system performance measures in the steady state are derived, so as the long-run total expected cost rate.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Queue mode' for other source types:
Dissertations / Theses
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