Entity

Time filter

Source Type


Van Do T.,Budapest University of Technology and Economics | Chakka R.,Meerut Institute of Engineering and Technology MIET
Simulation Modelling Practice and Theory | Year: 2010

The specification of the Multicast Address Dynamic Client Allocation Protocol (MADCAP) includes a mechanism to assign multicast addresses to the hosts in the Internet environment. MADCAP servers provide multicast address allocation services. A MADCAP client (that is, a host requesting multicast address allocation services via MADCAP) identifies a suitable MADCAP server and sends appropriate messages to the MADCAP server in order to request a multicast address. The mechanism makes the reuse of multicast addresses available with the MADCAP server, through the application of the lease-time concept. Estimating the performance measures of such a system, accurately and reliably, is very important for efficient use of resources and for achieving the QoS (Quality of Service) requirements. This paper proposes two approaches to estimate performability measures of the MADCAP dynamic allocation mechanism. They are essentially, an accurate one by simulation and a fast but approximate one by analytical solution. While the accuracy of the simulation method is limited by the length of the simulation, the analytical method is an approximate one but fast in computation. The detailed simulation model and the analytical method of the MADCAP dynamic allocation mechanism are presented, and the results are compared. Fairly good agreement is established between the simulation and the analytical results, giving rise to accurate and dependable computation of the performability measures. A solution approach using the QBD model for the performability analysis of the MADCAP mechanism is proposed, which has the computational complexity of the order O(c). Besides possessing the capability of tackling the problem with large c (the number of available IP multicast addresses is of the order of tens of thousands in the MADCAP server) in a very short time, it also gives numerically stable solution. The impact of the lease-time parameter on the performability of the MADCAP dynamic allocation mechanism is also investigated through a numerical study, and illustrated by graphs. © 2010 Elsevier B.V. All rights reserved. Source


Chakka R.,Meerut Institute of Engineering and Technology MIET | Van Do T.,Budapest University of Technology and Economics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

A new queueing model is proposed, namely the -Queue, also known as the Sigma queue. A steady state solution for this queue in a computable form is presented, based on an analytic methodology applying certain non-trivial transformations on the balance equations, which turn out to be of the QBD-M (Quasi Simultaneous-Multiple-Bounded Births and Deaths) type. As a consequence, existing methods such as the spectral expansion method or the matrix-geometric method can be used to obtain the steady state probabilities. The utility of this queue is demonstrated through the performance analysis of an optical burst switching (OBS) node. Numerical results show the impact of the burstiness of arrival process on the performance of the OBS multiplexer. © 2011 Springer-Verlag Berlin Heidelberg. Source


Van Do T.,Budapest University of Technology and Economics | Chakka R.,Meerut Institute of Engineering and Technology MIET
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

This paper suggests new queuing models, in the Markovian framework, which can tackle the presence of burstiness in the traffic and autocorrelations among the inter-arrival times of packets in the performance evaluation of next generation networks. These models are essentially based on certain generalizations of the Quasi Birth-Death (QBD) processes. Efficient steady state solution of these new queuing models, along with some illustrative applications, is presented. The proposed models and their further evolutions have the potential to be useful tools for the performance evaluation of modern telecommunication networks. © 2011 Springer-Verlag Berlin Heidelberg. Source


Do T.V.,Budapest University of Technology and Economics | Chakka R.,Meerut Institute of Engineering and Technology MIET
Communications in Computer and Information Science | Year: 2012

In order to extend the application opportunities of queues with working vacation to to the performance evaluation of practical systems with bursty traffic, we introduce the CPP/M/1 queue with working vacations. In this queue customers arrive in a batch having a geometric size distribution. We present a method and give closed form expressions for the steady state probabilities. We also show that a stochastic decomposition property exists for the CPP/M/1 queue with working vacations. © 2012 Springer-Verlag. Source


Van Do T.,Budapest University of Technology and Economics | Chakka R.,Meerut Institute of Engineering and Technology MIET
Studies in Computational Intelligence | Year: 2013

This paper provides the proof for some fundamental properties of the generalised Markovian queue - HetSigma, which has been proposed in order to model nodes in modern telecommunication networks. The fundamental properties serve as the background for the efficient computational algorithm to calculate the steady state probabilities of the HetSigma queue. © 2013 Springer International Publishing Switzerland. Source

Discover hidden collaborations