Using a Graph Algorithm Based Metric to Navigate Important Nodes and Validate Network Availability Design

Author(s):  
Minh Pham ◽  
Martin Kappes
1988 ◽  
Vol 53 (4) ◽  
pp. 788-806
Author(s):  
Miloslav Hošťálek ◽  
Jiří Výborný ◽  
František Madron

Steady state hydraulic calculation has been described of an extensive pipeline network based on a new graph algorithm for setting up and decomposition of balance equations of the model. The parameters of the model are characteristics of individual sections of the network (pumps, pipes, and heat exchangers with armatures). In case of sections with controlled flow rate (variable characteristic), or sections with measured flow rate, the flow rates are direct inputs. The interactions of the network with the surroundings are accounted for by appropriate sources and sinks of individual nodes. The result of the calculation is the knowledge of all flow rates and pressure losses in the network. Automatic generation of the model equations utilizes an efficient (vector) fixing of the network topology and predominantly logical, not numerical operations based on the graph theory. The calculation proper utilizes a modification of the model by the method of linearization of characteristics, while the properties of the modified set of equations permit further decrease of the requirements on the computer. The described approach is suitable for the solution of practical problems even on lower category personal computers. The calculations are illustrated on an example of a simple network with uncontrolled and controlled flow rates of cooling water while one of the sections of the network is also a gravitational return flow of the cooling water.


1992 ◽  
Vol 3 (4) ◽  
pp. 349-357 ◽  
Author(s):  
Michele Barezzani ◽  
Alcatel-Telettra Silvano Pupolin ◽  
Michele Zorzi

2021 ◽  
Author(s):  
Dwi Sunaryono ◽  
Annas Nuril Iman ◽  
Diana Purwitasari ◽  
Agus Budi Raharjo

Author(s):  
S. Suvitha ◽  
R. C. Karpagalakshmi ◽  
R. Umamaheswari ◽  
K. Chandramohan ◽  
M. S. Sabari

The internet is taking component in a developing feature in every non-public and professional activity. The real-time, delay sensitive and mission-essential purposes, community availability requirement is beforehand for internet carrier providers (ICPs). The loop-loose criterion (LLC) approach has been extensively deployed through numerous ICPs for handling the best network component failure state of affairs in fantastic internet through. The achievement of LLC lies in its inherent simplicity; however, this comes at the rate of letting certain failure. To reap complete failure safety with LLC without incurring significant extra, a singular link protection scheme, hybrid hyperlink protocol (HLP), to reap failure routing. In contrast with in advance schemes, HLP guarantees tall network in a greater surroundings pleasant way. HLP is carried out in stages. Initial level substances a surroundings pleasant LLC primarily based totally on (MNP-e). The complexity of the set of rules is decrease than that of Dijkstra’s set of rules and might gift similar to network availability with LCC (Loop-loose criterion). Moment level substances backup direction safety based on MNP-e, the area totally a minimum type of need to be protected, to fulfill the network requirement. We don't forget those algorithms in a massive spread of associated, real and actual, and the effects display that HLP can achieve lofty network without introducing apparent.


Sign in / Sign up

Export Citation Format

Share Document