• Title/Summary/Keyword: network optimization

Search Result 2,239, Processing Time 0.03 seconds

Circuit-Switched “Network Capacity” under QoS Constraints

  • Wieselthier, Jeffrey E.;Nguyen, Gam D.;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.230-245
    • /
    • 2002
  • Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

Joint Opportunistic Spectrum Access and Optimal Power Allocation Strategies for Full Duplex Single Secondary User MIMO Cognitive Radio Network

  • Yue, Wenjing;Ren, Yapeng;Yang, Zhen;Chen, Zhi;Meng, Qingmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3887-3907
    • /
    • 2015
  • This paper introduces a full duplex single secondary user multiple-input multiple-output (FD-SSU-MIMO) cognitive radio network, where secondary user (SU) opportunistically accesses the authorized spectrum unoccupied by primary user (PU) and transmits data based on FD-MIMO mode. Then we study the network achievable average sum-rate maximization problem under sum transmit power budget constraint at SU communication nodes. In order to solve the trade-off problem between SU's sensing time and data transmission time based on opportunistic spectrum access (OSA) and the power allocation problem based on FD-MIMO transmit mode, we propose a simple trisection algorithm to obtain the optimal sensing time and apply an alternating optimization (AO) algorithm to tackle the FD-MIMO based network achievable sum-rate maximization problem. Simulation results show that our proposed sensing time optimization and AO-based optimal power allocation strategies obtain a higher achievable average sum-rate than sequential convex approximations for matrix-variable programming (SCAMP)-based power allocation for the FD transmission mode, as well as equal power allocation for the half duplex (HD) transmission mode.

Applying Distributed Agents to Parallel Genetic Algorithm on Dynamic Network Environments (동적 네트워크 환경하의 분산 에이전트를 활용한 병렬 유전자 알고리즘 기법)

  • Baek Jin-Wook;Bang Jeon-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.119-125
    • /
    • 2006
  • Distributed Systems can be defined as set of computing resources connected by computer network. One of the most significant techniques in optimization problem domains is parallel genetic algorithms, which are based on distributed systems. Since the status of dynamic network environments such as Internet and mobile computing. can be changed continually, it must not be efficient on the dynamic environments to solve an optimization problem using previous parallel genetic algorithms themselves. In this paper, we propose the effective technique, in which the parallel genetic algorithm can be used efficiently on the dynamic network environments.

  • PDF

Evolutionary Neural Network based on Quantum Elephant Herding Algorithm for Modulation Recognition in Impulse Noise

  • Gao, Hongyuan;Wang, Shihao;Su, Yumeng;Sun, Helin;Zhang, Zhiwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2356-2376
    • /
    • 2021
  • In this paper, we proposed a novel modulation recognition method based on quantum elephant herding algorithm (QEHA) evolving neural network under impulse noise environment. We use the adaptive weight myriad filter to preprocess the received digital modulation signals which passing through the impulsive noise channel, and then the instantaneous characteristics and high order cumulant features of digital modulation signals are extracted as classification feature set, finally, the BP neural network (BPNN) model as a classifier for automatic digital modulation recognition. Besides, based on the elephant herding optimization (EHO) algorithm and quantum computing mechanism, we design a quantum elephant herding algorithm (QEHA) to optimize the initial thresholds and weights of the BPNN, which solves the problem that traditional BPNN is easy into local minimum values and poor robustness. The experimental results prove that the adaptive weight myriad filter we used can remove the impulsive noise effectively, and the proposed QEHA-BPNN classifier has better recognition performance than other conventional pattern recognition classifiers. Compared with other global optimization algorithms, the QEHA designed in this paper has a faster convergence speed and higher convergence accuracy. Furthermore, the effect of symbol shape has been considered, which can satisfy the need for engineering.

Numerical Research on Suppression of Thermally Induced Wavefront Distortion of Solid-state Laser Based on Neural Network

  • Liu, Hang;He, Ping;Wang, Juntao;Wang, Dan;Shang, Jianli
    • Current Optics and Photonics
    • /
    • v.6 no.5
    • /
    • pp.479-488
    • /
    • 2022
  • To account for the internal thermal effects of solid-state lasers, a method using a back propagation (BP) neural network integrated with a particle swarm optimization (PSO) algorithm is developed, which is a new wavefront distortion correction technique. In particular, by using a slab laser model, a series of fiber pumped sources are employed to form a controlled array to pump the gain medium, allowing the internal temperature field of the gain medium to be designed by altering the power of each pump source. Furthermore, the BP artificial neural network is employed to construct a nonlinear mapping relationship between the power matrix of the pump array and the thermally induced wavefront aberration. Lastly, the suppression of thermally induced wavefront distortion can be achieved by changing the power matrix of the pump array and obtaining the optimal pump light intensity distribution combined using the PSO algorithm. The minimal beam quality β can be obtained by optimally distributing the pumping light. Compared with the method of designing uniform pumping light into the gain medium, the theoretically computed single pass beam quality β value is optimized from 5.34 to 1.28. In this numerical analysis, experiments are conducted to validate the relationship between the thermally generated wavefront and certain pumping light distributions.

