• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.155-162
• /
• 2003

Fast restoration time and service guarantee are the important goals to achieve the network reliability. In the protection switching scheme, one way to guarantee service fro an application session if a network happens to fail is to establish the restoration path that amounts to the same bandwidth of the working path of the session at the same time. When we setup the restoration path, we can reduce the bandwidth consumption by the restoration path if the path can share the bandwidth required by the other paths. This paper explains the methods how to determine the shared bandwidth of the restoration path in the protection switching scheme, given the maximum bandwidth assigned to a link along the working path. We point out that such sharing algorithm can not reduce the bandwidth consumption by the restoration paths in some cases, which contradict the general conception. We explain why this can happen, and show the simulation results in real network topologies to prove our arguments. We explain the reason of the failure of the sharing effect by the simple sharing algorithm. Finally we propose the way of how we can overcome the failure of the sharing effect, using the complete sharing algorithm based on the link database and showing the results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.784-799
• /
• 2013

This paper presents an adaptive rate control scheme for streaming-based content sharing service. This scheme delivers multimedia contents from a user device to another device or seamlessly redirects streaming service across heterogeneous user devices. In the proposed scheme, a streaming server adjusts video quality level according to the network and client status. Our scheme is different from other rate control schemes, because the video quality at the server is decided not only based on the available bandwidth, but also based on the device characteristics and bandwidth requirement at the access network. We also propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows competing for the same narrow link with different Round Trip Times (RTTs). Through the simulation, we prove that our scheme improves the network stability and the quality of streaming service by appropriately adjusting the quality of the video stream. The simulation results also demonstrate the ability of the proposed scheme in ensuring RTT-fairness while remaining throughput efficient.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.11
• /
• pp.95-101
• /
• 2018

In this paper, we propose an efficient friendly forces location data sharing algorithm in a troops using a low bandwidth radio. The future battlefield is a 'Network Centric Warfare' with a concept of identifying the position and power of the enemy and friendly forces and leading the battlefield to victory through proper links at the time of our need. One of the basic elements in the 'Network Centric Warfare' is to share friendly forces location data. The bandwidth and transmission rates of radio used in battalion are low. Nevertheless, we should share our locations data almost in real time for effective fighting in a war situation. This paper describes the efficient method of friendly forces location data sharing based on low bandwidth radio. In particular, the concept of 'network-centered warfare' is reflected in the troop below the battalion to present an integrated and efficient way to shared location data of friendly forces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5803-5819
• /
• 2017

