EMIS 83921 Lecture 16 - Chapter 8 Designing Mesh Networks.

Slides:



Advertisements
Similar presentations
Selinger Optimizer Lecture 10 October 15, 2009 Sam Madden.
Advertisements

Chapter 5.2 Factoring by Grouping. 3y (2x – 7)( ) (2x – 7) (2x – 7) – 8 3y 1. Factor. GCF = (2x – 7) Find the GCF. Divide each term by the GCF. (2x –
The minimum cost flow problem
6.830 Lecture 10 Query Optimization 10/6/2014. Selinger Optimizer Algorithm algorithm: compute optimal way to generate every sub-join: size 1, size 2,...
d) F(x, y, z) = x y z + x\ y\ z + x y\ z\ y yz x x z
Form 1 Mathematics Chapter 11.  Lesson requirement  Textbook 1B  Workbook 1B  Notebook  Before lessons start  Desks in good order!  No rubbish.
A forest of trees even with modest numbers of tip species, the number of possible trees is frightening. Fitch W.M Syst. Zool. 20:
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #8.
TCOM 540/11 TCOM 540 Session 6. TCOM 540/12 Agenda Review Session 4 and 5 assignments Multicenter local access design.
Lecture 07 Prof. Dr. M. Junaid Mughal
Chapter 9: Graphs Basic Concepts
Recall the distributive property of multiplication over addition... symbolically: a × (b + c) = a × b + a × c and pictorially (rectangular array area model):
Combinations & Permutations. Essentials: Permutations & Combinations (So that’s how we determine the number of possible samples!) Definitions: Permutation;
1 Algorithms CSCI 235, Fall 2012 Lecture 9 Probability.
1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.
Chapter 2 Graph Algorithms.
Chapter 7 Section 1.  Students will write ratios and solve proportions.
6.3Find Probabilities Using Combinations
© Jalal Kawash 2010 Graphs Peeking into Computer Science.
Computing the chromatic number for block intersection graphs of Latin squares Ed Sykes CS 721 project McMaster University, December 2004 Slide 1.
Phrase-structure grammar A phrase-structure grammar is a quadruple G = (V, T, P, S) where V is a finite set of symbols called nonterminals, T is a set.
Copyright © 2014, 2010, and 2006 Pearson Education, Inc. Chapter 4 Polynomials.
Warm Up Find the missing side. In the diagram, ΔABC is equilateral, CD is an altitude, and AC = 12. What relationship exists between Δ ADC and Δ BDC?
Multiplying Binomials
1 TCOM 541 Session 2. 2 Mesh Network Design Algorithms for access are not suitable for backbone design –Access designs generally are trees – sites connect.
Operations with 2x2 matrices IB SL/HL
Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,
Parallelograms – Part 2 Geometry Chapter 6 A BowerPoint Presentation Proving quadrilaterals are parallelograms.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
A Valentines Day Problem Source The teachers lab Patterns in Mathematics
Geometry: Plane Figures Chapter. point A point marks a location. A A B B line segment the part of the line between 2 points endpoints.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
Copyright © 2014, 2010, and 2006 Pearson Education, Inc. Chapter 4 Polynomials.
Distributive Property with area models
Spanning Tree Method for Link State Aggregation in Large Communication Networks Whay Choiu Lee.
Turn in HW and Classwork sheet from last class. You have 10 minutes to complete the warm- up. After the warm-up, we will finish our notes on algorithms.
Graphs and Matrices Spring 2012 Mills College Dan Ryan Lecture Slides by Dan Ryan is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike.
Prepared by Dr. Maher Abuhamdeh
Basic Concepts Graphs For more notes and topics visit:
Aim: Full House Grid: 9 Grid Play: Calculate answer & cross it off
Combinations COURSE 3 LESSON 11-3
Combinations & Permutations
CHAPTE R The concept of Two-Dimensional Loci
FP1 Matrices Introduction
Make an Organized List and Simulate a Problem
تصنيف التفاعلات الكيميائية
Line, line segment and rays.
Recapping: Vector addition.
Introduction to Transportation Engineering
Chapter 9: Graphs Basic Concepts
Running example The 4-houses puzzle:
Introduction to Minimum Cost Flows
Splash Screen.
Combinations & Permutations
Splash Screen.
Bell Work Complete problems 8, 9, and 15 from yesterday. Proofs are on the board.
A Series of Slides in 5 Parts Movement 2. BFS
FIELD.
Splash Screen.
Md. Tanveer Anwar University of Arkansas
Vectors (2).
Distance Formula d = √ (x1 – x2)2 + (y1 – y2)2, where d is the distance between the points (x1, y1) and (x2, y2).
If AD = 10, DC =6, and ED = 15, find DB.
Properties of Transversal Lines
10.5 Permutations and Combinations.
Chapter 9: Graphs Basic Concepts
A Series of Slides in 5 Parts Movement 4. Best-First
A Series of Slides in 5 Parts Movement 4. Best-First
A Series of Slides in 5 Parts Movement 1. DFS
A Series of Slides in 5 Parts Movement 3. IDFS
Presentation transcript:

EMIS Lecture 16 - Chapter 8 Designing Mesh Networks

EMIS Example #1 Example #1 InputsInputs –4 Sites A, B, C, D –Traffic Matrix –Equip = 64K bps –Trunks –Utilization < 50% ABCDA B C D-3232-

EMIS Feasible Design #1 (Tree) A D B C DemandRoutingValue A-BA-D-B32 A-CA-D-C32 B-AB-D-A32 B-D 32 C-AC-D-A32 C-D 32 D-B 32 D-C 32

EMIS Link Loading (Utilization < 50%) LinkLoadingTrunks A-D64 bps2 D-A642 B-D642 D-A642 C-D642 D-C642 A D B C

EMIS Feasible Design #2 (Mesh) DemandRoutingValue A-B 32 A-C 32 B-A 32 B-D 32 C-A 32 C-D 32 D-B 32 D-C 32 A D B C

EMIS LinkLoad (K bps) Trunks A-B321 B-A321 A-C321 C-A321 B-D321 D-B321 C-D321 D-C321 A D B C 4 64Kbps trunks Utilization = 50% Final Design

EMIS Optimization Models Multicommodity Problem – let the commodity be represented by the origin nodes Commodity A: From A to other nodes Commodity B: From B to other nodes Commodity C: From C to other nodes Commodity D: From D to other nodes

EMIS The 4 Commodities A D B C A D B C A D B C A D B C {64} {-32}

EMIS Examine a Potential Solution A D B C A D B C A D B C A D B C 64 Kbps 32 Kbps

EMIS A D B C How much equipment is required for this solution? Total 64 K Trunks = 9

EMIS AMPL Models Node-Arc Model Arc-Path Model NodeArc1L16.txt, dataNA1L16.txt, outNA1L16.txt ArcPath1L16.txt, dataAP1L16.txt, outAP1L16.txt

EMIS Solution – Both Models ABCD A32 B C D A D B C 4 64K trunks

EMIS New Traffic Matrix ABCD A529 B C52741 D

EMIS See NodeArc2L16.txt, dataNA2L16.txt, outNA2L16.txt ArcPath2L16.txt, dataAP2L16.txt, outAP2L16.txt Model and Data Files

EMIS Solution Node-Arc Model A D B C A D B C A D B C A D B C

EMIS Uses 11 Trunks A D B C

EMIS Arc-Path Solution (same 11 Trunks) A-C: 5 Path 4 A-C A-D: 29 Path 25 A-D B-A: 79Path 7 B-A with 64 Path 8 B-C-A with 3 Path 9 B-D-A with 12 TOTAL79