Exhaustive Service Research Articles

IPREDS: Efficient Prediction System for Internet-wide Port and Service Scanning

Internet-wide port and service scanning, a vital tool for network research, is unaffordable in time and network bandwidth consumption. However, scanning only a portion of ports and services may lead to erroneous research conclusions. Previous work has shortened scanning time by predicting potentially active ports and eliminating many invalid scan targets. Still, they suffer from inherent design flaws that compromise their performance in terms of prediction accuracy and efficiency. The vast, unevenly distributed, and noisy nature of active ports presents significant challenges for prediction systems. Meanwhile, service prediction work is still in a shortage state. In this work, we introduce IPREDS, the first efficient prediction system for Internet-wide port and service scanning. IPREDS uses its carefully designed decision model to utilize all input features and predict the scanning reward of each target in parallel, providing high coverage prediction results in minimal time. Our experiment results show that IPREDS can discover 87% of active ports across the entire IPv4 network within two hours, saving at least 87.26% of the total time and 59% of the packets sent compared to existing work. For service scanning, IPREDS finds 91% of all active services using only four handshakes on each active port and saves 85.9% time to find 69% of each active service compared to exhaustive service scanning.

Analysis of a Single Server Queueing System Controlled by a Random Switch

In this paper, a single server queueing system operating in a doubly stochastic environment is analysed. The random environment makes transitions among N levels controlled by a random switch which performs the task of assigning a job to the server. The queueing system resides in level k of the environment till the completion of the service of the last customer in the system and immediately reports to the random switch to get a new service job. The random switch generates a set up time and waits till a customer arrives and assigns a job to the server in any one of the N levels with a positive probability governed by a binomial distribution. In each level r of the environment, the queueing system behaves like M(λr)/M(μr)/1 queue subject to the condition that the server reports to the random switch immediately after performing exhaustive service for getting a new assignment. For this model, time-dependent state probabilities are explicitly found and the corresponding steady-state probabilities are deduced. Some key performance measures are also obtained. A numerical study is also made.

Performance analysis of a two-level polling control system based on LSTM and attention mechanism for wireless sensor networks.

A continuous-time exhaustive-limited (K = 2) two-level polling control system is proposed to address the needs of increasing network scale, service volume and network performance prediction in the Internet of Things (IoT) and the Long Short-Term Memory (LSTM) network and an attention mechanism is used for its predictive analysis. First, the central site uses the exhaustive service policy and the common site uses the Limited K = 2 service policy to establish a continuous-time exhaustive-limited (K = 2) two-level polling control system. Second, the exact expressions for the average queue length, average delay and cycle period are derived using probability generating functions and Markov chains and the MATLAB simulation experiment. Finally, the LSTM neural network and an attention mechanism model is constructed for prediction. The experimental results show that the theoretical and simulated values basically match, verifying the rationality of the theoretical analysis. Not only does it differentiate priorities to ensure that the central site receives a quality service and to ensure fairness to the common site, but it also improves performance by 7.3 and 12.2%, respectively, compared with the one-level exhaustive service and the one-level limited K = 2 service; compared with the two-level gated- exhaustive service model, the central site length and delay of this model are smaller than the length and delay of the gated- exhaustive service, indicating a higher priority for this model. Compared with the exhaustive-limited K = 1 two-level model, it increases the number of information packets sent at once and has better latency performance, providing a stable and reliable guarantee for wireless network services with high latency requirements. Following on from this, a fast evaluation method is proposed: Neural network prediction, which can accurately predict system performance as the system size increases and simplify calculations.

Achieving optimal resource utilization in industrial environments: Combining polling methods and an exhaustive service discipline with an unreliable service

Achieving optimal resource utilization in industrial environments: Combining polling methods and an exhaustive service discipline with an unreliable service

Towards the analysis of the performance measures of heterogeneous networks by means of two-phase queuing systems

