• Journal of Broadcast Engineering
• /
• v.14 no.6
• /
• pp.796-806
• /
• 2009

SVC (Scalable Video Coding) is a new video coding standard to provide convergence media service in heterogeneous environments with different networks and diverse terminals through spatial-temporal-quality combined flexible scalabilities. This paper presents the performance analysis on packet loss in the delivery of SVC over IP networks and an efficient adaptation method to packet loss caused by buffer overflow. In particular, SVC with MGS (Medium Grained Scalability) as well as spatial and temporal scalabilities is addressed in the consideration of packet-based adaptation since finer adaptation is possible with a sufficient numbers of quality layers in MGS. The effect on spatio-temporal quality due to the packet loss of SVC with MGS is evaluated. In order to minimize quality degradation resulted by packet loss, the proposed adaptation of MGS based SVC first sets adaptation unit of AU (Access Unit) or GOP corresponding to allowed delay and then selectively discards packets in order of importance in terms of layer dependency. In the experiment, the effects of packet loss on quantitative qualities are analyzed and the effectiveness of the proposed adaptation to packet loss is shown.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.93-103
• /
• 2006

Network solutions for protecting against worm attacks that complement partial end system patch deployment is a pressing problem. In the content-based worm filtering, the challenges focus on the detection accuracy and its performance enhancement problem. We present a worm filter architecture using the bloom filter for deployment at high-speed transit points on the Internet, including firewalls and gateways. Content-based packet filtering at multi-gigabit line rates, in general, is a challenging problem due to the signature explosion problem that curtails performance. We show that for worm malware, in particular, buffer overflow worms which comprise a large segment of recent outbreaks, scalable -- accurate, cut-through, and extensible -- filtering performance is feasible. We demonstrate the efficacy of the design by implementing it on an Intel IXP network processor platform with gigabit interfaces. We benchmark the worm filter network appliance on a suite of current/past worms, showing multi-gigabit line speed filtering prowess with minimal footprint on end-to-end network performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.653-660
• /
• 2013

This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

• Journal of IKEEE
• /
• v.9 no.2 s.17
• /
• pp.123-135
• /
• 2005

3GPP RLC protocol specification adopted a window-controlled selective-repeat ARQ scheme for provisioning reliable data transmission. Inevitably, the re-ordering issue arises in the 3GPP's ARQ since it belongs to the selective-repeat ARQ clan. A long re-ordering time results in the degradation of throughput and delay performance, and may invoke the overflow of the re-ordering buffer. Also, the re-ordering time must be regulated to meet the requirements of some services which are both loss-sensitive and delay-sensitive. In the 3GPP's ARQ, we may deflate the occupancy of the re-ordering buffer by reducing the window size and/or length of the status report period. Such a decrease, however, deteriorates the throughput and delay performance and encroaches the resource of the reverse channel. Aiming at reducing the occupancy at the re-ordering buffer while suppressing the degradation of throughput and delay performance, we propose threshold-dependent occupancy control schemes, identified as post-threshold and pre-threshold schemes, as supplements to the 3GPP's ARQ. For judging the effectiveness of the proposed schemes, we investigate peak occupancy, maximum throughput and average delay in the practical environment involving fading channels. From the simulation results, we observe that the proposed schemes invoke the performance trade-off between occupancy and throughput in general. Also, we reveal that the post-threshold scheme is able to improve the throughput and delay performance of the ordinary 3GPP's ARQ without inflating the occupancy of the re-ordering buffer.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.51-61
• /
• 2007

