• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.123-129
• /
• 2011

In this paper, We have proposed a new distributed conference architecture which can reduce largely SIP(Session Initiation Protocol) messages exchanged between servers and participants in distributed conference environment by using resource lists which consist of conference participants URIs. This architecture can also reduce processing time and loads of conference servers. In our proposed method, the number of SIP messages required for participating in the conference can be largely reduced, and the number of SIP messages required for subscription of conference event package and maintaining sessions can also be largely reduced by using resource lists. Therefore expandibility of the conference system increases and network traffic can be reduced by using our conference architecture. And We also have proposed in this paper a new conference information data format with some added elements that are necessary for processing resource lists. Furthermore the procedure for dynamically adding conference servers to the conference environment has been suggested, and the exchanging process of SIP messages and conference information data between conference servers and conference participants has been also suggested. The performance of our proposed system has been evaluated by experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.133-140
• /
• 2012

In SIP(Session Initiation Protocol) service, users should send SIP SUBSCRIBE messages to the SIP server to get subscription informations of the other parties, and total amount of SIP messages becomes large in network as refresh messages and notification messages are generated to each SIP subscription. In this paper, a new resource lists architecture using dynamic notification control method has been proposed to solve these problems. In this architecture, service users can control event notification generation rate dynamically from the server according to the operation circumstances, and users can control generation of notification messages during refresh for maintaining SIP session. Furthermore users can also control generation of notification messages according to session connection conditions. A new resource lists MIME type has been designed, and several parameters for dynamic notification message control have been added to the extended SIP message headers. In this system new resource lists MIME type can be used for processing of the event package. Therefore total amount of SIP messages in network can be largely reduced, and load of the resource lists server for processing messages can be reduced also. The performance of the proposed method has been evaluated by experiments.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.58-64
• /
• 2009

For the success of the reconfigurable computing, the algorithm for mapping operations onto coarse-grained reconfigurable architecture is very important. This paper proposes a resource-aware mapping system for the coarse-grained reconfigurable architecture and its own underlying heuristic algorithm. The operation assignment and the routing path allocation are simultaneously performed with a cycle-accurate time-exclusive resource model. The proposed algorithm minimizes the communication resource usage and the global memory access with the list scheduling heuristic. The operation to be mapped are prioritized with general properties of data flow. The evaluations of the proposed algorithm show that the performance is significantly enhanced in several benchmark applications.

• The KIPS Transactions:PartC
• /
• v.19C no.1
• /
• pp.47-54
• /
• 2012

Sharing cross-site resources has been adopted by many recent websites in the forms of service-mashup and social network services. In this change, exploitation of the new vulnerabilities increases, which includes inserting malicious codes into the interaction points between clients and services instead of attacking the websites directly. In this paper, we present a system model to identify malicious script codes in the web contents by means of a remote verification while the web contents downloaded from multiple trusted origins are executed in a client's browser space. Our system classifies verification items according to the origin of request based on the information on the service code implementation and stores the verification results into three databases composed of white, gray, and black lists. Through the experimental evaluations, we have confirmed that our system provides clients with increased security by effectively detecting malicious scripts in the mashup web environment.

• The Journal of the Korea Contents Association
• /
• v.18 no.1
• /
• pp.10-18
• /
• 2018

This paper presents a method to resynthesize logic of a programmed FPGA from a bitstream file that is a downloaded file for Xilinx FPGA (Field Programmable Gate Array). It focuses on reconfiguring the LUT (Look Up Table) logic. The bitstream data is compared and analyzed considering various situations and various input variables such as composing other logics using the same netlist or synthesizing the same logic at various positions to find a structure of the bitstream. Based on the analyzed bitstream, we construct a truth table of the LUT by implementing various logic for one LUT. The proposed algorithm extracts the logic of the LUT based on the truth table of the generated LUT and the bitstream. The algorithm determines the input and output pins used to implement the logic in the LUT. As a result, we extract a gate level logic from a bitstream file for the targeted Xillinx FPGA.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.71-81
• /
• 2010

In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.