• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.137-145
• /
• 2006

In this paper, we propose a multicast P2Patching technique in the application layer. The P2Patching technique serves VOD stream effectively with Patching in P2P environment. The P2Patching provides multicast tree construction technique that reduces the server load and minimizes the start delay with extended multicast technique. And we provide a fast recovery technique by tree failure and dynamic buffering scheme that guarantees the continuous streaming by frequent tree disconnections. Comparing the method with that of $P2Cast^{[12]}$, we obtained the better performance by our scheme in terms of average join count, service rejection probability, tree recovery failure and buffer starvation. The average about 16$\%$ of the improvement is shown by the simulation. Most of all, the performance of buffer starvation and average join count shows a significant improvement than that of P2Cast.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.17-28
• /
• 2008

Recently, main memory access is a performance bottleneck for many computer applications. Cache memory is introduced in order to reduce memory access latency. However, it is possible for cache memory to reduce memory access latency, when desired data are located on cache. EST tree is proposed to solve this problem by improving T tree. However, when doing a range search, EST tree has to search unnecessary nodes. Therefore, this paper proposes $CST^+$ tree which has the merit of CST tree and is possible to do a range search by linking data nodes with linked lists. By experiments, we show that $CST^+$ is $4{\sim}10$ times as fast as CST and $CSB^+$. In addition, rebuilding an index Is an essential step for the database recovery from system failure. In this paper, we propose a fast tree index rebuilding algorithm called MaxPL. MaxPL has no node-split overhead and employs a parallelism for reading the data records and inserting the keys into the index. We show that MaxPL is $2{\sim}11$ times as fast as sequential insert and batch insert.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2008-2019
• /
• 2000

In this paper, we propose a recovery method for high dimensional index structures. It recovers efficiently transactions including reinsert operations that needs undo or rollback due to system failures or transaction failures. It is based on WAL(Write Ahead Logging) protocol. We apply the method to the FCIR-Tree and implement it based on MiDAS-III which is the storage system of a multimedia DBMS, called BADA-III. We also show through performance evaluation that the recovery method with our algorithm recovers reinsert operations efficiently over that without our algorithm.

• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.28-34
• /
• 2007

Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes perform local error recovery for their receiver nodes using the data stored in their buffers. We propose a packet loss patterns adaptive feedback scheduling scheme to manage these buffers in an efficient manner. Under our scheme, receiver nodes send NAKs to repair nodes to request packet retransmissions only when the packet losses are independent events from other nodes. At dynamic and infrequent intervals, they also send ACKs to indicate which packets can be safely discarded from the repair node's buffer. Our scheme reduces delay in error recovery because the requested packets are almost always available in the repair node's buffers. It also reduces the repair node's workload because (a) each receiver node sends infrequent ACKs with non-fixed intervals and (b) their sending times are fairly distributed among all the receiver nodes.

• Journal of Korean Society for Atmospheric Environment
• /
• v.18 no.6
• /
• pp.515-525
• /
• 2002

A field study was conducted to estimate the emission rate of biogenic volatile organic compounds (BVOCs) from pine trees. In addition, the influences of meteological variables on their distribution characteristics have been investigated. A vegetation enclosure chamber was designed and constructed of Tedlar bag and acril. Sorbent tubes made up of Tenax TA and Carbotrap were used to collect biogenic VOCs emitted from each individual tree. Analysis of BVOCs was performed using a GC-FID system. The fundamental analytical parameters including linearity, retention time, recovery efficiency, and breakthrough volume were examined and verified for the determination of monoterpene emission rates. Total average concentration of each component is found to be $\alpha$-pinene (16.5), $\beta$-pinene (4.61) from pine trees, and $\alpha$-pinene (42.4), $\beta$-pinene (18.7 ng(gdw)$^{-1}$ hr$^{-1}$ ) from Korean pine trees. On the basis of our study, $\alpha$-pinene was found to be the major monoterpene emitted from both pine and Korean pine trees which were accompanied by $\beta$-pinene, camphene, and limonene. In ambient air, variable monoterpene compositions of emissions from pine trees were similar to Korean pine trees. Emission rates of monoterpene from each tree were found to depend on such parameters as temperature and solar radiation.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.119-124
• /
• 2021

Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1546-1554
• /
• 1999

