• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.307-312
• /
• 2011

In the macro/femto cellular networks, the portion of channels assigned to each cell is a critical factor which sets the stability and the performance of the whole system. To grasp the concrete influence that the channel split portion have on the system, we present the queueing model for IP based macro/femto cellular networks, and find the stability conditions. Additionally we provide the strategy to decide the portion of channels allocated to each cell. Through the experiments, we prove that the proposed strategies operate feasibly in various network environments, and on the basis of these results we discuss the efficient system structure plan.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.104-107
• /
• 2002

Traditional queueing analyses are very useful for designing a network's capacity and predicting there performances, however most of the predicted results from the queueing analyses are quite different from the realistic measured performance. And recent empirical studies on LAN, WAN and VBR traffic characteristics have indicated that the models used in the traditional Poisson assumption can't properly predict the real traffic properties due to under estimation of the long range dependence of network traffic and self-similarity. In this paper self-similar characteristics over statistical approaches and real time network traffic measurements are estimated. It is also shown that the self-similar traffic reflects network traffic characteristics by comparing source model.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.41-51
• /
• 2016

Smart metering systems have become widespread around the world. RF mesh communication systems have contributed to the creation of smarter and more reliable power systems. This paper presents an algorithm for positioning GPRS concentrators to attain delay constraints for a ZigBee-based mesh network. The proposed algorithm determines the number and placement of concentrators using integer linear programming and a queueing model for the given mesh network. The solutions given by the proposed algorithm are validated by verifying the communication network performance through simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1420-1426
• /
• 2008

This paper derives medium access delay of each AC(Access Category) in a stationary station using inter-departure time of IEEE 802.11e WLAN(Wireless LAN). Inter-departure time of IEEE 802.11e WLAN is obtained using saturation throughput of IEEE 802.11e WLAN which was the topic of our prior work. By using a simple queueing model, we evaluate mean queue length and mean delay for each AC on stationary condition. We calculate performance of each AC using this simple model and validate results using simulation.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.287-290
• /
• 2000

This paper analyze link-sharing mechanisms in packet networks based on the hierarchical class based queueing. The CBQ outlines a set of flexible, efficiently implemented gateway mechanisms that can meet a range of service and link-sharing requirements. We have analyzed the Class level(B, C, D) using the EWMA (Exponential Weighted Moving Average) weight value and EWMA average limit value.

• East Asian mathematical journal
• /
• v.30 no.1
• /
• pp.23-29
• /
• 2014

To solve inefficient spectrum usage problem under current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy, which maximizes immediate throughput, is a simple and robust strategy with reduced complexity. In this paper, we present a simple mathematical model to evaluate the saturation throughput and medium access delay of a myopic policy in the presence of multiple channels.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.151-157
• /
• 1992

This paper presents a method for analyzing the transfer lines with finite storage buffers. Each machine spends a random amount of time processing each material. This transfer line can be modeled by the tandem queueing system with finite buffers. The great dimensionality of the state space renders the analysis of such system a formidable task. We propose an efficient algorithm to obtain the marginal state probabilities based on the exact algorithm for the two-machine system. Other performance measures, such as the utilization, the blocking probability, the average sojourn time, and the average queue length, can be easily calculated.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.647-653
• /
• 2010

We consider an M/M/1 retrial queue with collision and impatience. It is shown that the generating functions of the joint distributions of the server state and the number of customers in the orbit at steady state can be expressed in terms of the confluent hypergeometric functions. We find the performance characteristics of the system such as the blocking probability and the mean number of customers in the orbit.

• IE interfaces
• /
• v.14 no.4
• /
• pp.334-340
• /
• 2001

The theory of constraints (TOC) has become a valuable system in modern operations management. Using the ideas and methods of the TOC, companies can achieve a large reduction of work-in-process and finished-goods inventories, significant improvement in scheduling performance, and substantial earnings increase. The purpose of this paper is to calculate the optimal size of the time buffer which is used to accommodate disruptions in production processes and provide maximum productivity of capacity constrained resources. After the problem formulation in terms of single server queueing model, we observed the system behavior by sensitivity analyses.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.476-480
• /
• 2002

The theory of constraints (TOC) has become a valuable system in modern operations management. Using the ideas and methods of the TOC, companies can achieve a large reduction of work-in-process and finished-goods inventories, significant improvement in scheduling performance, and substantial earnings increase. The purpose of this paper is to calculate the optimal size of the time buffer which is used to accommodate disruptions in production processes and provide maximum productivity of capacity constrained resources. After the problem formulation in terms of single server queueing model, we observed the system behavior by sensitivity analyses.