• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.3-11
• /
• 2000

This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. TBPJ scheme shows also better performance than that of HOL scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.854-861
• /
• 2003

In this paper, we proposed the fuzzy control algorithm for efficient buffer control about traffic that is connected in ATM networks. The proposed Fuzzy control algorithm has total traffic arrival ratio, buffer occupancy ratio and Fuzzy set to search for dynamic service rates in server. That is, is based on Fuzzy logic according to the arrival ratio of total traffic and buffer occupancy ratio that is happened and reasoning. Then, made reasoning result control service rates in server about traffic that is connected with defuzzification value. Performance analysis result: it was confirmed that with the proposed scheme, performance improves at cell loss rate, when compared with the existing PBS scheme.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.47-53
• /
• 2004

The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7C
• /
• pp.664-669
• /
• 2002

In this paper, we propose the fuzzy control algorithm for effective buffer control to connected traffic in ATM networks. The proposed Fuzzy control algorithm has two priorities and uses Fuzzy sets to search for dynamic thresholds. In this words, the difuzzification value controls the threshold in the buffer to according to traffic priority (low or high) using fuzzy set theory for traffic connected after reasoning. Performance analysis result: it was confirmed that with the proposed scheme, performance improves at cell loss rate, when compared with the existing PBS scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.263-271
• /
• 2004

In this paper, we proposed a new buffer management algorithm using perVC-Queuing discipline. Proposed algorithm uses service rate estimation and assigns dynamic perVC threshold to each VCs. Service rate estimation and dynamic perVC threshold combined with global threshold provide nearly optimal throughput and improve fairness performance of network resource among GFR VCs as well as guarantee MCR of all VCs. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

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

Reducing energy consumption in a wireless video sensor network (WVSN) is a crucial problem because of the high video data volume and severe energy constraints of battery-powered WVSN nodes. In this paper, we present an adaptive dynamic resizing approach for a SRAM communication buffer in a WVSN node in order to reduce the energy consumption and thereby, to maximize the lifetime of the WVSN nodes. To reduce the power consumption of the communication part, which is typically the most energy-consuming component in the WVSN nodes, the radio needs to remain turned off during the data buffer-filling period as well as idle period. As the radio ON/OFF transition incurs extra energy consumption, we need to reduce the ON/OFF transition frequency, which requires a large-sized buffer. However, a large-sized SRAM buffer results in more energy consumption because SRAM power consumption is proportional to the memory size. We can dynamically adjust any active buffer memory size by utilizing a power-gating technique to reflect the optimal control on the buffer size. This paper aims at finding the optimal buffer size, based on the trade-off between the respective energy consumption ratios of the communication buffer and the radio part, respectively. We derive a formula showing the relationship between control variables, including active buffer size and total energy consumption, to mathematically determine the optimal buffer size for any given conditions to minimize total energy consumption. Simulation results show that the overall energy reduction, using our approach, is up to 40.48% (26.96% on average) compared to the conventional wireless communication scheme. In addition, the lifetime of the WVSN node has been extended by 22.17% on average, compared to the existing approaches.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.36-48
• /
• 1999

Controlled transfer (CT) service has been recently proposed as a new ATM transfer capability for high-speed data applications, which used a credit-based flow control. This paper investigates buffer allocation schemes for CT service and proposes an improved dynamic bugger allocation scheme. In order to improve the responsiveness to a congestion, the proposed method is considered the load factor of a link when determining the amounts of virtual connection (VC)s buffer allocation. Also, in this paper we compare the performance of the proposed method with those of the existing buffer allocation methods such as flow controlled virtual channels (FCVC) and zero queueing flow control (ZQFC) through simulation. Simulation results show tat the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1039-1048
• /
• 2015

Recently, the web-based adaptive streaming service, DASH (Dynamic Adaptive Streaming over HTTP), is receiving more attention. However, existing network-based and buffer-based video quality control schemes in DASH environments make oscillation of segment throughput, causing degradation of the quality of experience (QoE) with frequent quality changes and playback interruptions because these schemes do not consider the content characteristics. In this paper, we propose a C-DASH (Content Characteristics based Dynamic Adaptive Streaming over HTTP) scheme in order to improve the QoE in DASH environments. The C-DASH scheme performs seamless and smooth quality control based on the segment throughput, buffer status, and segment size of the content. Based on simulation results, it is confirmed that the C-DASH scheme can improve the QoE, when compared with the existing quality control schemes.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.97-100
• /
• 2001

A common network such as internet does not provide a guaranteed network bandwidth to accommodate multimedia service in a reliable fashion. In this paper, we propose a new rate control mechanism for multimedia service on the internet which is adaptive to the dynamic QoS in real-time. Also we adapt an QoS monitoring module and real-time transmission control module to adapt dynamic network bandwidth. To do this, we used layer attribution of media data and also considered loss rate and buffer threshold in receiver side for measurement of dynamic QoS.