• ETRI Journal
• /
• v.26 no.1
• /
• pp.27-37
• /
• 2004

The architecture in a differentiated services (DiffServ) network is based on a simple model that applies a per-class service in the core node of the network. However, because the network behavior is simple, the network structure and provisioning is complicated. If a service provider wants dynamic provisioning or a better bandwidth guarantee, the differentiated services network must use a signaling protocol with QoS parameters or an admission control method. Unfortunately, these methods increase the complexity. To overcome the problems with complexity, we investigated scalable dynamic provisioning for admission control in DiffServ networks. We propose a new scalable $qDPM^2$ mechanism based on a centralized bandwidth broker and distributed measurement-based admission control and movable boundary bandwidth management to support heterogeneous QoS requirements in DiffServ networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4823-4843
• /
• 2017

In this paper, an improved utility-based cross-layer dynamic subcarrier allocation (DSA) algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system, which adopts adaptive service rate control (ASRC) to eliminate the service rate waste and improve the spectral efficiency in heterogeneous network including non-real-time traffic and real-time traffic. In this algorithm, furthermore, a first in first out (FIFO) queuing model with finite space is established on the cross-layer scheduling framework. Simulation results indicate that by taking the service rate constraint as the necessary condition for optimality, the ASRC algorithm can effectively eliminate the service rate waste without compromising the scheduling performance. Moreover, the ASRC algorithm is able to further improve the quality of service (QoS) performance and transmission throughput by contributing an attractive performance trade-off between real-time and non-real-time applications.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.12
• /
• pp.1193-1200
• /
• 2016

In this paper, we developed a system for measuring a passive intermodulation distortion signal of the mobile communication RF module having a wide band characteristic. The Broadband was designed to represent the characteristics of the receiver to meet the low noise characteristics and wideband characteristics in the RF receiver were to represent a wide dynamic range(high dynamic range)from the RF receiving end. PIMD designed passive intermodulation distortion signal measured by applying the FPGA / DSP in the system was measured to record the program on the PC. Variable up to 650MHz-2700MHz showed up to-138dBc measured PIMD3.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1479-1501
• /
• 2020

Dependable functioning of dynamic networks is essential for delivering ubiquitous services. Faults are the root causes of network outages. The comparison diagnosis model, which automates fault's identification, is one of the leading approaches to attain network dependability. Most of the existing research has focused on stationary networks. Nonetheless, the time-free comparison model imposes no time constraints on the system under considerations, and it suits most of the diagnosis requirements of dynamic networks. This paper presents a novel protocol that diagnoses faulty nodes in diagnosable dynamic networks. The proposed protocol comprises two stages, a testing stage, which uses the time-free comparison model to diagnose faulty neighbour nodes, and a disseminating stage, which leverages a Random Linear Network Coding (RLNC) technique to disseminate the partial view of nodes. We analysed and evaluated the performance of the proposed protocol under various scenarios, considering two metrics: communication overhead and diagnosis time. The simulation results revealed that the proposed protocol diagnoses different types of faults in dynamic networks. Compared with most related protocols, our proposed protocol has very low communication overhead and diagnosis time. These results demonstrated that the proposed protocol is energy-efficient, scalable, and robust.

• International Journal of Contents
• /
• v.6 no.1
• /
• pp.47-52
• /
• 2010

Skyline queries are an important new search capability for multi-dimensional databases. Most of the previous works have focused on processing skyline queries over static data set. However, most of the real applications deal with the dynamic data set. Since dynamic data set constantly changes as time passes, the continuous skyline computation over dynamic data set becomes ever more complicated. In this paper, we propose a multiple layer grids method for continuous skyline computation (MLGCS) that maintains multiple layer grids to manage the dynamic data set. The proposed method divides the work space into multiple layer grids and creates the skyline influence region in the grid of each layer. In the continuous environment, the continuous skyline queries are only handled when the updating data points are in the skyline influence region of each layer grid. Experiments based on various data distributions show that our proposed method outperforms the existing methods.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.38 no.3
• /
• pp.31-39
• /
• 2001

In this paper, we proposed a new pixel circuit of the CMOS image sensor for high dynamic range operation, which is based on a multiple sampling scheme and a conditional reset circuit. To expand the pixel dynamic range, the output is multiple-sampled in the integration time. In each sampling, the pixel output is compared with a reference voltage, and the result of comparison may activate the conditional reset circuit. The times of conditional reset, N, during the integration will contribute to the increase of the dynamic range by the times of N. The test chip was fabricated with 0.65-${\mu}m$ CMOS technology (2-P, 2-M).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.60-70
• /
• 2006

Currently, Scalable Video Coding (SVC) is being standardized. By using scalability of SVC, QoS managed video streaming service is enabled in heterogeneous networks even with only one original bitstream. But current SVC is insufficient to dynamic video conversion for the scalability, thereby the adaptation of bitrate to meet a fluctuating network condition is limited. In this paper, we propose dynamic full-scalability conversion method for QoS adaptive video streaming in H.264/AVC SVC. To accomplish full scalability dynamic conversion, we propose corresponding bitstream extraction, encoding and decoding schemes. On the encoder, we newly insert the IDR NAL to solve the problems of spatial scalability conversion. On the extractor, we analyze the SVC bitstream to get the information which enable dynamic extraction. By using this information, real time extraction is achieved. Finally, we develop the decoder so that it can manage changing bitrate to support real time full-scalability. The experimental results showed that dynamic full-scalability conversion was verified and it was necessary for time varying network condition.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2942-2944
• /
• 2005

마이크로 프로세서의 클럭 속도를 공급 전압에 따라 변하게 하는 방법을 Dynamic Voltage Scaling 방법이라 한다. 이것은 운영체제를 내장한 컴퓨터 시스템의 에너지 소비 효율성을 높일 수 있는 매우 효과적인 방법이다. 본 논문에서는 Dynamic Voltage Scaling 방법을 응용하여 실시간 운영체제의 스케줄링 방법을 제안하였다. 이 방법은 다음에 실행할 태스크의 양을 예하여 적절하게 공급전압과 클럭 속도를 조절함으로써 에너지 소비 효율성을 높였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.326-329
• /
• 2004

Content adaptation is an effective solution to support the quality of service over multimedia services over heterogeneous environments. This paper deals with the accuracy and the real-time requirement, two important issues in making decision on content adaptation. From our previous problem formulation, we propose an optimal algorithm and a fast approximation based on the Viterbi algorithm of dynamic programming. Through extensive experiments, we show that the proposed algorithms can enable accurate adaptation decisions, and especially they can support the real-time processing.