A Single Server

1979 ◽  
pp. 43-89
Author(s):  
Gordon F. Newell
Keyword(s):  
Single Server

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

State-dependent signalling in queueing networks

1994 ◽  
Vol 26 (02) ◽  
pp. 436-455 ◽  
Author(s):  
W. Henderson ◽  
B. S. Northcote ◽  
P. G. Taylor
Keyword(s):  
Queueing Networks ◽  
State Dependence ◽  
Product Form ◽  
Batch Size ◽  
Single Server ◽  
Negative Customers ◽  
Affect Control ◽  
State Dependent ◽  
Special Cases ◽  
Equilibrium Distributions

It has recently been shown that networks of queues with state-dependent movement of negative customers, and with state-independent triggering of customer movement have product-form equilibrium distributions. Triggers and negative customers are entities which, when arriving to a queue, force a single customer to be routed through the network or leave the network respectively. They are ‘signals' which affect/control network behaviour. The provision of state-dependent intensities introduces queues other than single-server queues into the network. This paper considers networks with state-dependent intensities in which signals can be either a trigger or a batch of negative customers (the batch size being determined by an arbitrary probability distribution). It is shown that such networks still have a product-form equilibrium distribution. Natural methods for state space truncation and for the inclusion of multiple customer types in the network can be viewed as special cases of this state dependence. A further generalisation allows for the possibility of signals building up at nodes.

scholarly journals A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Ekaterina Evdokimova ◽  
Sabine Wittevrongel ◽  
Dieter Fiems
Keyword(s):  
Performance Measures ◽  
Queueing Systems ◽  
Poisson Processes ◽  
Series Expansions ◽  
Service Rate ◽  
Single Server ◽  
Queueing Model ◽  
State Space Explosion ◽  
Finite Queues ◽  
Service Rates

This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i) overloaded and (ii) under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.

scholarly journals Secure Single-Server Aggregation with (Poly)Logarithmic Overhead

2020 ◽  
Author(s):  
James Henry Bell ◽  
Kallista A. Bonawitz ◽  
Adrià Gascón ◽  
Tancrède Lepoint ◽  
Mariana Raykova
Keyword(s):  
Single Server
Sign in / Sign up

Export Citation Format

Share Document