Relevant bibliographies by topics / Queue mode

Contents

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

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Queue mode"

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
More sources

Dissertations / Theses on the topic "Queue mode"

1

Jou, Jia-Shiang. "Multifractal internet traffic model and active queue management." College Park, Md. : University of Maryland, 2003. http://hdl.handle.net/1903/53.

Full text
Abstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2003.
Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
2

Chan, Ming Kit. "Active queue management schemes using a capture-recapture model /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20CHAN.

Full text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.
Includes bibliographical references (leaves 58-61). Also available in electronic version. Access restricted to campus users.
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

Abdel-Jaber, Hussein F. "Performance Modelling and Evaluation of Active Queue Management Techniques in Communication Networks. The development and performance evaluation of some new active queue management methods for internet congestion control based on fuzzy logic and random early detection using discrete-time queueing analysis and simulation." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/4261.

Full text
Abstract:
Since the field of computer networks has rapidly grown in the last two decades, congestion control of traffic loads within networks has become a high priority. Congestion occurs in network routers when the number of incoming packets exceeds the available network resources, such as buffer space and bandwidth allocation. This may result in a poor network performance with reference to average packet queueing delay, packet loss rate and throughput. To enhance the performance when the network becomes congested, several different active queue management (AQM) methods have been proposed and some of these are discussed in this thesis. Specifically, these AQM methods are surveyed in detail and their strengths and limitations are highlighted. A comparison is conducted between five known AQM methods, Random Early Detection (RED), Gentle Random Early Detection (GRED), Adaptive Random Early Detection (ARED), Dynamic Random Early Drop (DRED) and BLUE, based on several performance measures, including mean queue length, throughput, average queueing delay, overflow packet loss probability, packet dropping probability and the total of overflow loss and dropping probabilities for packets, with the aim of identifying which AQM method gives the most satisfactory results of the performance measures. This thesis presents a new AQM approach based on the RED algorithm that determines and controls the congested router buffers in an early stage. This approach is called Dynamic RED (REDD), which stabilises the average queue length between minimum and maximum threshold positions at a certain level called the target level to prevent building up the queues in the router buffers. A comparison is made between the proposed REDD, RED and ARED approaches regarding the above performance measures. Moreover, three methods based on RED and fuzzy logic are proposed to control the congested router buffers incipiently. These methods are named REDD1, REDD2, and REDD3 and their performances are also compared with RED using the above performance measures to identify which method achieves the most satisfactory results. Furthermore, a set of discrete-time queue analytical models are developed based on the following approaches: RED, GRED, DRED and BLUE, to detect the congestion at router buffers in an early stage. The proposed analytical models use the instantaneous queue length as a congestion measure to capture short term changes in the input and prevent packet loss due to overflow. The proposed analytical models are experimentally compared with their corresponding AQM simulations with reference to the above performance measures to identify which approach gives the most satisfactory results. The simulations for RED, GRED, ARED, DRED, BLUE, REDD, REDD1, REDD2 and REDD3 are run ten times, each time with a change of seed and the results of each run are used to obtain mean values, variance, standard deviation and 95% confidence intervals. The performance measures are calculated based on data collected only after the system has reached a steady state. After extensive experimentation, the results show that the proposed REDD, REDD1, REDD2 and REDD3 algorithms and some of the proposed analytical models such as DRED-Alpha, RED and GRED models offer somewhat better results of mean queue length and average queueing delay than these achieved by RED and its variants when the values of packet arrival probability are greater than the value of packet departure probability, i.e. in a congestion situation. This suggests that when traffic is largely of a non bursty nature, instantaneous queue length might be a better congestion measure to use rather than the average queue length as in the more traditional models.
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Zhenyu. "Discrete-time queueing model for responsive network traffic and bottleneck queues." Thesis, Loughborough University, 2016. https://dspace.lboro.ac.uk/2134/21314.

