• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1320-1328
• /
• 2007

In recent year, the popularity of WLAN has generated much interests on improvement and performance analysis of the IEEE 802.11 protocol. In this paper, we analyze two medium access methods of the IEEE 802.11 MAC protocol by investigating the MAC layer packet service times when arrival packet sizes have a general probability distribution. We use the M/G/1/K queueing model to analyze the throughput and the delay performance of IEEE 802.11 MAC protocol in a wireless LAN. We compare the performances of Basic access method and RTS/CTS access method. We take some numerical examples for the system throughput and the queue dynamics including the mean packet delay and packet blocking probability.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.162-172
• /
• 1999

For VBR video traffic, Motion-Picture Experts Group(MPEG) coding algorithm was adopted as the standard coding algorithm by International Telecommunication Union(ITU). In this paper, we propose a traffic model of an MPEG coded video traffic in frame level and cell level, and develop an approximate model for evaluating performance of a ATM multiplexer with homogeneous MPEG video sources by considering burst-level variation of aggregated traffics. For homogeneous MPEG video traffics which are frame-synchronized, the performance of the ATM multiplexer is influenced by source correlation at the multiplexing time. When sources are highly correlated, we decompose the aggregated cell streams by the frame-type and model multiplexing process during a frame time as n*D/D/1/K queueing model and suggest an approximate method for obtaining CLP of the ATM multiplexer. In the case that sources are highly correlated, the solution has the meaning of the upper bounds of performance of the ATM multiplexer. For the verification of our model, we compare the solution of our model with simulation resets. As the number of sources increases. The CLP obtained from our model approaches to simulation results, and gives upper bounds of simulation results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.9
• /
• pp.20-27
• /
• 2002

The demand for multimedia transmission in wireless networking is rapidly increasing. Performance evaluation in the CDMA system has been carried out on the voice-oriented system without re-transmission or buffering. We propose a multimedia access protocol with buffering and ARQ which can meet a variety of QoS requirements. We study the effect of buffering in MC-CDMA(Multi-Code CDMA) and design a dynamic rate control algorithms, whose simulation shows the efficiency of MC-CDMA.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.437-450
• /
• 1994

The problem of testing for a change in the parameter of a stochastic process is particularly important in simulation studies. In studies of the steady state characteristics of a simulation model, it is important to identify initialization bias and to evaluate efforts to control this problem. A simulation output have the characteristics of chaotic behavior because of sensitive dependence on initial conditions. For that reason, we will apply Lyapunov exponent for diagnosis of chaotic motion to simulation output analysis. This paper proposes two methods for diagnosis of steady state in simulation output. In order to evaluate the performance and effectiveness of these methods using chaos theory, M/M/I(.inf.) queueing model is used for testing point estimator, average bias.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.157-161
• /
• 1996

This paper presents a method for designing private networks considering response time under packet switching network environment Specifically, we propose the designing process of a private network, where the host is assumed to be synchronous and the terminals to be asynchronous, according to protocol and access lines. To calculate the response time for the networks, we use the mutual independent M/M/1 and M/W/s queueing models. Comparing the response time derived from the model with the actual one, it is found that the model yields almost same performance in a more economic way. From the experiment, it is suggested that the necessary number of lines as well as the response time for a specific network can be estimated properly by sensitivity analysis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.1
• /
• pp.1-9
• /
• 1987

This paper considers (S -1, S) inventory models which have wide applications in reparable spare parts inventory systems and multi-echelon systems. We assume a discrete compounds Poisson demand and order size dependent delivery times ; when the replenishment order size is n, we assume the delivery time distribution is arbitrary with finite mean $b_{n}$ . On the basis of the fact the outstanding orders follow a certain queueing process, we introduce the results of Fakinos (1982). We develop the efficient recursive formulae to find the optimal $S^{*}$ under several performance measures as a function of the decision variable S. The results of this paper can be applied to the multi-echelon systems such as MEETRIC.C.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.11-17
• /
• 2001

We consider the M/G/1 with Bernoulli feedback, where the served customers wait in the feedback queue for rework with probability p. It is important to decide the moment of dispatching in feedback systems because of the dispatching cost for rework. Up to date, researches have analyzed for the instantaneous-dispatching model or the case that dispatching epoch is determined by the state of feedback queue. In this paper we deal with a dispatching model whose dispatching epoch depends on main queue. We adopt supplementary variable method for our model and a numerical example is given for clarity.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.657-669
• /
• 2006

In this paper, we analyze a leaky bucket (LB) scheme with queue length dependent arrival rates. In other words, if the queue length exceeds an appropriate threshold value on buffer, the arrivals need to be controlled. In ATM networks, if the congestion occurs, the input traffics must be controlled (reduced) for congestion resolution. By the bursty and correlated properties of traffics, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the loss probability and the waiting time distribution for arbitrary cell. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effects of our proposed LB scheme.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1170-1173
• /
• 1987

A network flow control method, input buffer limit technique which can adjusts the transit traffics in a node, is proposed. The transit traffics that occupy node buffers more threshold are decreased. It has better performance than input buffer limit. The proposed flow control is analyzed by queueing model. Numerical results of some example are shown.