• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.778-780
• /
• 2001

ATM(Asynchronous Transfer Mode) 망은 사용자의 요구에 의해 대역폭을 할당한 수 있으므로 전송에 필요한 대역폭이 수시로 변화하는 MPEG 비디오를 전송하는데 적합하다. 그러나 MPEG 트래픽(traffic)은 셀(cell) 발생량의 변화가 심한 군집성 (burst)이 큰 트래픽 이기에 전송 품질을 유지하면서 동시에 망의 대역폭을 효율적으로 사용하는 전송을 구현하기가 매우 힘들다. 본 연구에서는 이러한 상반되는 두 가지의 목적을 수행하기 위하여 새로운 대역폭 할당 기법을 제안하였다. 사용자에게 최소한의 품질을 보장하면서 망에 대역폭의 여유가 있는 경우 고품질의 서비스가 가능토록 하는 방안으로 ATM 망의 CBR(Constant Bit Rate) 서비스와 VBR(Variable Bit Rate) 서비스를 복합적으로 사용하는 방법을 제안하였다. 이의 구현을 위하여 2 계층 구조의 MPEG 부호화기를 설계, 구현하였고 모의 실험을 통하여 기존의 단일 계층 CBR 서비스에 비하여 품질과 망의 효율성에 있어 충분히 우수함을 확인하여 그 효용성을 증명하였다.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.285-292
• /
• 2007

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.33-42
• /
• 2001

We consider a model describing large scale performance of multiservice networks supporting both constant- and adaptive-rate services. As the number of constant-rate connection changes over time in multiservice networks, the available bandwidth for adaptive-rate connections changes as well. We estimate the available bandwidth for adaptive-rate service in a dynamically changing traffic environment based on Erlang fixed point equation and Little\`s law. The bandwidth allocation for adaptive-rate service is determined by the max-min fairness criterion. We find an upper bound on the average minimum throughput for adaptive-rate service, and 7how that the bound is achieved in large-capacity networks. This is verified using network examples. Since max-min fair allocation may not maximize the total throughput or revenue in a network, we consider adjustments via network level priority schemes to increase efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.449-450
• /
• 2015

This paper describes performance evaluation results of a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system without using an explicit request. An ONU (optical network unit) does not send its request to an OLT (optical line termination). The OLT monitors the upstream bandwidth usage of the ONU to estimate the request of the ONU.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.170-176
• /
• 1999

This paper addresses the design of object distribution in distributed object-oriented databases. The proposed strategy of object distribution consists of two-step design of fragments. One step is class fragmentation and the other is allocation of fragments. We define partitioning algorithms to reflect the characteristics of object-oriented databases in the class fragmentation and define expressions to reduce the amount of data transfer by allocating fragments of other classes referred together to one site in the allocation of fragments

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.152-153
• /
• 2014

This paper proposes a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system in which an ONU (optical network unit) does not explicitly send its request to an OLT (optical line termination). To estimate the request of the ONU, the OLT monitors the upstream bandwidth usage of the ONU and periodically allocates a probe slot to the ONU.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.284-286
• /
• 2013

멀티채널 무선센서네트워크에서 기존의 채널할당 방법들은 각 노드마다 다른 채널을 할당하는 방법을 채택하여 연구하였다. 이러한 경우 노드 간 전송 시에 채널을 수신 노드의 채널로 변경하고 다시 자신의 수신 채널로 변경이 필요하다. 채널 변경에는 에너지를 소모하기 때문에 이를 줄인다면 전송에 좀더 많은 에너지를 사용할 수 있다. 따라서 본 논문에서는 하위 노드의 수를 이용하여 이를 기반으로 채널할당을 하고 성능평가를 통해 에너지소모량을 측정한다. 측정결과 기존 기법에 비해 약 12%의 성능 향상을 보였다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.51-54
• /
• 2001

지금까지의 비트 율 조절에 대한 연구는 일정한 프레임 율을 갖는다는 가정 하에서 매크로 블록 단에서의 연구가 대부분이었다. 그러나 저 전송률 환경에서는 사용 할 수 있는 bit 수가 적기 때문에 오히려 이러한 가정이 성능을 저하시킬 수 있다. 우리는 이 논문에서 저 전송률 환경에서 문제가 되는 motion jerkiness 와 flickering effort 를 개선시키고 프레임 skip 을 방지하는 비트율 조절 방법을 제안한다. 제안된 기법은 허용하는 지연 시간 안에서 부호화단에 부가적인 계산량을 거치 부가하지 않기 때문에 실시간 처리에 적합하다. 실험 결과는 우리의 기법이 저 전송률 환경에 적함함을 보여준다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.81-90
• /
• 2005

When we transmit signals, which are quantized by the vector quantizer (VQ), through noisy channels, the overall performance of the coding system is very dependent on the employed quantization scheme and the channel error effect. In order to design an optimal coding system, the source and channel coding scheme should be jointly optimized as in the channel-optimized VQ. As a suboptimal approach, we may consider the robust VQ (RVQ). In RVQ, we consider developing an index assignment function for mapping the output of quantizers to channel symbols so that the effect of the channel errors is minimized. Recently, a VQ, which can reduce the encoding complexity and is called the sample-adaptive product quantizer (SAPQ), has been proposed. SAPQ has very similar quantizer structure as to the product quantizer (PQ). However, the quantization performance can be better than PQ. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. In this paper, SAPQ is employed in order to design an RVQ to channel errors by reducing the vector dimension. Discussions on the codebook structure of SAPQ and experiments are introduced in an aspect of robustness to noisy channels.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.80-87
• /
• 2013

This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.