• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.62-64
• /
• 2000

레이다 빔 스케쥴러는 레이타의 전체적인 운용과 제어를 담당하는 레이다 통제기의 핵심기능으로서 레이다의 운용시간 및 송신 전력 등 한정된 가용 자원을 효율적으로 관리하기 위한 최적화 기법이 매우 중요하다. 본 논문은 충남대에서 개발한 실시간 운용체제인 iRTOS를 기반으로 하여 방위각 방향은 기계적 회전을 하고 고각 방향은 위상을 가변하여 다수의 위협 표적을 실시간으로 탐지하고 추적하는 회전형 3차원 위상배열 레이다에 적용 가능한 레이다 빔 스케쥴러의 구현 알고리즘에 관한 내용이다. 제안된 레이다 빔 스케쥴러는 우선 순위를 갖는 핵심적인 스케쥴링 태스크와 이를 보조하기 위한 다수의 기능 태스크를 정의하고 생성하였으며 태스크간 데이터 교환을 위하여 인터럽트 처리, 시간 관리, 세마포어 및 메시지 큐 등을 적용하였다. 레이다 빔 스케쥴러의 성능을 검증하기 위하여 다수의 모의 표적을 발생시켜 빔 스케쥴러의 상태와 성능을 확인하였으며, 자체 개발한 실시간 운용체제인 iRTOS를 이용하여 3차원 레이다 빔 스케쥴러를 구현할 수 있음을 확인하였다.

• 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 the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2371-2377
• /
• 2010

As the substantial increment in program complexity and appearance of mega program, the programs need to be divided to small tasks with multiple partitions and performed with a priority based scheduling. And also, a program development has to be progressed according to diversify of development environment. For instance, there are some restrictions upon O/S environment such as embedded O/S or windows. Therefore, the adaptive scheduling technique which performs multiple task partitioning process, regardless environment or O/S, is suggested. In this study, In this study, the adaptive scheduling technique algorithm and its applied examples are described.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.45-56
• /
• 2010

This paper reports a new mechanism for congestion controls. The proposed congestion detection algorithm can be provided with delay and unnecessary energy consumption. Conventional congestion control methods decide congestion by queue occupancy or mean packet arrival rate of MAC layer only, however, our method can perform precise detection by considering queue occupancy and mean packet arrival rate. In addition, the congestion avoiding method according to congestion degree and scheduling method using priority for real time packets are proposed. Finally, simulation results show that proposed congestion detection and control methods outperforms conventional scheduling schemes for wireless sensor network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.477-482
• /
• 2007

최근 다양한 P2P 프로그램을 많이 사용함에 따라 네트워크에서 생겨나는 트래픽의 상당 부분이 P2P가 발생시키는 트래픽으로 이미 HTTP, FTP의 양을 훨씬 뛰어넘고 있다. 현재 인터넷 환경에서 방화벽을 통과하기 위해 포트번호를 변경하여 통신을 하는 새로운 P2P응용들의 행동들은 전통적인 well-known port 기반의 응용프로그램을 구분하는 단순한 분석 방법만으로 신뢰하기가 어렵다. 새로운 P2P 응용들과 같은 트래픽 모니터링의 정확도를 높이기 위해서는 TCP/IP 헤더만이 아니라 패킷이 담고 있는 페이로드 내용에 대한 조사 차원의 모니터링 방법이 필요하다. 본 논문에서는 TCP/IP 헤더 정보와 더불어 패킷의 페이로드 내용을 조사하여 P2P 트래픽을 탐지하는 모니터링 기법을 제안한다. 이어 탐지되는 P2P 트래픽에 대하여 Linux Netfilter Framework의 Queuing Discipline에서 제공하는 계층적인 우선순위 큐를 사용하여 일정한 양의 대역폭을 할당하는 정책을 적용함으로써 안정적이면서 효율적인 네트워크 운용 방안을 제시한다.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.169-176
• /
• 2008

In this paper, we develop radio resource management queueing model in IEEE 802.IS networks considering both connection and packet level. In the upper level connection, we model connection admission control depending on availability of bandwidth and priority queue in each service class. In the lower level packet, we model dynamic bandwidth allocation considering threshold and availability of bandwidth in each service class simultaneously. Hierarchical model is built using an extended Petri Nets, SRN (Stochastic Reward Nets). Bandwidth utilization and normal throughput as performance index for all service classes of traffic are calculated and numerical results are obtained.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1559-1566
• /
• 2017

Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.249-257
• /
• 2008

This paper shows the Applied Q-learning Algorithm which supports selecting the waiting position of a robot and the part serviced next in the Flexible Manufacturing Cell (FMC) that consists of one robot and various types of facilities. To verify the performance of the suggested algorithm, we design the general FMC made up of single transfer robot and multiple machines with a simulation method, and then compare the output with other control methods. As a result of the analysis, the algorithm we use improve the average processing time and total throughputs as well by increasing robot utilization, reversely, by decreasing robot waiting time. Furthermore, because of ease of use compared with other complex ways and its adoptability to real world, we expect that this method contribute to advance total FMC efficiency as well.