We analyze a single server polling model with two finite buffer queues (high and low priority queues), in which high-priority queue is served with queue length dependent service intervals, while low-priority queue is served with constant service intervals. The server follows limited service discipline to serve packets from both the queues. We derive buffer occupancy distribution of high priority queue at departure instants by using embedded Markov chain approach. Simulation results confirm the validity of analytical results. This polling model can be used to model and analyze any node in a packet-switched network, which handles both real-time and non real-time traffic. © 2014 IEEE.

R. Manivasakan

Department of Electrical Engineering

Communication systems

Queueing networks

Analytical results

EMBEDDED MARKOV CHAIN

Finite buffer queues

Polling model

Real time traffics

SERVICE DISCIPLINES

SERVICE INTERVALS

STATE DEPENDENT SERVICE

Queueing theory

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

A two-queue finite-buffer polling model with limited service and state-dependent service times

IEEE CONECCT 2014 - 2014 IEEE International Conference on Electronics, Computing and Communication Technologies

We derive the distribution of inter-departure times of a finite-buffer single-server queue with Poisson arrival process and queue-length-dependent service times, where the server goes to vacation if either the queue is emptied or a limited number (R1) of packets are served, whichever occurs first, in the current busy period. We consider two types of vacation distributions: 1) deterministic and 2) exponential. Queue-length distribution at embedded points is derived first, then, the distribution and variance of inter-departure times are derived, for both types of vacations. The simulation results are in good agreement with the derived analytical results. The above framework would be useful at the receiver in modeling and analyzing the jitter and the waiting time of time-division multiplexing (TDM) emulated packets in TDM over packet-switched network (TDM over PSN) technology as a function of a buffer size. © 2013 IEEE.

Fulltext

IEEE Access

On the Inter-Departure Times in M/D/1/Bon Queue With Queue-Length Dependent Service and Deterministic/Exponential Vacations

TDMoIP is the emulation of Time Division Multiplexing (TDM) over Packet Switched Network (PSN), say IP. When TDM traffic is packetized and injected into a PSN for transportation, packets arrive at the destination with different inter-arrival times, due to variable delay (jitter) introduced by PSN. This network induced jitter should be minimized, because TDM traffic is highly synchronous. Problem of jitter from theoretical (competitive and statistical analysis) to more practical view point had been well studied [1], [6]-[9]. In this paper, we have proposed two on-line algorithms, algorithm-A and algorithm-B to control the rate-jitter. We have shown both analytically and by simulation that the rate-jitter achieved by algorithm-A is strictly less than the rate-jitter of on-line algorithm proposed in [1] and through simulations, it is shown that algorithm-B also achieves less rate-jitter compared with [1]. We also undertake the statistical analysis of above algorithms, in particular, we modeled jitter buffer as an M/D/1/Bon queue and steady state queue length distribution is calculated. The correctness of the analytical results corresponding to our proposed algorithms is verified with simulation results. From the simulation results, it is also shown that the mean waiting time of a packet in the buffer is less for both the proposed algorithms compared with [1]. © 2013 IEEE.

2013 National Conference on Communications, NCC 2013

Novel rate-jitter control algorithms for TDMoIP

Surveys in Operations Research and Management Science

Applications of polling systems

Probability in the Engineering and Informational Sciences

A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE

Queueing Systems

Iterative approximation of k-limited polling systems

Journal of Applied Mathematics and Stochastic Analysis

Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline

Journal	Data powered by TypesetIEEE CONECCT 2014 - 2014 IEEE International Conference on Electronics, Computing and Communication Technologies
Publisher	Data powered by TypesetIEEE Computer Society
Open Access	No