• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.113-130
• /
• 2002

In this paper, we developed DNL(Dynamic Network Loading) model based on Moving cell theory to analyze the dynamic characteristics of traffic flow in congested network. In this paper vehicles entered into link at same interval would construct one cell, and the cells moved according to Cell following rule. In the past researches relating to DNL model a continuous single link is separated into two sections such as running section and queuing section to describe physical queue so that various dynamic states generated in real link are only simplified by running and queuing state. However, the approach has some difficulties in simulating various dynamic flow characteristics. To overcome these problems, we present Moving cell theory which is developed by combining Car following theory and Lagrangian method mainly using for the analysis of air pollutants dispersion. In Moving cell theory platoons are represented by cells and each cell is processed by Cell following theory. This type of simulation model is firstly presented by Cremer et al(1999). However they did not develop merging and diverging model because their model was applied to basic freeway section. Moreover they set the number of vehicles which can be included in one cell in one interval so this formulation cant apply to signalized intersection in urban network. To solve these difficulties we develop new approach using Moving cell theory and simulate traffic flow dynamics continuously by movement and state transition of the cells. The developed model are played on simple network including merging and diverging section and it shows improved abilities to describe flow dynamics comparing past DNL models.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.53-60
• /
• 2009

In home network environments, the user authentication and authorization associated user's information and usability may be important security issue. The OSGi service platform, a well-known home network gateway already specifies the mechanism of that. The traditional authority method provided OSGi implements simple RBAC(Role Based Access Control) model. This is difficult to support efficient access control. In this paper, we propose the dynamic RBAC model based on OSGi. The proposed method describes the extended framework that manage two roles named as absolute role and relative role, extend existed framework with relative role and propose programming model to enable dynamic access control. Finally, we implement the proposed framework using AspectJ and Java annotation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.307-312
• /
• 2008

최근 전기 전력 도메인의 IT화 (전력 IT) 가 본격적으로 진행되면서 전기 데이터를 취득하기 위한 기기들 뿐만 아니라 전력 운영 환경이 변화를 도모하고 있다 본 논문에서는 이런 전력 IT 의 일환으로 개발된 지능형 전력 정보 모니터링 시스템 (K-WAMS)을 소개하고자 한다. 이 시스템은 이기종 분산 환경에서 전력 정보를 실시간으로 전송 받아 현재 전력계통의 상황을 직관적으로 판단할 수 있는 정보를 제공하여 광역 정전을 예방하고자 하는 조기경보시스템 (Early Warning System) 이다. 또한, 전력계통의 안정성 여부를 판단하는 지능형 에이전트의 구현을 통해 광역 정전을 예견하는 지수를 제공하고, 실시간 데이터 처리 및 이력 데이터 저장 에이전트들을 통해 현재 취득되고 있는 현장 데이터 모니터링 기능을 제공한다. K-WAMS 는 실시간으로 전송 처리되는 고속 대용량 데이터들의 처리 지연, 동적 환경으로 인한 네트워크의 부하문제를 해결하기 위해서 IPC Shared Memory 기법을 이용하였고, 동적 프로세스들의 작업 스케줄링을 관리하기 위한 IPC Message Queue 기법을 이용하였다. 또한 논리적 기능 기반으로 설계된 현재 중앙 급전소(GCC) 단위의 설계 모델은 향후 지역 급전소(RCC) 단위로 설치 될 경우 재사용 되어 개발 생산성을 향상시킬 것으로 예상된다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1844-1866
• /
• 2011

In a home network system, each customer electronic device has the control data format chosen by its manufacturing company and there are various types of digital devices and protocols. Besides the mutual operating environments among the various devices are dissimilar. Affected by the characteristics explained above, home network systems can hardly support the crucial functions, such as data compatibility, concurrency control, and dynamic plug-in. Thus, the home network system shows relatively poor reusability. In this paper, we suggest design technique of configurable framework, which can widely support the variability, to increase the reusability of the home network system. We extract the different parts of the home network system as variation points, and define them as the variability types. We design a structure of configurable framework, and suggest customization technique of configurable framework through selection technique and plug-in technique. Also, we prove the reusability by applying the proposed framework and it methods to real-world home network systems and analyzing the measurement results of these case studies using software metrics. We can expect the proposed approach provides better reusability than the existing them by analyzing those measurement results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1487-1490
• /
• 2002