In this paper, we proposed a contract theory based cooperative spectrum sharing scheme with joint power and bandwidth optimization under asymmetric information, where the primary user (PU) does not know the secondary users' (SUs) private information. To improve performance, PU needs to provide incentives to stimulate nearby SUs to help forward its signal. By using contract theory, PU and SUs' negotiations are modeled as a labor market. PU and SUs act as the employer and employees, respectively. Specifically, SUs provide labor (i.e. the relay power, which can be used for forwarding PU's signal) in exchange for the reward (i.e. the spectrum access bandwidth which can be used for transmitting their own signals). PU needs to overcome a challenge how to balance the relationship between contributions and incentives for the SUs. We study the optimal contract design which consists of relay power and spectrum access bandwidth allocation. We show that the most efficient SUs will be hired by the PU to attend the cooperative communication. PU can achieve the same maximum utility as in the symmetric information scenario. Simulation results confirm that the utility of PU is significantly enhanced with our proposed cooperative spectrum sharing scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.404-410
• /
• 1999

A scheme of more exact overflow probability analysis is proposed for traffic regulated by dual leaky bucket. To each regulated traffic stream is allocated bandwidth and buffer independent of other traffic stream and overflow occurs when total bandwidth or buffer allocated to each traffic exceed link capacity or physical buffer size. Ratio of buffer and bandwidth allocated to each traffic stream is assumed to be constant, and this ratio is larger than the ratio of physical buffer and bandwidth due to buffer sharing effect. Numerical experiments show that this sharing effect have significant influence on overflow probability and effective bandwidth.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.140-145
• /
• 2014

In this paper, we propose an anti-interference cooperative spectrum sharing strategy for cognitive system, in which a secondary system can operate on the same spectrum of a primary system. Specifically, the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to achieve the target rate. To gain access to the spectrum of the primary system, the secondary system needs to allocate a fraction of bandwidth to help forward the primary signal. As a reward, the secondary system can use the remaining bandwidth to transmit its own signal. The secondary system uses different bandwidth to transmit the primary and its own signal. Thus, there will be no interference felt at primary and secondary systems. We study the joint optimization of time and bandwidth allocation such that the transmission rate of the secondary system is maximized, while guaranteeing the primary system, as a higher priority, to achieve its target transmission rate. Numerical results show that the secondary system can gain significant improvement with the proposed strategy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.97-103
• /
• 2020

Linux Cgroups takes a fundamental role for sharing system resources among multiple containers on container-based cloud computing environment. Especially for I/O resource, Linux Cgroups supports a mechanism for sharing I/O bandwidth in proportion to I/O weight. However, the current mechanism of Linux Cgroups using BFQ I/O scheduler seriously degrades the I/O performance with high bandwidth storage device such as NVMe SSDs. In this paper, we proposed a new feedback based I/O bandwidth sharing scheme for Linux Cgroups which allocates I/O credits to containers according to I/O weights and adjusts the amount of credits to performance fluctuation of NVMe SSDs. The proposed scheme is implemented on Linux kernel 5.3 and evaluated. The evaluation results show that it can share the I/O bandwidth among multiple containers proportionally to I/O weights while improving I/O performance more than twice as high as the existing scheme.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.97-104
• /
• 2000

Effective call admission control is desirable to control an ATM traffics. It should provide high fairness and utilization for different kinds of services during call admission. Complete bandwidth sharing method is efficient for utilization of bandwidth but not efficient for fairness of call admission. Complete bandwidth partitioning method is efficient for fairness but not efficient for utilization. We propose a new CST(Complete Sharing with Threshold) algorithm using threshold on a total link to improve fairness and utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.529-538
• /
• 2007

Fair Queueing algorithms based on Generalized Processor Sharing (GPS) not only guarantee sessions with service rate and delay, but also provide sessions with instantaneous fair sharing. This fair sharing distributes server capacity to currently backlogged sessions in proportion to their weights without regard to the amount of service that the sessions received in the past. From a long-term perspective, the instantaneous fair sharing leads to a different quality of service in terms of delay and bandwidth to sessions with the same weight depending on their traffic pattern. To minimize such long-term unfairness, we propose a delay-bandwidth normalization model that defines the concept of value of service (VoS) from the aspect of both delay and bandwidth. A model and a packet-by-packet scheduling algorithm are proposed to realize the VoS concept. Performance comparisons between the proposed algorithm and algorithms based on fair queueing and service curve show that the proposed algorithm provides better long-term fairness among sessions and that is more adaptive to dynamic traffic characteristics without compromising its service rate and delay guarantees.

• The Korean Journal of Applied Statistics
• /
• v.22 no.3
• /
• pp.541-551
• /
• 2009

Generalized processor sharing(GPS) service policy is a scheduling algorithm to allocate the bandwidth of a queueing system with multi-class input traffic. In a queueing system with single-class traffic, the stationary queue length becomes larger stochastically when the bandwidth (i.e. the service rate) of the system decreases. For a given GPS server, we consider the similar problem to this. We define the monotonicity for the head of the line processor sharing(HLPS) servers in which the units in the heads of the queues are served simultaneously and the bandwidth allocated to each queue are determined by the numbers of units in the queues. GPS is a type of monotonic HLPS. We obtain the HLPS server whose queue length of a class stochastically bounds upper that of corresponding class in the given monotonic HLPS server for all classes. The queue lengths process of all classes in the obtained HLPS server has the stationary distribution of product form. When the given monotonic HLPS server is GPS server, we obtain the explicit form of the stationary queue lengths distribution of the bounding HLPS server. Numerical result shows how tight the stochastic bound is.