• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.47-53
• /
• 2016

A type of workflow affiliation network is one of the specialized social network types, which represents the associative relation between actors and activities. There are many methods on a workflow affiliation network measuring centralities such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. In particular, we are interested in the closeness centrality measurements on a workflow affiliation network discovered from enterprise workflow models, and we know that the time complexity problem is raised according to increasing the size of the workflow affiliation network. This paper proposes an estimated ranking algorithm and analyzes the accuracy and average computation time of the proposed algorithm. As a result, we show that the accuracy improves 47.5%, 29.44% in the sizes of network and the rates of samples, respectively. Also the estimated ranking algorithm's average computation time improves more than 82.40%, comparison with the original algorithm, when the network size is 2400, sampling rate is 30%.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

• 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.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.56-82
• /
• 2008

The topic on Flow is generating increased interests in e-commerce studies. Flow has been identified as a key component in e-commerce. Studies on Flow have so far focused on internet shopping mall, but scarcely looked at the Flow of Internet auction. The purpose of study is to find out which factors play a major role in building Flow on internet auction and how the built-up Flow affect Brand Equity. Therefore, the research model investigates what factors influence Flow. Furthermore, the research is designed to understand how the Flow influences Brand Equity. The antecedents of Flow classifies into three types such as personal (Challenge, Skill), IT characteristic, Internet Auction characteristic. The results of this empirical study shows that three characteristics significantly affected the flow：personal (Challenge), IT (information quality, system quality), and Internet Auction (interactivity). And also Flow has significant effect on the brand equity. This result indicates that customer's optimal experience is important to increase brand equity. That is, the flow is influenced by multi-dimensional factors and plays an important role in increasing brand equity. Finally, the finding of this study suggests that personal challenge, information quality, system quality, and interactivity should be enhanced preferentially.

• 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 트래픽을 신뢰성있게 분석할 수 있다는 것을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.301-303
• /
• 2003

본 논문에서는 인터넷 혼잡제어를 위한 새로운 방법을 제안한다. 라우터 큐에 예측제어함수를 적용하여 미래의 혼잡상황을 예측하고 소스에게 미리 피드백을 수행하여 혼잡제어를 한다. 예측제어함수는 실제 큐와 예측된 큐의 오차를 계산하여 주기적으로 예측함수를 갱신하는 NLMS 방식의 예측제어함수를 적용한다. 피드백 정보의 전송지연으로 인한 혼잡상황 악화가 발생하기 전에 혼잡상황에 대응할 수 있으므로 라우터 버퍼 사용효율의 최적함을 유지할 수 있으며 버퍼 오퍼플로우로 발생하는 패킷의 손실을 최소화 할 수 있다. 혼잡상황을 야기하도록 과도한 트래픽을 생성하여 라우터에서 예측함수를 적용하는 경우와 단지 혼잡알림제어를 수행하는 경우를 비교하여 시뮬레이션을 수행하였다. 예측함수를 적용하는 경우는 시스템 성능효율을 증가시키며 라우터 버퍼 크기를 최적하게 사용할 뿐만 아니라 오퍼플로우가 발생하지 않았으나 예측함수를 적용하지 않고 혼잡알림제어를 수행하는 경우는 과도한 큐 크기와 오버플로우가 발생하였음을 시뮬레이션을 통해서 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.252-255
• /
• 2011

인터넷 트래픽의 증가로 인해서 트래픽을 분석, 관리의 필요성이 높아졌다. 인터넷 트래픽의 분석은 크게 패킷 기반의 트래픽 분석과 플로우 기반의 트래픽 분석으로 나눌 수 있다. 증가한 트래픽 양으로 인하여 패킷 기반의 트래픽 분석보다 정확도는 낮지만 빠른 속도를 보장하는 플로우 기반의 트래픽 분석이 널리 이용되고 있다. 하지만 플로우 데이터 분석 서버를 새롭게 구축하거나 기존의 서버를 업그레이드 하는 경우 초기 설치 비용 및 서버 관리 비용이 증가한다. 증가한 비용을 낮추고 트래픽을 분석하는 사용자가 쉽게 사용할 수 있으며 확장 가능하고 고 가용성을 보장하는 Hadoop 기반의 트래픽 분석 시스템을 제안하고자 한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.5
• /
• pp.1271-1278
• /
• 2008

As the collaboration of WFMS(workflow management systems) in enterprises increases, security protocols could be considered a critical factor affecting secure operation of WMFS. The security protocol of WFMS could not reflect the nature of collaboration in WFMS, resulting to collaboration of WFMS on Internet causing the operation problems of WFMS. This study suggests collaboration based security protocols based on the collaboration of WFMS on Internet. To reflect the nature of collaboration in WFMS, this study analyzes security requirements for WFMS. Based on security requirements, this study suggests a security architecture and security protocols for WFMS using security agents.

• Journal of KIISE:Software and Applications
• /
• v.28 no.3
• /
• pp.249-261
• /
• 2001

웹 기반의 워크플로우 시스템은 기업간 전자상거래에 필수적인 요소로 부각되고 있다. 그러나 상이한 벤더들에 의해 제작된 워크플로우 엔진들은 상호운영성이 보장되지 않기 때문에 전자상거래의 제기능을 발휘하지 못한다. 이와 같은 문제를 해결하기 위한 노력으로 WfMC(Workflow Management Coalition)에서는 워크플로우 시스템간의 상호운영성을 위한 기본 명세를 제공하고 있으나, 인터넷상에서의 구체적인 활용방안은 제시되지 못하고 있다. 본 논문에서는 워크플로우 시스템 사이의 데이타 교환을 위한 프레임워크(WDEF : Workflow Data Exchange Framwork)를 제시한다. WDEF는 데이타 레지스트리를 중심으로 하여 워크플로우간 상호운영성을 제공하기 위한 메타데이타를 기술하고, 네트워크 상의 자원을 기술하기 위한 기반 기술인 RDF(Resource Description Framework)를 이용하여 워크플로우간의 메시지를 구성한다. 데이타 레지스트리를 이용함으로써, WDEF는 WfMC에서 정의하는 워크플로우 상호운영성을 위한 요구조건들을 모두 수용하면서 보다 확장성 있고 유연한 구조를 가지며, RDF에 기반한 자동적인 XML 인코딩을 통해 전자 상거래에 이용되는 다른 XML문서와도 완벽한 호환성을 가진다.

• Journal of Internet Computing and Services
• /
• v.20 no.1
• /
• pp.87-96
• /
• 2019

In this paper, we propose a MapReduce-supported clustering technique for collecting and classifying distributed workflow enactment event logs as a preprocessing tool. Especially, we would call the distributed workflow enactment event logs as Workflow BIG-Logs, because they are satisfied with as well as well-fitted to the 5V properties of BIG-Data like Volume, Velocity, Variety, Veracity and Value. The clustering technique we develop in this paper is intentionally devised for the preprocessing phase of a specific workflow process mining and analysis algorithm based upon the workflow BIG-Logs. In other words, It uses the Map-Reduce framework as a Workflow BIG-Logs processing platform, it supports the IEEE XES standard data format, and it is eventually dedicated for the preprocessing phase of the ${\rho}$-Algorithm that is a typical workflow process mining algorithm based on the structured information control nets. More precisely, The Workflow BIG-Logs can be classified into two types: of activity-based clustering patterns and performer-based clustering patterns, and we try to implement an activity-based clustering pattern algorithm based upon the Map-Reduce framework. Finally, we try to verify the proposed clustering technique by carrying out an experimental study on the workflow enactment event log dataset released by the BPI Challenges.