• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2401-2408
• /
• 1997

The measured pulse shapes provided in the given data package demonstrated pulse distortions due to laser speckle. the distorted pulse shapes were carefully analyzed, modeled, and then applied to the DTTL(Digital-data Transition Tracking Loop)[1] bit synchronizer simulator to measure the mean time delay and its delay variation performance. The result showed that the maximum mean time delay variation with the modeled data was 12.5% when window size equals 1. All the data given were located within this modeled boundary and the maximum eman time delay variation was 7% in this case. The mean time delay variation was known to be smaller by reducing the window size [2][5][6]. The mitigated delay variation was 2.5% in the modeled case and 1.4% in the data set given when the windown size equals 0.1. With the digital DTTL insteal of analog DTTL, similar results was obtained.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.105-110
• /
• 2005

With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about $3.6{\%}{\~}11.1{\%}$ in terms of normalized surcharge for DUVCA. The time complexity of our algorithm is $O(mn^2)$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2157-2165
• /
• 2006

In implementing GCRA, well known as the representative user traffic policing algorithm for constant-bit rate service, it is essential to set proper values for delay variation tolerance in order to prevent network overload and excessive user data loss due to delay variation incurred inevitably during transmission process. In this paper, we investigate the performance of GCRA algorithm for various values of delay variation tolerance and suggest a guideline for setting proper delay variation tolerance values.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.437-442
• /
• 2005

The measurement of RTT (Round Trip Time) can be used for the analysis of Internet congestion. However, simple measuring of RTT which measures only hun around time of a packet can not infer a packet forward/backward delay variation. In this thesis, we present a new algorithm which can be used for the estimation of forward/backward delay variation of packets. These delay variations are implication of network congestion state. In this algorithm, the reference forward/backward delay can be determined based on the minimum RTT value. The delay variation of each packet can be calculated by comparing reference delay with the packet delay. We verified our proposed algorithm by NS-2 simulation and delay measuring in a real network.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.2
• /
• pp.32-39
• /
• 2010

Conventional cell characterization does not consider Multiple Input Switching(MIS). Since the impact of MIS on gate delay variation is large, it is not possible to predict the accurate gate delay with the conventional cell characterization. We observed the maximum 46% difference in gate delay due tn MIS. In this paper, we propose a gate delay model considering the delay variation caused by the temporal proximity of MIS. The proposed model calculates the delay variation using the Radial Basis Function. The experimental results show that the proposed method can more accurately predict the gate delay when MIS occurs.

• Journal of The Korean Astronomical Society
• /
• v.49 no.6
• /
• pp.289-293
• /
• 2016

We investigate the long-term spatial drift of the center and the temporal variation of the shutter delay time map of Y4KCam mounted on the CTIO 1.0 m telescope. We have collected shutter delay time maps over eight years as a part of our long-term survey program. We find that the center of the shutter delay time map can drift up to $450{\mu}m$, equivalent to ${\approx}30pixels$, on the CCD. This effect can result in a small amount of error in integration time without the proper shutter delay time correction, but it does not appear to cause any significant problems in photometric measurements. We obtain a mean shutter delay time of $69.1{\pm}0.8$ ms and find no temporal variation of the shutter delay time of Y4KCam over eight years, indicative of the mechanical stability of the shutter. We suggest that using a master shutter delay time correction frame would be sufficient to achieve high precision photometry, which does not exceed photometric errors ${\approx}1.7mmag$ across the CCD frame for exposure times longer than 1 s.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.175-183
• /
• 2008

QoS-support technology in networks is based on measuring QoS metrics which reflect a magnitude of stability and performance. The one-way delay measurement of the QoS metrics especially requires a guarantee of clock synchronization between end-to-end hosts. However, the hosts in networks have a relative or absolute difference in clock time by reason of clock offsets. flock skews and clock adjustments. In this paper, we present a theorem, methods and simulation results of one-way delay and clock offset estimations between end-to-end hosts. The proposed theorem is a relationship between one-way delay, one-way delay variation and round-trip time And we show that the estimation error is mathematically smaller than a quarter of round-trip time.

• Nuclear Medicine and Molecular Imaging
• /
• v.42 no.4
• /
• pp.285-291
• /
• 2008

Purpose: Although automatic quantification software of myocardial perfusion SPECT provides highly objective and reproducible quantitative measurements, there is still some limitation in the direct use of quantitative measurements. In this study we derived parameters using normal variation of perfusion measurements, and tried to test the usefulness of these parameters. Materials and Methods: In order to calculate normal variation of perfusion measurements on myocardial perfusion SPECT, 55 patients (M:F = 28:27) of low-likelihood for coronary artery disease were enrolled and $^{201}TI$ rest/$^{99m}Tc$-MIBI stress SPECT studies were performed. Using 20-segment model, mean (m) and standard deviation (SD) of perfusion were calculated in each segment. As a myocardial viability assessment group, another 48 patients with known coronary artery disease, who underwent coronary artery bypass graft surgery (CABG) were enrolled. $^{201}TI$ rest/$^{99m}Tc$-MIBI stress / $^{201}TI$ 24-hr delayed SPECT was performed before CABG and SPECT was followed up 3 months after CABG. From the preoperative 24-hr delayed SPECT, $Q_{delay}$ (perfusion measurement), ${\Delta}_{delay}$ ($Q_{delay}$ - m) and $Z_{delay}$ (($Q_{delay}$ - m)/SD) were defined and diagnostic performances of them for myocardial viability were evaluated using area under curve (AUC) on receiver operating characteristic (ROC) curve analysis. Results: Segmental perfusion measurements showed considerable normal variations among segments. In men, the lowest segmental perfusion measurement was $51.8{\pm}6.5$ and the highest segmental perfusion was $87.0{\pm}5.9$, and they are $58.7{\pm}8.1$ and $87.3{\pm}6.0$, respectively in women. In the viability assessment $Q_{delay}$ showed AUC of 0.633, while those for ${\Delta}_{delay}$ and $Z_{delay}$ were 0.735 and 0.716, respectively. The AUCs of ${\Delta}_{delay}$ and $Z_{delay}$ were significantly higher than that of $Q_{delay}$ (p = 0.001 and 0.018, respectively). The diagnostic performance of ${\Delta}_{delay}$, which showed highest AUC, was 85% of sensitivity and 53% of specificity at the optimal cutoff of -24.7. Conclusion: On automatic quantification of myocardial perfusion SPECT, the normal variation of perfusion measurements were considerable among segments. In the viability assessment, the parameters considering normal variation showed better diagnostic performance than the direct perfusion measurement. This study suggests that consideration of normal variation is important in the analysis of measurements on quantitative myocardial perfusion SPECT.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.31-43
• /
• 1996

In this paper, we analyze the delay characteristics of the multimdedia traffic in B-ISDN, and propose a weighted variable-size window estimator considering the QoS characteristics of the media and the variable delay characteristics of the networks, and present a delay estimator-based synchronization protocol for the efficient synchronization in ATM-based B-ISDN. The proposed estimator assigns a high weight value to recent cells arrived in the receiver, and suitably adjusts window size in order to efficiently adapt to delay variation by the prameter to detect the delay variation of the networks. The proposed synchronization protocol estimates end-to-end delay by the weighted variable-size window estimator, and dynamically schedules th evirtual channel of the transmitter to playout multimedia data on time in the receiver. Also, we evaluate the performance of the delay estimator, which is the most importnat functional element in our proposed synchronization protocol, by the simulation and analyze the results of the simulation.