Network Topology Cutset Loop

Network topology, cut-Network topology, cut-set and set and

loop equation loop equation

20050300 HYUN KYU SHIM

DefinitionsDefinitionsConnected Graph : A lumped network

graph is said to be connected if there exists at least one path among the branches (disregarding their orientation ) between any pair of nodes.

Sub Graph : A sub graph is a subset of the original set of graph branches along with their corresponding nodes.

(A) Connected Graph (B) Disconnected Graph

Cut – SetCut – Set

Given a connected lumped network graph, a set of its branches is said to constitute a cut-set if its removal separates the remaining portion of the network into two parts.

Tree Tree

Given a lumped network graph, an associated tree is any connected subgraph which is comprised of all of the nodes of the original connected graph, but has no loops.

LoopLoop

Given a lumped network graph, a loop is any closed connected path among the graph branches for which each branch included is traversed only once and each node encountered connects exactly two included branches.

TheoremsTheorems(a) A graph is a tree if and only if

there exists exactly one path between an pair of its nodes.

(b) Every connected graph contains a tree.

(c) If a tree has n nodes, it must have n-1 branches.

Fundamental cut-setsFundamental cut-sets

Given an n - node connected network graph and an associated tree, each of the n -1 fundamental cut-sets with respect to that tree is formed of one tree branch together with the minimal set of links such that the removal of this entire cut-set of branches would separate the remaining portion of the graph into two parts.

Fundamental cutset Fundamental cutset matrixmatrix

.cutset

withassociatedbranch tree theas cutset

defining surface closed the toregardh wit

onoriientati opposite thehas and cutset in is branch if : 1

.cutset in not is branch if : 0

.set -cut with associatedbranch

tree theas cutset defining surface closed the toregard

n with orientatio same thehas and cutset in is branch if : 1

Nodal incidence matrixNodal incidence matrix

The fundamental cutset equations may be obtained as the appropriately signed sum of the Kirchhoff `s current law node equations for the nodes in the tree on either side of the corresponding tree branch, we may always write

(A is nodal incidence matrix)

Loop incidence matrixLoop incidence matrix

Loop incidence matrix defined by

loop. theasdirection opposite in the

oriented is and loopin is branch if : 1-

. loopin not is branch if : 0

loop. theasdirection same in the

oriented is and loopin is branch if : 1

Loop incidence matrix & Loop incidence matrix & KVLKVL

We define branch voltage vector

We may write the KVL loop equations conveniently in vector – matrix form as

)]`(),...,(),([)( 21 tvtvtvtv bb

tallfor 0)( tvB ba

General CaseGeneral Case

t)all(for 0)()()( 321 tvtvtv

t)all(for 0)()()( 321 tititi

To obtain the cut set equations for an n-node , b-branch connected lumped network, we first write Kirchhoff `s law

The close relation of these expressions with

0)( tQib )(`)( tvQtv tb

0)( tAib )(`)( tvAtv nb

bbbb tvyti )()(

)( kb ydiagy

sourcecurrent t independenan containsbranch th if : 0

L valueof inductancean containsbranch th if : L

R valueof resistance a containsbranch th if : R1

C valueof ecapacitanc a containsbranch th if : C

source. voltageindepedentan containsbranch th if : 0

And current vector is specified as

follows

function timeby the specified source

currentt independenan containsbranch th if : )(

)(tcondition initial

with theinductancean containsbranch th if :

resistance a containsbranch th if : 0

ecapacitanc a containsbranch th if : 0

source t voltageindependenan containsbranch th if : )(

Hence,

We obtain cutset equations

btbb QtvQQytQi )(`)(0

btb QtvQQy )(`

)(`)( tvQtvib

bib QtvQQy

ExampleExample

0 0 0 0

0 0 0 0 0

0 0 0 1

0 0 0 0 0

Rti bb

hence the fundamental cutset matrix

yields the cutset equations

1- 1- 1- 1 0

1- 1- 1- 0 1Q

)()()(

2 titi

tititi

In this case we need only solve

for the voltage function to obtain

every branch variable.

tt titi

CdvLdt

tdvCdv

)()()(

Network Topology Cutset Loop

Documents

Capacitated network design using general ﬂow-cutset

A Closed Loop TBSC Compensator for Direct Online Starting ... · Motor 1 Induction Motor 2 Induction TBSC Motor n Compensation Vs Fig.1 Proposed Topology A Closed Loop TBSC Compensator

Topology - cisco.com · Topology •Topology,onpage1 Topology TheTopologywindowdisplayscolor-encodednodesandlinksthatcorrespondtovariousnetworkelements, includingswitches,links

x Homotopy of Pathspi.math.cornell.edu/~erin/topology/munkres.pdf · both send a loop f 2 ˇ1(X;x0) to the same loop in

NETWORK TOPOLOGY - d13mk4zmvuctmz.cloudfront.net · Page 7 Fig 1c. Oriented Graph Cutset : It is a set of branches of a connected graph G which satisfies the following conditions

Capacitated network design using general ﬂow-cutset ... · Capacitated network design using general ﬂow-cutset ... The task of capacitated network design is to assign capacity

Graph theory and systematic analysis - EIEcktse/eie201/2.SystematicAnalysis.pdfMesh —enhanced— General loop analysis Nodal —enhanced— General cutset analysis Prof. C.K. Tse:

Resilient virtual topologies in optical networks and clouds · virtual network topology over optical network infrastructure thus becomes of prime importance. ... We apply the cutset

Designing Survivable Networks: A Flow Based Approach · Topology of network determines its ability to cope with disruptions and failures. ... Cutset {S, T} = set of edges separating

Network Topology Network Topology

STRING TOPOLOGY BACKGROUND AND PRESENT · PDF fileSTRING TOPOLOGY BACKGROUND AND PRESENT STATE ... inﬁnity structures and the loop product in ... ∗ of the free loop space

CMX998 Cartesian feedback loop calibration · feedback loop (CFBL) around a power amplifier (PA). Transmitters using this topology require calibration and control to ensure correct

A Poincaré inequality on loop spaces - Xue-Mei · A Poincaré inequality on loop spaces ... relates to the geometry and the topology of the path space and its subspaces. For the

Configure Topology-Independent Loop-Free Alternate (TI-LFA) · TI-LFAhasbeensuccessfullyconfiguredforsegmentrouting. Configuring TI-LFA for OSPF Thistaskdescribeshowtoenableper-prefixTopologyIndependentLoop-FreeAlternate(TI-LFA

loop coproducts onBG12 - marine.shinshu-u.ac.jpmarine.shinshu-u.ac.jp/~kuri/dvi/loop_coproducts_onBG12.pdf · THE BV ALGEBRA IN STRING TOPOLOGY OF CLASSIFYING SPACES 3 The case p=

Topology Discovery, Loop Finding and Alternative Path Solution in

Topology - head - Subdivision Modeling ...wiki.polycount.com/w/images/2/2a/Subdivision... · (pic4) The loop distance and shape differs with each person, though the underlying topology

Network topology, cut-set and loop equation Network topology, cut-set and loop equation 20050300 HYUN KYU SHIM

INTERNATIONAL IEEE Std 1588™ed3.0}en.pdf · K.1 Example —Star topology ..... 420 K.2 Example —PTP Network with a single loop with an odd number of PTP Instances in the loop

Topology Topology Different types of topology Different types of topology bus topologybus topology ring topologyring topology star topologystar