최근 분산 컴퓨팅 환경은 급진적으로 광역화되고, 이질적이며, 연합형태의 광역 시스템 구조로 변화하고 있다. 이러한 환경은 네트워크상에 광범위한 서비스를 제공하는 통신 네트워크 기반에서 구현된 수많은 객체로 구성된다. 더욱, 지구상에 존재하는 모든 객체들은 이름이나 속성에 의해 중복된 특성을 갖는다. 이러한 같은 특성을 갖는 객체들은 중복 객체로 정의된다. 그러나 기존의 네이밍이나 트레이딩 메커니즘은 독립적인 위치 투명성이 결여로 중복된 객체들의 바인딩 서비스 지원이 불가능하다. 서로 다른 시스템 상에 존재하는 중복된 객체들이 동일한 서비스를 제공한다면, 각 시스템의 부하를 고려하여 클라이언트의 요청을 분산시킬 수 있다. 이러한 이유로 본 논문에서는 광역 컴퓨팅 환경에서 중복된 객체들의 위치 관리뿐만 아니라 시스템들간의 부하 균형화를 유지하기 위해서 최소부하를 갖는 시스템에 위치한 객체의 선정하여 동적 바인딩 서비스를 제공할 수 있는 새로운 모델을 설계하고 구현하였다. 이 모델은 네이밍 및 트래이딩 기능을 통합한 서비스에 의해 중복된 객체들에 대한 단일 객체 핸들을 얻는 부분과, 얻어진 객체핸들을 사용하여 위치 서비스에 의해 하나 이상의 컨택 주소를 얻는 부분으로 구성하였다. 주어진 모델로부터, 우리는 Naming/Trading 서비스와 위치 서비스에 의한 전체 바인딩 메커니즘의 처리과정을 나타내고, 통합 바인딩 서비스의 구성요소들에 대만 구조를 상세하게 기술하였다. 끝으로 우리의 모델을 구현하기 위해, 윈도우 운영체제와 Solaris 2.5/2.7에서 사용되는 CORBA 사양을 따르는 VisBroker 4.1과 자바 언어, SQL Server 2000 그리고 LSF를 이용하였다. 그리고 구현 환경과 구성요소에 대한 수행 화면을 보였다.ool)을 사용하더라도 단순 다중 쓰레드 모델보다 더 많은 수의 클라이언트를 수용할 수 있는 장점이 있다. 이러한 결과를 바탕으로 본 연구팀에서 수행중인 MoIM-Messge서버의 네트워크 모듈로 다중 쓰레드 소켓폴링 모델을 적용하였다.n rate compared with conventional face recognition algorithms. 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는 피험자의 머리 움직임에 의하여 도파민 유리가 과대평가되었으며 이는 이 연구에서 제안한 영상정합을 이용한 움직임 보정기법에 의해서 개선되

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.406-416
• /
• 2001

Single path routing schemes using dynamic routing metric amy find out the dynamic network status and recompute paths to keep the traffic from the highly loaded regions of the network. This type of routing approach, however, may lead to a routing oscillation, and further, it cannot exploit multi-paths that may frequently exist in the real network. We propose a multipath routing scheme with dynamic load balancing, called MP-DLB, which is capable of reducing the overhead incurred by the multipath routing with dynamic load balancing approach while taking advantage of the high routing performance provided by the approach. According to the analysis of Internet packet traces which show that a high percentage of network traffic is destined for a small number of networks, MP-DLB applies the multipath routing with dynamic load balancing only to a limited subset of all the destinations in the network. For the rest of the destinations, it applies traditional single path routing scheme. This approach may reduce overall routing overheads by limiting the number of destinations to apply the more complicated routing scheme while it can keep the routing performance high by providing efficient routing for the most significant traffic in the routing performance. A series of simulations are done to analyze the performance of MP-DLB. The simulation results show that MP-DLB may effectively cope with the congestion and achieve high routing performance by distributing traffic streams that are generated from varying sources and heading toward a specific hot destination over multi-paths.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.211-216
• /
• 2011

Networked virtual environments (NVEs) are distributed systems where geographically dispersed users interact with each other in virtual worlds by exchanging network messages. Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. A limited area called area of interest (AOI) in MMOG is reduced the load caused by message exchange between users. Voronoi-based Overlay Network (VON) is proposed to reduce the bandwidth consumption in P2P environments and Vorocast also is made using message forwarding in VON. We propose a dynamic AOI management method that solves problems such as a consistency and latency due to forwarding position updates to neighbor nodes from the message originator in forwarding scheme. Our scheme provides the consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The communication between a user and users existing in center circle within AOI of the user is directly connected and the communication between the user and users existing outside the center area within AOI is using Vorocast scheme. The proposed model is evaluated through simulations.

• The Journal of the Korea Contents Association
• /
• v.3 no.3
• /
• pp.63-73
• /
• 2003

Today, in exponential growth of internet, the importance of file caching which could reduce the sun load, the volume of network traffic, and the latency of response has emerged. Actually, in one network, the traffic has reduced by using the cache and this means that file caching can improve the internet environment by cost a fraction of link upgrades. In this paper, we address a dynamic cache group configuration policy, to solve the scalable problem. The simulation result shows that the cache group using our proposal policy reduces the latency of response time and it means that out cache group configuration is more scalable than the static cache configuration.