SINGLE-SERVER PROBLEM

2006 ◽  
pp. 712-712
Keyword(s):  
Single Server ◽  
Server Problem

scholarly journals Note on a Moving Single Server Problem

1959 ◽  
Vol 30 (1) ◽  
pp. 243-246 ◽  
Author(s):  
S. Karlin ◽  
R. G. Miller ◽  
N. U. Prabhu
Keyword(s):  
Single Server ◽  
Server Problem

scholarly journals A Moving Single Server Problem

1957 ◽  
Vol 28 (2) ◽  
pp. 471-478 ◽  
Author(s):  
B. McMillan ◽  
J. Riordan
Keyword(s):  
Single Server ◽  
Server Problem

scholarly journals Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues

1994 ◽  
Vol 26 (01) ◽  
pp. 258-279 ◽  
Author(s):  
Dimitrios G. Pandelis ◽  
Demosthenis Teneketzis
Keyword(s):  
Sufficient Conditions ◽  
Stochastic Scheduling ◽  
Random Variable ◽  
General Distribution ◽  
Single Server ◽  
Preemptive Scheduling ◽  
Discounted Cost ◽  
Holding Costs ◽  
Holding Cost ◽  
Server Problem

A number of jobs on two interconnected queues are to be processed by m identical servers. The servers operate in parallel, so that every server can process any job. Jobs in queue i, i = 1, 2, incur an instantaneous holding cost Ci during the time they remain in the system. The service time for jobs in queue i, denoted by Xi , is a random variable with a general distribution. The interconnection process is independent of the service process. We establish sufficient conditions on the service times, the holding costs and the interconnection process under which the non-preemptive scheduling strategy that gives priority to queue 1 minimizes the total expected α -discounted cost. We call this strategy P1. We present counterexamples showing that if any of the sufficient conditions is not satisfied P1 may not be optimal, and that the optimal policy for the single-server problem is not necessarily optimal for the multiserver problem.

scholarly journals Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues

1994 ◽  
Vol 26 (1) ◽  
pp. 258-279 ◽  
Author(s):  
Dimitrios G. Pandelis ◽  
Demosthenis Teneketzis
Keyword(s):  
Sufficient Conditions ◽  
Stochastic Scheduling ◽  
Random Variable ◽  
General Distribution ◽  
Single Server ◽  
Preemptive Scheduling ◽  
Discounted Cost ◽  
Holding Costs ◽  
Holding Cost ◽  
Server Problem

A number of jobs on two interconnected queues are to be processed by m identical servers. The servers operate in parallel, so that every server can process any job. Jobs in queue i, i = 1, 2, incur an instantaneous holding cost Ci during the time they remain in the system. The service time for jobs in queue i, denoted by Xi, is a random variable with a general distribution. The interconnection process is independent of the service process. We establish sufficient conditions on the service times, the holding costs and the interconnection process under which the non-preemptive scheduling strategy that gives priority to queue 1 minimizes the total expected α -discounted cost. We call this strategy P1. We present counterexamples showing that if any of the sufficient conditions is not satisfied P1 may not be optimal, and that the optimal policy for the single-server problem is not necessarily optimal for the multiserver problem.

HULK and DDoS Attacks in Web Applications with Detection Mechanism

2018 ◽  
Vol 6 (6) ◽  
pp. 192
Author(s):  
Amit Sharma
Keyword(s):  
Web Applications ◽  
Denial Of Service ◽  
Single Server ◽  
Distributed Denial Of Service ◽  
Ddos Attacks ◽  
Application Layer ◽  
Detection Mechanism ◽  
Plan Execution ◽  
Social Affair ◽  
Server Application

Distributed Denial of Service attacks are significant dangers these days over web applications and web administrations. These assaults pushing ahead towards application layer to procure furthermore, squander most extreme CPU cycles. By asking for assets from web benefits in gigantic sum utilizing quick fire of solicitations, assailant robotized programs use all the capacity of handling of single server application or circulated environment application. The periods of the plan execution is client conduct checking and identification. In to beginning with stage by social affair the data of client conduct and computing individual user’s trust score will happen and Entropy of a similar client will be ascertained. HTTP Unbearable Load King (HULK) attacks are also evaluated. In light of first stage, in recognition stage, variety in entropy will be watched and malevolent clients will be recognized. Rate limiter is additionally acquainted with stop or downsize serving the noxious clients. This paper introduces the FAÇADE layer for discovery also, hindering the unapproved client from assaulting the framework.

Optimal Policy in Single-Server Multi-Class Queuing Systems with Abandonment

2019 ◽  
Author(s):  
Sina Ansari ◽  
Laurens Debo ◽  
Seyed Iravani
Keyword(s):  
Optimal Policy ◽  
Single Server ◽  
Queuing Systems
Sign in / Sign up

Export Citation Format

Share Document