PERFORMANCE EVALUATION OF NON-STATIONARY TWO NODE TANDEM QUEUING MODEL WITH DIRECT ARRIVALS HAVING LOAD DEPENDENT SERVICE AND INTERMEDIATORY DEPARTURES

2019 ◽  
Vol 117 (2) ◽  
pp. 175-215
Author(s):  
K. Srinivasa Rao ◽  
Ch. Sreelatha ◽  
B. Muniswamy
Keyword(s):  
Performance Evaluation ◽  
Queuing Model ◽  
Tandem Queuing

scholarly journals Multi Node Tandem Queuing Model with Bulk Arrivals Having Geometric Arrival Distribution

2019 ◽  
Vol 8 (3) ◽  
pp. 1113-1137
Keyword(s):  
Geometric Distribution ◽  
Queuing Model ◽  
Service Station ◽  
Parallel Queues ◽  
Service Distribution ◽  
Distribution Parameters ◽  
In Series ◽  
Service Rates ◽  
Tandem Queuing ◽  
Number Of Customers

In this paper a K-node forked queuing model with load dependent service rates is analysed. Here it is assumed that the customers arrive to the first queue in batches and wait for service. After getting service at first service station with some probability they may join any one of the (K-1) parallel queues which are connected to first queue in series and exit from the system after getting service. It is assumed that the arrival and service completions follow Poisson processes and service rates depend on number of customers in the queue connected to it. The influence of Geometrically distributed bulk arrivals on this queuing model is studied. Sensitivity analysis of the system behaviour with regards to the arrival rates and load dependent service distribution parameters is carried out. The influence of these parameters on system performance measures such as average number of customers, waiting time of customer, variation of number of customers in each queue, throughput of each service station, utilization of each server are derived explicitly when arrivals follow a Geometric distribution. Simulations are carried out to illustrate the result.

scholarly journals Based on Regular Expression Matching of Evaluation of the Task Performance in WSN: A Queue Theory Approach

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Jie Wang ◽  
Kai Cui ◽  
Kuanjiu Zhou ◽  
Yanshuo Yu
Keyword(s):  
Performance Evaluation ◽  
Sensor Networks ◽  
Task Scheduling ◽  
Regular Expression ◽  
Wireless Sensor ◽  
Theory Approach ◽  
Queuing Model ◽  
Related Sequence ◽  
Validation Phase ◽  
Evaluation Phase

Due to the limited resources of wireless sensor network, low efficiency of real-time communication scheduling, poor safety defects, and so forth, a queuing performance evaluation approach based on regular expression match is proposed, which is a method that consists of matching preprocessing phase, validation phase, and queuing model of performance evaluation phase. Firstly, the subset of related sequence is generated in preprocessing phase, guiding the validation phase distributed matching. Secondly, in the validation phase, the subset of features clustering, the compressed matching table is more convenient for distributed parallel matching. Finally, based on the queuing model, the sensor networks of task scheduling dynamic performance are evaluated. Experiments show that our approach ensures accurate matching and computational efficiency of more than 70%; it not only effectively detects data packets and access control, but also uses queuing method to determine the parameters of task scheduling in wireless sensor networks. The method for medium scale or large scale distributed wireless node has a good applicability.

Sign in / Sign up

Export Citation Format

Share Document