A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Path selection algorithm for shortest path bridging in access networks
2013
IEICE Communications Express
Preserved Fulltext
It is important to avoid congestion by selecting the optimal path for each flow. This paper proposes a path selection algorithm for access networks with SPBM. ...
We confirmed with computer simulations that the proposed algorithm could efficiently utilize links and improve throughput fairness. ...
This approach can use network resources efficiently and simplify the operation procedure. ...
doi:10.1587/comex.2.396
fatcat:wvsqn4v5nzgqvilthgut2sluqu
Global Load Balancing Strategy Based on Origin-based Algorithm
2018
DEStech Transactions on Computer Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The origin-based algorithm which is used for optimal planning of the transportation network is valued. ...
To apply this algorithm, the model of resource access for multiple data centers which has corresponding attributes to the transportation network has been structured. ...
The purpose of initialization is allocating traffic flow to the traffic network roughly in preparation for the main loop. ...
doi:10.12783/dtcse/csse2018/24511
fatcat:b2zscr6c65bdfnur77iq22gec4
Page 72 of The Journal of the Operational Research Society Vol. 54, Issue 1
[page]
2003
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Computational experiments are performed to test the efficiency of the algorithm, which show that the algorithm works quite well in finding optimal solutions (for the test instances) within reasonable time ...
Therefore, no conventional network flow algorithm can handle directly the combined issue of establishing VPs and routing traffic packets (demands) in those layered communication networks. ...
Method for network simplification for voltage variation analysis caused by wind farm integrated on power system with two different treatments for boundary buses
2010
2010 9th IEEE/IAS International Conference on Industry Applications - INDUSCON 2010
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This work presents a description of the development of a model for representation of simplified grid applied in hybrid load flow for calculation of the voltage variations in steady-state provoked by wind ...
The main aim consists to propose models of simplified networks that allow to the necessity of the knowledge only of the data referring the internal network, that is, the parcel of the network of interest ...
ACKNOWLEDGMENT The authors are grateful to the Federal University of Rio Grande do Norte -UFRN -for the financial support. ...
doi:10.1109/induscon.2010.5740053
fatcat:obx7w5sjvvaaphivrvts7xyiuq
EFS: Efficient Storage Optimization for Multistage Flow-table in Software-Defined Satellite Network
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For the memory shortage of flow tables in SDSN, we propose an expanded-field search (EFS) algorithm, which supports storage compression during both the initialization and update of multistage flow-table ...
It applies a novel search strategy to expand the search field from O(N ) to O(N 2 ) for better convergence, and employs a statistical inference method to simplify the computation. ...
Shuai Wang would like to acknowledge the Beijing National Research Center for Information Science and Technology for their valuable support that were essential for the completion of this work. ...
doi:10.1109/access.2021.3138399
fatcat:fkubk7vos5a6jgsdkm3c6xbx2m
New Algorithmic Techniques for Complex EDA Problems
2014
VLSI design (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Dutt develop a simplified and fast discretized network flow (DNF) algorithm for cell sizing for timing optimization under power and area constraints. ...
In the third paper "Fast and near-optimal timing-driven cell sizing under cell area and leakage power constraints using a simplified discrete network flow algorithm, " H. Ren and S. ...
Dutt develop a simplified and fast discretized network flow (DNF) algorithm for cell sizing for timing optimization under power and area constraints. ...
doi:10.1155/2014/134946
fatcat:khteidnkd5b4fbxmx62l3apgaa
MCRT
2011
ACM transactions on sensor networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
packet loss for wireless sensor networks. ...
Because of the small number of orthogonal channels available in current mote hardware, MCRT allocates channels to network partitions formed based on many-to-one data flows. ...
In Simplified MCRT, three orthogonal channels are used for the 3 flows, while only one channel is used for all the 3 flows in Simplified RPAR. ...
doi:10.1145/1993042.1993044
fatcat:pzac5gy7ojdzdoebpmu33jyave
A fuzzy logic-based information security management for software-defined networks
2014
16th International Conference on Advanced Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Such applications can implement logic to provide complex quarantine procedures, or redirect malicious network flows for their special treatment. ...
For evaluation of the modules work we used mininet environment, which provides rapid prototyping for OpenFlow network. ...
This model making access control much more dynamic and flexible by applying different risk mitigation actions to different information flows, depending on the level of perceived risk. ...
doi:10.1109/icact.2014.6778942
fatcat:iowrfm2uvjh6tlykspilynfn6u
Two-Step Spectral Clustering Controlled Islanding Algorithm
2013
IEEE Transactions on Power Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Simulation results, obtained using the IEEE 9-, 39-, and 118-bus test systems, show that the proposed algorithm is computationally efficient when solving the controlled islanding problem, particularly ...
The objective function used in this controlled islanding algorithm is the minimal power-flow disruption. The sole constraint applied to this solution is related to generator coherency. ...
The original network is simplified to a 34-node and 43-edge graph when searching for Cutset 1, and is simplified to a 24-node and 38-edge graph when searching for Cutset 2. ...
doi:10.1109/tpwrs.2012.2197640
fatcat:tdtymxjs2bd6pm26qd6w4i2eqa
Two-step spectral clustering controlled islanding algorithm
2013
2013 IEEE Power & Energy Society General Meeting
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Simulation results, obtained using the IEEE 9-, 39-, and 118-bus test systems, show that the proposed algorithm is computationally efficient when solving the controlled islanding problem, particularly ...
The objective function used in this controlled islanding algorithm is the minimal power-flow disruption. The sole constraint applied to this solution is related to generator coherency. ...
The original network is simplified to a 34-node and 43-edge graph when searching for Cutset 1, and is simplified to a 24-node and 38-edge graph when searching for Cutset 2. ...
doi:10.1109/pesmg.2013.6672655
fatcat:r6xeixvaqfhgri6fub2wsxc4by
Evaluating hydrology preservation of simplified terrain representations
2009
SIGSPATIAL Special
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We present an error metric based on the potential energy of water flow to evaluate the quality of lossy terrain simplification algorithms. ...
A quantitative measurement of how accurately a drainage network captures the hydrology is important for determining the effectiveness of a terrain simplification technique. ...
For example, we will fill in the river network between the simplified river and ridge points using the Bresenham line rasterization algorithm [2] . ...
doi:10.1145/1517463.1517470
fatcat:l3hsy456rvfa5cety5t2zz4zyq
Technical note: Efficient online source identification algorithm for integration within a contamination event management system
2017
Drinking Water Engineering and Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Over the past decade research has focused on the development of new sensors that are able to detect malicious substances in the network and early warning systems for contamination. ...
of water supply networks. ...
The SAFEWATER project has received funding from the European Union's Seventh Framework Programme for research, technological development and demonstration under grant agreement no. 312764. ...
doi:10.5194/dwes-10-53-2017
fatcat:ppjceulw6bhtjmixr3pr4zao74
Computationally scalable geospatial network and routing analysis through multi-level spatial clustering
2020
MethodsX
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This work presents a system for geospatial modelling of thermal networks including their routing through the existing road network and calculation of flows through the network. ...
•We develop algorithms and data processing pipelines for calculating network routing.•We use cluster-level caching to enable rapid evaluation of model variants. ...
Acknowledgements This research project is financially supported by the Swiss Innovation Agency Innosuisse as part of the Swiss Competence Centre for Energy Research SCCER FEEB&D (Future Energy Efficient ...
doi:10.1016/j.mex.2020.101072
pmid:33014716
pmcid:PMC7522122
fatcat:2qdjgiymlza2vlyuet5ccbehom
A Novel Genetic Algorithm Based on all Spanning Trees of Undirected Graph for Distribution Network Reconfiguration
2014
Advanced Materials Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 this paper, based on all spanning trees of undirected graph, a novel genetic algorithm for electric distribution network reconfiguration is proposed. ...
Flow chart of the proposed algorithm The flow chart of the proposed algorithm is shown as Fig. 3 . ...
doi:10.4028/www.scientific.net/amr.960-961.943
fatcat:vziil2h2znfvzmbcyvxzqqqksy
A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
2014
Journal of Modern Power Systems and Clean Energy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 this paper, based on all spanning trees of undirected graph, a novel genetic algorithm for electric distribution network reconfiguration is proposed. ...
Flow chart of the proposed algorithm The flow chart of the proposed algorithm is shown as Fig. 3 . ...
doi:10.1007/s40565-014-0056-0
fatcat:mzeh5dl37vc73km5h7qn3w3p2e
« Previous
Showing results 1 — 15 out of 188,083 results