Full text
Abstract:
The Internet has been more and more intensively used in recent years. Although network infrastructure has been regularly upgraded, and the ability to manage heavy traffic greatly increased, especially on the core networks, congestion never ceases to appear, as the amount of traffic that flow on the Internet seems to be increasing at an even faster rate. Thus, congestion control mechanisms play a vital role in the functioning of the Internet. Active Queue Management (AQM) is a popular type of congestion control mechanism that is implemented on gateways (most notably routers), which can predict and avoid the congestion before it happens. When properly configured, AQMs can effectively reduce the congestion, and alleviate some of the problems such as global synchronisation and unfairness to bursty traffic. However, there are still many problems regarding AQMs. Most of the AQM schemes are quite sensitive to their parameters setting, and these parameters may be heavily dependent on the network traffic profile, which the administrator may not have intensive knowledge of, and is likely to change over time. When poorly configured, many AQMs perform no better than the basic drop-tail queue. There is currently no effective method to compare the performance of these AQM algorithms, caused by the parameter configuration problem. In this research, the aim is to propose a new analytical model, which mainly uses discrete-time queueing theory. A novel transient modification to the conventional equilibrium-based method is proposed, and it is utilised to further develop a dynamic interactive model of responsive traffic and bottleneck queues. Using step-by-step analysis, it represents the bursty traffic and oscillating queue length behaviour in practical network more accurately. It also provides an effective way of predicting the behaviour of a TCP-AQM system, allowing easier parameter optimisation for AQM schemes. Numerical solution using MATLAB and software simulation using NS-2 are used to extensively validate the proposed models, theories and conclusions.
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Lefei. "Development and Evaluation of Transit Signal Priority Strategies with Physical Queue Models." Diss., The University of Arizona, 2006. http://hdl.handle.net/10150/193823.

Full text
Abstract:
With the rapid growth in modern cities and congestion on major freeways and local streets, public transit services have become more and more important for urban transportation. As an important component of Intelligent Transportation Systems (ITS), Transit Signal Priority (TSP) systems have been extensively studied and widely implemented to improve the quality of transit service by reducing transit delay. The focus of this research is on the development of a platform with the physical queue representation that can be employed to evaluate and/or improve TSP strategies with the consideration of the interaction between transit vehicles and queues at the intersection.This dissertation starts with deterministic analyses of TSP systems based on a physical queue model. A request oriented TSP decision process is then developed which incorporates a set of TSP decision regions defined on a time-space diagram with the physical queue representation. These regions help identify the optimal detector location, select the appropriate priority control strategy, and handle the situations with multiple priority requests. In order to handle uncertainties in TSP systems arising in bus travel time and dwell time estimation, a type-2 fuzzy logic forecasting system is presented and tested with field data. Type-2 fuzzy logic is very powerful in dealing with uncertainty. The use of Type-2 fuzzy logic helps improve the performance of TSP systems. The last component of the dissertation is the development of a Colored Petri Net (CPN) model for TSP systems. With CPN tools, computer simulation can be performed to evaluate various TSP control strategies and the decision process. Examples for demonstrating the process of implementing the green extension strategy and the proposed TSP decision process are presented in the dissertation. The CPN model can also serve as an interface between the platform developed in this dissertation and the implementation of the control strategies at the controller level.
APA, Harvard, Vancouver, ISO, and other styles
7

Palekar, Trishul Ajit. "Signal optimization at isolated intersections using pre-signals." Texas A&M University, 2006. http://hdl.handle.net/1969.1/4279.

Full text
Abstract:
This research proposes a new signal operation strategy aimed at efficient utilization of green time by cutting down on the start up and response loss times. The idea is to have a "pre-signal" on each main approach a few hundred feet upstream of the intersection in addition to the main intersection signal, which is coordinated with the pre-signal. The offset between the main and pre-signal ensures that the majority of start up losses does not occur at the main signal. The benefits of the system under various traffic conditions were evaluated based on analysis of the queue discharge process and Corridor Simulation (CORSIM) study. The proposed measure should reduce the travel time and total control delay for the signalized network. To attain the objective the following two studies were undertaken: 1. Development of a queue discharge model to investigate the expected benefits of the system. 2. Simulation of the system: In the second part of the research, the proposed strategy was tested using CORSIM to evaluate its performance vis-à-vis the baseline case. The queue discharge model (QDM) was found to be linear in nature in contrast to prior expectations. The model was used to quantify the benefits obtained from the pre-signal system. The result of this analysis indicated that the proposed strategy would yield significant travel time savings and reductions in total control delay. In addition to the QDM analysis, CORSIM simulations were used to code various hypothetical scenarios to test the concept under various constraints and limitations. As per expectations, it was found that the system was beneficial for high demand levels and longer offsets. The upper limit on offsets was determined by visual observation of platoon dispersion and therefore the maximum offset distance was restricted to 450 feet. For scenarios where split phasing was used, the break even point in terms of demand level was found to be 2500 vph on a three lane approach, whereas that for a lag-lag type of phasing strategy was found to be 1800 vph, also on a three lane approach.
APA, Harvard, Vancouver, ISO, and other styles
8

