COMPUTER NETWORK TOPOLOGY DESIGN IN THE LIMELIGHT OF Click to edit Master subtitle style PASCAL GRAPH PROPERTY

KRITHI B G
3/26/12

INTRODUCTION GRAPH AND PROPERTIES (Based on paper submitted by

PASCAL

Dr. Narsingh Deo and Micheal Quinn in 1982)

DEPENDABLE

NODE OF PASCAL

GRAPH (Based on paper submitted by 3/26/12 Sanjay Kumar Pal and Samar Sen

INTRODUCTION

3/26/12

Network

Topology

Network topology is the layout pattern of interconnections of the various elements (links, nodes) of a computer or biological network.

Types
q

Physical Topology Logical Topology

3/26/12

GRAPH

THEORY

Study of graphs Graph

vertices or nodes egdes

Directed graph Undirected graph

3/26/12

Desired

properties of a Graph

Simple

and Recursive be adjacent to all others

No reconfiguration on adding new node

Vertex

Several

paths between each pair of vertices

Reliability

Paths

be of short lengths
3/26/12

Reduce communication delay

PASCAL GRAPH AND PROPERTIES (Based on paper submitted by Dr. Narsingh Deo and Micheal Quinn in 1982)

3/26/12

Pascal

Triangle

Named after French Mathematician Blaise Pascal Pascal's triangle is a triangular array of the binomial coefficients in a triangle.

3/26/12

A number in the triangle can be found by nCr (n Choose r) where n is the number of the row and r is the element in that row. The formula for nCr is:

n! -------r!(n-r)!

3/26/12

Pascal

Triangle Modulo 2

Consider Square form of Pascal Triangle.

Numbers in bold appear in Pascal 5 triangle

Take mod 2 of entries in the above square

3/26/12

Pascal

Matrix

Pascal matrix is an infinite matrix containing the binomial coefficients as its elements. Upper Triangle Lower Triangle

3/26/12

An (n x n) symmetric binary matrix is called the Pascal Matrix PM(n) of order n if its main diagonal entries are all 0s and its lower (and therefore the upper also) consists of the first (n1) rows of Pascal Triangle modulo 2.

3/26/12

Pascal

Graph

An undirected graph of n vertices corresponding to PM(n) as an adjacency matrix is called Pascal Graph (n), where n is the order of the Pascal graph.

3/26/12

Connectivity

Properties of Pascal

Graph

PG(n) is a subgraph of PG(n+1) for every n 1.

3/26/12

All Pascal Graph PG(i) for i 1 7 are planar; all Pascal Graph of higher order are nonplanar.

3/26/12

Vertex V1 is adjacent to all other vertices in the Pascal Graph. Vertex V1 is adjacent to V i+1 in the Pascal graph for i 1.

3/26/12

PG(n) contains a star tree for every n 1.

3/26/12

PG(n) contains a Hamiltonian circuit [1,2,3,,n-1, n,1].

3/26/12

If k=2^n +1, n is a positive integer, then Vk is adjacent to all Vi. 0i< 2k and i k

3/26/12

No two even number of vertices of a Pascal Graph are adjacent.

3/26/12

There are at least two edge disjoint path of length 2 between any two distinct vertices in PG(n), 3 n .

3/26/12

If Vi is adjacent to Vj , where j is even and |i-j|>1, then I is odd and Vi is adjacent to V j-1.

3/26/12

Define

e(PG(n)) to be the number of edges in PG(n),

3/26/12

Pascal
Step Step Step

Graph Generation Algorithm

1: Enter n number of vertices. 2: Initialized LT[0,0] = 1;

3: From the lower left triangle [LT(n,n)] by adding the number directly above and to the left with the number directly above and to the right to find the new value. If either the number to the right or left is not present, substitute a zero to its place. 4: From the upper right triangle [UT(n,n)] using the same manner. 5: Convert the lower left triangle 3/26/12 into binary values.

Step Step

DEPENDABLE NODE OF PASCAL GRAPH (Based on paper submitted by Sanjay Kumar Pal and Samar Sen Sarma in 2010)

3/26/12

CONNOTATION OF WORK
Criteria

in any network topology that are given priorities to judge its credentials. criteria are,
of the network, of the network, of the network network.

Those

degree diameter

scalability

reliability of the 3/26/12

FASCINATING PROPERTY OF PASCAL GRAPH

Vertex

v1 of any Pascal graph is adjacent to all other vertices in that graph. vi is adjacent to v i+1 in the Pascal graph if i 0 that there exist other node vi ( i 0) having the same property like v1 node will never have even 3/26/12 number as its index.

Vertex Prove

This

Dependable

Node of Pascal

Graph
They

have found and recommended other node similar to v1 in the PG(n) and termed it as Dependable Node of Pascal Graph (DNP); the special node, other than node v1, of Pascal graph PG(n) with same degree like v1.

3/26/12

FORMULAE DERIVED

3/26/12

Experimental

Result

3/26/12

3/26/12

SIGNIFICANCE
It is very easy to access or traverse any
node from v1 directly in a single hop.
Every

other node except v1 had to use either two hop (the two communicating nodes have even number indices) or single hop otherwise. is fine till v1 is not perturbed. this paper they have re-established its reliability under this circumstances by finding DNP that is similar to v1 in PG(n). graphs exhibits high reliability, effective degree and diameter from computer network point of view. 3/26/12

Everything In

Pascal

CONCLUSION
A

source code has been written in C programming language to generate the Pascal Matrix of different order. formulae were put into test for a meticulous checking of the existence of DNP in different Pascal Matrices generated by the program. the3/26/12 3, the Pascal graph case

The

From

ANY QUESTIONS?

3/26/12