• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.593-604
• /
• 2001

A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.137-145
• /
• 1986

The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.517-525
• /
• 2009

We propose a quality guaranteed scalable video streaming service over the Internet using a new rate adaptation algorithm. Because video data requires much more bandwidth rather than other types of service, therefore, quality of video streaming service should be guaranteed while providing friendliness with other service flows over the Internet. To successfully provide this, we propose a framework for providing quality-guaranteed streaming service using two-channel transport layer and rate adaptation of scalable video stream. In this framework, baseline layer for scalable video is transmitted using TCP transport for minimum qualify service. Enhancement layers are delivered using TFRC transport with layer adaptation algorithm. The proposed framework jointly uses the status of playout buffer in the client and the encoding rate of layers in media contents. Therefore, the proposed algorithm can remarkably guarantee minimum quality of streaming service rather than conventional approaches regardless of network congestion and the encoding rate variation of media content.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.483-488
• /
• 2010

Due to the prevalence of various mobile devices and wireless broadband networks, there has been a significant increase in interest and demand for multimedia streaming services. Moreover, the user can service the participatory video broadcasting service in the mobile device and it can be used to deliver the real-time news and more variety information in the user side. Live multimedia service of user participation should consider not only the video quality but also the delay bounds and continuity of video playback for improving the user perceived QoS (Quality of Service) of streaming service. In this paper, we propose an adaptive rate control scheme, called DeBuG (Delay Bounds Guaranteed), to guarantee the delay bounds and continuity of video playback for the real-time streaming in mobile devices. In order to provide those, the proposed scheme has a quality adaptation function based on the transmission buffer status and network status awareness. It also has a selective frame dropper, which is based on the media priority, before the transmission video frames. The simulation results demonstrate the effectiveness of our proposed scheme.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.617-630
• /
• 1996

In this paper, a shared-concurrent file system (S-CFS) is designed and implemented using conventional disks as disk arrays on a Workstation Cluster which can be used as a small-scale server. Since it is implemented on UNIX operating systems, S_CFS is not only portable and flexible but also efficient in resource usage because it does not require additional I/O nodes. The result of the research shows that on small-scale systems with enough disks, the performance of the concurrent file system on transaction processing applications is bounded by the bottleneck of CPUs computing powers while the performance of the concurrent file system on massive data I/Os is bounded by the time required to copy data between buffers. The concurrent file system,which has been implemented on a Workstation Cluster with 8 disks,shows a throughput of 388 tps in case of transaction processing applications and can provide the bandwidth of 15.8 Mbytes/sec in case of massive data processing applications. Moreover,the concurrent file system has been dsigned to enhance the throughput of applications requirring high performance I/O by controlling the paralleism of the concurrent file system on user's side.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2010.02a
• /
• pp.463-463
• /
• 2010

고휘도 고효율 백색 LED (lighting emitting diode)가 차세대 조명광원으로 급부상하고 있다. 백색 LED를 생산하기 위한 공정에서 MOCVD (유기금속화학증착)장비를 이용한 Epi wafer공정은 에피층과 기판의 격자상수 차이와 열팽창계수차이로 인하여 생성되는 에피결함의 제거를 위하여 기판과 GaN 박막층 사이에 완충작용을 해줄 수 있는 버퍼층 (Buffer layer)을 만들고 그 위에 InGaN/GaN MQW (Multi Quantum Well)공정을 하여 고휘도 고효율 백색 LED를 구현할 수 있다. 이 공정에서 기판의 온도가 불균일해지면 wafer 파장 균일도가 나빠지므로 백색 LED의 yield가 떨어진다. 균일한 기판 온도를 갖기 위한 조건으로 기판과 induction heater의 간격, 가스의 흐름, 기판의 회전, 유도가열코일의 디자인 등이 장비의 설계 요소이다. 코일에 교류전류를 흘려주면 이 코일 안 또는 근처에 있는 도전체에 와전류가 유도되어 가열되는 유도가열 방식은 가열 효율이 높아 경제적이고, 온도에 대한 신속한 응답성으로 인하여 열 손실을 줄일 수 있으며, 출력 온도 제어의 용이성 및 배출 가스 등의 오염 없다는 장점이 있다. 본 연구에서는 유도가열방식의 induction heater를 이용하여 회전에 의한 기판의 온도 균일도 측정을 하였다. 기초 실험으로 저항 가열 히터를 통하여 대류에 의한 온도 균일도를 평가하였다. 그 결과 gap이 3 mm일 때, 평균 온도 $166.5^{\circ}C$ 에서 불균일도 6.5 %를 얻었으며 이를 바탕으로 induction heater와 graphite susceptor의 간격이 3 mm일 때, 회전에 의한 온도 균일도를 측정을 하였다. 가열원은 induction heater (viewtong, VT-180C2)를 사용하였고, 가열된 graphite 표면의 온도를 2차원적으로 평가하기 위하여 적외선 열화상 카메라(Fluke, Ti-10)을 이용하여 온도를 측정하였다. 기판을 회전하면서 표면 온도의 평균과 표준 편차를 측정한 결과 2.5 RPM일 때 평균온도 $163^{\circ}C$ 에서 가장 좋은 5.5 %의 불균일도를 확인할 수 있었고, 이를 상용화 전산 유체 역학 코드인 CFD-ACE+의 모델링 결과와 비교 분석 하였다.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.680-688
• /
• 2004

In this paper, we propose a new handoff scheme which is efficient in hybrid mobile data network consists of cellular mobile network and wireless LAN. In this scheme, handoff is delayed until connections with wireless LAN and data rates are smoothly decreased according to becon signal strength of wireless LAN. By doing so, data transfer capacity is increased and required data buffer in handoff for mobile and network system can be decreased. We analyze new handoff scheme by computer simulation. The results show that 180Mbytes data can be transferred additionally in handoff processing and required buffer size can be decreased 1/2 with the conditions that mobile speed is 1Km/hr and the data rate of a original call is 2,048Kbps.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.509-516
• /
• 2008

Recently, the operator modules to control external devices are concerned about automatic management system to process continuously changed signals. These signals are the stream data of which characteristics are several numbers. a short report interval and asynchronous report time. It is necessary that the system brings about high accuracy and real time process for stream data. The typical queries of these systems consist of the current query to search the latest signal value, the snapshot query at a past time, the sliding window query from a past time to current. In this paper, we propose the efficient method to manage the above signals by using a file structured database in small-size operating systems. We also propose a query model to accommodate various queries including the sliding window query. The file database in the QNX adopts a delta version and a shared memory buffering method for the resource limit of a small storage and a low computing power.