Fils, Ebba, Clara Harrison, and Mathilda Nilsson. "Swedes only hate queue jumpers they don't know : A description of brand attitudes on Google's SERPs." Thesis, Linnéuniversitetet, Institutionen för marknadsföring (MF), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-75866.

Full text
Abstract:
Background: The Internet has developed the world of advertising by giving advertisers the possibility to track specific patterns among their consumers, which shows how consumers are clicking on online advertisements and what translates into sales for the brand. Lately, companies have actively starting to make use of search engines marketing (SEM). The paid advertising on search engines is one option to make a brand’s website visible to its consumers. The attitudes towards advertisements have previously been examined in traditional media and in other online settings, but the research in the context of search engines is limited. Therefore, it calls for deeper insights and knowledge in how consumers hold attitudes towards a brand and its paid advertising on search engines such as Google. Purpose: The purpose is to describe how users’ attitudes towards brands are influenced by the fact that brands have paid for advertising on search engine result pages. This is done through the ABC-model of attitudes. The question asked in this study was: How does paid advertising displayed on search engines affect the attitudes held towards a brand? Methodology: This thesis project used a qualitative approach and was of descriptive nature. The data was gathered through seven unstructured in-depths interviews based on a quota sample considering three criteria: age group, in this case, 18-29-year-olds, and the variable of regular e-commerce buyers, as well as the participants being users of the search engine Google. The researchers verified data saturation at seven interviews. Conclusion: The main finding in this study is that the level of familiarity influences the participants attitudes towards the brand. Previous experience and knowledge with a brand was an affecting factor of how they interpreted the brand’s advertising on Google’s search engine result pages. Knowledge and a positive experience with a brand generated a more positive attitude towards the brand when an unknown brand generated a neutral or more negative attitude towards the brand. Related factors that also influenced the study were the clicking pattern, the landing page, the choices of wording and the intended target groups by the brands. The study also presents a range of recommendations for future research, as well as theoretical and managerial implications.
APA, Harvard, Vancouver, ISO, and other styles
9

Bahr, Hubert. "DATA BANDWIDTH REDUCTION TECHNIQUES FOR DISTRIBUTED EMBEDDED SIMULATIO." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2778.

