• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.275-279
• /
• 2004

In this paper, a large-scale, wide-area storage system based on IP is proposed which is under development. OASIS is a storage system enforced with very high-scalability up to hundreds and thousands of clients over IP network, and it is able to extend the service to the wide area network. For this purpose, we adopt an storage interconnection technology based on IP, the object based storage technology and a clustered server architecture which provides high-scalability and availability to our system. This system can be utilized to provide network storage service which gains more reality with the incoming FTTH and WiBro services.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.578-585
• /
• 2001

IP Multicast that provides best-efforts service does not guarantee reliable delivery of multicast packets. In recent years, there are many approaches to support reliable multicast, but those are insufficient for implementing scalable and reliable multicast over Internet. We propose a Reliable Multicast Architecture(RMA) for scalable and reliable multicast. The RMA model guarantees reliability using a receiver initiated retransmission mechanism, and scalability using a feedback suppression mechanism by Multicast Router(MR). Furthermore, it utilizes underlying multicast routing information to minimize the cost of protocol modification and overheads. Our performance analyses show that RMA is much superior to previous works in the point of scalability and compatibility.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.123-128
• /
• 2011

As the global grid has grown in size, large-scale distributed data analysis schemes have gained momentum. Over the last few years, a number of methods have been introduced for allocating data intensive tasks across distributed and heterogeneous computing platforms. However, these approaches have a limited potential for scaling up computing nodes so that they can serve more tasks simultaneously. This paper tackles the scalability and communication delay for computing nodes. We propose a distributed data node for storing and allocating the data. This paper also provides data provisioning method based on the steady states for minimizing the communication delay between the data source and the computing nodes. The experimental results show that scalability and communication delay can be achieved in our system.

• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.41-50
• /
• 2012

In this research, we developed a scalable resource monitoring system for large scale scientific computing data centers. Usually, there are limitations and overheads for keeping track of every computing nodes because of the huge number of computing nodes. So, this research proposes a layered summarizing techniques during collection of all system resource information. The technique results in improved scalability by reducing the amount of information at higher layer. Our prototype system which is implemented with web service is applicable with the HTML5 mobile web technology on smart devices.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.58-70
• /
• 2008

Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. These previous schemes, however, must perform the authentication process one-by-one in hierarchical manner and thus are not fit to be used as primary authentication methods in sensor networks which require mass of multiple authentications at any given time. This paper proposes a new concept of public key-based authentication that can be effectively applied to sensor networks. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t, n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability. The performance advantages of this scheme on memory usage, communication overload and scalability compared to Merkle tree-based authentication are clearly demonstrated using performance analysis.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.25-30
• /
• 2010

Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.484-486
• /
• 2005

Passenger safety is a primary concern of railway system but, it has been urgent issue that dozens of people are killed every year when they falloff from train platforms. Recently, advancements in IT have enabled applying vision sensors to railway environments, such as CCTV and stereo camera sensors. In this paper, we propose a stereoscopic video coding scheme for subway accident monitoring system. The proposed scheme is designed for providing flexible video among various displays, such as control center, station employees and train driver. We uses MPEG-2 standard for coding the left-view sequence and IBMDC for predicting the P- and B-types of frames of the right-view sequence. IBMDC predicts matching block by interpolating both motion and disparity predicted macroblocks. To provide efficient stereoscopic video service. we define both temporally and spatially scalable layers for each eye's-view by using the concept of Spatio-Temporal scalability. According to the experimental results. we expect the proposed functionalities will play a key role in establishing highly flexible stereoscopic video codec for ubiquitous display environment where devices and network connections are heterogeneous.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.327-334
• /
• 2015

Various types of middle-ware were created for integration between legacy systems and newly built systems. RPC(Remote Procedure Call), MOM(Message Oriented Middle-ware) and TM(Transaction processing Monitor) are the typical types of middle-ware. One of the most known MOM type middle-ware is PS(Publish/Subscribe). PS enables to create a system which has low coupling and high scalability. But PS based systems also have low cohesiveness. On the contrary, RPC has high cohesiveness but also has high coupling. This paper proposed design and implementation of hybrid model which offset disadvantages of RPC and PS.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.107-114
• /
• 2017

In beacon-enabled mode, beacon collision is a significant problem for the scalability of cluster-tree wireless sensor networks. In this paper, multi-channel time division scheduling (MCTS) is proposed to prevent beacon collisions and provide scalability. A coordinator broadcasts a beacon frame, including information on allocated channels and time-slots, and a new node determines its own channel and time-slot. The performance of the proposed method is evaluated by comparing the proposed approach with a typical ZigBee. MCTS prevents beacon collisions in cluster-tree wireless sensor networks. It enables large-scale wireless sensor networks based on a cluster tree to be scalable and effectively constructed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.17-27
• /
• 2011

In recent years, the interest and research for Future Internet are rapidly increasing. In domestic, MOFI (Mobile Oriented Future Internet) is proposed as one architecture of Future Internet. MOFI is a data transmission architecture which provides a mobility, name-based communication and routing scalability. In this paper we implement a basic MOFI testbed that supports HID-based communication, and verify the feasibility of HID-based communication through experimentation of general service such as PING and WWW service. We used "VirtualBox" as a virtual machine and implement a packet processing and a HCP header addition and translation function using "Click Modular Router".