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.

R. Manivasakan

Department of Electrical Engineering

Algorithms

Statistical methods

Time division multiplexing

Competitive analysis

JITTER-BUFFER

RATE-JITTER

STATE DEPENDENT SERVICE

TDMOIP

Jitter

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

Novel rate-jitter control algorithms for TDMoIP

2013 National Conference on Communications, NCC 2013

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

Time-division multiplexing over packet-switched network (TDMoPSN) is an intermediate phase of transition from current synchronous TDM to future all-optical converged network. TDMoPSN is exclusively used to transport interactive voice traffic transparently over a PSN (e.g., IP, MPLS or Ethernet). The goal of this paper is to reduce rate-jitter that is introduced into a stream of packets carrying TDM payload. We have proposed two online algorithms, algorithm-A and algorithm-B, to reduce the rate-jitter and shown analytically that the rate-jitter achieved by algorithm-A is strictly less than the rate-jitter of online algorithm proposed by Mansour et al. [1]. We have used three stochastic processes, namely Poisson, Markov-modulated Poisson process (MMPP) and an arrival process with Pareto-distributed inter-arrival times (see [2–4]) for modeling the arrival of TDM packets (say, IP packets with single or many TDM frames as payloads) at the destination. We undertook statistical analysis of the proposed algorithms by modeling the jitter-buffer as $$M/\widetilde{D}/1/\, B_{on}$$M/D~/1/Bon and $$MMPP/\widetilde{D}/1/B_{on}$$MMPP/D~/1/Bon queues, to derive steady-state queue-length distribution, mean waiting time and distribution of inter-departure times. We also simulate the most realistic queueing model $$Pareto/\widetilde{D}/1/B_{on}$$Pareto/D~/1/Bon of our study and evaluated its performance with respect to the metrics: rate-jitter, mean waiting time, packet loss probability and steady-state queue-length distribution. Simulation results show that our proposed algorithms far outperforms the scheme proposed in [1]. We also present simulation results to verify the correctness of analytical queueing models. The algorithms proposed here are more general (for TDMoPSNs) and can be used to study TDMoIP, pseudowire, CES over metro Ethernet network (MEN), etc. © 2015, Springer Science+Business Media New York.

Photonic Network Communications

On the rate-jitter performance of jitter-buffer in TDMoPSN: study using queueing models with a state-dependent service

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.

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

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

The key focus of our work is to analyse some jitter control algorithms. We study a jitter control algorithm proposed by Mansour et. al [1] for networks with guaranteed quality of service (QoS) from a competitive analysis point of view. The authors have analysed the proposed algorithm (on-line algorithm) and also compared its performance to the off-line algorithm. In this paper, the analysis of the on-line algorithm has been dealt with rigorously and relevant conditions have been derived. For delay jitter, we show that the on-line algorithm guarantees the same delay jitter as the off-line algorithm. Also, both the algorithms in their original forms are applicable only to a fixed number of packets. We extend the results to a more practical model in which we compare the off-line algorithm with n packets and the on-line algorithm with n 1 (n 1 &gt; n) packets, arrival times for both the stream of packets being realised from the same statistical model. In this case, we show that there exists a expression for the ratio of buffer size needed in the off-line algorithm to the buffer size needed in the on-line algorithm, provided that the delay jitter in both the cases are equal. © 2011 IEEE.

Journal	Data powered by Typeset2013 National Conference on Communications, NCC 2013
Publisher	Data powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
ISSN	15503607
Open Access	No