• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.213-220
• /
• 2002

Distributed competing system gives a new system architecture to be taken into consideration for solving the problems of interoperability of heterogeneous systems. In the present paper, CORBA based on multi-threaded interoperates with software blocks at physically isolated hardware. We show how archives optimal CORBA system from analysis of required functions, implementations of protocols and benchmarking of system performance in the Open Multi-service Network System Environment. The core features of our CORBA system are restricted Quality of Service based on priority, timeout service and exception status information notify to the related software blocks. And the objectives are design and implementation of high performance multi-threaded middleware and satisfied with extendibility, flexibility and stability of CORBA platform.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.148-158
• /
• 2007

Recently, IEEE 802.15.4a(low-rate UWB) technique has been paid much attention to the LR-UWB communication system for WPAN. However, there are various interferences such as MPI(Multi Path Interference) or IPI(Inter Piconet Interference) in IEEE 802.15.4a wireless channel. In order to cancel various interferences occurred to WPAN environment, in this paper, we propose a UWB wireless communication system with high QoS(Quality of Service) which is a chaotic-OOK(On-Off Keying) system using unipolar ZCD(Zero Correlation Duration) spreading code in physical layer level. Furthermore, we analyze its performance via simulations and verify the availability of proposed system with prototype implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7C
• /
• pp.691-699
• /
• 2006

Despite of the in-depth effort to cantrol the variability in IP networks, quality of service (QoS) is still not guaranteed in the IP networks. Thus, it is necessary to deal with the audible artifacts caused by packet lasses. To overcame the packet loss problem, most speech coding standard have their own embedded packet loss concealment (PLC) algorithms which adapt extrapolation methods utilizing the dependency on adjacent frames. Since many low bit rate CELP coders use predictive schemes for increasing coding efficiency, however, error propagation occurs even if single packet is lost. In this paper, we propose an efficient PLC algorithm with consideration about the speech characteristics of lost frames. To design an efficient PLC algorithm, we perform several experiments on investigating the error propagation effect of lost frames of a predictive coder. And then, we summarize the impact of packet loss to the speech characteristics and analyze the importance of the encoded parameters depending on each speech classes. From the result of the experiments, we propose a new PLC algorithm that mainly focuses on reducing the error propagation time. Experimental results show that the performance is much higher than conventional extrapolation methods over various frame erasure rate (FER) conditions. Especially the difference is remarkable in high FER condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1802-1807
• /
• 2015

The cloud computing service provides physical IT resources to VM instances to users using virtual technique and the users pay cost of VM instances to service provider. The auction model based on cloud computing provides available resources of service provider to users through auction mechanism. The users bid spot instances to process their a job until its deadline time. If the bidding price of users is higher than the spot price, the user will be provided the spot instances by service provider. In this paper, we propose a new bidding strategy to minimize the total cost for job completion. Typically, the users propose bidding price as high as possible to get the spot instances and the spot price get high. we lower the spot price using proposed strategy and minimize the total cost for job completion. To evaluate the performance of our strategy, we compare the spot price and the total cost for job completion with real workload data.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.450-456
• /
• 2010

In the high-speed packet service, next generation mobile communication system has emerged as a major feature. If the fire of these high-speed kit services and non-continuous transmission of data due to the symmetrical nature of daeyiteo traffic for D-CDMA system has been actively studied. Small amounts of data moving in the uplink, but the real-time video downlink transmission, such as downloading large files to move data and services to those with asymmetric traffic characteristics, a system that can efficiently handle the data requirements be. Of 3GPP TDD(Time Division Duplex) scheme based on CDMA and TDMA in a way by introducing the concept through the proper allocation of time slots that can handle asymmetric traffic efficiently, has an advantage. TD-CDMA system by considering the characteristics of the frame configuration of transmission methods, such as physical channel structure and channel coding has been investigated. In addition, the HARQ scheme TD-CDMA system performance is analyzed by comparing them.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.663-668
• /
• 2003

With the advent of high speed networking technology, computers connected to the high-speed networks tend to consume more of their CPU cycles to process data. So one of the solutions to improve the performance of the computers is to reduce the CPU cycles for processing the data. As the consumption of the CPU cycles is increased in proportion to the number of the packets per second to be processed, reducing the number of the packets per second by increasing the length of the packet is one of the solutions. In order to meet this requirement, two types of jumbo packets such as jumbograms and jumbo frames have already been standardized or being discussed. In case that the jumbograms and general packets are interleaved and scheduled together in a router, the jumbogrms may deteriorate the QoS of the general packets due to the transfer delay. They also frequently exhaust the memory with storing the huge length of the packets. This produces the congestion state easily in the router that results in the loss of the packets. In this paper, we analyze the problems in processing the jumbo packets and suggest a noble solution to overcome the problems.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2605-2614
• /
• 1997

Recently, we are concerned with effective service according as the demand increase for high speed data service. We can use high speed transfer and multiple traffic service on the ATM networks, so we concentrate on preventive-control method rather than reactive-control one. But it is possible to have low QoS and traffic congestion due to unpredictable traffic and burst traffic. Specially, ATM Forum has discussed to standardization of traffic management of ABR(Available Bit Rate) service. Because ABR traffic controls the flow of traffic using the feedback information and the current status information of cell, it allocates bandwidth systematically and dynamically to the user. In this paper, we propose a new Rate-based flow control scheme which adapted double threshold buffer idea. The double threshold buffer controls the traffic control by establishing two threshold in buffer.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1387-1390
• /
• 2008

In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). In view of this many schemes have been developed which aim to reduce the handover latency. The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile and its correspondent nodes. HMIPv6 can avoid this situation by using more than one mobility anchor point for each link. In [3], an improved Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It has been shown that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if mobile nodes perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local binding update units (LBUs) as to two MAPs. To reduce this communication overhead, a new cost-reduced binding update scheme is proposed here, which reduces the communication overhead compared to previous schemes, by using an increased number of MAP switches. Using this new proposed method, it is shown that there is a 19.6% performance improvement in terms of the total handover latency.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.191-195
• /
• 2008

This paper proposes a technique for improving IEEE 802.11e EDCA's performance by dynamically adjusting each class's contention window size based on each class's traffic amount. For providing differentiated service differently from 802.11, 802.11e EDCA maintains four classes each of which specifies different static minimum and maximum contention window sizes. Since the initial window sites significantly affect the 802.11e performance, several window adjustment schemes have been proposed. One of the schemes known as CWminAS (CWmin Adaptation Scheme) dynamically and synchronously determines the four windows' site based on the periodically measured collision rate. This method, however, can lower the send probability of high priority classes since it can't differentiate their collisions from those of low priority classes, leading to the channel underutilization. For solving this problem, we propose ACATICT(Adaptive Contention-window Adjustment Technique based on Individual Class Traffic) algorithm which adapts each class window size based on each individual collision rate rather than one average collision rate. Our simulation experiments show that ACATICT achieves better utilization by around 10% at maximum.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.11-19
• /
• 2019

Recently, hybrid CDN/P2P video streaming architecture is specially designed and deployed to achieve the scalability of P2P networks and the desired low delay and high throughput of CDNs. In this paper, we propose a cooperative video streaming and active node buffer management technique in hybrid CDN/P2P architecture. The key idea of this streaming strategy is to minimize network latency such as jitter and packet loss and to maximize the QoS(quality of service) by effectively and efficiently utilizing the information sharing of file location in CDN's proxy server which is an end node located close to a user and P2P network. Through simulation, we show that the proposed cooperative video streaming and active node buffer management technique based on CDN and P2P network improves the performance of realtime video streaming compared to previous methods.