• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.489-491
• /
• 2005

This paper presents the application study of substation automation protocol, IEC 61850 to digital relay (HiMAP). Especially, it implements the data modeling, ACSI definition, GOOSE, MSVCB and data service required in the existing digital relay. To verify the system performance, we develop the process emulator and HiMAP emulator, and describe the results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3352-3365
• /
• 2012

Group key agreement (GKA) is a cryptographic primitive allowing two or more users to negotiate a shared session key over public networks. Wu et al. recently introduced the concept of asymmetric GKA that allows a group of users to negotiate a common public key, while each user only needs to hold his/her respective private key. However, Wu et al.'s protocol can not resist active attacks, such as fabrication. To solve this problem, Zhang et al. proposed an authenticated asymmetric GKA protocol, where each user is authenticated during the negotiation process, so it can resist active attacks. Whereas, Zhang et al.'s protocol needs a partially trusted certificate authority to issue certificates, which brings a heavy certificate management burden. To eliminate such cost, Zhang et al. constructed another protocol in identity-based setting. Unfortunately, it suffers from the so-called key escrow problem. In this paper, we propose the certificateless authenticated asymmetric group key agreement protocol which does not have certificate management burden and key escrow problem. Besides, our protocol achieves known-key security, unknown key-share security, key-compromise impersonation security, and key control security. Our simulation based on the pairing-based cryptography (PBC) library shows that this protocol is efficient and practical.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.625-632
• /
• 2005

Recently, real time services have been demanding a lot and the number of mobile devices is increasing extremely. Many researchers are focusing on decreasing handoff or signaling cost, produced when mobile devices are moving around. With these efforts, HMIPv6(Hierarchical Mobile Internet Protocol Version 6) was proposed. Mobile nodes do not need to register their locations to Home Agents whenever crossing over subnets within a MAP domain. In HMIPv6, mobile nodes choose the farthest MAP without considering node mobility pattern. However, a large MAP domain is not always efficient for a slow moving node and required additional work to choose a MAP in HMIPv6. Hence, this paper proposes 'Performance Analysis of HMIPv6 applying adaptive MAP Domain Site'.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.351-359
• /
• 2009

Recently with increase of data in the Internet, platform technologies that can process huge data effectively such as Google platform and Hadoop are regarded as worthy of notice. In this kind of platform, there exist network I/O overheads to send task outputs due to the MapReduce operation which is a programming model to support parallel computation in the large cluster system. In this paper, we suggest applying of TIPC (Transparent Inter-Process Communication) protocol for reducing network I/O overheads and increasing network performance in the distributed computing environments. TIPC has a lightweight protocol stack and it spends relatively less CPU time than TCP because of its simple connection establishment and logical addressing. In this paper, we analyze main features of the Hadoop-based distributed computing system, and we build an experimental model which can be used for experiments to compare the performance of various protocols. In the experimental result, TIPC has a higher bandwidth and lower CPU overheads than other protocols.

• Spatial Information Research
• /
• v.15 no.1
• /
• pp.15-23
• /
• 2007

Recently, Korea became the first country which started Terrestrial-DMB service. The DMB service is still at a very early stage throughout the world. At this stage, it is an important issue to develop DMB contents which distinguish DMB from traditional broadcasting by utilizing DMB's mobility. In this paper, we will propose outline of map service through DMB along with related services such as traffic and location information. This outline includes the map service protocol and map data structure for DMB. There is little research at the moment related to it, and this preliminary research enables map service through DMB. A map service would bring DMB a distinct advantage over traditional broadcasting. Moreover, further services based on broadcasting network and mobility would contribute to rapid growth of DMB.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.586-590
• /
• 2009

The objective of this paper describes the design of MapReduce over Peer-to-Peer network for dynamic environments applications. MapReduce is a software framework used for Cloud Computing which processing large data sets in a highly-parallel way. Based on the Peer-to-Peer network character which node failures will happen anytime, we focus on using a DHT routing protocol which named Pastry to handle the problem of node failures. Our results are very promising and indicate that the framework could have a wide application in P2P network systems while maintaining good computational efficiency and scalability. We believe that, P2P networks and parallel computing emerge as very hot research and development topics in industry and academia for many years to come.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.9
• /
• pp.828-837
• /
• 1991

본 논문에서는 CCITT에서 채택된 X.2.5 network과 IBM이 채택한 System network architecture(SNA)의 synchronous data link control(SDLC)간의 protocol converter의 성능 분석을 한다. 여기서 protocol converter의 link level map-ping method를 사용하여 구현 되었다고 가정한다. 성능 분석을 통하여 각종 parameter에 대한 throughput과 mean waiting time을 구하며, 다양한 paramerter에 대하여 최적의 값을 조사한다. 특히 converter가 추정한 SDLC frame이 X.25. network packetizing과 규정한 최대 data packet size 보다 더 클 경우에 frame을 분할하게 되는데. 분할방식에 있어서 full and remainder packetzing과 equal packetizing 도입하여 서로간의 성능을 비교한다. message를 분할 할 때 조격으로 나누는 것이 frame의 오류를 줄일 수 있기 때문에 전자보다 후자가 성능면에서 우수함을 알 수 있다.