In this paper, Dynamic Fault Tree algorithm(DFT algorithm) is presented. This algorithm provides a concise representation of dynamic fault tolerance system including fault recovery techniques with fault detection, mask and switching function. And this algorithm define FDEP, CSP, SEQ, PAG gate which captures the dynamic characteristics of system. It show that this algorithm solved the constraints to satisfy the dynamic characteristics of system which there are in Markov and also this is able to satisfy the dynamic characteristics of system which there are in Markov and also this is able to covered the disadvantage of Fault tree methods. To show the key advantage of this algorithm, a traditional method, that is, Markov and Fault Tree, applies to TMR and Dual-Duplex systems with the dynamic characteristic and a presented method applies to those. He results proved that the DFT algorithm for solving the problems of the system is more effective than the Markov and Fault tree analysis model..

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.343-354
• /
• 2003

This paper describes algorithm that minimizes recovery time of packet loss resulting from handoff in multicast environments and guarantees reliability through interaction of FN(Foreign Network) with PMTP(Predictable Multicast Tree Protocol). To solve the problems that inefficient routing and handoff delay taking plate when using hi-directional tunneling and remote subscription independently in multicast environments, proposed algorithm uses tunneling and rejoining multicast group according to the status of an arriving FA in a foreign network. Furthermore, proposed algorithm sends packet loss information and register message to previous FA or current FA at the same time. so, MH is able to recovery packet loss in handoff delay as soon as possible. As a result of performance analysis, proposed algorithm is more efficient than previous researches and is applicable to existing handoff method without requiring additional procedures.

• KEPCO Journal on Electric Power and Energy
• /
• v.6 no.3
• /
• pp.259-269
• /
• 2020

With the proposal-agreement procedure, RSTP can reduce the network recovery time to 400 ms or less in the case of 40 bridges. While the legacy RSTP reverts the previous agreement at the bridge with the alternate port role in the ring during the fault recovery, a new position based fast fault recovery procedure is proposed in this paper to guarantee a single proposal-agreement transaction which can provide more faster recovery. By knowing the relative position of the faulty link or bridge in hops, the bridge on the middle of the ring can complete the recovery procedure without revert. The performance of proposed procedure is numerically calculated and verified by simulation and the result shows that the recovery time can be reduced up to 100 ms, which is 1/4 times of the legacy RSTP.

• Korean Journal of Soil Science and Fertilizer
• /
• v.33 no.5
• /
• pp.325-332
• /
• 2000

To determine the distribution and recovery of fall-applied N in various parts of satsuma mandarins (Citrus unshiu Marc). $19.68g\;N\;tree^{-1}$ as urea containing 5 atom % $^{15}N$ and 58 kg$K_2O$ $ha^{-1}$ were broadcast-applied to 11 years old 'Miyagawa Wase' grown at a spacing of $2.7{\times}2.7m$ on 18 November 1998. Nitrogen, $P_2O_5$, and $K_2O$ were applied at 104, 308, and $62kg\;ha^{-1}$ on 22 March and N and $K_2O$ at 42 and $83kg\;ha^{-1}$ on 15 June 1999. Two trees were excavated on 15 June and 8 December 1999, respectively. In mid-June, whole tree contained $168.2g\;N\;tree^{-1}$ of which 11.9, 42.1, 29.7, and 16.3% were in fruits, leaves, stems, and roots, respectively. In early December, total tree N averaged $169.8g\;tree^{-1}$ and fruits accounted for 27.6%, leaves 36.4%, stems 22.8%, and roots 13.2% of total tree N. Regardless of harvest date, N derived from fertilizer was highest in newly developed tissues. In mid June, the tree recovered 18.5% ($3.63g\;tree^{-1}$) of fertilizer N. Fruits accounted for 21.1%, leaves for 50.4%, stems for 21.5%, and roots for 7.9% of fertilizer-derived N in the tree, respectively. In early December, the tree recovered 17.0% of fertilizer N. Fruits contained 39.6%, leaves 40.5%, stems 14.5%, and roots 5.3% of fertilizer-derived N in the tree respectively. Comparing with total tree N, a higher proportion of fertilizer-derived N was allocated to metabolically active tissues while a less proportion to old tissues regardless of harvest date.