• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.204-209
• /
• 2023

Dynamic Bandwidth Allocation (DBA) methods in telecommunication network & systems have emerged with mechanisms for sharing limited resources in a rapidly growing number of users in today's access networks. Since the DBA research trends are incredibly fast-changing literature where almost every day new areas and terms continue to emerge. Co - citation analysis offers a significant support to researchers to distinguish intellectual bases and potentially leading edges of a specific field. We present the visualization based analysis for DBA algorithms in telecommunication field using mainstream co-citation analysis tool-CiteSpace and web of science (WoS) analysis. Research records for the period of decade (2009-2018) for this analysis are sought from WoS. The visualization results identify the most influential DBA algorithms research studies, journals, major countries, institutions, and researchers, and indicate the intellectual bases and focus entirely on DBA algorithms in the literature, offering guidance to interested researchers on more study of DBA algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2275-2282
• /
• 1999

In ATM networks, bandwidth allocation using available bandwidth is important to control ABR traffic efficiently. However, it is difficult to dynamically assign bandwidth on bursty traffic, because the tracking of the existing available bandwidth information uses statistical value. In this paper, we propose a output-bufferd ATM switch using Per-VC queueing scheme with timer and Controller. The controller determines whether each VC is in congestion state or not, and the timer can assign dynamically as determining the available bandwidth for the Present period by Backlogged time and total link capacity, and then transmitting the determined bandwidth to source. Instead of using statistical parameters, the proposed scheme can improve link efficiency as allocating the bandwidth of the next period, by use of measured bandwidth during the current period.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.89-96
• /
• 2000

ABR service is defined by ATM Forum and ITU for the efficient use of link bandwidth, and 2-pass service policing is proposed for this service. 2-pass service policing is effective by the real-time measurement of the used bandwidth, and this scheme obtains multiplexing gam and control efficiently ABR traffic as dynamically allocating rate by residual bandwidth information. In this study, we propose the real-time bandwidth prediction scheme for ABR traffic control, as using dynamic rate allocation by available bandwidth information. This study can obtain the simple hardware structure by means of as predicting available bandwidth by the total link bandwidth and the sum of transmission rate on the backlogged state connections.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.121-128
• /
• 2005

Recently, as the research of effective resource management for supporting of various next generation internet service, the admission control mechanisms using the dynamic provisioning methods in differentiated service networks are studied. However, even though admission control mechanism is applied to the network, there exits the unfairness of call blocking probability among the different bandwidth requested services. In this paper, we propose the new admission control policy heuristic algorithm that provides fairness of call blocking probability between the large bandwidth requested service and the small bandwidth requested service. The simulation results show that the proposed algorithm provides not only blocking probability fairness but also high bandwidth utilization.

• Proceedings of the KIEE Conference
• /
• 2002.07c
• /
• pp.1649-1651
• /
• 2002

Ultra-wide bandwidth (UWB) detection method has been widely used as a front end detection scheme for the ultra-high frequency (UHF) partial discharge (PD) monitoring systems. A broad-band video detector module was developed and characterized for the UHF UWB PD detection systems. The useable bandwidth of the module is more than 2 GHz and it is optimized for 50-ohm systems. The detection sensitivity and dynamic range of the module were characterized by using a known ns-width RF pulses of GHz range. The dynamic range is more than 6-decades and the module can detect pulsed RF signals down to 1 nW. The detector module can eliminate expensive equipment such as high speed oscilloscopes and radio frequency (RF) spectrum analyzers. Therefore, it enables one to use slow speed data acquisition systems for the PD monitoring at the UHF range. The detector module was used to detect real PDs of about <3 pC. The module converts the UWB PD signals into a low-bandwidth video signal with a high signal-to-noise ratio.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.11b
• /
• pp.576-581
• /
• 2002

The suspension is a structure that supports reading, writing head in information storage device. In order to develop the information storage device of high track density, it is necessary to study about the suspension. To satisfy operation condition of information storage device, the suspension shape is very important since it correlates to dynamic characteristics. Therefore, it is necessary to analyze the dynamic characteristics by using finite element analysis and to optimize the suspension of information storage device using size optimization and topology optimization. The suspension has various modes according to different kinds of frequency bandwidth. Sway mode and second torsion mode are especially critical among them. In this paper, we investigated method to improve bandwidth of sway and second torsion mode of HDD and ODD suspension by using size optimization and topology optimization.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.209-212
• /
• 2005

The look-ahead preview control with the use of limited bandwidth active suspensions is presented. Both a linearized racked vehicle model and a complex nonlinear model based on a commercial multibody dynamic program are used to verify the performance of preview control. The performance of the preview control system is evaluated on the ride quality which is estimated from the acceleration of the driver position. Due to the practical advantages associated with the use of limited bandwidth active control in comparison with full bandwidth systems, the results are considered important to the future development of active tracked vehicle suspensions.

• Journal of Power Electronics
• /
• v.18 no.6
• /
• pp.1760-1770
• /
• 2018

This paper presents a control bandwidth extension method for inverters with a low carrier ratio. The bandwidth is extended at the price of decreasing the phase margin. Then the phase margin is compensated by introducing an extra leading angle into an inverse Park transformation. The model of the controller with the proposed method is established. The magnitude and phase characteristics are also analyzed. Then the influence on system stability when the leading angle is introduced is analyzed. The proposed method is applied to design an inverter controller with both a large bandwidth and a desired phase margin, and the experimental results verify that the controller performs well in the steady-state and in terms of transient response.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3479-3489
• /
• 2000

Most of the study on fairness control method for Distributed-Queue Dual-Bus(DQDB) have been performed under specific load types such as equal probability load types or symmetric load types. On Web-based internet enviroments client-server load types are more practical traffic patlerns than specrfic load types. In this paper, an effiective fairness control method to distribute DQDR network bandwidth fairly to all stations under a client-server load is proposed. In order to implement a dynamic bandwidth timing capabihty needed to distribute the bandwidth fairty at heavy loads, the proposed method uses two pararnetexs, one is an access hrnit to legulate each station's packet transmission and the other is the number of extra emply slots that are yielded to downstream stations. In point of implementation this mechanism is simpler and easier than Bandwidth Tuning Mechanism(BTM) that uses an intermediate pattern and an adptation function. Simulation results show that it outperforms othen mecharusms.