• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.1-9
• /
• 2011

Wireless mobile networks that exploit generalized PF scheduling can dynamically allocate network resources by using scheduling parameters. There are limitations to predict throughputs by the conventional stochastic approach in general. Moreover the limitations make it difficult to find appropriate scheduling parameters for achieving the demanded throughputs. This paper derives a prediction algorithm that predicts throughputs of the networks by using deterministic approach. A throughput adjust algorithm and a throughput switching algorithm are derived from the prediction algorithm. The performance of the throughput prediction/switching algorithms is evaluated by a simulator based on IEEE 802.16m system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.801-810
• /
• 2014

In this paper, we will provide a way to grant a differentiated service rate that is according to priorities of WLP device and WUSB/DRD transfer mode by improving D-SoQ that considers existing QoS of WiMedia WSS environment based on UWB technology. The proposed method makes it possible to differentiate SoQ performance and throughput, based on priority of traffic streams.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.21-26
• /
• 2002

Video stream invoke a variety of traffic with the structure of compression algorithm and image complexity. Thus, it is difficult to allocate the resource on the both sides of sender and receiver, and playout on the Internet such as a packet switched network. Thus, in this paper we proposed video stream smoothing using multistream for the effective transmission of video stream. This method specifies the type of LDU(logical data unit) according to the type of original stream, and then makes a large number of streams as a fixed size, and transfers them. So, the proposed method can reduce the buffering time which occurs during the process of the smoothing and prefetch be robust to the jitter on network, as well. Consequently, it has the effective transmission characteristics of fully utilizing the clients bandwidth.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.323-330
• /
• 2000

이동통신망의 발전으로 인해 한정적인 주파수 자원을 효율적으로 사용하여 폭증하는 가입자를 수용하기 위해 셀의 반경은 점점 작아지고 있다. 가입자에게 신규호의 실패보다 더 민감한 핸드오프호가 자주 발생함에 따라 핸드오프호 처리의 중요성이 증대되었다. 따라서, 셀마다 핸드오프호를 위한 예약 채널을 두어 어느 정도 신규호의 블록킹율의 증가를 감수하더라도, 핸드오프호의 강제종료율을 낮추는 방법이 제안되었다. 이러한 예약 채널 할당 기법에서는 예약 채널을 몇 개로 할 것인가가 중요한 문제가 된다. 왜냐하면 예약 채널 수를 과다하게 설정하면 핸드오프가 빈번하지 않은 셀에서는 채널의 낭비를 초래하고, 적게 설정하면 핸드오프가 빈번한 셀은 핸드오프 강제종료율이 높아지게 되기 때문이다. 이러한 문제를 해결하기 위해 본 논문은 신경망 모델 중 다층 퍼셉트론을 이용하여 셀에서 요구되는 최적의 예약율을 구하여 셀의 환경이 변할 때마다 적용할 수 있는 방법을 제안한다. 본 논문에서는 모의 실험을 통해 이동통신 시스템에서의 핸드오프 예약율을 주기적으로 최적화 시킴으로써 핸드오프가 자주 발생하는 셀에서는 핸드오프 강제종료율을 낮추고, 핸드오프가 빈번하지 않은 셀은 채널의 손실을 막아 시스템의 전체적인 효율이 향상됨을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.956-966
• /
• 2004

Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1647-1658
• /
• 2011

This paper suggests the methods to improve the wireless backhaul link of the Relay FDD mode that 3GPP LTE-Advanced supports. New RRC message and Relay startsup procedure are introduced to apply Carrier Aggregation in the Relay wireless backhaul. Also, we design new reference signal that makes Type 1 Relay operated in full-duplexing, expecting to maximize the radio resource utilization. And, we propose the efficient configuration for the periodic uplink control information under the backhaul subframe allocation method in LTE-Advanced Relay. Hereafter, the standard activities in the 3GPP RAN is supposed to focus on the improvement of the LTE-Advanced features. Therefore, the suggestions in this paper are expected to be actively discussed in the LTE-Advanced future releases.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.371-380
• /
• 2013

D2D (Device-to-Device) communication on an underlying cellular infrastructure which exploits the same spectrum has several advantages such as increased resource utilization and improved cellular coverage. However, D2D communication system needs to cope with ICI (Inter-Cell Interference) and interference between cellular and D2D links. As a result, macro UEs (User Equipments), especially those located near cell edge, will suffer from serious link performance degradation. We propose a novel interference avoidance mechanism assisted by SRN (Shared Relay Node) in this paper. SRN not only performs data re-transmission as a usual Type II relay but also has several features newly defined to avoid interference between cellular and D2D links. In particular, we suggest resource allocation methods based on the SRN for effective interference avoidance, and evaluate their performance through computer simulations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6260-6268
• /
• 2015

In LTE-Advanced that different networks coexist, it is considered that it is actually difficult to provide service continuity with a procedural and static control method applied to the existing voice service. This paper suggests Service Self-Organization to support the service continuity effectively based on SON. It means a method in which a subscriber's terminal collects information about its current condition and base station around, and a base station, through the data collected by monitoring inner or adjacent base station, shares related data and converges, controlling service continuity on its own. In other words, as context information of mobile terminal and base station changes, set-up of related functions such as ISHO, cell selection, source allocation, load control, and QoS mapping is adapted; each function fits into the change, exchanges the process of reorganization, and interacts; these actions go toward to satisfy service continuity. Simulation results show that it provides better performances than the conventional one with the measure of resource utilization rate and outage probability.

• KNOM Review
• /
• v.23 no.1
• /
• pp.43-50
• /
• 2020

As General Purpose Graphics Processing Unit (GPGPU) recently plays an essential role in high-performance computing, several cloud service providers offer GPU service. Most cluster orchestration platforms in a cloud environment using containers allocate the integer number of GPU to jobs and do not allow a node shared with other jobs. In this case, resource utilization of a GPU node might be low if a job does not intensively require either many cores or large size of memory in GPU. GPU virtualization brings opportunities to realize kernel concurrency and share resources. However, performance may vary depending on characteristics of applications running concurrently and interference among them due to resource contention on a node. This paper proposes GPU container co-execution framework with multiple server creation and execution based on Kubernetes, container orchestration platform for measuring interference which may be occurred by sharing GPU resources. Performance changes according to scheduling policies were investigated by executing several jobs on GPU. The result shows that optimal scheduling is not possible only considering GPU memory and computing resource usage. Interference caused by co-execution among applications is measured using the framework.