• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.71-84
• /
• 1999

The purpose of this study is to construct a dynamic traffic analysis model using the existing traffic flow theory in order to develope a dynamic traffic assignment technique. In this study the dynamic traffic analysis model was constructed using Daganzo's CELL TRANSMISSION THEORY which was considered more suitable to dynamic traffic assignment than the other traffic flow theories. We developed newly the diverging split module, the cost update module and the link cost function and defined the maximum waiting time decision function that Daganzo haven't defined certainly at his Papers. The output that resulted from the simulation of the dynamic traffic analysis model with test network I and II was shown at some tables and figures, and the analysis of the bottleneck and the HOV lane theory showed realistic outputs. Especially, the result of traffic assignment using the model doesn't show equilibrium status every time slice but showed that the average travel cost of every path maintains similarly in every time slice. It is considered that this model can be used at the highway operation and the analysis of traffic characteristics at a diverging section and the analysis of the HOV lane effect.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.65-76
• /
• 2002

This study is realized using fuzzy evaluation and AHP(the analytic hierarchy process) for the optimum search of traffic route and estimated by the quantitative analysis in the vague subjective judgement. It is different from classical route search and noticed thinking method of human. Appraisal element, weight, appraisal value of route is extracted from basic of the opinion gathering fur the driving expert and example of route model was used for the finding of practice utility. Model assessment was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure, Choquet fuzzy integral.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.1-6
• /
• 2008

Data grid shares distributed large data via wide-band network. Such grid environment consumes much time for large data transmission. Because it is implemented on internet as physical network. Many replication strategies were proposed for solving this problem, but they are not optimal in real Data grid environments. Because they were proposed that based on logical topology without consideration of real internet architecture. Grid data access time is largely influenced by internet architecture as physical network of Data grid. In this paper, we propose a new data replication strategy RSIA(Replication Strategy based on Internet Architecture) based on internet architecture. The RSIA places replicas considering structural hierarchy in each element of internet, and avoid the performance bottlenecks to reduce system performance degradation when a data transfer. Through simulation, we show that the proposed RSIA data replication strategy improves the performance of Data Grid environment compared with previous strategies.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1594-1609
• /
• 2010

In the case that multiple services are in race condition for limited I/O resource, the services or processes with lower priority occasionally occupy most of limited I/O resource. And it decreases QoS and performance of important services and makes it difficult to efficiently use limited I/O resource. Although system administrator allocates I/O resource according to priority of process, he/she can't know or expect how much resource will be used by the specific process. Due to these reasons, it causes the problem that he/she can't guarantee the service QoS and performance stability. Therefore, in this paper, we propose service based disk I/O control supporting predictable I/O bandwidth to resolve upper problems. Proposed I/O control guarantees the service QoS and performance stability by supporting the service based predictable I/O bandwidth and it makes limited I/O resource to be efficiently used in respect of service.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.23-28
• /
• 2012

The performance improvement of the secondary storage is very slow compared to the main memory and processor. The data is loaded from secondary storage to memory for the execution of an application. At this time, there is a bottleneck. In this paper, we propose an Executable Compression Method to speed up the initial loading time of application. and we examined the performance. So we implemented the two applications. The one is a compressor for Execution Binary File. and The other is a decoder of Executable Compressed application file on the Embedded System. Using the test binary files, we performed the speed test in the six files. At the result, one result showed that the performance was decreased. but others had a increased performance. the average increasing rate was almost 29% at the initial loading time. The level of compression had different characteristics of the file. And the performance level was dependent on the file compressed size and uncompress time. so the optimized compression algorithm will be needed to apply the execution binary file.

• Journal of Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.291-298
• /
• 2006