Full text
Abstract:
Maintaining coherence between the independent views of multiple participants at distributed locations is essential in an Embedded Simulation environment. Currently, the Distributed Interactive Simulation (DIS) protocol maintains coherence by broadcasting the entity state streams from each simulation station. In this dissertation, a novel alternative to DIS that replaces the transmitting sources with local sources is developed, validated, and assessed by analytical and experimental means. The proposed Concurrent Model approach reduces the communication burden to transmission of only synchronization and model-update messages. Necessary and sufficient conditions for the correctness of Concurrent Models in a discrete event simulation environment are established by developing Behavioral Congruence ¨B(EL, ER) and Temporal Congruence ¨T(t, ER) functions. They indicate model discrepancies with respect to the simulation time t, and the local and remote entity state streams EL and ER, respectively. Performance benefits were quantified in terms of the bandwidth reduction ratio BR=N/I obtained from the comparison of the OneSAF Testbed Semi-Automated Forces (OTBSAF) simulator under DIS requiring a total of N bits and a testbed modified for the Concurrent Model approach which required I bits. In the experiments conducted, a range of 100 d BR d 294 was obtained representing two orders of magnitude reduction in simulation traffic. Investigation showed that the models rely heavily on the priority data structure of the discrete event simulation and that performance of the overall simulation can be enhanced by an additional 6% by improving the queue management. A low run-time overhead, self-adapting storage policy called the Smart Priority Queue (SPQ) was developed and evaluated within the Concurrent Model. The proposed SPQ policies employ a lowcomplexity linear queue for near head activities and a rapid-indexing variable binwidth calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost scoring factors and then applying heuristics to adjust the organization of the underlying data structures. Results indicate that optimizing storage to the spatial distribution of queue access can decrease HOLD operation cost between 25% and 250% over existing algorithms such as calendar queues. Taken together, these techniques provide an entity state generation mechanism capable of overcoming the challenges of Embedded Simulation in harsh mobile communications environments with restricted bandwidth, increased message latency, and extended message drop-outs.
Ph.D.
Department of Electrical and Computer Engineering
Engineering and Computer Science
Computer Engineering
APA, Harvard, Vancouver, ISO, and other styles
10

Nassir, Neema. "Optimal Integrated Dynamic Traffic Assignment and Signal Control for Evacuation of Large Traffic Networks with Varying Threat Levels." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/297042.

Full text
Abstract:
This research contributes to the state of the art and state of the practice in solving a very important and computationally challenging problem in the areas of urban transportation systems, operations research, disaster management, and public policy. Being a very active topic of research during the past few decades, the problem of developing an efficient and practical strategy for evacuation of real-sized urban traffic networks in case of disasters from different causes, quickly enough to be employed in immediate disaster management scenarios, has been identified as one of the most challenging and yet vital problems by many researchers. More specifically, this research develops fast methods to find the optimal integrated strategy for traffic routing and traffic signal control to evacuate real-sized urban networks in the most efficient manner. In this research a solution framework is proposed, developed and tested which is capable of solving these problems in very short computational time. An efficient relaxation-based decomposition method is proposed, implemented for two evacuation integrated routing and signal control model formulations, proven to be optimal for both formulations, and verified to reduce the computational complexity of the optimal integrated routing and signal control problem. The efficiency of the proposed decomposition method is gained by reducing the integrated optimal routing and signal control problem into a relaxed optimal routing problem. This has been achieved through an insight into intersection flows in the optimal routing solution: in at least one of the optimal solutions of the routing problem, each street during each time interval only carries vehicles in at most one direction. This property, being essential to the proposed decomposition method, is called "unidirectionality" in this dissertation. The conditions under which this property exists in the optimal evacuation routing solution are identified, and the existence of unidirectionality is proven for: (1) the common Single-Destination System-Optimal Dynamic Traffic Assignment (SD-SODTA) problem, with the objective to minimize the total time spent in the threat area; and, (2) for the single-destination evacuation problem with varying threat levels, with traffic models that have no spatial queue propagation. The proposed decomposition method has been implemented in compliance with two widely-accepted traffic flow models, the Cell Transmission Model (CTM) and the Point Queue (PQ) model. In each case, the decomposition method finds the optimal solution for the integrated routing and signal control problem. Both traffic models have been coded and applied to a realistic real-size evacuation scenario with promising results. One important feature that is explored is the incorporation of evacuation safety aspects in the optimization model. An index of the threat level is associated with each link that reflects the adverse effects of traveling in a given threat zone on the safety and health of evacuees during the process of evacuation. The optimization problem is then formulated to minimize the total exposure of evacuees to the threat. A hypothetical large-scale chlorine gas spill in a high populated urban area (downtown Tucson, Arizona) has been modeled for testing the evacuation models where the network has varying threat levels. In addition to the proposed decomposition method, an efficient network-flow solution algorithm is also proposed to find the optimal routing of traffic in networks with several threat zones, where the threat levels may be non-uniform across different zones. The proposed method can be categorized in the class of "negative cycle canceling" algorithms for solving minimum cost flow problems. The unique feature in the proposed algorithm is introducing a multi-source shortest path calculation which enables the efficient detection and cancellation of negative cycles. The proposed method is proven to find the optimal solution, and it is also applied to and verified for a mid-size test network scenario.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Queue mode"

