• The Journal of the Acoustical Society of Korea
• /
• v.18 no.6
• /
• pp.65-70
• /
• 1999

In ATM network there exist several traffics according to QoS, such as CBR, rt-VBR, nrt-VBR, UBR, and ABR. Many studies have done at the traffic management of ABR which uses the unused network bandwidth. Many flow control mechanisms have proposed to use efficiently the unused bandwidth. In TMWG(Traffic Management Working Group) of ATM Forum, there exist rate-based, credit-based, and mixture of them to manage flow control of ABR traffic. Among these, rate-based mechanisms adopted as standard because it is flexible and also makes it possible to implement ATM switch with low price and high capacity. In this paper, we study the switch that uses EFCI, ER and VS/VD(Virtual Source/Virtual Destination) with rate-based mechanism. Instead of using queue threshold, we propose a new algorithm which uses bandwidth threshold of input stage of switch, and manages efficiently ABR traffic with EPRCA algorithm.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.947-952
• /
• 2016

Most data centers attempt to consolidate servers using virtualization technology to efficiently utilize limited physical resources. Moreover, virtualized systems have commonly adopted contents-based page sharing mechanism for page deduplication among virtual machines (VMs). However, previous page sharing schemes are limited by the inability to effectively manage accumulated hints which mean sharable pages in stack. In this paper, we propose a priority-based hint management scheme to efficiently manage accumulated hints, which are sent from guest to host for improving page sharing opportunity in virtualized systems. Experimental results show that our scheme removes pages with low sharing potential, as compared with the previous schemes, by efficiently managing the accumulated pages.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.237-246
• /
• 2001

In this paper we introduce a solution to improve the unfairness problem and to remove the waste of bandwidth in the distributed queue dual bus system. This solution requires only a minor modification of the current protocol and further shows no bandwidth wastes when we try to resolve the unfairness problem occurred in current DQDB protocol. There has been many problem in DQDB system in terms of fairness of sending message in each node. In order to solve this problem, Bandwidth Balancing technic and proportional assignment technic have been introduced. It is, however, to note that the waste of bandwidth problem is still existing in those technics, even though there has been significant improvement as to the fairness problem. In this paper we introduce a new solution to remove the waste of bandwidth problem while we are still obtaining the improved fairness of the network. By following this new solution, the simulation result shows higher throughput and lower message delay than previously proposed technics.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3479-3489
• /
• 2000

Most of the study on fairness control method for Distributed-Queue Dual-Bus(DQDB) have been performed under specific load types such as equal probability load types or symmetric load types. On Web-based internet enviroments client-server load types are more practical traffic patlerns than specrfic load types. In this paper, an effiective fairness control method to distribute DQDR network bandwidth fairly to all stations under a client-server load is proposed. In order to implement a dynamic bandwidth timing capabihty needed to distribute the bandwidth fairty at heavy loads, the proposed method uses two pararnetexs, one is an access hrnit to legulate each station's packet transmission and the other is the number of extra emply slots that are yielded to downstream stations. In point of implementation this mechanism is simpler and easier than Bandwidth Tuning Mechanism(BTM) that uses an intermediate pattern and an adptation function. Simulation results show that it outperforms othen mecharusms.

• Journal of the Korea Society for Simulation
• /
• v.22 no.3
• /
• pp.35-41
• /
• 2013

This paper applies an active period based bottleneck detection method to flow shop manufacturing system with limited buffer size. Manufacturing systems are constrained by one or more bottlenecks which degrades the system throughput. Conventional bottleneck detection methods include the waiting time or queue length of production stations and their utilization. Due to the random events such as production time of items, machine failure and repair times, the systems may change over time, and subsequently bottlenecks shift from one station to another station. Active period of working station may cause other stations to wait for productions. Information when and where active periods occur helps to find bottlenecks in production systems. Based on these informations, we predict bottlenecks in applying AweSim simulation language. We compare the simulation results of conventional methods with those obtained from duration of active period method, and duration ratio method of both sole and shift bottleneck periods. Even though simulation results are from simple flow shop model, they are quite promising for predicting bottlenecks of production stations. We hope this study aids in decision making regarding the improving system production yield and allocation of available resources of system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.1 no.1
• /
• pp.33-40
• /
• 2002

This paper presents the evaluation result of the Namsan 1st tunnel traffic information system, which is providing the real time queue length status and incidence information inside of the Namsan 1st tunnel, 1600meters long in the Seoul metropolitan CBD. This information system plays an important role because of notifying drivers to pay a toll for the tunnel path, the congestion information in advance. According to the analysis, an evident improvement on the tunnel path and its bypass without any conspicious adverse impact. Furthermore, survey analysis found that motorists placed a high value on the provided information. During peak time, the system turned out to help motorists to relax their hasty minds. As well, several performance indices showed the reduction of congestion and travel time variation on both of the tunnel path and its bypass, in spite of no traffic information on the bypass.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.42-58
• /
• 2008

Nowadays the installation of Real-time Traffic Signal Control system is gradually spread, in order to solve the traffic problem which become serious. The most important thing are reliability of data collection and functionality of system in Real-time Traffic Signal Control System. But, the evaluation for those introduction system are defective after system constructing. So, many systems are not working properly to those systems's primarily purpose. This study is executed expansion through field test and analysis which check performance and advise of system operation. It has purpose to establish of the maintenance system of Real-time Traffic Signal Control system. As the result of analysis, we could find the several problems in this study. So, we also could guess that the effective maintenance systems of the Real-time Traffic Signal Control system is necessary within few years.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.22-31
• /
• 2008

RT/IMPOST is an effective algorithm that can realize real-time internal metering policy (IMP) using queue information from loop detector and signal control strategies. In this paper, an investigation was made to adopt the IMP methodology within COSMOS environments in terms of communication environment and control time point. Through the analysis of the communication environment of COSMOS and communication and control steps in RT/IMPOST, a set of applicable alternative were developed and evaluated. Then, one of the alternatives was selected, and performance of the alternative was compared with RT/IMPOST system using a simulation technique. Results showed that two techniques produced the similar performance. Therefore, the method suggested in this paper was evaluated as a practically viable alternative.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.45-50
• /
• 2017

Micro-service Architecture is a service architecture optimized for large-scale distributed systems such as real-time realistic broadcasting systems, so that are fiercely adopted by Global leading service platform vendors such as Netflix and Twitter due to the merit of horizontal performance scalability enabling the scale-out technique. In addition, micro-service architecture makes it possible to execute image processing and real-time data analysis using an asynchronous-based processing that are difficult to handle in Web API such as REST. In this paper, an event stream processing framework applicable to asynchronous based micro services is proposed in the sense that the accountability of event processing order is not guaranteed in the events such as IoT sensor data analysis or cloud-based image editing because these are the situations where the real-time media editing generates multiple event streams and asynchronous processes in the platform.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.36-48
• /
• 1999

Controlled transfer (CT) service has been recently proposed as a new ATM transfer capability for high-speed data applications, which used a credit-based flow control. This paper investigates buffer allocation schemes for CT service and proposes an improved dynamic bugger allocation scheme. In order to improve the responsiveness to a congestion, the proposed method is considered the load factor of a link when determining the amounts of virtual connection (VC)s buffer allocation. Also, in this paper we compare the performance of the proposed method with those of the existing buffer allocation methods such as flow controlled virtual channels (FCVC) and zero queueing flow control (ZQFC) through simulation. Simulation results show tat the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.