• Journal of Advanced Navigation Technology
• /
• v.13 no.2
• /
• pp.208-213
• /
• 2009

This paper presents an adaptive call admission control(CAC) algorithm based on a target handoff call dropping probability in mobile wireless environments. This method uses a neural network for predicting and reserving the bandwidth demands for handoff calls and new calls. The amount of bandwidth to be reserved is adaptively adjusted by a target value of handoff call dropping probability(CDP). That is, if the handoff CDP exceeds the a target CDP value, the bandwidth to be reserved should be increased to reduce the handoff dropping probability below a target value. The proposed method is intended to prevent from increasing handoff call dropping probability when bandwidth to be reserved is not enough for handoff calls due to an uncertain prediction. Our simulations compare the handoff CDP in proposed CAC with that of an existing CAC. Results show that the proposed method sustains handoff call dropping probability below our target value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.105-112
• /
• 2011

We propose an adaptive load balancing scheme to transport real-time video streams efficiently in this paper. The playback buffer level of a video requesting client is high or low temporarily in mobile environment. This scheme attempts to allocate more network bandwidth to serve a video request with the lower buffer level preferentially. In this scheme, the amount of network bandwidth is dynamically allocated to the requesting clients according to their playback buffer levels in a distributed mobile system. In order to improve the quality of service and real-time performance of individual video playback, the proposed load balancing scheme tries to maximize the number of frames that are transported successfully to the client prior to their playback times. Fair services can also be provided to all the concurrent clients by making their playback situation more adaptive. The performance of this load balancing scheme is compared with that of other static load balancing scheme through extensive simulation experiments, resulting in the higher ratio of frames transmitted successfully within given deadlines.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• Journal for History of Mathematics
• /
• v.17 no.2
• /
• pp.15-20
• /
• 2004

We investigate the unbiasedness and consistency as the statistical properties of density estimators. We show histogram, kernel density estimation, and local adaptive smoothing as density smoothing in this paper. Also, the early and recent research on nonparametric density estimation is described and discussed.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.209-215
• /
• 2010

In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in this paper. On the basis of the many-to-one concept, the proposed method uses a new multipeer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced.

• Journal of Information Processing Systems
• /
• v.19 no.6
• /
• pp.817-829
• /
• 2023

Variable wireless channel is a big challenge for real-time video applications, and the rate adaptation of realtime video streaming becomes a hot topic. Intra-video coding is important for high-quality video communication and industrial video applications. In this paper, we proposed a novel adaptive scheme for real-time video transmission with intra-only coding over a wireless network. The key idea of this scheme is to estimate the instantaneous remaining capacity of the network to adjust the quality of the next several video frames, which not only can keep low queuing delay and ensure video quality, but also can respond to bandwidth changes quickly. We compare our scheme with three different schemes in the video transmission system. The experimental results show that our scheme has higher bandwidth utilization and faster bandwidth change response, while maintaining low queuing delay.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.11 no.3
• /
• pp.274-283
• /
• 2006

The Permanent Magnet Synchronous Motor(PMSM) drive systems with ball-screw, gear and timing-belt are widely used in industrial applications such as NC machine, machine tools, robots and factory automation. These systems have torsional vibration in torque transmission from servo motor to mechanical load due to the mechanical couplings. This vibration makes it difficult to achieve quick responses of speed and may result in damage to the mechanical plant. This paper presents adaptive notch filter with auto searching function of vibration frequency to reject the mechanical vibration of linear feeder system with PMSM. The proposed adaptive notch filter can suppress the torque command signal of PMSM in the resonant bandwidth for reject the mechanical torsional vibration. However, the resonant frequency can vary with conditions of mechanical load system and coupling devices, adaptive notch filter can auto search the vibration frequency and suppress the vibration signal bandwidth. Computer simulation and experimental results shows the verification of the proposed adaptive notch filter in linear feeder system with PMSM.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.19-26
• /
• 2016

In this paper, the dynamic buffering based smart OTT platform was proposed, and analyzed for adaptive bit-rate video delivery with the optimization of HLS (HTTP Live Streaming). This platform consists of the software platform between sever and client which detects the bandwidth capacity, and adjusts the quality of the streaming for multiple bit-rates resolutions. In order to apply adaptive buffering, two buffers are added to the basic HLS player, and each buffer is responsible for constantly buffering a previous and the next channels relative to the current channel. This adaptive transmitting with smart OTT platform is superior to delivering a static video file at a single buffering, because the video stream of adaptive double buffers can be switched streaming according to client's available network speed. As a result, this proposed smart OTT can be cooperated to the application of HLS server with segmented H.265 MPEG-2 TS video & m3u8 files with its information based on the optimized transmission channel state of live and VOD, and applied to PLC transmission, too.