Filters








110,366 Hits in 8.2 sec

A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration

Jian ZHANG, Xiaodong YUAN, Yubo YUAN
2014 Journal of Modern Power Systems and Clean Energy  
Above all, all spanning trees of simplified graph of distribution network are found. Tie branches are obtained with spanning tree subtracted from simplified graph.  ...  Disadvantages of conventional genetic algorithm for network reconfiguration that a large amount of unfeasible solutions are created after crossover and mutation, which result in very low searching efficiency  ...  In order to facilitate finding all the spanning tree, bus 1, 2 and 3 are connected together.  ... 
doi:10.1007/s40565-014-0056-0 fatcat:mzeh5dl37vc73km5h7qn3w3p2e

A Novel Genetic Algorithm Based on all Spanning Trees of Undirected Graph for Distribution Network Reconfiguration

Jian Zhang, Xiao Dong Yuan
2014 Advanced Materials Research  
Above all, all spanning trees of simplified graph of distribution network are found. Tie branches are obtained with spanning tree subtracted from simplified graph.  ...  Disadvantages of conventional genetic algorithm for network reconfiguration that a large amount of unfeasible solutions are created after crossover and mutation, which result in very low searching efficiency  ...  In order to facilitate finding all the spanning tree, bus 1, 2 and 3 are connected together.  ... 
doi:10.4028/www.scientific.net/amr.960-961.943 fatcat:vziil2h2znfvzmbcyvxzqqqksy

ElasticTree: Saving Energy in Data Center Networks

Brandon Heller, Srinivasan Seetharaman, Priya Mahadevan, Yiannis Yiakoumis, Puneet Sharma, Sujata Banerjee, Nick McKeown
2010 Symposium on Networked Systems Design and Implementation  
We first compare multiple strategies for finding minimum-power network subsets across a range of traffic patterns.  ...  We finish by showing how a network admin might configure ElasticTree to satisfy their needs for performance and fault tolerance, while minimizing their network power bill.  ...  Thanks for OpenFlow switches goes to Jean Tourrilhes and Praveen Yalagandula at HP Labs, plus the NEC IP8800 team. Greg Chesson provided the Google traces.  ... 
dblp:conf/nsdi/HellerSMYSBM10 fatcat:k4hysni7trb7hon2ia34tklcga

Graph-based Cyber Security Analysis of State Estimation in Smart Power Grid [article]

Suzhi Bi, Ying Jun Zhang
2016 arXiv   pre-print
Smart power grid enables intelligent automation at all levels of power system operation, from electricity generation at power plants to power usage at households.  ...  efficient graphical solution algorithms, which are useful for both defending and attacking the ICT system of smart grid.  ...  Tree Pruning Algorithm Due to the NP-Hardness of finding an optimal EMST, the commodity flow based method can still result in high computational complexity in a large-size power network consisting of hundreds  ... 
arXiv:1612.05878v1 fatcat:njb4bsju3najtohjuoaagfvyfm

A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems

Minghe Sun
2013 Networks  
Because such efficient solutions are usually not integer solutions, a branch-and-bound algorithm is developed to find integer efficient solutions.  ...  To be computationally efficient, the algorithm takes advantage of the network structure as much as possible.  ...  The purpose of these studies is to find all integer efficient solutions for such problems although some earlier studies can only find basic and some others can only find supported integer efficient solutions  ... 
doi:10.1002/net.21493 fatcat:bwigsnvt2jgfxajvwsfmseqtdq

A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks

J. Yuan, Z. Li, W. Yu, B. Li
2006 IEEE Journal on Selected Areas in Communications  
We emphasize the network coding technique for multicast routing and a game theoretic method for interference management, for which efficient and distributed solutions are derived and illustrated.  ...  Finally, we show that the proposed framework can be extended to take into account physical-layer wireless multicast in mesh networks.  ...  Therefore, all link capacities exactly support the network flows . This solution has a max-flow min-cut interpretation.  ... 
doi:10.1109/jsac.2006.881617 fatcat:jqobz3t6k5dspaplz44pwl46ma

Towards bandwidth guaranteed energy efficient data center networking

Ting Wang, Bo Qin, Zhiyang Su, Yu Xia, Mounir Hamdi, Sebti Foufou, Ridha Hamila
2015 Journal of Cloud Computing: Advances, Systems and Applications  
Then we propose a heuristic solution with high computational efficiency by applying an AI resource abstraction technique.  ...  Therefore, aiming to achieve an energy proportional data center network without compromising throughput and fault tolerance too much, in this paper we propose two efficient schemes from the perspective  ...  All authors read and approved the final manuscript. interests include mobile and broadband wireless communication systems, cellular and satellites-based positioning technologies, synchronization and DSP  ... 
doi:10.1186/s13677-015-0035-7 fatcat:hrk7p25ppvhldkila7nrrkalfy

Joint multicast routing and network design optimisation for networks-on-chip

