• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.850-852
• /
• 2003

이 논문에서는 여러 가지 도구를 논리적인 순서로 사용함으로써 이루어지는 작업을 워크플로우로 보고, 이러한 관점에서 바이오인포매틱스 도구를 통합하는 새로운 멀티에이전트 시스템을 제안한다. 제안한 시스템은 기존의 도구를 랩퍼 에이전트로 구현하고, 에이전트간의 통신은 XML 형식의 메시지로 이루어진다. 수신 에이전트는 송신 에이전트가 전송하는 정보를 명시적으로 알리지 않고도 메시지로부터 필요한 정보를 추출할 수 있다. 제안한 시스템의 이러한 특징은 바이오인포매틱스 도구와 데이터베이스의 통합을 용이하게 한다. 또한, 제안한 시스템에서는 워크플로우를 여러 가지 제어 구조를 이용하여 정의할 수 있으며. 워크플로우 진행을 모니터링할 수 있는 기능을 제공한다. 제안한 시스템의 가용성을 보이기 위해 박테리아 Sphingomonas Chungbukensis DJ77 의 유전자 주해(gene annotation) 작업에 제안한 시스템을 적용하여 구현하고 있다.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.1-12
• /
• 2015

To realize futuristic services with agility, the role of the experimental facility (i.e., testbed) based on integrated resources has become important, so that developers can flexibly utilize the dynamic provisioning power of software-defined networking and cloud computing. Following this trend, an OpenFlow-based SDN testbed environment, denoted as OF@TEIN, connects multiple sites with unique SmartX Racks (i.e., virtualization-enabled converged resources). In this paper, in order to automate the multi-point L2 (i.e., Ethernet) inter-connection of OpenFlow islands, we introduce an automated tool to configure the required Network Virtualization using Generic Routing Encapsulation (NVGRE) tunneling. With the proposed automation tool, the operators can efficiently and quickly manage network inter-connections among multiple OpenFlow sites, while letting developers to control their own traffic flows for service realization experiments.

• Journal of the Korean Recycled Construction Resources Institute
• /
• v.5 no.4
• /
• pp.129-136
• /
• 2010

This study is to investigate experimentally the engineering characteristics of cement mortar according to the replacement method and contents of recycled aggregate powder (RP) by collecting the recycled aggregate powder with the maximum size of below 0.08 mm and 0.15 mm. then, the results of the study can be summarized as follows. The flow of flesh mortar represented a trend in decreasing while the recycled aggregate powder was substituted as it is compared with that of plain. In addition, in case of correlation between tests, it appeared that the correlation between flow and ring flow is big. In the case of the characteristics of hardened mortar, the strength showed more improvements as the RP was substituted to aggregate than the case, which is substituted to aggregate. In addition, it was verified that the results in which the RP was substituted to aggregate by 5% represented similar values to that of the plain according to the passage of age.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.461-471
• /
• 2004

Recently, subscribers have strong desire to get QoS based personalized services in high-speed Internet access. Service providers have been rapidly replacing ADSL, cable broadband access networks with Metro-Ethernet based VDSL. But, it is difficult for Motto-Ethernet based broadband access networks to provide QoS based personalized services, because already deployed network elements cannot distinguish subscribers by specific traffic characteristics. In this paper, when the access network has tree topology, we show that it is possible to provide QoS for each downstream flow with only per flow traffic shaping at the edge node without QoS functions in access networks. In order to show that our suggested scheduling algorithm at the edge node can support the assured service in tree topology access networks, we evaluated its performance by simulation. The suggested scheduling algorithm can shape per-flow traffic based on the maximum bandwidth, and guarantees minimum bandwidth per flow by modifying the DRR scheduler. Simulation results show that congestion and loss in the access network elements are greatly reduced, TCP performance is highly enhanced and loss for assured CBR service flows is reduced by only shaping per-flow traffic at the edge node using our proposed scheduling algorithm.

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