A new intelligent paging algorithm is proposed in this paper to maximize the paging capacity in wireless link of mobile communication systems. Intelligent paging algorithms have been studied to utilize limited wireless resource efficiently, in which a location area is divided to several paging areas which are searched sequentially. Previous intelligent paging methods mainly use location probability distribution of the paging target terminal to determine paging areas. However, these methods make the paging traffic of each cell non-uniformly distributed. Therefore, in relatively low paging load conditions, there exist cells congested with paging traffic in which paging traffic queues are overflowed and paging messages are lost. The proposed method determines paging areas to make the paging traffic distributed uniformly among cells by considering current paging traffic distribution in each cell. Performance evaluation shows that the proposed method outperforms the previous paging schemes much with respect to paging processing capacity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.6
• /
• pp.1071-1080
• /
• 2017

Recently, the terms of the 4th Industrial Revolution and the Smart Factory are often heard through news and media. But most of the companies that are parties are not interested. Because there is no specific guidance on how to build Smart Factory and information about Smart Factory. The built of the Smart Factory should be carried out in accordance with the size of the company considering the purpose of the introduction. In the existing study, they analyzed successful cases of building Smart Factory in Korea As a result, in the case of large-size firms, it is an effective strategy that expanding from a model factory to whole factory for successful Smart Factory building. In addition, in the case of medium and small-size firms, it is an effective strategy that upgrading from low-level step to high-level step for successful Smart Factory building. In this study, selecting medium and small-size firms, and bottleneck section and processes requiring improvement are identified through 3D virtual process design, and then install sensors. Finally, after analyzing the data collected through the sensor, we will improve the process and build Smart Factory with improved productivity.

• Korean Business Review
• /
• v.13
• /
• pp.263-273
• /
• 2000

Mercedes-Benz United States International (MBUSI) built a manufacturing facility for the production of the new M-Class All Activity Vehicle (AAV). This plant consists of three large sequential shops: the Body Shop, the Paint Shop, and the Assembly Shop. When the plant reaches full production, 270 vehicles will be produced each day by two shifts. A finished vehicle is intended to leave the end of the assembly line every 3.6 minutes. The main objective of this study is to simulate the design and operational policies of the AAV assembly facility and to verify that the daily throughput requirements can be met. The simulation study also answered the following questions: What is the maximum throughput (capacity) of the facility? What is the daily distribution of throughput? Does the current design produce the required throughput of 270 cars per day? How do the buffers behave in terms of quantity fluctuations? What are the possible bottlenecks to the desired throughput? This paper provides a description of the integrated simulation model to analyze the capability of the production facilities at MBUSI. This paper includes the inputs used for the development of each of the three individual models: the Body Shop, the Paint Shop, and the Assembly Shop. Additionally, it includes descriptions of the model features and the assumptions that were made.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1078-1087
• /
• 2014

In the conventional centralized mobility management schemes, it can lead to single points of failure, occurrence of a bottleneck, since all data and control are concentrated on the mobility anchor which is located in home network. In the current research of distributed mobility management, it is doing research into distributed mobility management which is supported by distributed mobility anchors. Such schemes do not consider a failure of the mobility anchor. However, it could be an issue under tactical environment since it occur non-service problem due to anchor movement, maintenance, failure, etc. In this paper, we proposed new DMM scheme named T-DMM(Tactical-Distributed Mobility Management) which can support handover even if mobility anchor breaks down. From the numerical analysis, we evaluate signaling cost and handover latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1177-1184
• /
• 2014

An wired ship area network has functionality of remote control and autonomous management of various sensors and instruments embedded or boarded in a ship. For such environment, the DiffServ (Differentiated Services) realizes that the high-speed real-time flow with the higher priority has the guaranteed minimum data rate and is delivered faster. As a result of this DiffServ effect, the intelligent Ship Area Networks can be implemented. In this paper, an packet drop technique is proposed to outperform the previous RIO (RED In and Out) drop mechanism for DiffServ in ship area networks. the proposed packet drop technique does not manage the individual flows and divides them into several flow groups according to a criterion. And it guarantees the fairness between individual flows in the same QoS class through the group-based control. In simulation results of the proposed packet drop technique, the link utilization decreases than RIO. But it guarantees more data rates to DiffServ flows passing multiple bottleneck links.