• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1007-1015
• /
• 2003

In this Paper, we propose a method of determining the price for the elastic traffic in the current or future Internet services. First, we investigate the behavior in the consumption of bandwidth of elastic traffic in IP network. Next, we propose a new method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially or fully on the usage rate of the network bandwidth. Next, we propose an optimal charging function for elastic traffic, which is applicable to any Internet services. Finally, we will illustrate the implication of the work via simple numerical experiments.

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

Decay usage scheduling algorithm gives preference to processes that have consumed little CPU in the recent past. It has been widely-used in time-sharing systems such as UNIX, where CPU-intensive processes and interactive processes are mixed. However, there has been no sound understanding about the mixed effects of decay usage parameters on the service performance. This paper empirically analyzes their effects in terms of the resulting service bandwidth and delay Based on such empirical analysis, we derive the clear meaning of each parameter. Such analysis and understanding provides a basis of controlling decay usage parameters for desirable service provision as required by applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.190-198
• /
• 2001

In this paper, the authors propose methods for determining the differentiated price for elastic traffic in IP (Internet Protocol) network. First, we investigate the behavior in the consumption of bandwidth of elastic traffic in IP network. Next, we propose a method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially or fully on the usage rate of the network bandwidth. After that, we propose a charging function for elastic traffic, which is based on the de facto usage of the bandwidth. Finally, we will illustrate the implication of the work via simple numerical experiments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.179-179
• /
• 2004

In the near future we can expect a change in charging the Internet service. The flat charging maybe replaced with a usage-based charging. In line with this movement, we propose a method of charging the assured-quality Internet services for the next generation network by introducing a UBC (usage-based charging) scheme over the conventional flat charging platform. First, we investigate the attribute of elastic traffic generated by assured services in IP network. Next, we propose a new method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially on the usage rate of the network bandwidth. Next, we propose a charging function for elastic traffic, which is applicable to any type of assured Internet services. Finally, we discuss the implication of the work via simple numerical experiments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.21-28
• /
• 2004

In the near future we can expect a change in charging the Internet service. The flat charging maybe replaced with a usage-based charging. In line with this movement, we propose a method of charging the assured-quality Internet services for the next generation network by introducing a UBC (usage-based charging) scheme over the conventional flat charging platform. First, we investigate the attribute of elastic traffic generated by assured services in IP network. Next, we propose a new method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially on the usage rate of the network bandwidth. Next, we propose a charging function for elastic traffic, which is applicable to any type of assured Internet services. Finally, we discuss the implication of the work via simple numerical experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.91-97
• /
• 2015

In this paper, we propose a MCFQ I/O scheduler that is implemented by modifying the existing Linux CFQ I/O scheduler. MCFQ observes whether the user requested I/O bandwidth weight is well distributed. Based on the I/O bandwidth observation, we improved I/O performance of the existing bandwidth distribution ability by dynamically controlling the I/O time-slice of the virtual machine. The use of SSDs as storage has been increasing dramatically in recent computer systems due to their fast performance and low power usage. As the usage of SSD increases and prices fall, virtualized system administrators can take advantage of SSDs. However, studies on guaranteeing SLA(Service Level Agreement) services when multiple virtual machines share the SSD is still incomplete. In this paper was conducted to improve performance of the bandwidth distribution when multiple virtual machine are sharing a single SSD storage in a virtualized environment. In particular, it was observed that the performance of the bandwidth distribution varied widely when garbage collection occurs in the SSD. In order to reduce performance variance, we add a MoTS(Manager of Time Slice) on existing CFQ I/O scheduler.

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

As the number of World Wide Web (Web) users grows, Web traffic continues to increase at an exponential rate. Currently, Web traffic is one of the major components of Internet traffic. Also, high bandwodth usage due to Web traffic is observed during peak periods while leaving bandwidth usage idle during off-peak periods. One of the solutions to reduce Web traffic and speed up Web access is through the use of Web caching. Unfortunately, Web caching has limitations for reducing network bandwidth usage during peak periods. In this paper, we focus our attention on the use of a prefetching algorithm for reducing bandwidth during peak periods by using off-peak period bandwidth. We propose a statistical, batch, proxy-side prefetching scheme that improves cache hit rate while only requiring a small amount of storage. Web objects that were accessed many times in previous 24 hours but would be expired in the next 24 hours, are selected and prefetched in our scheme. We present simulation results based on Web proxy and show that this prefetching algorithm can reduce peak time bandwidth using off-peak bandwidth.

• Journal of Digital Contents Society
• /
• v.18 no.2
• /
• pp.411-422
• /
• 2017

Current policies for sharing bandwidth increase average throughput and improve utilization of the bandwidth in the local network. However, with these policies, a central administer, which is responsible for allocating bandwidth to each network flow, cannot allocate resources based on user characteristics. Thus, it leads to unfair bandwidth allocation because it does not guarantee services based on user characteristics. Therefore, we propose a novel negotiation method to share the bandwidth in a limited bandwidth network, in which, a user negotiates with other users to gain more resource. Ideally, we use a fuzzy system to infer and determine whether a device will request bandwidth or not based on the current usage of the given device. We conduct two experiments consisting of a video streaming simulation in OPNET and a real-time video streaming in WebRTC. The results of the experiment indicate that the proposed method can flexibly share the bandwidth utilization based on user's requirement in the network.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.596-606
• /
• 2008

In this paper, we present a co-design methodology of dynamic optimal network-bandwidth allocation (ONBA) and adaptive control for networked control systems (NCSs) to optimize overall control performance and reduce total network-bandwidth usage. The proposed dynamic co-design strategy integrates adaptive feedback control with real-time scheduling. As part of this co-design methodology, a "closed-loop" ONBA algorithm for NCSs with communication constraints is presented. Network-bandwidth is dynamically assigned to each control loop according to the quality of performance (QoP) information of each control loop. As another part of the co-design methodology, a network quality of service (QoS)-adaptive control design approach is also presented. The idea is based on calculating new control values with reference to the network QoS parameters such as time delays and packet losses measured online. Simulation results show that this co-design approach significantly improves overall control performance and utilizes less bandwidth compared to static strategies.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.83-92
• /
• 2012

Location-based services (LBS) are increasingly popular due to the improvement of geo-positioning capabilities and wireless communication technology. However, in order to enjoy LBS services, a user requesting a query must send his/her exact location to the LBS provider. Therefore, it is a key challenge to preserve user's privacy while providing LBS. To solve this problem, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, 2PASS does not fully guarantee the actual user privacy because it does not take the real user distribution into account. Hence, in this paper, we propose a nearest neighbor query processing algorithm that supports K-anonymity property based on the weighted adjacency graph(WAG). Our algorithm not only preserves the location of a user by guaranteeing k-anonymity in a query region, but also improves a bandwidth usage by reducing unnecessary search for a query result. We demonstrate from experimental results that our algorithm outperforms the existing one in terms of query processing time and bandwidth usage.