• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.51-58
• /
• 2002

A electronic business user is increased rapidly, and load of a electronic business system and network traffic are increased rapidly. Also, the data which included an audio and video is increasing in a electronic business system gradually, and According to this an Internet service businessman is paying for an enormous cost for management of a system and a maintenance of a line. It is brought a delay of a response speed about a service wish of a Web customer this system load and network traffic raise. Also, this decreases customer satisfaction and becomes an important factor to decrease competitive power of an e-business enterprise. In this study, we proposed the electronic business system that improved answer delay time about a Web customer in an e-business system based on the .net which was a the latest version of Microsoft company, and analyzed performance of a proposal system through an experiment. In the experiment result, the system that proposed it can have response time to have been improved and fast adaptability about various requests of a Web customer. Also, in a proposed system, a decrease gets a delay of a response speed to occur because of the multiple user done.

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

Previous researches on scalability problem of distributed virtual environment (DVE) have been mainly focused on spatial partitioning of area of interest (AOI). Congestion phenomena by avatar groups in AOI have been neglected relatively. However, AOI congestion is highly related to scalability of DVT because it exhausts system resources such as network bandwidth and rendering time, and could be a bar to perform collaboration among participants. In this paper, this will be defined as the problem that must be solved for the realization of the scalable DVE, and a model will be proposed to measure and control congestion situation in AOI. The purposes of the proposed model are to prevent high density of participants in AOI, and to protect stable collaboration in DVE. For evaluation of the performance it is compared with a previous method by defining the resource cost model which is dynamically activated to AOI congestion.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.477-491
• /
• 2002

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1542-1555
• /
• 1999

This paper proposes an algorithm for class hierarchies which can optimize member data and member function. This algorithm considers single/multiple inheritance, static/dynamic binding, overloading/overriding, pure virtual/virtual function, and constructor on the hierarchy of C++ class. We need to eliminate unused function that possesses many component element, because the program uses a limited of function in class hierarchies. Previous works on slicing mainly focused on selecting output data and including the related program statement. It was consists of structured programming language and also centralized on error detection, maintenance, and flexible testing. In this paper, we extend to the object-oriented language, makes a linked-table for objects to raise the efficiency of information management, and proposes necessary algorithm for optimizing system Through this process, we can obtain the simplification of program code and the progress of system performance by eliminating unused member data and member function.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.293-302
• /
• 2013

Home network providers have many worries about providing home network services with an expandable, reliable, flexible and low-cost structure according to the expanding market environment. The existing client-server system has various problems such as complexity and high costs in providing home network services. In this paper we propose the P2P-SIP structure. P2P communication terminal supporting access of distributed resources provides functions which the existing SIP-based network devices have. Because diverse terminals in a home network access through networks, also, partitioning network domains with home gateways to manage, and applying the network-based PMIPv6(Proxy Mobile IPv6) technology considering mobility of terminals would help to have a more efficient home network structure. Especially, the proposed P2P-SIP structure proves itself as a very efficient structure to have an outstanding expandability among different home networks in a region, and to reduce maintenance costs.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of Astronomy and Space Sciences
• /
• v.13 no.2
• /
• pp.52-66
• /
• 1996

In this paper, we present the design methodology of KASCOM(KAIST satellite computer), the experimental on-board computer system of KITSAT-2. The design of the on-board computer system should consider the following constraints: operational throughput, fault tolerant input-output, low power, size, weight, and radiation hardness. KASCOM is designed to satisfy these constraints. This paper also presents the implementation and testing details of KASCOM. Finally, the in-orbit operational results are presented. The results show that about 2 SEU errors occur for the program memory(1Mbit SRAM) in a day, while 3.7 SEU errors occur for the data memory(4Mbit SRAM). This implies that high-integrated memories are more susceptible to the radiation environment than low-integrated memories.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.304-318
• /
• 2002

본 연구는 종합병원에서 운영중인 병원정보시스템(Hospital Information System)을 기준으로 업무별 데이터 마트를 구성하여 종합병원 데이터 웨어하우스 시스템을 제안하는 연구이다. 본 연구에서 제안한 병원 데이터웨어하우스 모형은 충남대학교병원 데이터 웨어하우스 시스템 구축 보고서, Inmon의 데이터 웨어하우스 개발방법론에 기초를 두었다. 종합병원의 데이터하우스시스템을 제안하면 다음과 같다. 첫째, 원무 데이터마트, 병원의 원무팀에서 주로 사용하는 것으로써 수입에 관련된 정보, 진료인원에 관한 정보, 심사/청구/삭감에 관한 정보들로 구성되어 있다. 둘째, 약국 데이터마트, 처방전달 데이터 마트와 연결되어 외래/입원의 처방에 관한 정보, 약에 대한 효능과 성분에 대한 정보, 투약과 검사에 대한 정보들로 구성된다. 셋째, 의무기록 데이터마트, 의무기록팀에서 관리하는 퇴원요약 정보, 암환자에 대한 정보, 외래/입원 환자 통계에 대한 정보들로 이루어진다. 넷째, 처방전달 데이터마트, 주로 의사가 환자에게 행한 처치/처방/수술과 진료기록에 대한 정보들을 기준으로 환자진료나 임상연구에 필요한 정보를 제공한다. 다섯째, 병원 행정 데이터마트, 인사정보, 급여정보, 회계정보, 예산정보, 물류정보 등으로 구성되어 병원의 자원활용이나 행정에 대한 전반적인 정보를 제공한다. 여섯째, 경영지원 데이터마트, 병원경영에 필요한 수입정보, 원가분석 정보, 진료인원 정보들을 요약한 형태로 제공한다. 또한 의사결정 형태도 의료진 중심의 병원에서 환자중심의 병원으로 구조를 바꾸었고 투명한 정보공유와 기초 데이터들의 정제는 부가가치가 높은 정보로 가공할 수 있게 되었으며 각 전문 직종간의 단절된 정보 흐름을 유기적으로 교환할 수 있게 되어 지식의 교환을 촉진시켰다 그리고 온라인거래처리시스템(OLTP)의 한계점인 하드웨어적인 문제와 성능 저하에 대한 문제를 해결하였고, OLTP시스템에서 분리되고 이원화된 코드체계와 데이터 형태의 이질화를 통일하는 방법으로 데이터웨어하우스 시스템을 제시하였다. 결국 병원에서 데이터웨어하우스 시스템의 구축은 임상, 연구, 교육의 유기적 순환관계를 정립하여 지식의 순환적 고리인 수집, 공유, 확산, 재창출을 지속적 유지할 수 있는 인프라를 구축해 준다. 반면 상이한 정보들간의 충돌과 이에 따른 해석의 오류로 잘못된 의사결정을 위한 정보를 제공할 수 있고 기초정보의 접근 및 추출의 유용성에 의해서 정보유출에 대한 문제가 한계점으로 나타났다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.503-516
• /
• 2010

In this paper, we propose the converged profile and authentication scheme for supporting converged media services of broadcasting & communications convergence in fixed mobile convergence networks. The proposed scheme supports the management of access, service, mobility and IPTV profiles on subscriber and a function of open API(Application Program Interface) for providing the subscriber profile for the third party service provider with the PUSH/PULL method. The open API is based on a web service and a REST(Representational State Transfer) and provides various services for the third party service provider with ease. In addition, the proposed scheme supports a function of SSO(Single Sign-on). After user succeeded in establishing an access connection, user can sustain the same authentication state with this function although connected access network is changed or IMS(IP Multimedia Subsystem) service network is attached. We evaluate and analyze the performance of the proposed scheme through the implementation of CUPS(Converged User Profile Server) system test-bed.