For provisioning reliable data transmission, the 3GPP RLC specification adopted a selective-repeat ARQ scheme assisted by a window-based admission control scheme. In the 3GPP ARQ, which is a member of the selective-repeat ARQ clan, inheres the reordering problem A long and irregular reordering time results in the degradation of throughput and delay performance, and may incur the overflow of the reordering buffer. Furthermore, the reordering time must be regulated to meet the requirements of some services which are loss-sensitive and delay-sensitive as well. Perceiving the reordering hazard, we propose an alternative, identified as snowball scheme, to the original admission control scheme of the 3GPP ARQ with aiming at deflating the occupancy of the reordering buffer. A unique feature of the snowball scheme is to reject a new DATA PDU if it is non-adjacent to any DATA PDU sojourning at the reordering buffer. Such an intentional rejection apparently reduces the occupancy of the reordering buffer while it may deteriorate the throughput and delay performance. Developing an analytical approximation method, we investigate the effect of snowball scheme on the saturated occupancy and throughput. Also, we, using a simulation method, evaluate the peak occupancy, normalized throughput and average delay in the practical environment. From the simulation results, we reveal that the snowball scheme is able to enhance occupancy performance as well as throughput performance compared with the original admission control scheme of the 3GPP ARQ.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.334-337
• /
• 2002

특정 프로그램의 취약점 여부를 판단하기 위해 프로그램의 버전이나 작동여부를 점검하여 검증하는 방식이 많이 사용되었다. 하지만, 이 방식은 취약점 증명에 영향을 미치는 많은 요소들을 모두 고려할 수 없기 때문에 점검 결과가 부정확하다는 단점이 있다. 최근에는 이를 보완하기 위해 해당 프로그램에 실제로 공격을 수행하고 그 성공 여부를 통해 취약점 여부를 검증하는 방식이 사용되고 있다. 이렇게 실제 공격코드를 이용하는 방법은 정확한 결과를 얻을 수 있다는 장점이 있지만, 공격코드를 구현하기 어렵다는 단점이 있다. 본 논문에서는 공격코드들의 구조를 분석하여 공통된 부분들을 모듈화하고 이를 재사용함으로써 다양한 취약점을 정확하게 점검할 수 있고, 새로운 취약점에 대해서도 쉽게 확장할 수 있는 취약점 증명을 위한 프레임워크를 제시한다.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.1-11
• /
• 2001

There are several traditional factors of software quality. Some of them are such as correctness, reliability, efficiency, compatibility, portability, etc. In addition to them, security is required as another factor of software quality nowadays because some application programs are used as a way to attack information systems by stack frame manipulation. Each processor has its own peculiar stack frame mechanism and C language uses the characteristics of them. This paper explains the concept of security problem caused by stack frame manipulation, and the stack frame mechanism of Pentium, Alpha and SP ARC processor in detail. And then it examines the effect of stack frame mechanism on the security of programs in C language.

• Journal of Advanced Navigation Technology
• /
• v.17 no.2
• /
• pp.218-224
• /
• 2013

Uplink overflow in WMSN (Wireless Multimedia Sensor Networks) aggravates the resource consumption, delay, and traffic congestion. This paper proposes a new traffic congestion control mechanism using popularity. The proposed mechanism controls congestions by dispersing the media traffic, and it control fairly packets according to priority. This paper proposes PQS (Packet Queue Scheduler) to control fairly packets, and the proposed mechanism provides a fair opportunity to all sensor nodes without a specific location. The simulation results show that the proposed mechanism achieves improved performance in throughput, delay ratio, link quality, and buffer queue control ratio compared with those of other existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1383-1391
• /
• 1999

This paper presents a rate control method that minimizes global distortion under given target bit rates for video communication. This method makes the quality of reconstructed images better than that of the conventional ones based on R-D model at the same bit rates. Given a set of quantizers, a sequence of macroblocks to be quantized selects the optimal quantizer for each macroblock so that the total cost measure is minimized and the finite buffer is never in overflow. To solve this problem we provide a heuristic algorithm based on Lagrangian optimization using an operational rate-distortion framework and a quantization method follows H.263recommendation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.21-31
• /
• 1998

In this paper, a new algorithm is proposed which distributes multicast cells in a copy network. The dual copy network is composed of running adder network, distributor, dummy address encoder, and broadcasting network. It is operated lower input address and higher one simultaneously by the distribution algorithm. As a result, for each input has a better equal opportunity of processing, cell delay and hardware complexity are reduced in copy network. Also, for it adopts the broadcasting network from an expansion Banyan network with binary tree and Banyan network, overflow probability is reduced to a half in that network. As a result of computer simulation, the copy network processed by the distribution algorithm is remarkably improved in cell delay of input buffer according to all input loads.