An Efficient Algorithm to Develop Model for Predicting Bead Width in Butt Welding

  • Kim, I.S.;Son, J.S.
    • International Journal of Korean Welding Society
    • /
    • v.1 no.2
    • /
    • pp.12-17
    • /
    • 2001
  • With the advance of the robotic welding process, procedure optimization that selects the welding procedure and predicts bead width that will be deposited is increased. A major concern involving procedure optimization should define a welding procedure that can be shown to be the best with respect to some standard and chosen combination of process parameters, which give an acceptable balance between production rate and the scope of defects for a given situation. This paper presents a new algorithm to establish a mathematical model f3r predicting bead width through a neural network and multiple regression methods, to understand relationships between process parameters and bead width, and to predict process parameters on bead width for GMA welding process. Using a series of robotic arc welding, additional multi-pass butt welds were carried out in order to verify the performance of the neural network estimator and multiple regression methods as well as to select the most suitable model. The results show that not only the proposed models can predict the bead width with reasonable accuracy and guarantee the uniform weld quality, but also a neural network model could be better than the empirical models.

  • PDF

Optimal Replacement Scheduling of Water Pipelines

  • Ghobadi, Fatemeh;Kang, Doosun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2021.06a
    • /
    • pp.145-145
    • /
    • 2021
  • Water distribution networks (WDNs) are designed to satisfy water requirement of an urban community. One of the central issues in human history is providing sufficient quality and quantity of water through WDNs. A WDN consists of a great number of pipelines with different ages, lengths, materials, and sizes in varying degrees of deterioration. The available annual budget for rehabilitation of these infrastructures only covers part of the network; thus it is important to manage the limited budget in the most cost-effective manner. In this study, a novel pipe replacement scheduling approach is proposed in order to smooth the annual investment time series based on a life cycle cost assessment. The proposed approach is applied to a real WDN currently operating in South Korea. The proposed scheduling plan considers both the annual budget limitation and the optimum investment on pipes' useful life. A non-dominated sorting genetic algorithm is used to solve a multi-objective optimization problem. Three decision-making objectives, including the minimum imposed LCC of the network, the minimum standard deviation of annual cost, and the minimum average age of the network, are considered to find optimal pipe replacement planning over long-term time period. The results indicate that the proposed scheduling structure provides efficient and cost-effective rehabilitation management of water network with consistent annual budget.

  • PDF

Multiobjective Space Search Optimization and Information Granulation in the Design of Fuzzy Radial Basis Function Neural Networks

  • Huang, Wei;Oh, Sung-Kwun;Zhang, Honghao
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.4
    • /
    • pp.636-645
    • /
    • 2012
  • This study introduces an information granular-based fuzzy radial basis function neural networks (FRBFNN) based on multiobjective optimization and weighted least square (WLS). An improved multiobjective space search algorithm (IMSSA) is proposed to optimize the FRBFNN. In the design of FRBFNN, the premise part of the rules is constructed with the aid of Fuzzy C-Means (FCM) clustering while the consequent part of the fuzzy rules is developed by using four types of polynomials, namely constant, linear, quadratic, and modified quadratic. Information granulation realized with C-Means clustering helps determine the initial values of the apex parameters of the membership function of the fuzzy neural network. To enhance the flexibility of neural network, we use the WLS learning to estimate the coefficients of the polynomials. In comparison with ordinary least square commonly used in the design of fuzzy radial basis function neural networks, WLS could come with a different type of the local model in each rule when dealing with the FRBFNN. Since the performance of the FRBFNN model is directly affected by some parameters such as e.g., the fuzzification coefficient used in the FCM, the number of rules and the orders of the polynomials present in the consequent parts of the rules, we carry out both structural as well as parametric optimization of the network. The proposed IMSSA that aims at the simultaneous minimization of complexity and the maximization of accuracy is exploited here to optimize the parameters of the model. Experimental results illustrate that the proposed neural network leads to better performance in comparison with some existing neurofuzzy models encountered in the literature.

A SAN Optimization Scheme for High-Performance Storage System (고성능 저장장치를 위한 SAN최적화기법)

  • Lee, In-Seon
    • Journal of Digital Convergence
    • /
    • v.12 no.1
    • /
    • pp.379-388
    • /
    • 2014
  • We noted that substituting hard disk with high-performance storage device on SAN did not immediately result in getting high performance. Investigating the reason behind this leaded us to propose optimization schemes for high-performance storage system. We first got rid of the latency in the I/O process which is unsuitable for the high-performance storage device, added parallelism on the storage server, and applied temporal merge to Superhigh speed network protocol for improving the performance with small random I/O. The proposed scheme was implemented on the SAN with high-performance storage device and we verified that there were about 30% reduction on the I/O delay latency and 200% improvement on the storage bandwidth.

Cache Management Method for Query Forwarding Optimization in the Grid Database (그리드 데이터베이스에서 질의 전달 최적화를 위한 캐쉬 관리 기법)

  • Shin, Soong-Sun;Jang, Yong-Il;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.13-25
    • /
    • 2007
  • A cache is used for optimization of query forwarding in the Grid database. To decrease network transmission cost, frequently used data is cached from meta database. Existing cache management method has a unbalanced resource problem, because it doesn't manage replicated data in each node. Also, it increases network cost by cache misses. In the case of data modification, if cache is not updated, queries can be transferred to wrong nodes and it can be occurred others nodes which have same cache. Therefore, it is necessary to solve the problems of existing method that are using unbalanced resource of replica and increasing network cost by cache misses. In this paper, cache management method for query forwarding optimization is proposed. The proposed method manages caches through cache manager. To optimize query forwarding, the cache manager makes caching data from lower loaded replicated node. The query processing cost and the network cost will decrease for the reducing of wrong query forwarding. The performance evaluation shows that proposed method performs better than the existing method.

  • PDF