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

Software adaptation may be required to interact between heterogeneous platforms and to react to rapid change of environment in ubiquitous computing. Web service provides a way to use heterogeneous and distributed services or resources to utilize and organize them. But it is not easy to retrieve appropriate services when we search services because web service lacks of semantic information. Semantic web service provides additional information of services, but it does not support a method to match them in various ways. We can adapt and extend web applications by using web service, but a method for management and administration is still needed. Therefore in this paper, we propose a framework for dynamic growing of web service applications based on ESB(Enterprise Service Bus) and agent and provide a prototype to show its usefulness.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.315-318
• /
• 2017

Nowadays, Distributed Denial of Service (DDoS) attacks have gained increasing popularity and have been a major factor in a number of massive cyber-attacks. It could easily exhaust the computing and communicating resources of a victim within a short period of time. Therefore, we have to find the method to detect and prevent the DDoS attack. Recently, there have been some researches that provide the methods to resolve above problem, but it still gets some limitations such as low performance of detecting and preventing, scope of method, most of them just use on cloud server instead of network, and the reliability in the network. In this paper, we propose solutions for (1) handling multiple DDoS attacks from multiple IP address and (2) handling the suspicious attacks in the network. For the first solution, we assume that there are multiple attacks from many sources at a times, it should be handled to avoid the conflict when we setup the preventing rule to switches. In the other, there are many attacks traffic with the low volume and same destination address. Although the traffic at each node is not much, the traffic at the destination is much more. So it is hard to detect that suspicious traffic with the sampling based method at each node, our method reroute the traffic to another server and make the analysis to check it deeply.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.659-672
• /
• 2004

A Mobile Ad hoc Network (MANET) is a group of independent mobile computing nodes that consist of a multi-hop wireless network without a central administration or any infrastructure. Every node that wants to join a MANET must obtain an address for communication. Having a centralized DHCP server that provides addresses to nodes, we can easily and automatically obtain addresses. However, a MANET lacks any fixed infrastructure such as a DHCP server. We therefore propose a distributed address autoconfiguration approach for a MANET using a reserved address and optimistic Duplicated Address Detection (DAD). The reserved address helps to reduce the allocation latency, and the optimistic DAD guarantees the uniqueness of addresses and lessens communication overhead. We then suggest methods of handling network partition and network merging situations, and go on to evaluate our approach through simulations. The simulation result shows that our scheme guarantees the uniqueness of allocated address and considerably improves allocation latency and communication overheads.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.152-159
• /
• 2004

The Grid system is an emerging computing infrastructure that will substitute for existing distributed systems. However end users have a difficulty in using the Grid because of its complicated usage, which is an inherent characteristic from the heterogeneous mechanism of the Grid. In this paper, we present the JCML(Job Control Markup Language) and its GUI-based editor, which not only provide users with ease of use, improved working environment, but assist users to execute their jobs efficiently The JCML is a job control language that improves the RSL of Globus, which defines global services in Grid. The JCML is designed to support flexibility among various Grid services using standard XML. And it makes use of a graph representation method, GXL(Graph eXchange Language), to specify detailed job properties and dependencies among jobs using nodes and edges. The JCML editor provides users with GUI-based interface. With the JCML editor, a complicated job order can be easily completed using very simple manipulations with a mouse, such as a drag-and-drop.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.356-363
• /
• 2000

Java programming language is designed to run effectively on internet and distributed network environments. However, because it has a deficit to be executed by the interpreter method on each platform, to execute Java programs efficiently the code generation system which transforms Bytecode into SPARC code as target machine code must be developed. In this paper, we implement a code generation system which translates Bytecode into SPARC code using the retargetable code generating techniques. For the sake of code expander, we wrote a Bytecode table describing a rule of SPARC code generation from Bytecode, and implemented the information extractor transforming Bytecode to suitable form during expanding of source code from class file. The information extractor determines constant pool entry of each Bytecode instruction operand and then the code expander translates the Bytecode into SPARC code accoring to the Bytecode table. Also, the retargetable code generation system can be systematically reconfigured to generate code for a variety of distinct target computers.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• Journal of Internet Computing and Services
• /
• v.5 no.4
• /
• pp.11-22
• /
• 2004

Works that improve the process and notify the improved process, the product and the change of tasks to all users are essential in achieving project. Existent project management tools support the definition and the change of project activities, and configuration management tools support version check, workspace management. build management. etc. It costs too much to buy each tool. as well as, it is burdensome to learn usage for various tools. Therefore the web-based integrated tool is proposed to manage the process and artifacts at a time in this paper. The proposed tool defines component based development process model. and achieves recording of process progression, processing the request of change, reporting the progression of each task, product registering and change, version recording, artifact or form search, etc. using ebXML. Furthermore, the stakeholders get the systematic management and standardization by sharing information that are necessary in process achievement and configuration management in distributed environment using the integrated management tool.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.77-88
• /
• 2011

In distributed cognitive radio networks, cognitive radio devices which perform the channel sensing individually, are seriously affected by radio channel environments such as noise, shadowing and fading such that they can not property satisfy the maximum allowable interference level to the primary user. In the paper, we propose a Q-learning based channel access scheme for cognitive radios so as to satisfy the maximum allowable interference level to the primary user as well as to improve the throughput of cognitive radio by opportunistically accessing on the idle channels. In the proposed scheme, the pattern of channel usage of the primary user will be learned through Q-learning during the pre-play learning step, and then the learned channel usage pattern will be utilized for improving the sensing performance during the Q-learning normal operation step. Through the simulation, it is shown that the proposed scheme can provide bettor performance than the conventional energy detector in terms of the interference level to primary user and the throughput of cognitive radio under both AWGN and Rayleigh fading channels.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.675-684
• /
• 2009

Internet worm can cause a traffic problem through DDoS(Distributed Denial of Services) or other kind of attacks. In those manners, it can compromise the internet infrastructure. In addition to this, it can intrude to important server and expose personal information to attacker. However, current detection and response mechanisms to worm have many vulnerabilities, because they only use local characteristic of worm or can treat known worms. In this paper, we propose a new framework to detect unknown worms. It uses macroscopic characteristic of worm to detect unknown worm early. In proposed idea, we define the macroscopic behavior of worm, propose a worm detection method to detect worm flow directly in IP packet networks, and show the performance of our system with simulations. In IP based method, we implement the proposed system and measure the time overhead to execute our system. The measurement shows our system is not too heavy to normal host users.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.623-631
• /
• 2014

Comparison of two representative deduplication file systems, LessFS and SDFS, shows that Lessfs is better in execution time and CPU utilization while SDFS is better in storage usage (around 1/8 less than general file systems). In this paper, a new system is proposed where the advantages of SDFS and Lessfs are combined. The new system uses multiple DFEs and one DSE to maintain the integrity and consistency of the data. An evaluation study to compare between Single DFE and Dual DFE indicates that the Dual DFE was better than the Single DFE. The Dual DFE reduced the CPU usage and provided fast deduplication time. This reveals that proposed system can be used to solve the problem of an increase in large data storage and power consumption.