• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.653-678
• /
• 2011

WiMAX is intended for fourth generation wireless mobile communications where a group of users are provided with a connection and a fixed length queue. In present literature traffic of such network is analyzed based on the generator matrix of the Markov Arrival Process (MAP). In this paper a simple analytical technique of the two dimensional Markov chain is used to obtain the trajectory of the congestion of the network as a function of a traffic parameter. Finally, a two state phase dependent arrival process is considered to evaluate probability states. The entire analysis is kept independent of modulation and coding schemes.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.217-226
• /
• 2014

In this research, we study the problem of opportunistic spectrum access (OSA) in a time-varying environment with fading channels, where the channel state is characterized by both channel quality and the occupancy of primary users (PUs). First, a finite-state Markov channel model is introduced to represent a fading channel. Second, by probing channel quality and exploring the activities of PUs jointly, a two-dimensional partially observable Markov decision process framework is proposed for OSA. In addition, a greedy strategy is designed, where a secondary user selects a channel that has the best-expected data transmission rate to maximize the instantaneous reward in the current slot. Compared with the optimal strategy that considers future reward, the greedy strategy brings low complexity and relatively ideal performance. Meanwhile, the spectrum sensing error that causes the collision between a PU and a secondary user (SU) is also discussed. Furthermore, we analyze the multiuser situation in which the proposed single-user strategy is adopted by every SU compared with the previous one. By observing the simulation results, the proposed strategy attains a larger throughput than the previous works under various parameter configurations.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.1
• /
• pp.191-202
• /
• 2009

In this study, we drive the one dimensional marginal transform function, probability density function and probability distribution function for the random variables $T_{{\xi}N}$ (Time taken by the servers during the vacations), ${\xi}_N$(Number of vacations taken by the servers) and ${\eta}_N$(Number of customers or units arrive in the system) by controlling the variability of two random variables simultaneously.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.345-356
• /
• 1995

The aim of this paper is to analyze the batch service queueing model M/M(a, b ; ${\mu}_k/1$) under general bulk service rule with mean service rate ${\mu}_k$ for a batch of k units, where $a{\leq}k{\leq}b$. This queueing model consists of the two-dimensional state space so that it is characterized by two-dimensional state Markov process. The steady-state solution and performane measure of this process are derived by using Matrix Geometric method. Meanwhile, a new approach is suggested to calculate the two-dimensional traffic density R which is used to obtain the steady-state solution. In addition, to determine the optimal service initiation threshold a, a decision model of this queueing system is developed evaluating cost of service per batch and cost of waiting per customer. In a job order production system, the decision-making procedure presented in this paper can be applicable to determining when production should be started.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3447-3469
• /
• 2019

It is well-known that the cooperative communication and error control technology can improve the network performance, but most existing cooperative MAC protocols have not focused on how to cope with the contention process caused by cooperation and how to reduce the bad influence of channel packet error rate on the system performance. Inspired by this, this paper first modifies and improves the basic rules of the IEEE 802.11 Medium Access Control (MAC) protocol to optimize the contention among the multi-relay in a cooperative ARQ scheme. Secondly, a hybrid ARQ protocol with soft combining is adopted to make full use of the effective information in the error data packet and hence improve the ability of the receiver to decode the data packet correctly. The closed expressions of network performance including throughput and average packet transmission delay in a saturated network are then analyzed and derived by establishing a dedicated two-dimensional Markov model and solving its steady-state distribution. Finally, the performance evaluation and superiority of the proposed protocol are validated in different representative study cases through MATLAB simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.917-921
• /
• 2015

We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.119-131
• /
• 2014

In recent literature on traffic scheduling, the combination of the two-dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.