Options
Manivasakan Rathinam
Loading...
Preferred name
Manivasakan Rathinam
Official Name
Manivasakan Rathinam
Alternative Name
Rathinam, Manivasakan
Manivasakan, R.
Main Affiliation
Email
ORCID
Scopus Author ID
Google Scholar ID
23 results
Now showing 1 - 10 of 23
- PublicationOn the rate-jitter performance of jitter-buffer in TDMoPSN: study using queueing models with a state-dependent service(28-08-2015)
;Sikha, Madhu BabuTime-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. - PublicationOn the departure process of jitter buffer in TDMoIP(15-05-2012)
;Rani, S. UshaThis paper discusses the condition under which the jitter buffer at the receiver is to be operated for minimum output variance in a TDMoIP framework. The above study would be useful in the design of synchronization algorithms at the receiver of a TDMoIP network. This work uses the results derived in [1] to the above problem. We model the receiver jitter buffer as a M/G/1 queueing system with EARMA correlations between the inter-arrival times and the service times. The motivation for the above correlation structure is that, if the service intervals depend on the arrival rate and there is correlation within service times, we can achieve a constant bit rate at the receiver, that is, emulate the TDM stream as it was sent at the transmitter. Also, analysis of such a correlated queue is analytically tractable. We derived the variance of the inter departure times, of the above queue. The analysis of the departure process and the waiting times of incoming packets of this correlated queue and the relevant simulations show that if the variance of the inter departure time process constituting output TDM stream is to be less than that of the inter arrival time process of the jitter buffer, which is modeled as M/G/1 queue, then the mean waiting time of the packets in the jitter buffer would necessarily be greater than that of independent (M/M/1) case. © 2012 IEEE. - PublicationPerformance Analysis of Stochastic Fair Sharing Scheme for Link Sharing(01-02-2004)
; ;Hamdi, MounirTsang, Danny H.K.We address the problem of the performance analysis of the stochastic fair sharing (SFS) algorithm for fair link sharing. The SFS scheme has been proposed to carry out a fair link sharing and fair sharing among virtual private networks. Depending upon the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. In this letter, we undertake the performance evaluation of the SFS scheme analytically. We explore the tradeoff between fairness and the blocking probability by varying the trunk reservation parameter. The results show that the analytical performance measure agrees well with the simulation results. - PublicationAn analytical framework for comparing flat and hierarchical architectures in fog computing networks(01-01-2020)
;Haneefa, Niyas K. ;Pramod, S.With the emergence of IoT, the number of devices that is getting connected is increasing exponentially, which poses a constraint on the lower latency requirements of processing these tasks. Evolving technologies such as fog computing and edge computing consist of computationally lesser exhaustive power servers, which bring this processing near the edge or onto the devices, thereby reducing the round-trip delay as well as the load on the entire network. In this work, we propose the hierarchical arrangement of servers in the fog computing layer for this processing of data and derive the analytical framework for the same. The proposed architecture works on top-down scheduling policy rule for the incoming packets, defined mathematically in terms of two-dimensional Markov chains. The performance of the proposed architecture is compared with an equivalent flat architecture analytically in terms of the mean sojourn time and the mean computational power and justified using simulation results. - PublicationOn the Inter-Departure Times in M/D/1/Bon Queue With Queue-Length Dependent Service and Deterministic/Exponential Vacations(01-01-2019)
;Sikha, Madhu BabuWe 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. - PublicationMultimedia-MAC protocol: Its performance analysis and applications for WDM networks(01-03-2006)
;Wang, Lixin ;Hamdi, Mounir; Tsang, Danny H.K.The design of the medium-access control (MAC) protocol is the most crucial aspect for high-speed and high-performance local and metropolitan area networks, since the decisions made at this level determine the major functional characteristics of these networks. Most of the MAC protocols proposed in the literature are not suitable for multimedia applications, since they have been designed with one generic traffic type in mind. As a result, they perform quite well for the traffic types they have been designed for, but poorly for other traffic streams with different characteristics. In this paper, we propose an integrated MAC protocol called the Multimedia-MAC (M-MAC), which integrates different MAC protocols into a hybrid protocol in a shared-medium network to efficiently accommodate various types of multimedia traffic streams with different characteristics and quality-of-service demands, namely, a constant-bit-rate traffic, bursty traffic (say, variable-bit-rate traffic), and emergency messages (say, control messages). We have developed a mathematical framework for the analysis and performance evaluation of our M-MAC protocol, which involves a queueing system with vacation. We have applied our M-MAC design approach to a wavelength-division multiplexing network, and evaluated its performance under various traffic conditions. © 2006 IEEE. - PublicationA compact and high-speed plasmonic slot waveguide coupled with photonic waveguide based 2x2 electro-optic switch(01-01-2016)
;Arya, AdityaWe report an electro-optic switch at 1.55 μm wavelength based on Mach-Zehnder Interferometer (MZI) in which, the MZI arms and the input-output 3-dB couplers are designed using plasmonic and photonic waveguides re- spectively. More than 90% photons are successfully converted into surface plasmons through tapering the both photonic as well as plasmonic waveguide. The plasmonic and photonic mode profiles, interaction between plas- monic and RF fields, confinement of plasmonic field in plasmonic waveguide, and trade-off between loss and confinement are thoroughly examined before the combined optical and electrical simulation of the switch. The switching voltage is less than 6 Volts, the MZI arm length is only 15 μm, the crosstalk is less than -35 dB, and the maximum switching speed is 11.55 ps. The footprint of the switch is only 290x50 μm2. - PublicationNovel rate-jitter control algorithms for TDMoIP(01-01-2013)
;Sikha, MadhuTDMoIP 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. - PublicationA Performance Limit Estimation Framework for Multihop Repeated/Regenerated Optical Links(01-01-2022)
;Francis, FredyWe propose and demonstrate a generalized framework for performance limit evaluation and comparison of multihop optical repeated and regenerated links. The model developed is implementation agnostic and applies to multihop optical links of varied forms, including fiber, free space, and underwater links. The framework estimates the best-case performance gains of deploying an all-regenerative link over an all-repeater link for any given implementation. The implementation-independent technique is then illustrated using guided and free-space optical links. An abstract model is developed first with the evolution of signal, noise power, and bit error rate down the link compared and contrasted for both cases. The model is then evaluated using physical parameters for a typical fiber optic intensity-modulated direct detection link, and the obtained all-regenerator link performance advantage is translated to extra reach and lower transmission power requirements. Further, certain approximations are provided to reduce computational complexity and improve the analytical tractability of the procedure, which could be particularly helpful when employed in specialized hardware or for dynamic reconfiguration networks. Finally, the framework's versatility is established by employing it in analyzing an ideal free-space link and comparing amplify and forward links against decode and forward counterparts. Similar results are also reproduced on a commercial optical link simulation suite. Detailed literature on link analysis is provided for fiber, free space, and underwater links, bringing out their similarities. We conclude by elaborating on various current and emerging application domains and certain limitations of the proposed technique. - PublicationJitter buffer modelling and analysis for TDM over PSN(01-01-2015)
;Seshasayee, Usha RaniTime Division Multiplexing (TDM) over Packet Switched Network (PSN) is a pseudo wire technology for emulating TDM Circuits over Packet Networks. Conceptually, the important ingredients of the above technology are to implement the following, in the PSN (i) Quality of Service (QoS) which is implemented through scheduling at the intermediate nodes that gives priority to packets containing 'TDM' payload (ii) timing and synchronization and (iii) scheduling in the jitter buffer for minimum output variance. Among these, this paper addresses (iii) as a first step assuming that the PSN provisions the "unacknowledged virtual circuit" (the main components of 'virtual circuit' are QoS and connection-oriented service). This work targets to implement a scheduling algorithm (service intervals) in jitter buffer at the receiver, such that the variance of inter-departure intervals of TDM stream is minimized. This is accomplished by the buffer modelled as M/G/l queueing system with Auto-Regressive AR (1) correlations within service intervals. The motivation for the above correlation structure is two-fold. First, given the correlations within the service intervals, such a correlation results in reduction of variance in the inter-departure interval. The other is that the analysis of such a correlated queue is analytically tractable. The variance of the inter-departure time is presented. The analysis of the departure process, the waiting times of incoming packets of this correlated queue aids in determining the correlation parameter that are sub-optimal in the context of TDMoPSN. Our study also includes a M/G/l queue with AR (1) cross-correlations between the inter-arrival and the service times. A G/G/l queue in which the inter arrivals are correlated, and with AR (1) correlations of the above two types are also studied. Extensive simulations demonstrate our analytical and approximation results.
- «
- 1 (current)
- 2
- 3
- »