IEEE 802.16 광대역 무선 접속망에서 QoS 보장을 위한 스케줄링 기법은 매우 중요하고 활발히 연구되고 있는 분야중 하나이다. 현재 IEEE 802.16 표준에 QoS 보장을 위한 메커니즘들이 정의되어 있지만 실제로 이것에 대한 시스템 구현은 설계자의 몫이다. 또한 기존에 제안 되었던 메커니즘은 각 커넥션들이 요구하는 서비스 품질을 만족시키지 못 하고 있다. 특히 딜레이에 민감한 rtPS 서비스 플로우에 대한 특성화된 스케줄링 매커니즘의 필요성이 대두되고 있다. 따라서 본 논문은 IEEE 802.16 표준에 정의된 4가지 QoS Class들중 실시간 서비스 및 멀티미디어 서비스 클래스인 rtPS 클래스에 대하여 각각의 커넥션이 높은 QoS를 만족할 있도록 ACK 정보를 이용한 스케줄링을 제안한다. 최종적으로 NS-2 시뮬레이터를 이용한 실험결과를 통해 성능 향상 시키는 것을 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11B
• /
• pp.1920-1927
• /
• 2000

본 논문은 cepstral 필터를 이용하여 지적인 비주얼 센싱을 위한 카메라의 운동 제어법을 제안한다. 화상은 pursuit 운동을 위하여 물체의 옵티컬 플로우가 필요하고, vergence 운동을 위하여 양안시차 정보를 필요로 한다. 그러나, 화상정보에는 올바른 정보와 잘못된 정보가 존재하기 때문에 해의 올바른 시차를 선택해야 하는데, 옵티컬 플로우의 계산에서와 마찬가지로 템플리트 매칭을 이용하여 올바른 정보를 선택한다. 그리고, 화상 중의 하나를 3 조각으로 분할한 후 각각 cepstral 필터링에 의하여 양안시차를 검출한다. 본 논문은 saccade 운동, pursuit 운동, vergence 운동에 관한 제어 알고리즘을 제안하고, 실험에 의하여 알고리즘을 비교 및 분석한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1047-1054
• /
• 2022

With the advent of SDN, a next-generation network technology that separates the hardware and software areas of network equipment and defines the network using open source-based software, it solves the problems of complexity and scalability of the existing network system. It is now possible to configure a custom network according to the requirements. However, it has a structural disadvantage that a load on the network may occur due to a lot of control communication occurring between the controller and the switch, and many studies on network load distribution to effectively solve this have been preceded. In particular, in previous studies of load balancing techniques related to flow tables, many studies were conducted without consideration of flow entries, and as the number of flows increased, the packet processing speed decreased and the load was increased. To this end, we propose a new network load balancing technique that monitors flows in real time and applies dynamic flow management techniques to control the number of flows to an appropriate level while maintaining high packet processing speed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1655-1665
• /
• 2017

Recently data centers are being constructed actively by many cloud service providers, enterprises, research institutes, etc. Generally, they are built on tree topology using ECMP data forwarding scheme for load balancing. In this paper, we examine data center network topologies like tree topology and fat-tree topology, and load balancing technologies like MLAG and ECMP. Then, we propose a scheduling algorithm to efficiently transmit particular files stored on the hosts in the data center to the destination node outside the data center, where fat-tree topology and OpenFlow protocol between infrastructure layer and control layer are used. We run performance analysis by numerical method, and compare the analysis results with those of ECMP. Through the performance comparison, we show the outperformance of the proposed algorithm in terms of throughput and file transfer completion time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.836-841
• /
• 2002

Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.172-182
• /
• 2008

Application Contents of based on a workflow process unit in grid system is a practical work to solve the problem. To construct cooperation environment is very important because the contents are deployed and executed. And the most of cooperation is executed by workflow. Globus toolkit is the middleware for cooperation process in grid environment. However the middleware only provides basic services for constructing grid, not workflow that can provides cooperation, job scheduling, application contents management. Also Globus toolkit is suitable for huge gird community but small size pc based grid community. Therefore, this paper proposes the efficient application contents deployment system for small sizes cooperation. This system supports efficient cooperation environment with Application contents deployment and resource management provided in grid community. Also it presents information and association relation among application contents with association dictionary among application contents based on workflow process unit, and utilizes this as information for application contents deployment.