2005RelayRequires access

Fast network topology method for a distribution network

Yubin Yao

Open publisher page 4 citations

Abstract

The most effective way to speed up network topology is to reduce searching range.Topological analysis for a transmission network can reduce searching range by the method of searching within a station,but this method is not adaptive to a distribution network.Data sorting is another good method to reduce searching range,but data sorting is a time-consuming task. So it is proposed that overall network topology be divided into static network topology and dynamic network topology.Static network topology only deals with data sorting and works in advance,and dynamic network topology realizes topology actually.By using of sorted data,the speed of network topology is greatly increased.And it is also proposed to form islands by node-branch list which can be sorted in static network topology.This method can speed up network topology for further for a distribution network.The results of some practical examples prove the effectiveness of the two proposed method.

About this research paper

What this paper is about

The most effective way to speed up network topology is to reduce searching range.Topological analysis for a transmission network can reduce searching range by the method of searching within a station,but this method is not adaptive to a distribution network.Data sorting is another good method to reduce searching range,but data sorting is a time-consuming task. So it is proposed that overall network topology be divided into static network topology and dynamic network topology.Static network topology only deals with data sorting and works in advance,and dynamic network topology realizes topology actually.By using of sorted data,the speed of network topology is greatly increased.And it is also proposed to form islands by node-branch list which can be sorted in static network topology.This method can speed up network topology for further for a distribution network.The results of some practical examples prove the effectiveness of the two proposed method.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The most effective way to speed up network topology is to reduce searching range.Topological analysis for a transmission network can reduce searching range by the method of searching within a station,but this method is not adaptive to a distribution network.Data sorting is another good method to reduce searching range,but data sorting is a time-consuming task. So it is proposed that overall network topology be divided into static network topology and dynamic network topology.Static network topology only deals with data sorting and works in advance,and dynamic network topology realizes topology actually.By using of sorted data,the speed of network topology is greatly increased.And it is also proposed to form islands by node-branch list which can be sorted in static network topology.This method can speed up network topology for further for a distribution network.The results of some practical examples prove the effectiveness of the two proposed method.

Key concepts: Topology (electrical circuits), Logical topology, Network topology, Hierarchical network model, Computer science, Network simulation, Extension topology, Node (physics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Fast network topology method for a distribution network — Research Paper | ScholarLens