Due to a multistage nature of transmission processes in heterogeneous 4G, 5G mobile networks, multiphase queuing systems become one of the most suitable ways for the resource allocation algorithms analysis and network investigation. In this paper, a few scientific papers that approached heterogeneous networks modelling by means of multiphase queuing systems are reviewed, mentioning the difficulties that arise with this type of analytical analysis. Moreover, several previously investigated models are introduced briefly as an example of two-phase systems of finite capacity and a special structure in discrete time that can be used for analysing resource allocation schemes based on the main performance measures obtained for wireless heterogeneous networks. One of the model presents a two-phase tandem queue with a group arrival flow of requests and a second phase of the complex structure that consists of parallel finite queues. The second model is a two-phase tandem queue with Markov modulated geometric arrival and service processes at the first phase and exhaustive service process at the second phase, which solves a cross-layer adaption problem in a heterogeneous network.

The unobserved waiting customer approximation

We introduce a new approximation procedure to improve the accuracy of matrix analytic methods when using truncated queueing models to analyse infinite buffer systems. This is accomplished through emulating the presence of unobserved waiting customers beyond the finite buffer that are able to immediately enter the system following an observed customer’s departure. We show that this procedure results in exact steady-state probabilities at queue lengths below the buffer for truncated versions of the classic M/M/1, \(M/M/1+M\), \(M/M/\infty \), and M/PH/1 queues. We also present two variants of the basic procedure for use within a \(M/PH/1+M\) queue and a N-queue polling system with exhaustive service, phase-type service and switch-in times, and exponential impatience timers. The accuracy of these two variants in the context of the polling model are compared through several numerical examples.

A MAP/PH(1), PH(2)/2 Production Inventory System with Multiple Servers and Varying Service Rates

The paper comprises an (s,S) production inventory facility in which multiple vacations and varying service rates are considered for the multiple servers. The arrival of customers constitutes a Markovian Arrival Process (MAP) and service completion times follow the phase type distributions with representations ( α, S ) and ( β, T ) respectively. Manufacturing needs to begin at the moment when the stock position falls to s. Service is offered at a lower rate if the stock level ranges from 0 to s and the service time distribution has the representations (α, η 1 S) and (β, η 2 T ), 0 < η 1, η 2 < 1 respectively. If the stock level reaches the maximum S, production is ceased to operate. 1-limited service policy, Bernoulli service schedule, and Exhaustive service disciplines are considered for the servers. A suitable cost function is outlined as per performance assessment. The impact of negative correlated inter arrival times on cost function is illustrated. Also, a relative study of expected cost function on different service modes is presented.

Performance Analysis and Evaluation of Ternary Optical Computer Based on a Queueing System With Synchronous Multi-Vacations

The ternary optical computer (TOC) has attracted increasing attention from its providers and potential customers because of the advantages of its optical processor, such as low power consumption, numerous trits, parallelism, dynamical reconfigurability and bitwise allocability. The analysis of its performance has become an urgent problem to be solved in recent years. This paper builds a four-stage TOC service model by introducing synchronous multi-vacations and tandem queueing. Here, a vacation refers specifically to an optical processor vacation. Additionally, we propose a processor-divided-equally(PDE) strategy and a task scheduling and optical processor allocation algorithm under this strategy. Assuming that the intervals of task arrival follow a homogeneous Poisson process, we obtain some important performance indicators, such as the mean response time, mean number of tasks, and optical processor utilization under the PDE strategy, which are based on the M/M/1 and M/M/n queueing systems with exhaustive service and synchronous multi-vacations. The numerical results illustrate that the number of small optical processors has an important effect on the performance of TOC and that high vacation rate can improve the system performance to some extent.

A polling access control with exhaustive service in wireless body area networks for mobile healthcare using the sleeping schema

Wireless body area networks (WBANs) play an important role in human health monitoring for mobile healthcare. The improvement of service performance and low-power consumption are the two challenges for these medical WBANs, because those energy-limited wireless medical sensors must transmit the monitoring data to the personal server (PS) via intra-WBAN in time. Further, precise mathematical modeling combining with the sleeping state to measure this improvement theoretically is still lack. Therefore, a polling control with exhaustive service using the sleeping schema is proposed to address the problems in WBANs communication for smart health. Based on the managed access phase (MAP) specified in the IEEE 802.15.6 standard, it has been attempting to improve the energy efficiency through a self-managing sleeping schema for both the sensor nodes and the PS according to the load in intra-WBANs, in which the node will soon turn to sleep upon completion of transmitting all its current data packets. Additionally, by employing the embedded Markov chain and probability generating function, the proposed model is established, and the performance characteristics—the mean cyclic period and queue length at the polling moment—were accurately obtained to justify the service performance can be guaranteed. In addition, the expressions of the quantitative relationship among sleeping time, performance characteristics and network parameters were derived in closed form, which can easily evaluate the energy efficiency. Simulations were carried out to justify this model.

