• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.158-166
• /
• 2004

Address lookup is one of the most essential functions of the Internet routers and a very important feature in evaluating router performance. Due to the facts that the Internet traffic keeps growing and the number of routing table entries is continuously growing, efficient address-lookup mechanism is indispensable. In recent years, various fast address-lookup schemes have been proposed, but most of those schemes are not practical in terms of the memory size required for routing table and the complexity required in table update In this paper, we have proposed a parallel IP address lookup architecture based on multiple hashing. The proposed scheme has advantages in required memory size, the number of memory accesses, and table update. We have evaluated the performance of the proposed scheme through simulation using data from MAE-WEST router. The simulation result shows that the proposed scheme requires a single memory access for the address lookup of each route when 203kbytes of memory and a few-hundred-entry TCAM are used.

• Journal of Digital Contents Society
• /
• v.19 no.9
• /
• pp.1751-1758
• /
• 2018

An integrated medical information system that integrates systems consisting of different environments centered on hospital information systems should be provided as a system that prioritizes the improvement of the quality of medical services, customer satisfaction, and patient safety. The RBAC-based medical information system is granted the access right according to task type, role, and rules. Through this, it is possible to use SMS channel, medical reservation and cancellation, customized statistics, and CRM / EMR interworking service using multi-channel to enable communication service without help of counselor and reduce the default rate of reservation patient, Operational improvement services can be extended to medical staff, patients and their families, as well as expanding to important decisions for patients.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.615-618
• /
• 2003

The design process of a relational database system consists of requirement analysis, conceptual design using ER diagram, logical design, and physical design. In logical design process, the conceptual schema is transformed to relational schema, and relational schema is normalized. This traditional design process is hard to applied in real database design process, since there is an ambiguity in conceptual design process. In this paper, we suggest a new design process, which provides more structural design steps by removing the conceptual design process. In new approach, we produce the data flow diagram by the structural methodology. From the attributes in the data store of data flow diagram, we construct relational table schema, and we normalize relational schema. Finally we produced table relationship diagram in order to figure out relationships between tables.

• Journal of Convergence Society for SMB
• /
• v.5 no.4
• /
• pp.5-10
• /
• 2015

With the advance of ICT, understanding the condition of network and analysing network monitoring have become an important issue. On the TCP/IP network, SNMP is the typical protocol that catches the condition of network by using polling method. If polling method is implemented for a long period, to catch the change of the condition of the network is not easy. On the other hand, in case of short-term polling, even if it could catch the condition of the network in real time, responsive messages to results of the polling cause the increase of traffic and therefore burden the network. There have been studies to control the overhead of responsive messages by controlling the polling period. However, not considering the characteristics of an agent, and running randomly, they cannot decrease the overhead although they would have an instant effect. This paper suggests an efficient polling method that decreases the traffic overhead of polling and catches the condition of the network in real time. Proposed method an polling for a short period and gave weight based on the characteristics of agents to catch the network condition, and a manager decided polling differentially based on the weight so that it decreased the overhead of polling traffic.

• Journal of Information Technology and Architecture
• /
• v.10 no.3
• /
• pp.347-359
• /
• 2013

The quality control of data is important element in data usage activations and decision makings. This paper is on how to extract the major critical data by each institution or organization selves. It proposes a social network analysis as a way to extract a table of high influence degree from a dynamic meta-data. The proposed CTQ data extraction method using SNA proved the fact that it is possible to extract highly accurate CTQ data by scientific measures of three-dimensional approach to real business situations without professional technicians. It is a new way that will change the goings on CTQ data management in IT sector and will improve the quality management level of an organization when applied to the real world.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.109-113
• /
• 2011

In intelligent subway systems, UWB-based WiMedia D-MAC Protocol can be considered to send and receive multimedia data which requires high data rate. However, network devices which do not exist within 10 meters, the limited communication rage, can not communicate with each other because WiMedia does not support multi-hop communications. In this paper, we developed the algorithm to select a relaying device for multi-hop routing on WiMedia networks. In the first step, each device acquires information of neighbors through beacon and decides whether it is a normal or relaying device using the acquired information. In the next step, all devices can create the 2-hop routing table using the information received via relaying devices and the whole routing table for all devices on networks, eventually.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.333-340
• /
• 2004

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.553-555
• /
• 2005

SLA는 네트워크 서비스 사업자와 가입자 사이에 서비스 품질을 정의하는 협약으로서, 일정 수준의 서비스 제공을 위해 SLA 관리 시스템(SLM)의 필요성이 대두되었다. 본 논문에서는 SLA에 대한 데이터 분석을 통해 네트워크 사업자에게 신속하고 효율적인 의사결정 지원정보를 제공할 수 있는 SLA 데이터 분석 시스템을 제안한다. 본 논문의 시스템은 SLM의 일반정보, 위반정보, 과금정보 등을 바탕으로, 각각 추이분석과 통계현황 기능을 수행한다. 분석 결과는 테이블, 그래프 등의 다양한 형태로 제공되며, 분석 결과에 대해서는 각각의 분석 모형에 대한 개요 및 기준치 등을 제시함으로써 시스템에 대한 신뢰성을 높일 수 있다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.1109-1114
• /
• 2002

본 논문에서는 멀티 에이전트 모델에서의 정보 검색 서비스 지원에 있어 이동 에이전트의 이주 호스트(이하 노드) 자동 탐색, 이주 순위 결정 및 검색 적중률 분석을 통한 보다 정확한 정보 서비스 지원을 위해 메타 데이터를 이용한 네이밍 에이전트를 설계한다. 기존의 이동 에이전트 시스템에서는 이동 에이전트가 이주할 노드의 IP와 포트번호 또는 CORBA 구현 저장소에 등록된 구현 객체의 이름 등을 사용자가 직접 지정해주어야 함으로써, 이주 대상 노드에 대한 구현 객체 연결을 위해 물리적인 정보들을 반드시 알고 있어야 하는 단점이 있다. 따라서, 본 논문에서는 각 네이밍 서비스별로 구현 객체 관련 정보들을 메타 데이터 테이블에 저장 및 관리하고, 사용자 입력 검색 키워드에 대한 해당 구현 객체의 객체 참조자를 반환하는 네이밍 에이전트를 설계한다. 설계된 네이밍 에이전트는 메타 데이터를 이용하여 정확한 정보 검색을 수행하기 위한 노드 이주를 지원하고, 이를 통해 다양한 사용자의 요구에 따른 정보 검색 정확도의 향상은 물론 이동 에이전트의 순회 검색 수행 시간의 단축 및 한정된 네트웍 환경에서의 트래픽 감소를 유도한다.