• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.397-404
• /
• 2009

In this paper, we propose a method of monitoring traffic and analyzing information of handover in mobile IPv6 networks. Our proposed method analyzes handover latency through monitoring packets at routers without installing monitoring applications at mobilenodes. For this purpose, we employ a flow-based traffic monitoring standard called IPFIX to perform the traffic measurement function the packets at the routers. Therefore, our method is useful in that we could easily obtain information regarding handover of mobile nodes by only monitoring traffic at the routers. In order to verify the proposed method, we carried out experiments in a real 802.11-based mobile IPv6 network testbed. From our experimental results, it was shown that the calculated handover latency for uploading traffic is accurate with less accuracy of analyzing the handover latency for downloading traffic.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.6
• /
• pp.89-98
• /
• 2006

Recently, grid computing environment has being changed to the service-oriented grid integrated with Web Services. In this architecture, there is the service-oriented grid application in which Grid Services are executed according to the workflow of the grid application. This implies that the grid scheduling method needs to consider grid service characteristics. Therefore, we propose the grid service performance model based on factors such as service availability, accessibility, reliability, throughput, and slowdown, and develop service scheduling method to increase performance of the service-oriented grid application.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.10
• /
• pp.421-426
• /
• 2013

As a greater amount of traffic have been generated on the Internet, it becomes more important to know the size of each flow. Many research studies have been conducted on the traffic measurement, and mostly they have focused on how to increase the measurement accuracy with a limited amount of memory. In this paper, we propose an explicit flow labeling technique that can be used to find out the names of the top flows and to increase the counting upper bound of the existing scheme. The labeling technique is applied to CSM (Counter Sharing Method), the most recent traffic measurement algorithm, and the performance is evaluated using the CAIDA dataset.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.109-118
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of workflow-based knowledge from workflow models, which is termed workflow-based affiliation network knowledge. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict a series of workflow-based knowledge from workflow models and their execution histories. So, this paper proposes a knowledge discovery algorithm which is able to discover workflow-based affiliation networks that represent the association and participation relationships between activities and performers defined in ICN-based workflow models. In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to derive its corresponding workflow-based affiliation network knowledge.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.283-285
• /
• 2005

인터넷 사용자의 증가와 항께 인터넷 트래픽 역시 기하급수적으로 증가하고 있다. 이에 따라 네트워크 보안, 트래픽의 특성 분석, 사용자별/응용별 과금, 및 트래픽 엔지니어링을 수행하기 위해서는 네트원크 모니터링 도구가 필수적이다. 그러나, 기존 연구에 많이 사용되고 있는 Cisco NetFlow v5는 포트번호를 기반으로 응용 트래픽을 분류하여 분석할 수 있지만, IPv6과 MPLS 등의 다양한 프로토콜에 대한 트래픽을 분석할 수는 없다. 따라서, IETF에서는 IPFIX표준을 제정하여 확장성 있고 SCTP/TCP 전송 프로토콜을 이용하여 신뢰성있는 플로우 측정 프레임워크를 제시하였다. 본 논문은 Cisco NetFlow v5와 NetFlow v9(IPFIX의 기본 프로토콜)를 모두 지원하여 IPv4/IPv6 트래픽을 실시간으로 분석할 수 있는 플로우 기반 트래픽 모니터링 도구를 구현하였고, 실험을 통하여 IPv6 트래픽을 신뢰성있게 분석할 수 있다는 것을 보였다.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.97-106
• /
• 2007

In this paper, the business process was easily modeled by distinguishing between the business process and work logic. Based on this model, B2Bi collaboration Workflow modeling tool, which facilitates collaboration, was designed and implemented. The collaboration workflow modeling tool consists of 3 components; business process modeling tool, execution engine and monitoring tool. First, a business process modeling tool is used to build a process map that reflects the business logic of an application in a quick and accurate manner. Second an execution engine provides a real-time execution environment for business process instance. Third, a monitoring tool provides a real-time monitoring function for the business process that is in operation at the time. In addition to this, it supports flexibility and expandability based on XML and J2EE for the linkage with the legacy system that was used previously, and suggests a solution for a new corporate strategy and operation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.19-21
• /
• 2005

분산되어 있는 고성능 컴퓨팅 자원과 대규모 데이터를 효과적으로 활용하기 위해서 최근에 그리드 환경에 대한 연구가 매우 활성화되었다. 그리드 자원을 활용하여 문제를 효율적으로 실행 및 관리하고 워크플로우 문제 모델을 지원하는 범용적인 문제풀이 환경은 더욱 중요해졌다. 고성능 GT2 기반에서 개발되었던 모니터링 정보가 제공되는 워크플로우 문제풀이 환경인 CEGA를 웹서비스 기반 그리드 미들웨어인 GT4 기반에서 포팅하고 웹서비스 기반 사용 편이한 문제 설계 및 실행환경 프로토타입을 구현한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.809-812
• /
• 2001

본 연구에서는 웹과 분산된 환경에서 신뢰할 수 있고 확장성 있는 워크플로우 관리 시스템의 구조와 워크플로우 관리 시스템의 핵심인 워크플로우 엔진의 구조를 설계하고 제안한 구조에 맞는 프로토타입 엔진을 구현하였다. 구현된 엔진은 다양한 Transition 타입을 지원하므로 실제 B2B환경에서 발생하는 다양한 형태의 비즈니스 타입을 지원한다. 또한 엔진 내의 인스턴트를 관리하는 인스턴트 관리자에 인스턴트들 사이의 처리 순서를 결정하는 인스턴트 스케줄링 기능이 들어있다. 이 인스턴트 스케줄링 기능은 인스턴트들을 사이에 우선순위를 부여한다든지 인스턴트의 실시간 보장을 위한 여러 관련 처리가 가능케 하여준다. 이외에 Invoked Application으로 웹 애플리케이션을 사용할 경우 Relevant Data를 어떻게 전달할 것인지, Notification 서비스, Monitoring 서비스 기능들을 고려하여 설계 및 구현하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.98-106
• /
• 2005

We propose a new wireless fair queueing algorithm, WFQ-R (Wireless Fair Queueing with Retransmission), which is well matched with the LLR (Link Level Retransmission) algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. Thus, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission under the MAC layer. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively and maximizes system throughput. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.1-7
• /
• 2016

When multiple applications are running concurrently on a multi-processor system, interferences between applications make it difficult to guarantee real-time constraints. We propose a novel interference analysis technique that allows sharing of share processors among dataflow applications, while satisfying real-time constraints. Based on the interference analysis, we develop a co-scheduling technique that aims to minimize the resource usage. Compared to an existent technique that involves converting application graphs to real-time tasks, the proposed technique shows better results in terms of resource usage, especially when it is applied to applications with tight time constraints.