Transient analysis of N-policy queue with system disaster repair preventive maintenance re-service balking closedown and setup times

This paper investigates the transient behavior of a \begin{document}$ M/M/1 $\end{document} queueing model with N-policy, system disaster, repair, preventive maintenance, balking, re-service, closedown and setup times. The server stays dormant (off state) until N customers accumulate in the queue and then starts an exhaustive service (on state). After the service, each customer may either leave the system or get immediate re-service. When the system becomes empty, the server resumes closedown work and then undergoes preventive maintenance. After that, it comes to the idle state and waits N accumulate for service. When the \begin{document}$ N^{th} $\end{document} one enters the queue, the server commences the setup work and then starts the service. Meanwhile, the system suffers disastrous breakdown during busy period. It forced the system to the failure state and all the customers get eliminated. After that, the server gets repaired and moves to the idle state. The customers may either join the queue or balk when the size of the system is less than N. The probabilities of the proposed model are derived by the method of generating function for the transient case. Some system performance indices and numerical simulations are also presented.

Analysis of M/G/1 retrial queues with second optional service and customer balking under two types of Bernoulli vacation schedule

An M/G/1 retrial queueing system with two phases of service of which the second phase is optional and the server operating under Bernoulli vacation schedule is investigated. Further, the customer is allowed to balk upon arrival if he finds the server unavailable to serve his request immediately. The joint generating functions of orbit size and server status are derived using supplementary variable technique. Some important performance measures like the orbit size, the system size, the server utilisation and the probability that the system is empty are found. Stochastic decomposition law is established when there is no balking permitted. Some existing results are derived as special cases of our model under study. Interestingly, these performance measures are compared for various vacation schedules namely exhaustive service, 1-limited service, Bernoulli vacation and modified Bernoulli vacation schedules. Extensive numerical analysis is carried out to exhibit the effect of the system parameters on the performance measures.

The Mn/Gn/1 queue with vacations and exhaustive service

We consider the Mn/Gn/1 queue with vacations and exhaustive service in which the server takes (repeated) vacations whenever it becomes idle, the service time distribution is queue length dependent, and the arrival rate varies both with the queue length and with the status of the server, being busy or on vacation. Using a rate balance principle, we derive recursive formulas for the conditional distribution of residual service or vacation time given the number of the customers in the system and the status of the server. We also derive a closed-form expression for the steady-state distribution as a function of the probability of an empty system. As an application of the above, we provide a recursive computation method for Nash equilibrium joining strategies to the observable M/G/1 queue with vacations.

Equilibrium Strategies of a Polling Network with Non-zero Switch-over Times

In this paper, we consider a cyclic two-queue polling system with non-zero switchover times under exhaustive service discipline. Arriving customers decide whether to join queue 1 ( Q1 ) or queue 2 ( Q2 ) under two different information levels: fully unobservable case and fully observable case. With the help of the waiting costs, we study the equilibrium strategies for arriving customers in both cases. Furthermore, we analyze the expected waiting cost of an arriving customer in fully unobservable case by numerical examples.

Optimal routeing in two-queue polling systems

AbstractWe consider a polling system with two queues, exhaustive service, no switchover times, and exponential service times with rate µ in each queue. The waiting cost depends on the position of the queue relative to the server: it costs a customercper time unit to wait in the busy queue (where the server is) anddper time unit in the idle queue (where there is no server). Customers arrive according to a Poisson process with rate λ. We study the control problem of how arrivals should be routed to the two queues in order to minimize the expected waiting costs and characterize individually and socially optimal routeing policies under three scenarios of available information at decision epochs: no, partial, and complete information. In the complete information case, we develop a new iterative algorithm to determine individually optimal policies (which are symmetric Nash equilibria), and show that such policies can be described by a switching curve. We use Markov decision processes to compute the socially optimal policies. We observe numerically that the socially optimal policy is well approximated by a linear switching curve. We prove that the control policy described by this linear switching curve is indeed optimal for the fluid version of the two-queue polling system.

