• Title/Summary/Keyword: Exponential Bandwidth

Search Result 45, Processing Time 0.025 seconds

Development of the Meta-heuristic Optimization Algorithm: Exponential Bandwidth Harmony Search with Centralized Global Search (새로운 메타 휴리스틱 최적화 알고리즘의 개발: Exponential Bandwidth Harmony Search with Centralized Global Search)

  • Kim, Young Nam;Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.2
    • /
    • pp.8-18
    • /
    • 2020
  • An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

Enhanced TCP Congestion Control Mechanism for Networks with Large Bandwidth Delay Product (대역폭과 지연의 곱이 큰 네트워크를 위한 개선된 TCP 혼잡제어 메카니즘)

  • Park Tae-Joon;Lee Jae-Yong;Kim Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.126-134
    • /
    • 2006
  • Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

Opportunistic Routing for Bandwidth-Sensitive Traffic in Wireless Networks with Lossy Links

  • Zhao, Peng;Yang, Xinyu
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.806-817
    • /
    • 2016
  • Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

Random Access Method of the Wibro System

  • Lee, Kang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1A
    • /
    • pp.49-57
    • /
    • 2011
  • Random access method for Wibro system is proposed using the Bayesian Technique, which can estimate the number of bandwidth request messages in a frame only based on the number of successful slots. The performance measures such as the maximum average throughput, the mean delay time and the collision ratio are investigated to evaluate the performance of the proposed method. The proposed method shows better performance than the binary exponential backoff algorithm used currently.

Design of the Broad-Band 3-dB Branch-Line Directional Coupler Using Exponential Transmission Line (지수함수적인 비균일 전송선을 이용한 광대역 3-dB 브랜치라인 방향성 결합기의 설계)

  • 하헌태;김세윤
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.9
    • /
    • pp.685-691
    • /
    • 1991
  • A broad-band 3-dB directional coupler is implemented by using cascaded exponential transmission line as branch lines. Compared with that of the uniform transmission line, the bandwidth of the proposed 3-dB branch-line directional cpoupler increases 2.96 times.

  • PDF

Application of exponential bandwidth harmony search with centralized global search for advanced nonlinear Muskingum model incorporating lateral flow (Advanced nonlinear Muskingum model incorporating lateral flow를 위한 exponential bandwidth harmony search with centralized global search의 적용)

  • Kim, Young Nam;Lee, Eui Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.53 no.8
    • /
    • pp.597-604
    • /
    • 2020
  • Muskingum, a hydrologic channel flood routing, is a method of predicting outflow by using the relationship between inflow, outflow, and storage. As many studies for Muskingum model were suggested, parameters were gradually increased and the calculation process was complicated by many parameters. To solve this problem, an optimization algorithm was applied to the parameter estimation of Muskingum model. This study applied the Advanced Nonlinear Muskingum Model considering continuous flow (ANLMM-L) to Wilson flood data and Sutculer flood data and compared results of the Linear Nonsingum Model incorporating Lateral flow (LMM-L), and Kinematic Wave Model (KWM). The Sum of Squares (SSQ) was used as an index for comparing simulated and observed results. Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was applied to the parameter estimation of ANLMM-L. In Wilson flood data, ANLMM-L showed more accurate results than LMM-L. In the Sutculer flood data, ANLMM-L showed better results than KWM, but SSQ was larger than in the case of Wilson flood data because the flow rate of Sutculer flood data is large. EBHS-CGS could be appplied to be appplicable to various water resources engineering problems as well as Muskingum flood routing in this study.