S. Yan, B. Lin
2009 IET Computers & Digital Techniques  
The minimum directed spanning tree formulation efficiently captures the best routing solutions for multicast flows during the topology synthesis procedure.  ...  Our design flow integrates floorplanning, and our solutions consider deadlock-free routing.  ...  The minimum directed spanning tree formulation efficiently captures the best routing solutions for multicast flows during the topology synthesis procedure.  ... 
doi:10.1049/iet-cdt.2008.0095 fatcat:vawn6hzvfbfvpgp3qg5ldb4cci

Greening data center networks with throughput-guaranteed power-aware routing

Mingwei Xu, Yunfei Shang, Dan Li, Xin Wang
2013 Computer Networks  
To overcome the problem of traditional tree based data center network, recently many new network architectures are proposed, such as Fat-Tree and BCube.  ...  The essence of our idea is to use as little network power as possible to provide the routing service, without significantly compromise on the network performance.  ...  Consequently, the solution of 0-1 Knapsack problem exists. End. Based on the three-step proof above, we conclude that PRP-T is an NP-hard problem.  ... 
doi:10.1016/j.comnet.2012.12.012 fatcat:ee67275mpnhrri3a3adid62pea

Branch Flow Model: Relaxations and Convexification—Part II

Masoud Farivar, Steven H. Low
2013 IEEE Transactions on Power Systems  
The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps.  ...  We prove that convexification requires phase shifters only outside a spanning tree of the network and their placement depends only on network topology, not on power flows, generation, loads, or operating  ...  The New England and the Polish power systems also involve MVA limits on branch power flows. All these systems are mesh networks, but very sparse.  ... 
doi:10.1109/tpwrs.2013.2255318 fatcat:5fobzkhrdvbjna5seu6f7t3kuu

An efficient generic network flow constraint

Robin Steiger, Willem-Jan van Hoeve, Radosław Szymanek
2011 Proceedings of the 2011 ACM Symposium on Applied Computing - SAC '11  
In our approach, all key aspects of a network flow can be represented by finite domain variables, making the constraint very expressive.  ...  We propose a generic global constraint that can be applied to model a wide range of network flow problems using constraint programming.  ...  A flow is a function x : A → Z ≥0 . The minimum-cost flow problem asks to find a flow that satisfies all arc capacity and node balance conditions, while minimizing total cost.  ... 
doi:10.1145/1982185.1982381 dblp:conf/sac/SteigerHS11 fatcat:366u37lkyfhl7gsbpb2q2jwhlu

Optimal Power Multicast Problem in Wireless Mesh Networks by Using a Hybrid Particle Swarm Optimization

Allam Maalla, Chen Wei, Haitham J. Taha
2009 American Journal of Applied Sciences  
Therefore, power consumption of network operations is critical and subject to optimization.  ...  Problem statement: Most mobile nodes in a wireless ad hoc network are powered by energy limited batteries; the limited battery lifetime imposes a constraint on the network performance.  ...  [9] , which is shown to be able to find better solutions in very little computation time.  ... 
doi:10.3844/ajassp.2009.1758.1762 fatcat:puyrkjcufzfarcp2zsrgqvnl4q

Energy efficient SDN commodity switch based practical flow forwarding method

Amer AlGhadhban, Basem Shihada
2016 NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium  
Consequently, the power consumption of network switches is in orders of magnitude less than other evaluated solutions. It also provides flow management flexibility and scalability.  ...  We find that EncPath flow entries in core switches in a multihomed fat-tree with 144 hosts is approximately 1000 times smaller than Equal-Cost MultiPath (ECMP) and random routing.  ...  To prove the flexibility of EncPath we inserted the same flow-entries in all switches in all layers, even the edge switches, and we tested our solution in the fat-tree topology, k=4.  ... 
doi:10.1109/noms.2016.7502899 dblp:conf/noms/AlGhadhbanS16 fatcat:ovnhssdbyne6la2zeye3uavcqm

Optimization of large electric power distribution using a parallel genetic algorithm with dandelion strategy

Jorge SABATTIN, Guillermo FUERTES, Miguel ALFARO, Luis QUEZADA, Manuel VARGAS
2018 Turkish Journal of Electrical Engineering and Computer Sciences  
A parallel genetic algorithm (PGA) is proposed to optimize a tree-based topology for large-scale electric power distribution networks.  ...  Finally, we find feasible solutions for instances of the problem with up to 50,000 nodes.  ...  With large networks finding an optimal solution is not possible; for this reason, metaheuristic techniques are used that find solutions close to the optimum.  ... 
doi:10.3906/elk-1801-261 fatcat:xsidf37lprhzzlmn5ou4sii6na

Efficient load flow for large weakly meshed networks

G.X. Luo, A. Semlyen
1990 IEEE Transactions on Power Systems  
and reducing the related computational effort to half; (2) It uses an efficient tree labeling technique which also contributes to the computational efficiency of the procedure; (3) It uses an improved  ...  A new and efficient method for calculating the load flow solution of weakly meshed transmission and distribution systems is presented.  ...  Network Flow Tree Labeling Modified Network Flow Progr;Mlqing tree labeling2 has been applied to label the radial network.  ... 
doi:10.1109/59.99382 fatcat:r5nfoosvynf6vmd42okq2iqjmm
« Previous Showing results 1 — 15 out of 110,366 results