Spanning Tree Method for Link State Aggregation in Large Communication Networks Whay Choiu Lee.

Slides:



Advertisements
Similar presentations
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Advertisements

Greed is good. (Some of the time)
FPGA Technology Mapping Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
The Cache Location Problem. Overview TERCs Vs. Proxies Stability Cache location.
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
Approximating Sensor Network Queries Using In-Network Summaries Alexandra Meliou Carlos Guestrin Joseph Hellerstein.
Discussion #36 Spanning Trees
CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints 晏廷.
1 On Compressing Web Graphs Michael Mitzenmacher, Harvard Micah Adler, Univ. of Massachusetts.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
Graphs & Graph Algorithms 2 Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.
Chapter 7 Network Flow Models.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Chapter 9: Graphs Basic Concepts
Graphs & Graph Algorithms 2 Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang.
Escaping local optimas Accept nonimproving neighbors – Tabu search and simulated annealing Iterating with different initial solutions – Multistart local.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Network Aware Resource Allocation in Distributed Clouds.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Chapter 2 Graph Algorithms.
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
COSC 2007 Data Structures II Chapter 14 Graphs III.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Data Structures and Algorithms A. G. Malamos
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Connected Dominating Sets. Motivation for Constructing CDS.
 Rooted tree and binary tree  Theorem 5.19: A full binary tree with t leaves contains i=t-1 internal vertices.
Administration Feedback on assignment Late Policy
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
CSCE350 Algorithms and Data Structure Lecture 19 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
Union-Find  Application in Kruskal’s Algorithm  Optimizing Union and Find Methods.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Routing Topology Algorithms Mustafa Ozdal 1. Introduction How to connect nets with multiple terminals? Net topologies needed before point-to-point routing.
Network-Aware Query Processing for Stream- based Application Yanif Ahmad, Ugur Cetintemel - Brown University VLDB 2004.
Ch. 15 Connecting LANs.
1 Data Compression Hae-sun Jung CS146 Dr. Sin-Min Lee Spring 2004.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Tree Configuration in Bridged IEEE1394 Bus Network PHILIPS Research Subrata Banerjee PHILIPS Research Briarcliff P WG Meeting March 19-20, 1998.
1 Assignment #3 is posted: Due Thursday Nov. 15 at the beginning of class. Make sure you are also working on your projects. Come see me if you are unsure.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
Chapter 11. Chapter Summary  Introduction to trees (11.1)  Application of trees (11.2)  Tree traversal (11.3)  Spanning trees (11.4)
1 Data Structures and Algorithms Graphs. 2 Graphs Basic Definitions Paths and Cycles Connectivity Other Properties Representation Examples of Graph Algorithms:
CSE 373: Data Structures and Algorithms Lecture 21: Graphs V 1.
Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.
Greedy Technique.
Optimal Configuration of OSPF Aggregates
Graph Algorithm.
Minimum Spanning Tree.
Minimum Spanning Tree.
Graphs & Graph Algorithms 2
Graph theory and routing: Background for Network Design
Lecture 9 Greedy Strategy
Graphs Chapter 11 Objectives Upon completion you will be able to:
Chapter 9: Graphs Basic Concepts
Running example The 4-houses puzzle:
Maximum Flow Neil Tang 4/8/2008
Chapter 9: Graphs Basic Concepts
Presentation transcript:

Spanning Tree Method for Link State Aggregation in Large Communication Networks Whay Choiu Lee

Overview Introduction Existing methods for link state aggregation symmetric-point full-mesh star Spanning Tree Method intuition properties of spanning tree how does it work Discussion Summary

Introduction Why is the link state aggregation needed? Complexity of link state updates( O(n 2 ) ). Security. Criteria of desirable link state aggregation: Adequately represents the original network. Significantly compresses the original network.

Introduction Common solution for complexity reduction Hierarchical structure. Boarder nodes Logical links

Subnetwork Topology A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) (bandwidth, delay) non-additive, additive

Existing methods for link state aggregation Symmetric-point Pro: greatest reduction. O(1). Con: does not adequately reflect any asymmetric topology. does not capture any multiple connectivity. (2,30) A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5)

Existing methods for link state aggregation Full-Mesh Pro: adequate representation. flexibility. A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) A B C D (6,24) (7,17) (6,21) ( 4,27 ) (4,13) Con: link state explosion. O(n 2 ). (4,18)

Existing methods for link state aggregation Star Pro: limited flexibility. O(n). A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) A B C D Con: does not capture any multiple connectivity. (1,15)

Spanning tree method Idea: Represent the original subnetwork by full-mesh topology consisting of predetermined subset of the nodes. Encode the link state information associated with the full-mesh representation. Advantages: O(n). Link state of nodes not on spanning tree may be derived or estimated. Multiple connectivity.

Spanning tree method Properties of spanning tree: Tree: connecting set of nodes with no loop. G(N, N-1). Unique path connecting each pair of nodes. Maximum spanning tree vs. minimum spanning tree. Maximum weight spanning tree: d <= min(a,b,c) Minimum weight spanning tree: d >= max(a,b,c) A B C D b a d c Spanning Tree

