• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.5
• /
• pp.123-136
• /
• 2021

RPC (Remote Procedure Call)-based Graphics Processing Unit (GPU) virtualization technology is one of the technologies for sharing GPUs with multiple user virtual machines. However, in a cloud environment, unlike CPU or memory, general GPUs do not provide a resource isolation technology that can limit the resource usage of virtual machines. In particular, in an RPC-based virtualization environment, since GPU tasks executed in each virtual machine are performed in the form of multi-process, the lack of resource isolation technology causes performance degradation due to resource competition. In addition, the GPU memory competition accelerates the performance degradation as the resource demand of the virtual machines increases, and the fairness decreases because it cannot guarantee equal performance between virtual machines. This paper, in the RPC-based GPU virtualization environment, analyzes the performance degradation problem caused by resource contention when the GPU memory requirement of virtual machines exceeds the available GPU memory capacity and proposes a GPU memory management technique to solve this problem. Also, experiments show that the GPU memory management technique proposed in this paper can improve the performance of GPGPU tasks.

• Journal of the Korean Society for Library and Information Science
• /
• v.57 no.2
• /
• pp.241-269
• /
• 2023

This study developed a scale for measuring publicness and examined the differences in perception of publicness according to library usage experience, personal characteristics of local residents, and types of library services. The survey was conducted on 15 local public libraries in 5 districts of Seoul, targeting library users and local residents. As a result, it was found that the publicness of libraries is composed of three factors: participatory responsiveness, procedural fairness, and situational equality, which demonstrate different aspects formed through the interaction between library users and local residents in the local community. The study derived ways to enhance publicness and presented in detail which aspect of publicness needs to be enhanced according to library usage experience and service period, local residents' occupational environment and experience of local activities, and types of library services. The study suggests that when service experiences that enhance publicness are effectively provided, more local residents can benefit from them, and the value of the library's existence can be demonstrated.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.523-532
• /
• 2003

Video on Demand(VOD) services cause high resource consumption in a video seuer, because multimedia are characterized by continuous playback, a high bandwidth requirement, and long playback duration. Patching has been proposed to save the network I/O bandwidth of a video server. To achieve true VOD, patching uses multicasting to share video streams, thereby providing immediate VOD services to users without any service latency. A communication channel is used to either multicast the entire video as a regular channel or multicast only the leading portion of a video as a Patching channel. This paper Proposes a buffering patching technique that divides regular channels, as used in patching, into sub-regular channels and regular channels to shorten the holding time of the channels. In the proposed technique, the last portion of video data, corresponding to the size of the buffering window, is not transferred by sub-regular channels, but rather downloaded and buffered in the user buffer from the latest regular channel. When simulations were performed to compare the performance of the proposed technique with that of conventional patching, the results indicated that the proposed technique was superior in terms of the defection rate, average service latency, and fairness, although the amount of video data buffered at each user station was higher than that with patching.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.48-59
• /
• 2024

As functions that support virtualization on their own in hardware are developed, user applications having various workloads are operating efficiently in the virtualization system. SR-IOV is a virtualization support function that takes direct access to PCI devices, thus giving a high I/O performance by minimizing the need for hypervisor or operating system interventions. With SR-IOV, network I/O acceleration can be realized in virtualization systems that have relatively long I/O paths compared to bare-metal systems and frequent context switches between the user area and kernel area. To take performance advantages of SR-IOV, network resource management policies that can derive optimal network performance when SR-IOV is applied to an instance such as a virtual machine(VM) or container are being actively studied.This paper evaluates and analyzes the network performance of SR-IOV implementing I/O acceleration is compared with Virtio in terms of 1) network delay, 2) network throughput, 3) network fairness, 4) performance interference, and 5) multi-network. The contributions of this paper are as follows. First, the network I/O process of Virtio and SR-IOV was clearly explained in the virtualization system, and second, the evaluation results of the network performance of Virtio and SR-IOV were analyzed based on various performance metrics. Third, the system overhead and the possibility of optimization for the SR-IOV network in a virtualization system with high VM density were experimentally confirmed. The experimental results and analysis of the paper are expected to be referenced in the network resource management policy for virtualization systems that operate network-intensive services such as smart factories, connected cars, deep learning inference models, and crowdsourcing.

• The Journal of Industrial Distribution & Business
• /
• v.10 no.3
• /
• pp.59-72
• /
• 2019