1

Percus, O. E. Queue length distributions in a Markov model of a multistage clocked queueing network. New York: Courant Institute of Mathematical Sciences, New York University, 1989.

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

Semmens, Marie C. ARCADY2: An enhanced program to model capacities, queues and delays at roundabouts. Crowthorne, Berkshire: Traffic Systems Division, Traffic Engineering and Control Department, Transport and Road Research Laboratory, 1985.

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

Semmens, Marie C. ARCADY2: An enhanced program to model capacities, queues and delays at roundabouts. Crowthorne, Berks: Transport and Road Research Laboratory, Traffic Engineering and Control Dept., Traffic Systems Division, 1985.

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

Semmens, Marie C. ARCADY 2: An enhanced program to model capacities, queues and delays at roundabouts. Crowthorne: Transport and Road Research Laboratory, 1985.

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

Burrow, I. J. OSCADY: A computer program to model capacities, queues and delays at isolated traffic signal junctions. Crowthorne, Berks: Transport and Road Research Laboratory, Traffic Group Traffic Management Division, 1987.

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

Burrow, I. J. OSCADY: A computer program to model capacities, queues and delays at isloated traffic signal junctions. Crowthorne, Berkshire: Traffic Management Division, Traffic Group, Transport and Road Research Laboratory, 1987.

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

Semmens, Marie C. PICADY2: An enhanced program to model capacities, queues and delays at major/minor priority junctions. Crowthorne, Berks: Transport and Road Research Laboratory, Traffic Engineering and Control Dept., Traffic Systems Division, 1985.

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

Burrow, I. J. OSCADY: A computer program to model capacities, queues and delays at isolated traffic signal junctions. Crowthorne: Transport and Road Research Laboratory, 1987.

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

Semmens, Marie C. PICADY2: An enhanced program to model capacities, queues and delays at major/minor priority junctions. Crowthorne, Berkshire: Traffic Systems Division, Traffic Engineering and Control Department, Transport and Road Research Laboratory, 1985.

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

Semmens, Marie C. PICADY 2: An enhanced program to model capacities, queues and delays at major/minor priority junctions. Crowthorne: Transport and Road Research Laboratory, 1985.

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

Book chapters on the topic "Queue mode"

1

Jalili-Kharaajoo, M. "Sliding Mode Queue Management in TCP/AQM Networks." In Telecommunications and Networking - ICT 2004, 638–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27824-5_86.

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

Jalili-Kharaajoo, Mahdi. "Application of Robust Fuzzy Adaptive Second-Order Sliding-Mode Control to Active Queue Management." In Lecture Notes in Computer Science, 109–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24643-5_10.

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

Walrand, Jean. "Networks: A." In Probability in Electrical Engineering and Computer Science, 71–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_5.

Full text
Abstract:
AbstractSocial networks connect people and enable them to exchange information. News and rumors spread through these networks. We explore models of such propagations. The technology behind social networks is the internet where packets travel from queue to queue. We explain some key results about queueing networks.Section 5.1 explores a model of how rumors spread in a social network. Epidemiologists use similar models to study the spread of viruses. Section 5.2 explains the cascade of choices in a social network where one person’s choice is influenced by those of people she knows. Section 5.3 shows how seeding the market with advertising or free products affects adoptions. Section 5.4 studies a model of how media can influence the eventual consensus in a social network. Section 5.5 explores the randomness of the consensus in a group. Sections 5.6 and 5.7 present a different class of network models where customers queue for service. Section 5.6 studies a single queue and Sect. 5.7 analyzes a network of queues. Section 5.8 explains a classical optimization problem in a communication network: how to choose the capacities of different links. Section 5.9 discusses the suitability of queueing networks as models of the internet. Section 5.10 presents a classical result about a class of queueing networks known as product-form networks.
APA, Harvard, Vancouver, ISO, and other styles
4