• Journal of the Korean Society for Precision Engineering
• /
• v.3 no.1
• /
• pp.13-19
• /
• 1986

자동제조공정 자동화를 추진하고 있는 GM사는 앞으로 5 년내에 생산 System에 컴퓨터를 활용하는 기술개발에 수백만불을 투입한다고 한다. 생산에서 컴퓨터 황용기술은 종래의 설계소요시간을 단축하는것 외에도 날로 불어나는 설계조건을 쉽게 처리하여 설계의 집적 도를 높이는 효과 그리고 FA의 효율, 기능, 유연성에 있어서도 효과적이라는 것이다. 즉, MAP는 CIM(Computer Integrated Manufacturing)의 구현에의 길목에서 처리하고 지나가야 될 숙명적인 과제라 할 수 있다.

• Journal of Korean Society of societal Security
• /
• v.2 no.1
• /
• pp.75-80
• /
• 2009

The objectives of this research are to develop hazard prediction map S/W for mountain river road. This mountain river road disaster happens by debris flow, landslide, debris accumulation and this cause are locally rainfall and heavy rainfall. System is constructed to GIS base. This research app lied to Kangwondo. We developed protocol to analyze calamity danger in mountain district area and examined propriety system. Furthermore examined the DB required and expression plan for hazard map creation SW construction by mountain rivers road.

• Journal of Internet Computing and Services
• /
• v.15 no.3
• /
• pp.45-52
• /
• 2014

The Ubiquitous-City (U-City) is a smart or intelligent city to satisfy human beings' desire to enjoy IT services with any device, anytime, anywhere. It is a future city model based on Internet of everything or things (IoE or IoT). It includes a lot of video cameras which are networked together. The networked video cameras support a lot of U-City services as one of the main input data together with sensors. They generate huge amount of video information, real big data for the U-City all the time. It is usually required that the U-City manipulates the big data in real-time. And it is not easy at all. Also, many times, it is required that the accumulated video data are analyzed to detect an event or find a figure among them. It requires a lot of computational power and usually takes a lot of time. Currently we can find researches which try to reduce the processing time of the big video data. Cloud computing can be a good solution to address this matter. There are many cloud computing methodologies which can be used to address the matter. MapReduce is an interesting and attractive methodology for it. It has many advantages and is getting popularity in many areas. Video cameras evolve day by day so that the resolution improves sharply. It leads to the exponential growth of the produced data by the networked video cameras. We are coping with real big data when we have to deal with video image data which are produced by the good quality video cameras. A video surveillance system was not useful until we find the cloud computing. But it is now being widely spread in U-Cities since we find some useful methodologies. Video data are unstructured data thus it is not easy to find a good research result of analyzing the data with MapReduce. This paper presents an analyzing system for the video surveillance system, which is a cloud-computing based video data management system. It is easy to deploy, flexible and reliable. It consists of the video manager, the video monitors, the storage for the video images, the storage client and streaming IN component. The "video monitor" for the video images consists of "video translater" and "protocol manager". The "storage" contains MapReduce analyzer. All components were designed according to the functional requirement of video surveillance system. The "streaming IN" component receives the video data from the networked video cameras and delivers them to the "storage client". It also manages the bottleneck of the network to smooth the data stream. The "storage client" receives the video data from the "streaming IN" component and stores them to the storage. It also helps other components to access the storage. The "video monitor" component transfers the video data by smoothly streaming and manages the protocol. The "video translator" sub-component enables users to manage the resolution, the codec and the frame rate of the video image. The "protocol" sub-component manages the Real Time Streaming Protocol (RTSP) and Real Time Messaging Protocol (RTMP). We use Hadoop Distributed File System(HDFS) for the storage of cloud computing. Hadoop stores the data in HDFS and provides the platform that can process data with simple MapReduce programming model. We suggest our own methodology to analyze the video images using MapReduce in this paper. That is, the workflow of video analysis is presented and detailed explanation is given in this paper. The performance evaluation was experiment and we found that our proposed system worked well. The performance evaluation results are presented in this paper with analysis. With our cluster system, we used compressed $1920{\times}1080(FHD)$ resolution video data, H.264 codec and HDFS as video storage. We measured the processing time according to the number of frame per mapper. Tracing the optimal splitting size of input data and the processing time according to the number of node, we found the linearity of the system performance.