• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1047-1054
• /
• 2009

Local smoothing jump detection procedure is a popular method for detecting jump locations and the performance of the jump detector heavily depends on the choice of the bandwidth. However, little work has been done on this issue. In this paper, we propose the bootstrap bandwidth selection method which can be used for any kernel-based or local polynomial-based jump detector. The proposed bandwidth selection method is fully data-adaptive and its performance is evaluated through a simulation study and a real data example.

• Journal of the Korean Statistical Society
• /
• v.17 no.1
• /
• pp.1-8
• /
• 1988

Kernel estimates of an unknown regression function are studied. Bandwidth selection rule minimizing integrated absolute error loss function is considered. Under some reasonable assumptions, it is shown that the optimal bandwidth is unique and can be computed by using bisection algorithm. Adaptive bandwidth selection rule is proposed.

• Journal of the Korean Statistical Society
• /
• v.20 no.1
• /
• pp.1-28
• /
• 1991

Considerable progress on the problem of data-driven bandwidth selection in kernel density estimation has been made recently. The goal of this paper is to provide an introduction to the methods currently available, with discussion at both a practical and a nontechnical theoretical level. The main setting considered here is global bandwidth kernel estimation, but some recent results on variable bandwidth kernel estimation are also included.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.844-853
• /
• 2006

The IEEE 802.17 Resilient Packet Ring (RPR) for future Local, Metropolitan, and Wide Area Networks was recently standardized, but it still suffer from delay jitter deterioration and even some bandwidth loss under unbalanced overload. In order to overcome these drawbacks, this paper proposes a bandwidth redistribution based fairness control method, compatible with the legacy one, in which each congested node measures the amount of available bandwidth of its bottleneck link resulted from regulating upstream nodes' shares of the link bandwidth, calculates optimal fair rate with the number of uptream nodes requiring more bandwidth, and then redistributes the available bandwidth to the upstream nodes by advertising the rate. The performance evaluation results show that the proposed method fairly redistributes 95% of the bottleneck link bandwidth with even only two redistributions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.7-12
• /
• 2010

The bandwidth of a Jerusalem AMC was investigated based on the equivalent circuit model. Using the circuit model and the derivative of the admittance(Y'), the relation between the bandwidth and various circuit parameters was analyzed. It was shown that the substrate thickness and permeability enhance the bandwidth whereas the loadings on FSS grid degrade the bandwidth. Among the two loadings, the capacitive loading had better bandwidth characteristics than the inductive loading. AMC with single polarization was suggested to relax the bandwidth degradation by the inductive loading.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.308-324
• /
• 2018

HTTP adaptive streaming (HAS) is a promising technology for delivering video content over the Internet. HAS-based video streaming solutions rely on bandwidth estimation to select the appropriate video bitrate. Video streaming solutions that consider network conditions provide users with seamless video playback. However, when multiple clients compete for a common bottleneck link, conventional bandwidth estimation schemes that consider only one client overestimate the network bandwidth due to the ON-OFF traffic pattern. The bandwidth overestimation can cause Quality of Experience (QoE) degradation, such as unnecessary changes in video quality, and unfairness of video quality. In this paper, we propose a client-side bandwidth estimation scheme to obtain a better QoE of HAS in the multiple-client environment. The proposed scheme differentiates the client buffer status according to the buffer occupancy, and then estimates the available network bandwidth based on the buffer status and segment throughput. We evaluate the performance of HAS implemented in the ns-3 network simulator. Simulation results show that compared with the conventional schemes, the proposed scheme can enhance the QoE.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.5
• /
• pp.65-70
• /
• 2008

A novel fast locking dual-loop integer-N phase locked loop(PLL) with adaptive bandwidth scheme is presented. When the PLL is out-of-lock, bandwidth becomes much wider than 1/10 of channel spacing with the wide bandwidth loop. When the PLL is near in-lock, bandwidth becomes narrower than 1/10 of channel spacing with the narrow bandwidth loop. The proposed PLL is designed based on a $0.35{\mu}m$ CMOS process with a 3.3V supply voltage. Simulation results show the fast look time of $50{\mu}s$ for an 80MHz frequency jump in a 200KHz channel spacing PLL with almost 14 times wider bandwidth than the channel spacing.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.15-24
• /
• 2013

Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.83-93
• /
• 2003

Differentiated service networks, based on bandwidth broker, perform the control and management of QoS provisioning for the QoS guaranteed services, However, the centralized bandwidth broker model has a scalability problem since it has centralized resource management for the admission control function of all call attempts, Therefore, in this paper, we proposea novel adaptive admission control mechanism according to the attempted call status for enhancing the scalability under the centralized bandwidth broker model in IP differentiated service networks, The proposed mechanism decouples the function of admission control from the bandwidth broker, So, the ingress edge node performs the admission control and the bandwidth broker performs the resource management and QoS provisioning, We also introduce an edge-to-edge path concepts and the ingress edge node performs the admission control under the allocated bandwidth to eachpath. The allocated bandwidth per path adaptively varies according to the status of the attempted calls, This mechanism can significantly reduce the number of communication message between the bandwidth broker and each edge node in the network and increase the bandwidth utilization via adaptable resource allocation, In this paper we study the adaptive admission control operation and show the efficient and extensive improvement through the performance evaluation.

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