Application of data preprocessing to improve the performance of the metaheuristic optimization algorithm-deep learning combination model (메타휴리스틱 최적화 알고리즘-딥러닝 결합모형의 성능 개량을 위한 데이터 전처리의 적용)

  • Ryu, Yong Min;Lee, Eui Hoon
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2022.05a
    • /
    • pp.114-114
    • /
    • 2022
  • 딥러닝의 학습 및 예측성능을 개선하기 위해서는 딥러닝 기법 내 연산과정의 개선과 함께 학습 및 예측에 사용되는 데이터의 전처리 과정이 중요하다. 본 연구에서는 딥러닝의 성능을 개량하기 위해 제안된 메타휴리스틱 최적화 알고리즘-딥러닝 결합모형과 데이터 전처리 기법을 통해 댐의 수위를 예측하였다. 수위예측을 위해 Multi-Layer Perceptron(MLP), 메타휴리스틱 최적화 알고리즘인 Harmony Search(HS)와 딥러닝을 결합한 MLP using a HS(MLPHS) 및 Exponential Bandwidth Harmony Search with Centralized Global Search(EBHS-CGS)와 딥러닝을 결합한MLP using a EBHS-CGS(MLPEBHS)를 통해 댐의 수위를 예측하였다. 메타휴리스틱 최적화 알고리즘-딥러닝 결합모형의 학습 및 예측성능을 개선하기 위해 학습 및 예측을 위한 자료를 기반으로 데이터 전처리기법을 적용하였다. 적용된 데이터 전처리 기법은 정규화, 수위구간별 사상(Event)분리 및 수위 변동에 대한 자료의 구분이다. 수위예측을 위한 대상유역은 금강유역에 위치한 대청댐으로 선정하였다. 대청댐의 수위예측을 위해 대청댐 상류에 위치하는 수위관측소 3개소를 선정하여 수위자료를 취득하였다. 각 수위관측소에서 취득한 수위자료를 입력자료로 설정하였으며, 대청댐의 수위자료를 출력자료로 설정하여 메타휴리스틱 최적화 알고리즘-딥러닝 모형의 학습을 진행하였다. 각 수위관측소 및 대청댐에서 취득한 수위자료는 2010년부터 2020년까지 총 11년의 일 단위 수위자료이며, 2010년부터 2019년까지의 자료를 학습자료로 사용하였으며, 2020년의 자료를 예측 및 검증자료로 사용하였다.

  • PDF

Bandwidth Management of WiMAX Systems and Performance Modeling

  • Li, Yue;He, Jian-Hua;Xing, Weixi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.2
    • /
    • pp.63-81
    • /
    • 2008
  • WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

A Dynamic Packet Recovery Mechanism for Realtime Service in Mobile Computing Environments

  • Park, Kwang-Roh;Oh, Yeun-Joo;Lim, Kyung-Shik;Cho, Kyoung-Rok
    • ETRI Journal
    • /
    • v.25 no.5
    • /
    • pp.356-368
    • /
    • 2003
  • This paper analyzes the characteristics of packet losses in mobile computing environments based on the Gilbert model and then describes a mechanism that can recover the lost audio packets using redundant data. Using information periodically reported by a receiver, the sender dynamically adjusts the amount and offset values of redundant data with the constraint of minimizing the bandwidth consumption of wireless links. Since mobile computing environments can be often characterized by frequent and consecutive packet losses, loss recovery mechanism need to deal efficiently with both random and consecutive packet losses. To achieve this, the suggested mechanism uses relatively large, discontinuous exponential offset values. That gives the same effect as using both the sequential and interleaving redundant information. To verify the effectiveness of the mechanism, we extended and implemented RTP/RTCP and applications. The experimental results show that our mechanism, with an exponential offset, achieves a remarkably low complete packet loss rate and adapts dynamically to the fluctuation of the packet loss pattern in mobile computing environments.

  • PDF

Random Access Method for the IEEE 802.16 Networks (IEEE 802.16 망을 위한 랜덤 액세스 기법)

  • Kim, Myeong-Hwan;Kook, Kwang-Ho;Lee, Kang-Won;Kim, Young-Il
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.11-19
    • /
    • 2008
  • To enhance the performance of the IEEE 802.16 broadband wireless access system, it is necessary to improve the efficiency of the radio link. The efficiency of the uplink can be improved by using more efficient random access method. As new random access methods, we propose a RA_NBRM method which is based on the number of bandwidth request messages and a RA_CRA method which is based on the conflict resolution algorithm. The simulation results show that the performance of the new methods is superior to that of the existing binary exponential backoff method.

  • PDF