• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• Journal of Navigation and Port Research
• /
• v.28 no.6
• /
• pp.549-555
• /
• 2004

The purpose of this study is to estimate the required number of yard tractor on port container terminal. The number of yard tractor is the bottleneck factor on the efficiency of container terminal. Due to the change in travel speed and travel distance, the efficiency is difficult to estimate. The efficiency of yard tractor is estimated by the proposed simulation model that developed considering the queueing network between container crane and transfer crane. The number of yard tractor per container crane is estimated by the alternative analysis. And to determine the number of yard tractor per container crane, the performance measure such as the distance between berth and yard, the speed of yard tractor are simulated.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.39-47
• /
• 2000

This paper is to propose an efficient and reliable control procedure of Base Station Controller of mobile communication system for bulk input messages which was delivered instantaneously. We divided the input messages that are processed by the base station controller of the mobile communication system into two things ; they are messages related to call connection and o&m(operation and maintenance). In addition, we analyzed the properties of the input messages and then performed computer simulation on each input message by using M/M/1/K queueing model in term of the following viewpoints : the loss probability of input messages, the average queue length, the utilization of process controller(server),the average waiting time in queue. And we compared the performance of the two input messages in the overload controlling which was caused by the congested input messages.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.574-581
• /
• 2002

Traditional queueing analyses are very useful for designing a network's capacity and predicting their 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 characteristic have indicated that the models used in the traditional Poisson assumption cannot properly predict the real traffic properties due to underestimation of the long-range dependence of network traffics and self-similar properties. In this paper, It is also shown that the self-similar traffic reflects real Ethernet traffic characteristics by comparing Pareto-like ON/OFF source model which is exactly self-similar model to the traditional Poisson model. It is also performed optimization design and performance analysis of ATM network using Internet traffic characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.727-734
• /
• 2004

Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1947-1955
• /
• 1989

With the increasing complexity of cabling at sensory level in process control and manufacturing automation, field buses were introduced to replace the traditional point to point links from each sensor or acruator to its controlling equipments by a single link on which all information is transmitted seriall and multiplexed in time. In this papr, we introduce the BITBUS network as a field bus. For the service discipline of the BITBUS network, two service strategies are proposed to obtain the performance of the network. They are the equal priority cyclic service strategy and the non-equal priority cyclic service strategy. The former assigns equal priority to each node for polling and the latter assumes non-equal priority. The BITBUS network was modeled as a cyclic queueing model and it is analyzed by two methods: the Kuehn's and the Boxma's. Computer simulation was also done for the cyclic queueing model and simulation results were compared with those. Under mathematically non-analyzable environment, only the computer simulation was done. From the simulation result, in order to meet the response time requirement of 5 msec imposed by International Electrotechnical Commission when each node has the average traffic of 5000 messages/sec in manufacturing automation the number of slave nodes should be smaller than 10 at the transmission rate of 2.5 Mbps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.227-236
• /
• 1986

In this paper, an integrated voice/data packet network with window flow control is modeled by a colsed multichain queueing system, and its performance is analyzed by the mean value analysis method. Particularly, for the analysis of a packet network having various kinds of messages with different priority classes, we introduce an approach based on the mean value analysis and the concept of effective capacity. By the mathematical analysis and computer simulation, we obtain the following network statistics in the steady state: Mean buffer occupancy at each node, utilization of link throughput of a virtual channel, and mean delay time of each message. Our iterative analysis method can predict the link data status in most cases within about 10 percent of accurady, and the statistics of voice messages and external data within 5 percent as compared to simulation results.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2415-2423
• /
• 2009

We consider organizational knowledge combination process. Previous literature investigated the issue from either managerial or social aspects, emphasizing on a part of the whole process and limiting to qualitative analyses. Here we propose an integrative and quantitative approach which considers knowledge combination process from engineering perspective. We employ a queueing network model and techniques to capture the process of interactions of entities in the knowledge combination environment. By doing so, we are able to understand the performance of the knowledge combination process. The performance measures derived can provide valuable implications for managerial decisions such as planning and controlling the knowledge combination process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5269-5286
• /
• 2018

Task scheduling is one of the key issues in improving system performance and optimizing resource management in cloud computing environment. In order to provide appropriate services for heterogeneous users, we propose a novel task scheduling strategy with service differentiation, in which the delay sensitive tasks are assigned to the rapid cloud with high-speed processing, whereas the fault sensitive tasks are assigned to the reliable cloud with service restoration. Considering that a user can receive service from either local SaaS (Software as a Service) servers or public IaaS (Infrastructure as a Service) cloud, we establish a hybrid queueing network based system model. With the assumption of Poisson arriving process, we analyze the system model in steady state. Moreover, we derive the performance measures in terms of average response time of the delay sensitive tasks and utilization of VMs (Virtual Machines) in reliable cloud. We provide experimental results to validate the proposed strategy and the system model. Furthermore, we investigate the Nash equilibrium behavior and the social optimization behavior of the delay sensitive tasks. Finally, we carry out an improved intelligent searching algorithm to obtain the optimal arrival rate of total tasks and present a pricing policy for the delay sensitive tasks.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.23-33
• /
• 2011

Due to underutilization of spectrum under current inefficient and static spectrum management policy, various kinds of opportunistic spectrum access (OSA) strategies have appeared. Myopic policy is a simple and robust OSA strategy with reduced complexity that maximizes immediate throughput. In this paper, we propose mathematical models to evaluate the throughput and the MAC delay of a myopic policy under saturation tra c conditions. Using the MAC delay distribution, we evaluate the packet delay of secondary users under nonsaturation conditions. Numerical results are given to show the performance of the myopic policy in cognitive radio networks.