Borghetti, Fabio, Paolo Cerean, Marco Derudi, and Alessio Frassoldati. "Queue Formation Model." In SpringerBriefs in Applied Sciences and Technology, 39–47. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00569-6_5.

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

Falin, G. I., and J. G. C. Templeton. "The main multiserver model." In Retrial Queues, 95–172. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4899-2977-8_2.

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

Falin, G. I., and J. G. C. Templeton. "The main single-server model." In Retrial Queues, 1–94. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4899-2977-8_1.

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

Gibbons, Phillip B., Yossi Matias, and Vijaya Ramachandran. "The queue-read queue-write asynchronous PRAM model." In Lecture Notes in Computer Science, 277–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0024714.

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

Schmidt, Bernd. "Queued Models." In Model Construction with GPSS-FORTRAN Version 3, 37–68. New York, NY: Springer New York, 1987. http://dx.doi.org/10.1007/978-1-4612-4748-7_2.

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

van Houtum, Geert-Jan. "The Symmetric Longest Queue Model." In Operations Research Proceedings 1993, 531. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-78910-6_178.

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

Evangelista, Sami, and Lars Michael Kristensen. "Combining the Sweep-Line Method with the Use of an External-Memory Priority Queue." In Model Checking Software, 43–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31759-0_6.

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

Conference papers on the topic "Queue mode"

1

Qi, Tianxiang, and Hao Wang. "PID sliding mode controller design and application to active queue management." In 2016 35th Chinese Control Conference (CCC). IEEE, 2016. http://dx.doi.org/10.1109/chicc.2016.7554447.

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

Xiao, Zhuoling, Chen He, and Lingge Jiang. "An Analytical Model for IEEE 802.15.4 with Sleep Mode Based on Time-Varying Queue." In ICC 2011 - 2011 IEEE International Conference on Communications. IEEE, 2011. http://dx.doi.org/10.1109/icc.2011.5962995.

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

Hongwei Wang, Georgi M. Dimirovski, Yuanwei Jing, and Zhaona Chen. "A robust active queue management scheme based on global sliding mode control." In 2008 47th IEEE Conference on Decision and Control. IEEE, 2008. http://dx.doi.org/10.1109/cdc.2008.4739005.

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

Roth, Katherine C., E. Rodrigo Carrasco, Bryan W. Miller, Andrew W. Stephens, Inger Jørgensen, and Bernadette Rodgers. "Managing target of opportunity (ToO) observations in queue mode at Gemini Observatory." In SPIE Astronomical Telescopes + Instrumentation, edited by David R. Silva, Alison B. Peck, and B. Thomas Soifer. SPIE, 2010. http://dx.doi.org/10.1117/12.857938.

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

Roth, Katherine, Paul Price, Kim Gillies, Bryan Miller, and Shane Walker. "Target of opportunity observing in queue mode at the Gemini North Observatory." In SPIE Astronomical Telescopes + Instrumentation, edited by Roger J. Brissenden and David R. Silva. SPIE, 2008. http://dx.doi.org/10.1117/12.790187.

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

Wang, Hao, Zuohua Tian, and Qinlong Zhang. "Sliding Mode Control with Fuzzy Reaching Law for Queue Management in the Internet." In 2010 19th International Conference on Computer Communications and Networks ( ICCCN 2010). IEEE, 2010. http://dx.doi.org/10.1109/icccn.2010.5560017.

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

"The Benefit of Information in a Single-server Queue with Heterogeneous Service Valuations [Abstract]." In InSITE 2019: Informing Science + IT Education Conferences: Jerusalem. Informing Science Institute, 2019. http://dx.doi.org/10.28945/4356.

Full text
Abstract:
Aim/Purpose: How does heterogeneous valuation of service affect optimal control of queues? Background We analyze this heterogeneity by adding a component of travel costs, which differ with distance from the service point. Methodology: Mathematical analysis of queuing theory. Analyzing the anarchy function. Contribution: Enabling consumers to make optimal choices based on knowledge about their status, and enabling better control of the organizer. Findings: In the arrival rate is bounded, there is no need of interference. If it is unbounded then in many cases the organizer should impose the socially optimal queue length. Recommendations for Practitioners: In the arrival rate is bounded, there is no need of interference. If it is unbounded then in many cases the organizer should impose the socially optimal queue length. Recommendations for Researchers: Explore the following points: What happens when there are more than one server, located at different point. How should consumers behave, and what is the best way to locate service points. Impact on Society: Handling queues taking into account social welfare. Future Research: What happens when there are more than one server, located at different point. How should consumers behave, and what is the best way to locate service points.
APA, Harvard, Vancouver, ISO, and other styles
8