基于完全服务轮询机制MAC协议的FPGA设计

基于完全服务轮询机制MAC协议的FPGA设计

Sojourn time distribution in polling systems with processor-sharing policy

We consider a polling system with a single server and multiple queues where customers arrive at the queues according to independent Poisson processes. The server visits and serves the queues in a cyclic order. The service discipline at all queues is exhaustive service. One queue uses processor-sharing as a scheduling policy, and the customers in that queue have phase-type distributed service requirements. The other queues use any work-conserving policy, and the customers in those queues have generally distributed service requirements. We derive a partial differential equation for the transform of the conditional sojourn time distribution of an arbitrary customer who arrives at the queue with processor-sharing policy, conditioned on the service requirement. We also derive a partial differential equation for the transform of the unconditional sojourn time distribution. From these equations, we obtain the first and second moments of the conditional and unconditional sojourn time distributions.

The Application of the Two Levels of Priority Exhaustive Service Polling Control Theory in Intelligent Traffic System

This paper presents a new use of two levels of priority exhaustive service polling control system in the intelligent traffic light control system. High priority will be set in main road and low priority be set in minor road. Compared to main road and minor road, because of the priority service policies the mean waiting time of the vehicles in the main road are shorter than the minor road’s, and the road capacity is improved. With the intelligent control, we can well solve the problem of traffic jams during different periods.

The analysis of batch sojourn-times in polling systems

We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the system. For the exhaustive service discipline, we study the batch sojourn-time, which is defined as the time from an arrival epoch until service completion of the last customer in the batch. We obtain exact expressions for the Laplace–Stieltjes transform of the steady-state batch sojourn-time distribution, which can be used to determine the moments of the batch sojourn-time and, in particular, its mean. However, we also provide an alternative, more efficient way to determine the mean batch sojourn-time, using mean value analysis. We briefly show how our framework can be applied to other service disciplines: locally gated and globally gated. Finally, we compare the batch sojourn-times for different service disciplines in several numerical examples. Our results show that the best performing service discipline, in terms of minimizing the batch sojourn-time, depends on system characteristics.

Stationary analysis of a BMAP/R/1 queue with R-type multiple working vacations

ABSTRACTWe consider an infinite-buffer single server queue with batch Markovian arrival process (BMAP) and exhaustive service discipline under multiple working vacation policy. The service time during a working vacation is generally distributed random variable which is independent of the service times during a normal busy period as well as the arrival process. Duration of service times during a normal busy period and duration of working vacation times follow the class of distributions whose Laplace-Stieltjes transforms are rational functions (R-type distributions). The service time during a normal busy period, working vacation time, and the service time during a working vacation are independent of each other as well as of the arrival process. If a working vacation terminates while service is going on for a customer at head of the queue in vacation mode then, the server switches to normal mode and the customer at head of the queue is entitled to receive a full service time in the normal busy period irrespective of the amount of service received by the customer at head of the queue during the previous working vacation period. We obtain system-length distributions at various epoch, such as post-departure, pre-arrival, arbitrary, and pre-service. The proposed analysis is based on the use of matrix-analytic procedure to obtain system-length distribution at post-departure epoch. Later, we use supplementary variable technique and simple algebraic manipulations to obtain system-length distribution at arbitrary epoch using the system-length distribution at post-departure epoch. Some important performance measures, such as mean system lengths and mean waiting time have been obtained. Finally, some numerical results have been presented in the form of tables and graphs to show the applicability of the results obtained in this article. The model has potential application in areas of computer and communication networks, such as ethernet passive optical network (EPON).

Queue length analysis of a Markov-modulated vacation queue with dependent arrival and service processes and exhaustive service policy

The paper introduces a class of vacation queues where the arrival and service processes are modulated by the same Markov process, hence they can be dependent. The main result of the paper is the probability generating function for the number of jobs in the system. The analysis follows a matrix-analytic approach. A step of the analysis requires the evaluation of the busy period of a quasi birth death process with arbitrary initial level. This element can be useful in the analysis of other queueing models as well. We also discuss several special cases of the general model. We show that these special settings lead to simplification of the solution.