• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.156-159
• /
• 1986

In this paper, we discribed characteristics of two buffer which are limited area in packet communication networks, we selected JSQ(Join the Shortest Queue) method for buffrt management and compared it with single, random methods. The blocking probabilities of massage using JSQ method is decreased about (2.5 times) in compared with that of single queue method and (0.5 times) in random selection method. This results could be used in designing packet switching communication networks.

• Journal of Korean Society of Transportation
• /
• v.33 no.1
• /
• pp.1-13
• /
• 2015

This study aims to develop a mainline metering strategy considering queue imbalance among lanes that can reduce congestion at a toll plaza section by managing queue caused by mainline metering. The suggested strategy considers simultaneously optimizing the number of cars in merging area and managing queue by lane. This study analyzes the effectiveness of the strategy with respect to the average travel time and the occurrence rate of spillback using the PARAMICS. The results show that the suggested strategy has an effect on reducing congestion and improving operation efficiency at toll plaza. In particular, the congestion become more intensified when the length of waiting space is shorter; however, this study shows that the suggested strategy can relieve the congestion in that condition.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.6
• /
• pp.152-160
• /
• 1996

This paper focuses on development and evaluation of a performance management algorithm for IEEE 802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisfy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. This paper presents a network performance manager that adjusts queue capacity as well as timers by using a set of fuzzy rules and fuzzy inference mechanism. The efficacy of the performance management has been demonstrated by a series of simulation experiments.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.82-89
• /
• 2003

In this paper, an efficient threshold-based filtering (TF) buffer management scheme is proposed. The TF is capable of minimizing the overall loss performance and improving the fairness of buffer usage in a shared buffer packet switch. The TF consists of two mechanisms. One mechanism is to classify the output ports as sctive or inactive by comparing their queue lengths with a dedicated buffer allocation factor. The other mechanism is to filter the arrival packets of inactive output ports when the total queue length exceeds a threshold value. A theoretical queuing model of TF is formulated and resolved for the overall packet loss probability. Computer simulations are used to compare the overall loss performance of TF, dynamic threshold (DT), static threshold (ST) and pushout (PO). We find that TF scheme is more robust against dynamic traffic variations than DT and ST. Also, although the over-all loss performance between TF and PO are close to each other, the implementation of TF is much simpler than the PO.

• Journal of Nutrition and Health
• /
• v.31 no.8
• /
• pp.1347-1354
• /
• 1998

The purposes of this study were to : (a) anlayze wating time, service rate, arrival rate, and coustomer expectations/satisfaction in cafeteria business foodservices and (b) identify the differences in those factors between foodservices by menu managmenet systems. The samples were two business foodservices operated by contract management in Seoul. The queue, laptime , service rate, and arrival rate were measured at each foodservice by stopwatch observation. The menu type, delivery system, number of meals served , servide time, and turnover rate of each foodservic was investigated. Questionnaires were developed to survey customer expectations and satisfaction. Satistical data analysis was completed using the SAS package programs for descriptive analysis and t-test. The mean waiting time of island type dafeteria system with separte set -menu was shorter than that of the other. In both foodservices, arrival rates were not significantly different from one another , but sevice rates were significnatly high in dafeteria menu systems. The peak time of the queue was found out at combination set menu line. The separate set menu line had a higher servide rate than the combination set menu line. The mean waiting time of the island type cafeteria line was shorter than that of the straifth type . At the straight type dafeterial line, both arrival rate and service rate were higher than those of island-type. The results of this study suggested that a separate set-menu would be more desirable than a combination set-menu in case of providing set menu with cafeteria menu.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.39-44
• /
• 2003

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Earl Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly We propose the Effective RED algorithm to solve with the weakness of RED In this algorithm the maximum drop probability decides to accept or drop the interning packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS(Network Simulator)-2.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.149-165
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.143-149
• /
• 2008

There have been some approximation analysis methods for a GI/G/1 queueing system. As one of them, an approximation technique for the steady-state probability in the GI/G/1 queueing system based on the iteration numerical calculation has been proposed. As another one, an approximation formula of the average queue length in the GI/G/1 queueing system by using the diffusion approximation or the heuristics extended diffusion approximation has been developed. In this article, an approximation technique in order to analyze the GI/G/1 queueing system is considered and then the formulae of both the steady-state probability and the average queue length in the GI/G/1 queueing system are proposed. Through some numerical examples by the proposed technique, the existing approximation methods, and the Monte Carlo simulation, the effectiveness of the proposed approximation technique is verified.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1737-1753
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.325-327
• /
• 2005

In this paper, we propose the design of active queue management (AQM) control system using the self-recurrent wavelet neural network (SRWNN). By regulating the queue length close to reference value, AQM can control the congestions in TCP network. The SRWNN is designed to perform as a feedback controller for TCP dynamics. The parameters of network are tunes to minimize the difference between the queue length of TCP dynamic model and the output of SRWNN using gradient-descent method. We evaluate the performances of the proposed AQM approach through computer simulations.