Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Internet Computing and Services
Journal Basic Information
Journal DOI :
Korean Society for Internet Information
Editor in Chief :
Volume & Issues
Volume 11, Issue 6 - Dec 2010
Volume 11, Issue 5 - Oct 2010
Volume 11, Issue 4 - Aug 2010
Volume 11, Issue 3 - Jun 2010
Volume 11, Issue 2 - Apr 2010
Volume 11, Issue 1 - Feb 2010
Selecting the target year
A study on the performance improvement of an adaptive, real-time traffic assignment scheduler using the TP coefficient
Park, Nho-Kyung ; Jin, Hyun-Joon ; Yun, Eui-Jung ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 1~10
As recent fusion industry and ubiquitous technology have grown fast, network contents, which require high load, are provided in various infrastructures and facilities such as u-city and smart phones. Therefore, it is anticipated that the playback quality of multimedia compared to network loads degrades dramatically due to the drastic increment of real-time reference of conventional high load contents (eg. multimedia data). In this paper, we improved the method of the traffic assignment based on MPP which elevated the playback quality of multimedia by assigning discriminately the possible traffic of MMS with TP coefficients. When the TP coefficient which combines content preference with media preference was applied to a real-time traffic assignment scheduler, the simulation results showed that the multimedia playback stream was assigned within the possible traffic of a server. The real-time scheduling algorithm was improved by using the TP coefficient that combines the time-dependent image contents and the weighted value of media preference. It was observed from the experiment that the loss of the possible traffic decreases to 3.91% and 3.88% for three and four clients respectively.
Hybrid Delegate-based Group Communication Protocol For Overlapped Groups
Kim, Cha-Young ; Ahn, Jin-Ho ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 11~22
In case that group communication protocols assume every process is interested in all events occurring in a large scale group, the events multicasting to a subset of a large process group, such as a sensor network, potentially varying for every event based on their interests might lead to very high communication overhead on each individual process. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped group using gossip based group communication for multicasting in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present a new gossip-based causal message order guaranteeing multicast protocol based on local views and delegates representing subgroups and fully utilizing multi-group features to improve scalability. In the proposed protocol, the message delivery order in overlapped groups has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, these features of the proposed protocol might be significantly scalable rather than those of the protocols guaranteeing atomic order dependencies between multicast messages by hierarchical membership list of dedicated groups like traditional committee protocols and much stronger rather than fully decentralized protocols guaranteeing dependencies between multicast messages based on only local views. And the proposed protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.
Security Enhancing of Authentication Protocol for Hash Based RFID Tag
Jeon, Jin-Oh ; Kang, Min-Sup ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 23~32
In this paper, we first propose the security enhancing of authentication protocol for Hash based RFID tag, and then a digital Codec for RFID tag is designed based on the proposed authentication protocol. The protocol is based on a three-way challenge response authentication protocol between the tags and a back-end server. In order to realize a secure cryptographic authentication mechanism, we modify three types of the protocol packets which defined in the ISO/IEC 18000-3 standard. Thus active attacks such as the Man-in-the-middle and Replay attacks can be easily protected. In order to verify effectiveness of the proposed protocol, a digital Codec for RFID tag is designed using Verilog HDL, and also synthesized using Synopsys Design Compiler with Hynix
standard-cell library. Through security analysis and comparison result, we will show that the proposed scheme has better performance in user data confidentiality, tag anonymity, Man-in-the-middle attack prevention, replay attack, forgery resistance and location tracking.
A Proactive Dissemination Protocol using Residual Energy and Signal Strength for WSNs
Park, Soo-Yeon ; Kim, Moon-Seong ; Jeong, Eui-Hoon ; Bang, Young-Cheo ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 33~39
In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.
Power-Laws Exponents of the Domestic AS-level Internet Topology based on the Valley-free BGP Routing Policy
Kang, Koo-Hong ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 41~49
Faloustsos et al.[1,2] showed successfully that the power-laws describe the heavy-tailed distributions of the AS level Internet topology properties such as node degree. This result allows us to represent the characteristics of AS-level Internet topology using some power-law exponents with elegant and simple. In this paper, we obtained the power-law exponents of the domestic AS-level Internet topology properties - the node degree, the number of pairs within hops, and eigenvalues of the graph - based on the valley-free BGP routing policy. We used the real data sets from UCLA IRL laboratory, and showed that these power-laws fit the real data pretty well resulting in correlation coefficient of 90.7%, 96.5%, and 97%, respectively. In particular, rounding the effective diameter to three, approximately 91% of the pairs of nodes are within this distance; that is, we might conclude our topology is pretty well organized.
The Selective Transmission of Sensor Data for a Water Quality Monitoring System
Kwon, Dae-Hyeon ; Oh, Ryeom-Duk ; Cho, Soo-Sun ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 51~58
In this paper, we introduce various attempts to transmit sensor data efficiently for design of a water quality monitoring system under the USN environment. The representative methods are the sensor management on a sensor node and the clustering on a sink node. The sensor management includes controls of sensing intervals, data accumulations, and data transmissions. And the clustering is one of efficient data compression methods using data mining technology. From the experimental results we confirmed that the proposed transmission method using the sensor management and the clustering outperformed common transmission method.
A Research for Improvement of WIM System by Abnormal Driving Patterns Analysis
Park, Je-U ; Kim, Young-Back ; Chung, Kyung-Ho ; Ahn, Kwang-Seon ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 59~72
WIM(Weigh-In-Motion) is the system measuring the weight of the vehicle with a high-speed. In the existing WIM system, vehicle weight is measured based on the constant speed and the error ratio has 10%. However, because of measuring the driving pattern, that is abnormal driving pattern which is like the acceleration and down-shift of the drivers, it has the error ratio which is bigger than the real. In order to it reduces the error ratio of WIM system, the improved WIM system needs to find the abnormal driving pattern. In order to reducing the error ratio of these WIM systems, the improved WIM system can find abnormal driving patterns. In this paper, the improved WIM system which analyzes the abnormality driving pattern influencing on the error ratio of WIM system of an existing and minimizes the error span is designed. The improved WIM system has the multi step loop structure of adding the loop sensor to an existing system. In addition, the measure function defined as an intrinsic is improved and the weight measured by the abnormal driving pattern is amended. The analysis of experiment result improved WIM system can know the fact that the error span reduces by 8% less than in the existing the maximum average sampling error 22.98%.
Scalable Resource Sharing using Group Similarity Function in Grid System
Mateo, Romeo Mark A. ; Lee, Jae-Wan ; Lee, Mal-Rey ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 73~83
The scalability of a grid system should be efficiently designed to handle the increasing number of grid users. This paper presents a scalable resource sharing mechanism among virtual organizations (VO) in grid environment by the scalable virtual organizations (SVO). The proposed grid architecture is composed of standard services of a grid system to manage the SVO. We propose a group similarity function which is used to determine similarities among VOs to select the VOs to merge. We compared other similarity functions to the GSF and determined the throughput performance of the SVO using simulation for grid system.
A Design of Context Prediction Structure using Homogeneous Feature Extraction
Kim, Hyung-Sun ; Im, Kyoung-Mi ; Lim, Jae-Hyun ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 85~94
In this paper, we propose a location-prediction structure that can provide user service in advance. It consists of seven steps and supplies intelligent services which can forecast user's location. Context information collected from physical sensors and a history database is so difficult that it can't present importance of data and abstraction of data because of heterogeneous data type. Hence, we offer the location-prediction that change data type from heterogeneous data to homogeneous data. Extracted data is clustered by SOFM, then it gets user's location information by ARIMA and realizes the services by a reasoning engine. In order to validate the proposed location-prediction, we built a test-bed and test it by the scenario.
Improvement Method and Performance Analysis of Shared Memory in Dual Core Embedded Linux system
Jung, Ji-Sung ; Kim, Chang-Bong ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 95~106
Recently multiple process communicate together. They share resource and information for cooperation in complicated programming environment. Kernel provides IPC (Inter -Process Communication) for communication with each other process. Shared Memory is a technique that many processes can access to identical memory area in the Linux environment. In this paper, we propose a performance improvement method of shared memory in the dual-core embedded linux system which is consist of different core and different operating system. We construct the MPC2530F (ARM926F+ARM946E) linux system and measure the performance therein. We attempt a performance enhancement in each CPU for each process which uses a shared memory.
Feature Configuration Validation using Semantic Web Technology
Choi, Seung-Hoon ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 107~117
The feature models representing the common and variable concepts among the software products and the feature configurations generated by selecting the features to be included in the target product are the essential components in the software product lines methodology. Although the researches on the formal semantics and reasoning of the feature models and feature configurations are in progress, the researches on feature model ontologies and feature configuration validation using the semantic web technologies are yet insufficient. This paper defines the formal semantics of the feature models and proposes a feature configuration validation technique based on ontology and semantic web technologies. OWL(Web Ontology Language), a semantic web standard language, is used to represent the knowledge in the feature models and the feature configurations. SWRL(Semantic Web Rule Language), a semantic web rule languages, is used to define the rules to validate the feature configurations. The approach in this paper provides the formal semantic of the feature models, automates the validation of feature configurations, and enables the application of various semantic web technologies, such as SQWRL.
DDX Framework Design and Implementation Usable in the Flex Platform
Kim, Yang-Hoon ; Jeong, Gu-Beom ; Yoo, Gab-Sang ; Kim, Guk-Boh ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 119~128
Computing environment in these days aim for user-oriented development called RIA (Rich Internet Application). As a representative development method of RIA, Flex Framework overcomes the weaknesses of the Mainframe and C/S (Client/Server). However, the issues, such as, difficulties in memory management, complexity of the binding structure and large capacities of the compile outputs are left to be solved. The purpose of this paper is to implement the framework which enables the fast and accurate development of user-oriented web application on the Flex platform. DDX (Dynamic Data eXchange) framework proposes standardized and efficient development environment in a Flex platform. And by using scalability-prepared library that is applicable for various job areas, the framework enhances the performance, increase development productivity and help construct stable system.
An Assurance Mechanism of Intrusion Data for Making Digital Evidence in Digital Computing Environment
Jang, Eun-Gyeom ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 129~141
In digital computing environment, for the mal functions in appliances and system errors, the unaccepted intrusion should be occurred. The evidence collecting technology uses the system which was damaged by intruders and that system is used as evidence materials in the court of justice. However the collected evidences are easily modified and damaged in the gathering evidence process, the evidence analysis process and in the court. That’s why we have to prove the evidence’s integrity to be valuably used in the court. In this paper, we propose a mechanism for securing the reliability and the integrity of digital evidence that can properly support the Computer Forensics. The proposed mechanism shares and manages the digital evidence through mutual authenticating the damaged system, evidence collecting system, evidence managing system and the court(TTP: Trusted Third Party) and provides a secure access control model to establish the secure evidence management policy which assures that the collected evidence has the corresponded legal effect.
Study of Document Distribution System Architecture for Digital Secret Document Leakage Prevention
Choi, Cheong-Hyeon ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 143~158
The illegal leakage of enterprise digital confidential information will threaten the enterprise with bankruptcy. Today since most small-and-medium companies have no capability to fight against illegally compromising their critically confidential documents in spite of knowing the leakage of them, strongly safe distribution system of the digital confidential documents should be designed so in secure as to prevent any malicious intent of embezzlement from accessing the critical information. Current DRM-based protection system is not always perfect to protect the digital secrets, even seems to leave the secrets open. Therefore our study has analyzed the illegal leakage paths that hackers attack against and the vulnerability of the current protection systems. As result, we study the group communication based system architecture satisfying the security conditions to make even legitimate working employee keep out of the confidential documents, without performance degradation. The main idea of this architecture is to stay every secrets in encrypted form; to isolate the encrypted documents from the crypto-key; to associate every entity with one activity and to authenticate every entity with DSA-based public key system; multiple authentication method make hackers too busy to get a privilege to access the secrets with too many puzzle pieces. This paper deal with the basic architectural structure for the above issues.
Measuring the Effectiveness of Teaching Introductory Programming Using LEGO Mindstorms Robots
Kim, Tae-Hee ; Kang, Moon-Seol ;
Journal of Internet Computing and Services, volume 11, issue 4, 2010, Pages 159~173
It is difficult for us to teach the introduction course of programming to beginners just starting their college life. What is particularly hard to do is to provide them with learning motivation so that the freshmen can be easily and rapidly adapted to programming work and to enhance their will to learn. In this paper, we suggest a method to apply LEGO Mindstorms robot to the introduction course of programming in purpose to allow programming beginners to be motivated and have higher will to learn so that they can receive programming education easily and joyfully. This paper attempts to find reasonable methods for improvement which can help programming beginners to be motivated and encouraged to learn in the course of C programming education and can facilitate learning effects as well, and conducts education using LEGO Mindstorms robot as a way to solve problems like students' low interest or will to learn. According to the result of providing the freshmen with the introduction course of C programming to which the suggested method was applied, it was found that their academic achievement in programming education enhanced through their increased motivation and will to learn programming. This result shows that students' interest, motivation, and will to learn the subject are statistically significant improvement through the course that employs LEGO Mindstorms robot.