• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.30-40
• /
• 2010

The hard disk is one of the most frequently used storage in IPTV sep-top box. It has large storage capacity and provides fast I/O speed compared to its price whereas it causes high power consumption due to mechanical characteristics of spindle motor. In order to play streaming data in the set-top box, spindle motor of hard disk keeps active mode and it causes high power consumption. In this paper, We propose an offset-buffering and multi-mode spin-down method to reduce power consumption for streaming data playback. The offset-buffering inspects the user's viewing pattern and performs buffering based on the analysis of viewing pattern. So, it can maintain the status of spindle motor as idle mode for long time. Besides, it can reduce power consumption by spinning down according to offset-buffer size. The experimental result shows that proposed offset-buffering and multi mode spin-down method is about 28.3% and 12.5% lower than the full-Buffering method in terms of the power consumption and spin-down frequency, respectively.

• Journal of Environmental Science International
• /
• v.11 no.8
• /
• pp.773-781
• /
• 2002

The natural carbon cycle has been perturbed since the mid-19th century by anthropogenic CO$_2$emissions from fossil fuel combustion and deforestation due to population growth and industrialization. The current study simulated the global carbon cycle for the past 42 years using an eight-box carbon cycle model. The results showed that since the terrestrial biospheric carbon sink was roughly offset by the deforestation source, the fossil fuel emission source was partitioned between the atmospheric and oceanic sinks. However, the partitioning ratio between the atmosphere and the ocean exhibited a change, that is, the carbon accumulation rate was faster in the atmosphere than in the ocean, due to a decrease in the so-called ocean buffering capacity. It was found that the ocean buffering capacity to take up excess CO$_2$decreased by 50% in terms of the buffer factor over the past 42 years. Accordingly, these results indicate that if the current CO$_2$emission trend continues, the future rate of increase in the atmospheric CO$_2$concentration will accelerate.

• ETRI Journal
• /
• v.40 no.3
• /
• pp.347-354
• /
• 2018

Using various offset times to separate differential services is the most common form of service differentiation in optical burst switching networks. In this approach, a larger offset time is given to a higher priority burst, but it causes this burst to have a longer delay. One solution to this problem is to adjust the burst assembly time so that the buffering delay of the higher priority burst is always shorter than that of the lower priority burst. However, this adjustment causes another problem, called delay unfairness, for bursts with differential priorities that share the same path to their destination. This article proposes a new solution for delay fairness using the burst assembly.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.