• Journal of Korea Game Society
• /
• v.16 no.4
• /
• pp.57-68
• /
• 2016

As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

• Journal of Digital Contents Society
• /
• v.11 no.4
• /
• pp.433-443
• /
• 2010

In this paper, we provide a comprehensive overview and classification on a wide range of the existing location management schemes which have been reported for wireless cellular networks and Mobile IP-based networks, respectively. In addition, from the various previous literature, we derive common key conceptual techniques, their main design goals and performance considerations on them, which can provide a useful guidance for understanding location management schemes regardless of network types. The aim of this paper is not to propose a new scheme for location management, but to highlight the various key design features involved in the design of the existing location management schemes, and to enhance an insight into the fundamental principles and techniques for designing more efficient and optimized location management scheme in future wireless mobile networks. We expect that regardless of network types, these underlying fundamental principles and conceptual techniques could be also easily tailored for more efficient mobility/QoS support in future mobile computing environments.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.49-56
• /
• 2007

This paper deals with grid job allocation and grid resource scheduling to provide a stable and quicker job processing service to grid users. In this paper, we proposed a fuzzy logic-based grid job scheduling model for an effective job scheduling in computational grid environment. The fuzzy logic-based grid job scheduling model measures resource efficiency of all grid resources by a fuzzy logic system based on diverse input parameters like CPU speed and network latency and divides resources into several groups by resource efficiency. And, the model allocates jobs to resources of a group with the highest resource efficiency. For performance evaluation, we implemented the fuzzy logic-based grid job scheduling model on the DEVS modeling and simulation environment and measured reduction rates of turnaround time, job loss, and communication messages in comparison with existing job scheduling models such as the random scheduling model and the MCT(Minimum Completion time) model. Experiment results that the proposed model is useful to improve the QoS of the grid job processing service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.565-572
• /
• 2007

3G Long Term Evolution (3G LTE) is a next generation cellular networks system capable or providing various mobile multimedia services by using OFDMA and MIMO based radio access technology. Among many differences from existing WCDMA based systems, the facts that 3G LTE uses Physical Resource Block (PRB) as its radio resources and provides all services through the PS domain make the development of new resource management schemes necessary. This paper proposes an adaptive partitioning based downlink call admission control scheme. It separates realtime call requests from non-realtime ones, specifies maximum allowable resource amounts for each type, but if the maximum is exceeded, call requests are accepted with probability proportional to remaining resource amounts. Despite the fact that such adaptive concept has been already adopted by other call admission schemes, the contributions of our paper, which are that we are able to find an efficient way to apply the proposed scheme exploiting PRB characteristics and measure the resource usage of base stations by PRB utilization and payload ratio, are still valid. When judging from simulation results in comparison with others, our scheme is able to prioritize realtime call requests over non-realtime ones, and at the same time, overall system performance is superior.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.9
• /
• pp.764-774
• /
• 2013

The number of users and data packets has increased in 4G cellular networks. Therefore, 4G cellular network providers suffer from the network capacity problem. In order to solve this problem, femtocell concept is suggested. It can reduce the coverage hole and enhance the QoS. However, only small number of femtocells experience the large amount of loads. To solve this problem, Mobility Load Balancing (MLB) algorithm is suggested, which is a kind of load balancing algorithm. To distribute the traffic load, MLB algorithm modifies the handover region. If the handover region is reduced by MLB algorithm, some cell edge users are compulsively handed over to neighbor femtocell. In this paper, we analyze the relation between MLB performing period and performance indicators. For example throughput and blocking probability is reduced, if period is decreased. On the contrast, if period is increased, the number of handover frequency is decreased. Using this relation, we suggest the adaptive periodic MLB algorithm. This algorithm includes the advantage of both long period and short period MLB algorithm, such as high throughput, the small number of handover frequency, and low blocking probability.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.3
• /
• pp.269-274
• /
• 2010

Recently IPTV service is becoming an emerging service representing IP convergence that is enabled on the broadband networks. It is an essential and very important issue to manage the service quality of IPTV service effectively for its successful deployment because of the innate nature of current Internet that cannot support quality of service (QoS). In particular, it is required that subscriber can measure and judge the service quality of IPTV service directly, which is impossible with the current method usually depending on a measurement equipment. In this paper, therefore, we introduce an implementation of a software that is installed at a set-top on the subscriber side and measures the quality of IPTV service in real time. In order to verify the performance of the implemented software, we perform a number of tests and compare the result with the measurement equipments in common use. By the comparison, it is shown that the measurement by the implemented software is precise and reliable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.349-359
• /
• 2004

To provide multicasting service, several multicast protocols for mobile hosts have been proposed. But they include glitches such as a non-optimal delivery route, data loss when hosts move another network, therefore they have some insecure problems about multicast data transmission. In this paper, we consider these problems and propose a new reliable and efficient multicast routing protocol for Mobile If networks. The proposed protocol provides reliable multicast transmission by compensating data loss from the previous agent when a mobile host moves another network. Also it provides additional function that is directly to connect a multicast tree according to the status of agents. It provides more efficient and optimal multicast path. The performance of the proposed protocol is proved by simulation of various conditions.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.316-328
• /
• 2003

In this paper, we propose and analyze two adaptive channel allocation schemes for supporting multimedia traffics in hierarchical cellular systems. It is guaranteed to satisfy the required quality of service of multimedia traffics according to their characteristics such as a mobile velocity for voice calls and a delay tolerance for multimedia calls. In the scheme 1, only slow-speed voice calls are allowed to overflow from macrocell to microcell and only adaptive multimedia calls can overflow from microcell to macrocell after reducing its bandwidth to the minimum channel bandwidth. In the scheme II, in addition to the first scheme, non-adaptive multimedia calls can occupy the required channel bandwidth through reducing the channel bandwidth of adaptive multimedia calls. The proposed scheme I is analyzed using 2-dimensional Markov model. Through computer simulations, the analysis model and the proposed schemes are compared with the fixed system and two previous studies. In the simulation result, it is shown that the proposed schemes yield a significant improvement in terms of the forced termination probability of handoff calls and the efficiency of channel usage.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.287-292
• /
• 2001

Multimedia service systems should have efficient capacity to serve the growing clients and new data. In the general streaming services, users can endure the small amount of time delay at the beginning of service. But they want to have good quality of service. A streaming server tries to transfer video files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested from clients. To achieve its purpose, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. It is superior to the other systems in the storing structure, fault-tolerance, and service capacity. Since this system supports the web interlace, users can operate easily through the www. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the single media streaming service because of the parallel architecture.

• 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.