Spanning tree method 1. Determine maximum bandwidth path for each pair of border nodes. 2. Create logical link between each pair of border nodes to form a full-mesh, and assign it the (bandwidth, delay) of maximum bandwidth path. 3. Generate one maximum weight spanning tree based on bandwidth, and another based on delay.

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5)

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) D-A (7,17)

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) D-A (7,17) D-B (4,27)

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) D-A (7,17) D-B (4,27) D-C (6, 21)

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24)

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18)

Constructing Maximum-Bandwidth Full-Mesh Representation shortest-widest routing algorithm A B C D (7,10) (4,8) (7,7) (5,5) (9,8) (3,4) (4,7) (6,6) (2,3) (10,5) D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18) B-A (4,13)

Maximum-Bandwidth Full-Mesh Representation D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18) B-A (4,13) A B C D (6,24) (7,17) (6,21) (4,27) (4,18) (4,13)

Deriving Maximum-Weight Spanning Tree for Bandwidth greedy algorithm Initialize tree T = Ø. Scan links in descending order of weight. If adding edge E to tree T create a loop Edge is excluded. Otherwise, edge is included in Tree T.

Deriving Maximum-Weight Spanning Tree for Bandwidth greedy algorithm D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18) B-A (4,13) A B C D (6,24) (7,17) (6,21) (4,27) (4,18) (4,13)

Deriving Maximum-Weight Spanning Tree for Bandwidth greedy algorithm A B C D (6,24) (7,17) (6,21) (4,27) (4,18) (4,13) D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18) B-A (4,13)

Deriving Maximum-Weight Spanning Tree for Bandwidth greedy algorithm A B C D (6,24) (7,17) (6,21) (4,27) (4,18) (4,13) D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18) B-A (4,13)

Deriving Maximum-Weight Spanning Tree for Bandwidth greedy algorithm A B C D (6,24) (7,17) (6,21) (4,27) (4,18) (4,13) D-A (7,17) D-B (4,27) D-C (6, 21) C-A (6, 24) C-B (4, 18) B-A (4,13)

Maximum-Weight Spanning Tree for Bandwidth A B C D

Maximum-Weight Spanning Tree for Delay A B C D

Decoding Maximum-Weight Spanning Tree for Bandwidth depth-first-search A B C D Root A

Decoding Maximum-Weight Spanning Tree for Bandwidth depth-first-search A B C D Root A: E(AD)

Decoding Maximum-Weight Spanning Tree for Bandwidth depth-first-search A B C D Root A: E(AD), E(AC)

Decoding Maximum-Weight Spanning Tree for Bandwidth depth-first-search A B C D = min(6,4) Root A: E(AD), E(AC), E(CB)

Decoded Full-Mesh for Bandwidth A B C D

Decoded Full-Mesh for Delay A B C D

Discussion: Full-Mesh Topology Comparison A B C D (6, 24) (7,21) (6,21) (4,27) (4,21 ) (4,18) c A B C D (6,24) b (7,17) a (6,21) ( 4,27 ) d (4,13) Maximum-Bandwidth Full-Mesh Decoded Maximum-Bandwidth Full-Mesh Perfect encoding for bandwidth: d = min(a,b,c) Upper-bound for delay: d <= min(a,b,c)

Full-Mesh Topology Comparison A B C D (6, 24) (7,21) (6,21) (4,27) (4,21 ) (4,18) c A B C D (6,24) b (7,17) a (6,21) ( 4,27 ) d (4,13) Maximum-Bandwidth Full-Mesh Decoded Maximum-Bandwidth Full-Mesh maximum spanning tree: d <= min(a,b,c). Perfect encoding for bandwidth: d = min(a,b,c) maximum weight full-mesh: d >= min(a,b,c). Upper-bound for delay: d <= min(a,b,c)

Discussion: Full-Mesh Topology Problem A B C D (6, 24) (7,21) (6,21) (4,27) (4,21 ) A B C D (2,16) (7,17) (3,15) ( 2,18 ) (2,3) (4,13) Minimum-Delay Full-Mesh Decoded Maximum-Bandwidth Full-Mesh

Discussion: Full-Mesh Topology Problem A B C D (6, 24) (7,21) (6,21) (4,27) (4,21 ) A B C D (2,16) (7,17) (3,15) ( 2,18 ) (2,3) (4,13) Minimum-Delay Full-Mesh Decoded Maximum-Bandwidth Full-Mesh Call: C-D (3, 15)

Discussion: Full-Mesh Topology Problem A B C D (6, 24) (7,21) (6,21) (4,27) (4,21 ) A B C D (2,16) (7,17) (3,15) ( 2,18 ) (2,3) (4,13) Minimum-Delay Full-Mesh Decoded Maximum-Bandwidth Full-Mesh Call: C-D (3, 15)

Discussion: Full-Mesh Topology Problem A B C D (6, 24) (7,21) (6,21) (4,27) (4,21 ) A B C D (2,16) (7,17) (3,15) ( 2,18 ) (2,3) (4,13) Minimum-Delay Full-Mesh Decoded Maximum-Bandwidth Full-Mesh Call: C-D (3, 15)

summary Spanning tree method Full-mesh topology generation. Spanning tree construction. Topology recovery from spanning tree. Discussion Perfect encoding vs. upper-bound. Conservative.

questions