Modeling Voting Service Times with Machine Logs

2018 ◽  
Author(s):  
Jacob Jaffe ◽  
Charles Stewart III ◽  
Jacob Coblentz
Keyword(s):  
Service Times

scholarly journals Flexible computation offloading in a fuzzy-based mobile edge orchestrator for IoT applications

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
VanDung Nguyen ◽  
Tran Trong Khanh ◽  
Tri D. T. Nguyen ◽  
Choong Seon Hong ◽  
Eui-Nam Huh
Keyword(s):  
Cloud Computing ◽  
Augmented Reality ◽  
Mobile Devices ◽  
Computing System ◽  
Mobile User ◽  
Computation Offloading ◽  
Context Aware ◽  
Computing Systems ◽  
Iot Applications ◽  
Service Times

AbstractIn the Internet of Things (IoT) era, the capacity-limited Internet and uncontrollable service delays for various new applications, such as video streaming analysis and augmented reality, are challenges. Cloud computing systems, also known as a solution that offloads energy-consuming computation of IoT applications to a cloud server, cannot meet the delay-sensitive and context-aware service requirements. To address this issue, an edge computing system provides timely and context-aware services by bringing the computations and storage closer to the user. The dynamic flow of requests that can be efficiently processed is a significant challenge for edge and cloud computing systems. To improve the performance of IoT systems, the mobile edge orchestrator (MEO), which is an application placement controller, was designed by integrating end mobile devices with edge and cloud computing systems. In this paper, we propose a flexible computation offloading method in a fuzzy-based MEO for IoT applications in order to improve the efficiency in computational resource management. Considering the network, computation resources, and task requirements, a fuzzy-based MEO allows edge workload orchestration actions to decide whether to offload a mobile user to local edge, neighboring edge, or cloud servers. Additionally, increasing packet sizes will affect the failed-task ratio when the number of mobile devices increases. To reduce failed tasks because of transmission collisions and to improve service times for time-critical tasks, we define a new input crisp value, and a new output decision for a fuzzy-based MEO. Using the EdgeCloudSim simulator, we evaluate our proposal with four benchmark algorithms in augmented reality, healthcare, compute-intensive, and infotainment applications. Simulation results show that our proposal provides better results in terms of WLAN delay, service times, the number of failed tasks, and VM utilization.

On a tandem queueing model with identical service times at both counters, I

1979 ◽  
Vol 11 (3) ◽  
pp. 616-643 ◽  
Author(s):  
O. J. Boxma
Keyword(s):  
Waiting Times ◽  
Sufficient Conditions ◽  
Complete Analysis ◽  
Single Server ◽  
Stationary Distributions ◽  
In Series ◽  
Queues In Series ◽  
Service Times ◽  
Necessary And Sufficient ◽  
Insight Into

This paper considers a queueing system consisting of two single-server queues in series, in which the service times of an arbitrary customer at both queues are identical. Customers arrive at the first queue according to a Poisson process.Of this model, which is of importance in modern network design, a rather complete analysis will be given. The results include necessary and sufficient conditions for stationarity of the tandem system, expressions for the joint stationary distributions of the actual waiting times at both queues and of the virtual waiting times at both queues, and explicit expressions (i.e., not in transform form) for the stationary distributions of the sojourn times and of the actual and virtual waiting times at the second queue.In Part II (pp. 644–659) these results will be used to obtain asymptotic and numerical results, which will provide more insight into the general phenomenon of tandem queueing with correlated service times at the consecutive queues.

The dependence of sojourn times on service times in tandem queues

1984 ◽  
Vol 21 (3) ◽  
pp. 661-667 ◽  
Author(s):  
Xi-Ren Cao
Keyword(s):  
Sojourn Time ◽  
Past History ◽  
Interarrival Time ◽  
Conditional Probabilities ◽  
Tandem Queues ◽  
Sojourn Times ◽  
Distributed Service ◽  
Service Times

In this paper we study a series of servers with exponentially distributed service times. We find that the sojourn time of a customer at any server depends on the customer's past history only through the customer's interarrival time to that server. A method of calculating the conditional probabilities of sojourn times is developed.

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

A semi-Markov queue with exponential service times

1986 ◽  
pp. 369-382
Author(s):  
J. H. A. de Smit ◽  
G. J. K. Regterschot
Keyword(s):  
Service Times

The M/G/1 queue with negative customers

1996 ◽  
Vol 28 (02) ◽  
pp. 540-566 ◽  
Author(s):  
Peter G. Harrison ◽  
Edwige Pitel
Keyword(s):  
Iterative Solution ◽  
Single Server ◽  
Negative Customers ◽  
Poisson Arrival ◽  
First Case ◽  
Full Study ◽  
Service Times ◽  
The Stability ◽  
The One ◽  
Iterative Solution Method

We derive expressions for the generating function of the equilibrium queue length probability distribution in a single server queue with general service times and independent Poisson arrival streams of both ordinary, positive customers and negative customers which eliminate a positive customer if present. For the case of first come first served queueing discipline for the positive customers, we compare the killing strategies in which either the last customer in the queue or the one in service is removed by a negative customer. We then consider preemptive-restart with resampling last come first served queueing discipline for the positive customers, combined with the elimination of the customer in service by a negative customer—the case of elimination of the last customer yields an analysis similar to first come first served discipline for positive customers. The results show different generating functions in contrast to the case where service times are exponentially distributed. This is also reflected in the stability conditions. Incidently, this leads to a full study of the preemptive-restart with resampling last come first served case without negative customers. Finally, approaches to solving the Fredholm integral equation of the first kind which arises, for instance, in the first case are considered as well as an alternative iterative solution method.

Sign in / Sign up

Export Citation Format

Share Document