Purpose - Blockchain technology, which has the characteristics of credibility, security, integrity and decentralization, has brought innovation to internet platforms that mediate peer to peer transactions, as well as changes to the contents distribution services. Blockchain-based copyright distribution platforms can solve problems which have been articulated on prior internet social networks: increased market dominance of platform business because of centralization with no reward to creators who upload on platforms, and lack of fairness, such as unfair profit distribution between the copyright holder and businesses. With this background, the current research confirmed the factors that affect the intention of usage and behaviors, targeting potential users of blockchain-based copyright distribution platforms. Research design, data, and methodology - Centered around the UTAUT2 Model, the research model was designed with 'Perceived Security' added as Construct, and 'Age' and 'Knowledge Level' added as moderating variables. For data, 607 responses were collected by an online survey, and 601 responses were included in the final analysis. We analyzed the research model and sample by using SPSS 23.0 and AMOS 23.0 on the collected responses. Results - First, results of research on whether Constructs make positive effects on Intention of use is: social influence, facilitating conditions, habit, and perceived security had positive effects on intention of use, and performance expectancy, effort expectancy, hedonic motivation, and economic value did not. Second, results of the research on whether facilitating condition, habit, and intention of use made an impact on using behaviors, it was shown that only habit and intention of use made positive effects. Third, in two groups divided by age above or under 40, group effort expectancy, intention of use, habit, and intention of use had controlling effects, and facilitating condition, intention of use, perceived security, and intention of use had effects in both groups. Conclusions - The research shows that no matter how great a blockchain-based platform is, if advantages of blockchain are not proved in various industries and utilized in real life like the internet, blockchain-based distribution systems will develop slowly. Rather than a short-term inducement emphasizing technology, there is a need for a strategic approach that can foster the environment.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.11-18
• /
• 2018

The Dutch treat culture, which pays for the cost of having meetings with a large number of people, is located in the daily life of many modern people. In particular, the execution of Kim Young-ran is a more active Dutch treat. However, when going dutch, there is a case where the amount of money to be paid per person is not divided equitably and there is an ambiguous situation about who should pay more. Also if one person have to pay all of the payments because of the different payment method such as a cash or card, there is inconvenience to keep a record of the financial relationship each time. In this paper, we introduce an application that allows several people to easily calculate the amount of money to pay per person when eating together or calculating something. From our service, you can easily access with web-based service, manage the user's debts more conveniently through forming the group. In addition, we focused on convenient calculation of cost by setting remaining unit and reserve function which is a function to overcome the disadvantages of existing application. Also, we maintain fairness through games in situations where the users need to make a choice.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.408-416
• /
• 2003

An electronic cash system has to provide the security, to prevent the double spending and to support the divisibility of electronic cash for the easy of use. Divisible electronic cash system allows an electronic cash to be divided into subdivisions. Each subdivision is worth any desired value, but all values must add up to the original cash value. Divisible scheme brings some advantages. It reduces to make the change and also there is no necessity that a customer must withdraw a cash of the desired value whenever transactions occur. In this paper, we present an electronic cash protocol which provides the divisibility based on the double hash chain technique. Electronic cash is constructed in the form of coins. Coins, generated by the double hush chain, have different denominations. The divisibility based on the double hash chain technique. Electronic cash is constructed in the form of coins. Coins, generated by the double hash chain, have different denominations. The divisibility of an electronic cash is satisfied by the payment certificate, which is a pair of bank´s proxy signature received from the bank. When a customer pays the coin of subdivision, the fairness of that coin is certified by a customer´s signing instead of a bank. Although the proposed method does not guarantee user´s anonymity, it generates coins which cannot be forged, and the customer can use an electronic cash conveniently and efficiently with its divisibility.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.137-147
• /
• 2014

The study aims at exploring motivation, rationale, and values in twitter users' retweet behavior. It proposes that diffusion of message is based on the complex interactional relationships among attributes of original message, user's rationale, and values. Based on a pilot study, we constructed a total of 34 questions asking message attributes, motivation, and values of retweeting. Then, twitter users participated in an online survey, in which they evaluate their own 5 retweet messages based on the constructed questions(5 messages ${\times}$ 34 questions = 170). Then, a factor analysis is done in order to see the dimensions of the concepts in retweet behavior; and understand how message attributes, motivations, and values are inter-related with each other. The main factors extracted were: (1) public fairness, (2) fun and playfulness, (3) communal help, (4) news and information, etc. Factor 2 and 4 show the traditional journalism characteristics; while factor 1 and 3 do alternative journalistic values. The latter may work as a rectifying factors for traditional journalism; however, backfiring mechanism for group polarization. In addition, (1) users' internal identities, (2) communal unity and (3) belongness were identified as rationales and values for retweet behavior.