• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.4
• /
• pp.151-157
• /
• 2012

This paper implements an effective attendance management and monitoring system utilizing the RFID(Radio Frequency IDentification) and Smart phone for student. In this paper, RFID system use 13.56MHz to control the attendance, and we can show that information of RFID and dynamic image through IP camera in Smart phone. We also make up the contents and database utilizing the labview program in computer. Especially, proposed technique can obtain dynamic image by server implementation at real time basis so that it is possible to use simultaneously several Smart phone. From the various and practical experiment, it is confirm that proposed system is useful for attendance management and remotely monitoring.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.21 no.4
• /
• pp.331-339
• /
• 2003

It is difficult for the road management system to give a correct road information because road facilities are differently managed according to each object. In this study, we have solved this problem of road information management and, developed a system which is able to integrate various data of facilities and to maintain the latest property of data by introducing server-client network structure for managing road facilities more efficiently. And, we have shown the affairs of the road information management could be achieved scientifically, by the integration of graphic, attribute and photograph information relevant to road. This enabled the connection of graphic data and the stereo drawing composition, and enhanced the feeling of real world experience using the dynamic image data of the road.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1144-1150
• /
• 2015

Presence information provides various informations about users such as on-line status, current location, network connection method and connection address, and there are two kinds of presence information, SIP(Session Initiation Protocol) based presence information and XMPP(Extensible Massaging and Presence Protocol) based presence information. In this paper, a multiple server architecture that can handle these two kinds of presence information has been proposed. In this architecture, severs are added dynamically according to number of users to provide system scalability, and load of each server can be effectively controlled. In this system, a new XMPP stanza architecture and presence information data format are designed for load control. Furthermore message exchanging procedures between servers and users for dynamic server control has been also suggested. The performance of the proposed system has been analysed by simulation.

• Journal of Digital Convergence
• /
• v.12 no.2
• /
• pp.335-341
• /
• 2014

To play the networked video contents in a client's mobile device in real time, the contents should be delivered to it by the contents server with streaming technology. Generally, in a server-client based commerce model, the server is in charge of both the authentication of the paid customer and distribution of the contents. The drawback of it is that if the customers' requests go on growing rapidly, the service quality would be degraded results from the problems of overloaded server or restricted network bandwidth. On the contrary, in P2P based networks, more and more the demand for service increasing, the service quality is upgraded since a customer can act as a server. But, in the P2P based network, there are too many servers to manage, it's possible to distribute illegal contents because the P2P protocol cannot control distributed servers. Thus, it's not suitable for commercial purposes. In this paper, the dymanic group authentication scheme is proposed which is suited to P2P based applications. The proposed scheme consists of group based key generation, key update, signature generation and verification protocols. It can control the seeder's state whether the seeder is joining or leaving the network, and it can be applied to hybrid P2P based commerce model where sales transactions are covered by the index server and the contents are distributed by the P2P protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.465-468
• /
• 2007

An intelligent home network system using low-power and low-cost sensor nodes was designed and implemented. In Intelligent Home Network System, active home appliances control is composed of RSSI (Received Signal Strength Indicator) based user indoor location tracking, dynamic multi-hop routing, and learning integration remote-control. Through the remote-control learning, home appliances can be controlled in wireless network environment. User location information for intelligent service is calculated using RSSI based Triangle measurement method, and then the received location information is passed to Smoothing Algorithm to reduce error rate. In order to service Intelligent Home Network, moreover, the sensor node is designed to be held by user. The gathered user data is transmitted through dynamic multi-hop routing to server, and real-time user location & environment information are displayed on monitoring program.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.747-754
• /
• 2016

DHCP(Dynamic Host Configuration Protocol) is a protocol for efficiency and convenience of the IP address management. DHCP automatically assigns an IP address and configuration information needed to run the TCP/IP communication to individual host in the network. However, existing DHCP is vulnerable for network attack such as DHCP spoofing, release attack because there is no mutual authentication systems between server and client. To solve this problem, we have designed a new DHCP protocol supporting the following features: First, ECDH(Elliptic Curve Diffie-Hellman) is used to create session key and ECDSA(Elliptic Curve Digital Signature Algorithm) is used for mutual authentication between server and client. Also this protocol ensures integrity of message by adding a HMAC(Hash-based Message Authentication Code) on the message. And replay attacks can be prevented by using a Nonce. As a result, The receiver can prevent the network attack by discarding the received message from unauthorized host.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.41-50
• /
• 2012

In the monitoring system based on web service application, it is faced with the problems like code reproduction, difficult scalability and error recovery derived from the frequent change of data structure. So we propose a technique of monitoring system by DTD(Document Type Definition) automatic generation. This technique is to use dynamic server-side script to cope with the change of sensor data structure, generate the DTD dynamically. An it also adapt the AJAX(Asynchronous JavaScript and XML) for XML data parsing, it can support mass data transmission and exception processing for data loss and damage. This technique shows the result of recovery time is decreased about 44.8ms in case of temporary data failure by comparing to the conventional XML method.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.137-146
• /
• 2002

In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.