24 research outputs found
A survey of the machine interference problem
This paper surveys the research published on the machine interference problem since the 1985 review by Stecke & Aronson. After introducing the basic model, we discuss the literature along several dimensions. We then note how research has evolved since the 1985 review, including a trend towards the modelling of stochastic (rather than deterministic) systems and the corresponding use of more advanced queuing methods for analysis. We conclude with some suggestions for areas holding particular promise for future studies.Natural Sciences and Engineering Research Council (NSERC) Discovery Grant 238294-200
EUROPEAN CONFERENCE ON QUEUEING THEORY 2016
International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"
Queueing Variables and Leave-Without-Treatment Rates in the Emergency Room
Hospitals stand to lose millions of dollars in revenue due to patients who leave without treatment (LWT). Grounded in queueing theory, the purpose of this correlational study was to examine the relationship between daily arrivals, daily staffing, triage time, emergency severity index (ESI), rooming time, door-to-provider time (DTPT), and LWT rates. The target population comprised patients who visited a Connecticut emergency room between October 1, 2017, and May 31, 2018. Archival records (N = 154) were analyzed using multiple linear regression analysis. The results of the multiple linear regression were statistically significant, with F(9,144) = 2902.49, p \u3c .001, and R2 = 0.99, indicating 99% of the variation in LWT was accounted for by the predictor variables. ESI levels were the only variables making a significant contribution to the regression model. The implications for positive social change include the potential for patients to experience increased satisfaction due to the high quality of care and overall improvement in public health outcomes. Hospital leaders might use the information from this study to mitigate LWT rates and modify or manage staffing levels, time that patients must wait for triage, room placement, and DTPT to decrease the rate of LWT in the emergency room
Multi-user resource-sharing problem for the Internet
In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore.
In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving nodes. Finally, we study the reputation scheme for the overlays and peer-to-peer networks, where resource is not placed on a common station, but spread across the network. The theoretical analysis suggests what behavior will be selected by the end station under such a reputation mechanism.Tässä väitöskirjassa tutkimme useita Internetin resurssienjako-ongelmia,
jotka liittyvät yhteisten resurssien käyttöön ja jakamiseen monen
käyttäjän järjestelmissä. Tutkimme rinnakkain käytettäviä resursseja,
jotka voidaan antaa käyttäjille omaan tai jaettuun käyttöön. Ratkaisuna
ehdotamme joko uutta algoritmia tai muutoksia olemassaoleviin
tunnettuihin mainejärjestelmiin. Kaikkia algoritmeja tutkitaan
useammasta näkökulmasta: protokollien optimaalisuus, käyttäjien
itsekkyys, protokollan reiluus käytäjiä kohtaan. Tämä monikantainen
analyysi mahdollistaa sopivimman protokollan valinnan, ottaen huomioon
erilaiset optimointikriteerit. Toisaalta, tulevaisuuden verkkoratkaisut
määrittelevät uusia optimointisääntöjä, sekä verkkojen uusia
ominaisuuksia, jotka molemmat pitää ottaa tulevaisuudessa huomioon
Creation and Simulation of a Model for a Discrete Time Buffer System with Interrupted Poisson Arrivals and Uncorrelated Server Interruptions
A mathematical model for a discrete-time buffer system with both arrival and server interruptions is developed. In this model fixed-size packets arrive at the buffer according to a Poisson distribution and are stored there until they can be transmitted over the output channel. Service times are constant and the buffer is assumed to be of infinite size. Both arrival stream as well as the service of the packets are subjected to random interruptions described by Bernoulli processes, where the interruption process of the Poisson input stream is uncorrelated to the interruptions of the output line. Expressions are derived for the mean waiting time, the mean queue length, the average lengths of idle and busy periods of the server, and for the server utilization. The behavior of the system is demonstrated with a computer simulation; the simulation results are used to indicate optimal buffer sizes
Recommended from our members
Performance modeling of congestion control and resource allocation under heterogeneous network traffic. Modeling and analysis of active queue management mechanism in the presence of poisson and bursty traffic arrival processes.
Along with playing an ever-increasing role in the integration of other communication networks and expanding in application diversities, the current Internet suffers from serious overuse and congestion bottlenecks. Efficient congestion control is fundamental to ensure the Internet reliability, satisfy the specified Quality-of-Service (QoS) constraints and achieve desirable performance in response to varying application scenarios. Active Queue Management (AQM) is a promising scheme to support end-to-end Transmission Control Protocol (TCP) congestion control because it enables the sender to react appropriately to the real network situation. Analytical performance models are powerful tools which can be adopted to investigate optimal setting of AQM parameters. Among the existing research efforts in this field, however, there is a current lack of analytical models that can be viewed as a cost-effective performance evaluation tool for AQM in the presence of heterogeneous traffic, generated by various network applications.
This thesis aims to provide a generic and extensible analytical framework for analyzing AQM congestion control for various traffic types, such as non-bursty Poisson and bursty Markov-Modulated Poisson Process (MMPP) traffic. Specifically, the Markov analytical models are developed for AQM congestion control scheme coupled with queue thresholds and then are adopted to derive expressions for important QoS metrics. The main contributions of this thesis are listed as follows:
iii
¿ Study the queueing systems for modeling AQM scheme subject to single-class and multiple-classes Poisson traffic, respectively. Analyze the effects of the varying threshold, mean traffic arrival rate, service rate and buffer capacity on the key performance metrics.
¿ Propose an analytical model for AQM scheme with single class bursty traffic and investigate how burstiness and correlations affect the performance metrics. The analytical results reveal that high burstiness and correlation can result in significant degradation of AQM performance, such as increased queueing delay and packet loss probability, and reduced throughput and utlization.
¿ Develop an analytical model for a single server queueing system with AQM in the presence of heterogeneous traffic and evaluate the aggregate and marginal performance subject to different threshold values, burstiness degree and correlation.
¿ Conduct stochastic analysis of a single-server system with single-queue and multiple-queues, respectively, for AQM scheme in the presence of multiple priority traffic classes scheduled by the Priority Resume (PR) policy.
¿ Carry out the performance comparison of AQM with PR and First-In First-Out (FIFO) scheme and compare the performance of AQM with single PR priority queue and multiple priority queues, respectively