• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.345-354
• /
• 2003

IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing control packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.

• Journal of Internet Computing and Services
• /
• v.3 no.5
• /
• pp.73-85
• /
• 2002

A new architecture coiled the Storage Area Network(SAN) was developed in response to the requirements of high availability of data, scalable growth, and system performance, In order to use SAN more efficiently, most SAN operating system support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually. A logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses, In this paper, we design and implement an efficient and flexible mapping method for logical volume manager. Additionally, to aid flexible mapping, we also design and implement free space management method, The mapping method in this paper supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add or remove storage devices to SAN even while the system is running.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.157-162
• /
• 2011

This study is about implementing wireless transferring system in pre-hospital cardiopulmonary resuscitation(CPR). Also, this study includes monitoring based feedback between patient and hospital to increase the survival rate of emergency patient by developing the performance of cardiopulmonary resuscitation in pre-hospital. It minimizes the loss of flow rate or gastric inflation through the space between the airway and the esophagus, which enables the inspiration-expiration rate to be measured more precisely. Due to these reasons this study applied ET insertion based respiratory sensor to measure flow rate. The main indices of artificial ventilation are justified from minute respiration(V), end-tidal $CO_2(E_TCO_2)$, and tracheal pressure($P_{tr}$). The simulation is performed to verify the bandwidth and delay time of transport network for in-hospital monitoring even as transporting images and voice information simultaneously. The total bandwidth is 815 kbps, and WLAN (IEEE 802.11x) is used as communication protocol. The network load is under 1.5% and the transmit delay time is measured under 0.3 seconds.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.89-100
• /
• 2000

Recently, studies on the mobile computing environments that enable mobile hosts to move while retaining its network connection are in progress. In these mobile computing environments, one of the necessary components is the distributed file system supporting mobile hosts, and there are several issues for the design and implementation of the shared file system. Among these issues, there are problems caused by network traffic on limited bandwidth of wireless media. Also, there are consistency maintenance issues that are caused by update-conflicts on the shared files in the distributed file system. In this paper, we propose TWB(Trickle Write-Back) scheme that utilizes weak connectivity for cache management of mobile clients. This scheme focuses on saving bandwidth, reducing waste of disk space, and reducing risks caused by disconnection. For such goals, this scheme lets mobile clients write back intermediate states periodically or on demand while delaying unnecessary write-backs. Meanwhile, this scheme is based on the existing distributed file system architecture and provides transparency.

• Tunnel and Underground Space
• /
• v.25 no.4
• /
• pp.303-319
• /
• 2015

Text mining is one of the branches of data mining and is used to find any meaningful information from the large amount of text. In this study, we analyzed titles and keywords of two SCI journals on rock engineering by using text mining to find major research area, trend and associations of research fields. Visualization of the results was also included for the intuitive understanding of the results. Two journals showed similar research fields but different patterns in the associations among research fields. IJRMMS showed simple network, that is one big group based on the keyword 'rock' with a few small groups. On the other hand, RMRE showed a complex network among various medium groups. Trend analysis by clustering and linear regression of keyword - year frequency matrix provided that most of the keywords increased in number as time goes by except a few descending keywords.

• Journal of Advanced Navigation Technology
• /
• v.12 no.1
• /
• pp.34-45
• /
• 2008

Broadcast encryption schemes are applied to transmit digital informations of multimedia, software, Pay-TV etc. in public network. User acquires message or session key to use key that broadcaster transmits, broadcaster need process that generation and distribution key in these process. Also, user secession new when join efficient key renewal need. In this paper, introduce about efficient key generation and distribution, key renewal method. The temporary conference environment base structure against an each mobile device wild gap. Without the transmission possible, it follows infrequent location change and with the quality where the key information change flow. Thus, in this paper, in order to apply to the embedded computing environment and the key generation and the efficient key renewal are done when the mobile device is used of the specify space it proposes.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.553-558
• /
• 2007

In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys' identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.4 no.4
• /
• pp.71-88
• /
• 2009

The Korean online gaming industry has seen rapid growth since the boom of information technology (IT) related industries, especially Internet and PC-bang or local area network (LAN) use, throughout the country. Online games are real-time games in which two or more players meet, compete, and cooperate in the same game space using the same communication network. Even though the growth rates of IT-related industries have recently slowed, the growth of the online gaming industry has increased, and Korean firms are expanding their businesses to countries all over the world. However, the online gaming industry is becoming an oligopoly, in which 4-5 leading companies occupy most online gaming markets. This situation presents a disadvantage to the Korean online gaming industry, since online players usually seek a diversity of online gaming contents and high quality online game services. Therefore, small- and medium-sized game developers must survive in this market by upgrading the quality of their online gaming services in an effort to provide differentiated goods and services in monopolistic competition markets. However, most venture companies in the online game industry, whether new or previously existing, are not able to obtain adequate financing. The objective of this paper is to examine the management environment for medium- and small-sized game developers in the Korean online gaming industry. By introducing the case of Grigon Entertainment, we try to identify the source of difficulty obtaining external financing for Korean venture firms in the online gaming industry.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.718-731
• /
• 2003

SAN(Storage Area Network) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use the SAN more efficiently, most of the SAN operating software supports storage virtualization concepts that allow users to view physical storage devices of the SAN as a large volume. A logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses. In this paper, we design and implement an efficient and flexible mapping method for the logical volume manager. Additionally we also design and implement a free space management method for flexible mapping. Our mapping method supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add or remove storage devices to and from the SAN even while the system is running. To justify our mapping method, we compare it with the mapping method of the GFS (Global File System) through various experiments.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.520-532
• /
• 2002

A new architecture called the Storage Area Network(SAN) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use SAN more efficiently, most SAN operating systems support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually. A logical volume manager plays a key role in storage virtualization. In order for mapping managers to process snap-shots and reorganizations, an efficient freespace manager is required, and it affects the overall performance of logical volume. In this thesis, we design and implement a freespace manager for logical volume manager. The freespace manager efficiently allocates physical blocks for logical blocks. Also, it processes space allocation requests for supports snapshots and reorganizations.