• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.876-880
• /
• 2009

A control flow graph(CFG) is an essential data structure for program analyses based on graph theory or control-/data- flow analyses. Esterel is an imperative synchronous language and its synchronous parallelism makes it difficult to construct a CFG of an Esterel program. In this work, we present a method to construct over-approximated CFGs for Esterel. Our method is very intuitive and generated CFGs include not only exposed paths but also invisible ones. Though the CFGs may contain some inexecutable paths due to complex combinations of parallelism and exception handling, they are very useful for other program analyses.

• Journal of Korean Society of Transportation
• /
• v.14 no.3
• /
• pp.127-141
• /
• 1996

This paper presents a unique approach to urban traffic network signal control. This paper begins with an introduction to traffic control in general, and then goes on to describe the approach of fuzzy control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic network condition and adjacent intersection. The signal timing parameters evolve dynamically using only local information to improve traffic signal flow. The signal timing at an intersection is defined by three parameters : cycle time, phase split, off set. Fuzzy decision rules are used to adjust three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. In this paper the effectiveness of this method is showed through simulation of the traffic signal flow in a network of controlled intersection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1520-1524
• /
• 2000

TCP congestion control algorithm prevents network congestion through the control of outgoing traffic size. The network, therefore, should monitor the incoming traffic size of a TCP to determine whether or not a TCP follows standard congestion control algorithms. Some TCP friendly test algorithms are proposed, But, these algorithms cannot be used in real environments because a router in a network does not know the RTT of a TCP flow. In this study, we propose a new RTT determination algorithm that can be used in a router. Our proposed algorithms is validated through the simulation studies.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.17-24
• /
• 2016

In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of Advanced Navigation Technology
• /
• v.27 no.2
• /
• pp.173-181
• /
• 2023

Aircraft carriers need to maintain an orderly flow of aircraft in order for military ships to conduct combat through aircraft. Maintaining aircraft flow is an important factor in strengthening ship and aviation safety. In order to maintain aircraft flow, it is essential to develop a state-of-the-art air control system that provides higher quality control information by simultaneously accommodating radar-based monitoring information and monitoring information based on CNS integrated technology. Based on this point, this study describes the function and operation method of specific control equipment for the operation of the Aviation Support System and Air Traffic Control System required to operate light aircraft carriers in Korea based on overseas cases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.655-664
• /
• 2002

In many data-parallel applications massive parallelism can be easily extracted through data distribution. But it often causes very long communication latency. This paper shows that task parallelism, which is extracted from data-parallel programs, can be exploited to hide such communication latency Unlike the most previous researches over exploitation of task parallelism which has not been considered together with data parallelism, this paper describes exploitation of task parallelism in the context of data parallelism. PCFG(Parallel Control Flow Graph) is proposed to represent a multithreaded program consisting of a few task threads each of which can include a few data-parallel loops. It is also described how a PCFG is constructed from a source data-parallel program through HDG(Hierarchical Dependence Graph) and how the multithreaded program can be constructed from the PCFG.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.257-264
• /
• 2001

We developed a SIFG (Slice-based Information Graph), which modelled the information flow on program on the basis of the information flow of data tokens on data slices. Then we defied a SCM (Slice-based complexity measure), which measured the program complexity by measuring the complexity of information flow on SIFG. SCM satisfied the necessary properties for complexity measure proposed by Briand et al. SCM could measure not only the control and data flow on program but also the physical size of program unlike the existing measures.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.168-170
• /
• 2014

SDN(Software Defined Networking)은 프로그래밍을 통해 네트워크 경로 설정과 제어 및 기존에 복잡했던 운용관리를 처리할 수 있게 해주는 기술이다. 하지만 중앙 집중 식으로 관리하는 특성에 따라 병목현상이 발생할 수 있으며, 이는 컨트롤러에 트래픽이 집중되고 제어 명령을 지연시키는 문제가 있다. 본 논문은 이러한 문제점을 개선하고자 확장성 있는 메시지 플로우 제어 메커니즘을 제안한다. 이 방법은 기존 스위치와 다르게 목적지만을 저장하는 Table 을 별도로 관리하여 동일한 목적지로 전송되는 패킷에 대해 반복되는 제어 메시지를 감소시킨다. 이를 통해 컨트롤러의 역할을 스위치로 분산하여 Control Plane 트래픽에 대한 부하를 줄일 수 있고, 패킷 전송 Delay, Flow Setup 동안 발생하는 Latency 의 문제점을 효율적으로 개선 할 수 있다.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.44-53
• /
• 2015

Control flow information is useful in the analysis and comparison of programs. Virtualization-obfuscation hides control structures of the original program by transforming machine instructions into bytecode. Direct examination of the resulting binary reveals only the structure of the interpreter. Recovery of the original instructions requires knowledge of the virtual machine architecture, which is randomly generated and hidden. In this paper, we propose a method to reconstruct original control flow using only traces generated from the obfuscated binary. We consider traces as strings and find an automaton that represents the strings. State transitions in the automaton correspond to the control transfers in the original program. We have shown the effectiveness of our method with commercial obfuscators.