How to Build Network? ISAT 625 Network Problems Build highways to connect cities Build highways to connect cities Build network to connect computers.

Slides:

Advertisements

Similar presentations

Network Models Chapter 11

Advertisements

Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.

Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

1 Minimal Spanning Tree This is a technique used when we need to connect many places to a system(network).

Optimisation Methods Network Models.

Chapter 7 Network Flow Models.

Facilities Planning Objectives and Agenda: 1. Different types of Facilities Planning Problems 2. Intro to Graphs as a tool for deterministic optimization.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

© 2008 Prentice-Hall, Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.

Network Flow Models Chapter 7.

Transportation, Assignment, Network Models

CSE390 Advanced Computer Networks Lecture 7: Bridging (From Hub to Switch by Way of Tree) Based on slides from D. Choffnes Northeastern U. Revised Fall.

MNG221 - Management Science

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 12-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 12.

1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.

Introduction to Management Science

Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)

17-LAN extensions: Fiber Modems, Repeaters, Bridges and Switches Dr. John P. Abraham Professor UTPA.

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

7-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

Shortest Route, Minimal Spanning Tree and Maximal Flow Models

Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.

Network Optimization Models

TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.

1 CS 4396 Computer Networks Lab LAN Switching and Bridges.

Introduction to Operations Research

Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.

Graph Theory Topics to be covered:

“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.

Network Optimization Problems

Welcome to MM305 Unit 6 Seminar Larry Musolino

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.4 Trees.

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Scaling Broadcast Ethernet Some slides used with.

Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1.

Fundamental Data Structures and Algorithms (Spring ’05) Recitation Notes: Graphs Slides prepared by Uri Dekel, Based on recitation.

CSE 461 University of Washington1 Topic How do we connect nodes with a switch instead of multiple access – Uses multiple links/wires – Basis of modern.

Trees Dr. Yasir Ali. A graph is called a tree if, and only if, it is circuit-free and connected. A graph is called a forest if, and only if, it is circuit-free.

Welcome Unit 6 Seminar MM305 Wednesday 8:00 PM ET Quantitative Analysis for Management Delfina Isaac.

Welcome to MM305 Unit 6 Seminar Dr. Bob Network Models.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

ENGM 631 Minimum Spanning Tree. Prototype Example Seervada Park Trams route smallest total distance Phone lines minimum spanning tree Tram limitations.

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

Network Problems A D O B T E C

The Medium Access Control Sublayer Chapter

Mjdah Al Shehri Hamdy A. Taha, Operations Research: An introduction, 8 th Edition Chapter 6: Network Models.

Transportation, Assignment, and Network Models 9 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale Power.

Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.

Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.

Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.

Network Models Chapter 12

CS 3700 Networks and Distributed Systems

CS 3700 Networks and Distributed Systems

Shuffle Exchange Point-to-point, Bus, Ring, Star, Mesh

Network Models Please carefully study the following examples:

CS 4700 / CS 5700 Network Fundamentals

Network Models Chapter 12

Chapter 12 Network Models 12-1

Routing and Logistics with TransCAD

Business Statistics with Quantitative Analysis

Transportation, Assignment and Network Models

Section 14.4 Trees.

CS 4700 / CS 5700 Network Fundamentals

Network Models 7-1.

Prepared by Lee Revere and John Large

Network Models Chapter 12

Chapter 6 Network Flow Models.

INTRODUCTION TO NETWORK FLOWS

Presentation transcript:

How to Build Network? ISAT 625

Network Problems Build highways to connect cities Build highways to connect cities Build network to connect computers Build network to connect computers Layout water pipelines for a city Layout water pipelines for a city Find the best route to drive Find the best route to drive Products, mail delivery Products, mail delivery

Spanning Tree Problem Telecommunications Network Telecommunications Network  Connect computer systems and devices together in an efficient and effective manner DEC was concerned how computer systems and devices were connected to a LAN using Ethernet. “I think I shall never see a graph more lovely than a tree. A tree whose critical property is loop-free connectivity. A tree must be sure to span, so packet can reach every LAN. First the route must be selected, by ID it is elected. Least-cost from the root are traced. In the tree these paths are placed. A mesh is made for folks by me, then bridges find a spanning tree.

Minimal-Spanning Tree Technique Objective Connect all nodes of a network together while minimizing the total distance Example Consider the Lauderale Construction Company, which is currently developing a luxurious housing project on Panama City Beach. Melvin Lauderdale, owner and president of the company, must determine the least expensive way to provide water and power to each house.

Minimal-Spanning Tree

Steps for the Minimal-Spanning Tree Technique 1.Select any node in the network 2.Connect this node to the nearest node that minimizes the total distance 3.Considering all of the nodes that are now connected, find and connected the nearest node that is not connected 4.Repeat Step 3 until all nodes are connected

Maximal-Flow Models Goal Find the maximum amount of material, traffic, or information that can flow through a network from one point to another point Example Waukesha, a small town in Wisconsin, is in the process of developing a road system for the downtown area. Bill Blackstone, one of the city planners, would like to determine the maximum number of cars that can flow through the town from west to east.

Maximal-Flow Models

Steps of Maximal-Flow Technique 1.Pick any path with some flow 2.Increase the flow as much as possible 3.Adjust the flow capacity numbers on the path 4.Repeat these steps until an increase in flow is no longer possible

Shortest-Route Models Goal Find the shortest path that you can travel from one point to a another point in the network Example Every day, Ray Design, INC., must transport beds, chairs, and other furniture items from the factory to the warehouse. This involves going through several cities. Ray would like to find the route with the shortest distance.

Shortest-Route Models

Steps of the Shortest-Route Technique 1.Find the nearest node to the origin. Put the distance in a box by the node 2.Find the next-nearest node to the origin, and put the distance in a box bu the node. 3.Repeat this process until you have gone through the network

PetroChem PetroChem, an oil refinery located on the Mississippi River south of Baton Rouge is designing a new plant to produce diesel fuel. The picture below shows the network of the main processing centers along with the existing rate of flow (in thousands of gallons of fuel). The management at PetroChem would like to determine the maximum amount of fuel that can flow through the plant.

PetroChem

Location Problem A location problem is concerned with a situation which can be represented by a network, and in which we wish to locate some facility or facilities so that some function is maximized or minimized A location problem is concerned with a situation which can be represented by a network, and in which we wish to locate some facility or facilities so that some function is maximized or minimized

Example Suppose that we wish to locate a hospital, police station, fire station or some other service point at one of the towns in a region. In this case, the vertices of the network correspond to the towns, and the edges correspond to roads linking these towns.