Hayel, Yezekael, Eran Simhon, David Starobinski, and Quanyan Zhu. "Distributed strategic mode selection for large-scale D2D communications based on Queue State Information." In 2015 49th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2015. http://dx.doi.org/10.1109/ciss.2015.7086844.

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

Saffer, Zsolt, and Miklós Telek. "Waiting time analysis of BMAP vacation queue and its application to IEEE 802.16e sleep mode." In the 4th International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1626553.1626572.

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

Kalyanaraman, R., and R. Senthilkumar. "Analysis of heterogeneous two server Markovian queue with switching for service mode of first server." In RECENT TRENDS IN PURE AND APPLIED MATHEMATICS. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5135206.

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

Reports on the topic "Queue mode"

1

Ephremides, A., and Rong-Zhu Zhu. Delay Analysis of Interacting Queues with an Approximate Model. Fort Belvoir, VA: Defense Technical Information Center, January 1986. http://dx.doi.org/10.21236/ada452458.

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

Krueger, Alan. Are Public Sector Workers Paid More Than Their Alternative Wage? Evidence From Longitudinal Data and Job Queues. Cambridge, MA: National Bureau of Economic Research, January 1988. http://dx.doi.org/10.3386/w2500.

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

Kodupuganti, Swapneel R., Sonu Mathew, and Srinivas S. Pulugurtha. Modeling Operational Performance of Urban Roads with Heterogeneous Traffic Conditions. Mineta Transportation Institute, January 2021. http://dx.doi.org/10.31979/mti.2021.1802.

Full text
Abstract:
The rapid growth in population and related demand for travel during the past few decades has had a catalytic effect on traffic congestion, air quality, and safety in many urban areas. Transportation managers and planners have planned for new facilities to cater to the needs of users of alternative modes of transportation (e.g., public transportation, walking, and bicycling) over the next decade. However, there are no widely accepted methods, nor there is enough evidence to justify whether such plans are instrumental in improving mobility of the transportation system. Therefore, this project researches the operational performance of urban roads with heterogeneous traffic conditions to improve the mobility and reliability of people and goods. A 4-mile stretch of the Blue Line light rail transit (LRT) extension, which connects Old Concord Rd and the University of North Carolina at Charlotte’s main campus on N Tryon St in Charlotte, North Carolina, was considered for travel time reliability analysis. The influence of crosswalks, sidewalks, trails, greenways, on-street bicycle lanes, bus/LRT routes and stops/stations, and street network characteristics on travel time reliability were comprehensively considered from a multimodal perspective. Likewise, a 2.5-mile-long section of the Blue Line LRT extension, which connects University City Blvd and Mallard Creek Church Rd on N Tryon St in Charlotte, North Carolina, was considered for simulation-based operational analysis. Vissim traffic simulation software was used to compute and compare delay, queue length, and maximum queue length at nine intersections to evaluate the influence of vehicles, LRT, pedestrians, and bicyclists, individually and/or combined. The statistical significance of variations in travel time reliability were particularly less in the case of links on N Tryon St with the Blue Line LRT extension. However, a decrease in travel time reliability on some links was observed on the parallel route (I-85) and cross-streets. While a decrease in vehicle delay on northbound and southbound approaches of N Tryon St was observed in most cases after the LRT is in operation, the cross-streets of N Tryon St incurred a relatively higher increase in delay after the LRT is in operation. The current pedestrian and bicycling activity levels seemed insignificant to have an influence on vehicle delay at intersections. The methodological approaches from this research can be used to assess the performance of a transportation facility and identify remedial solutions from a multimodal perspective.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Queue mode' for particular source types:
Journal articles 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