B Topological Network Design: Link Locations Dr. Greg Bernstein Grotto Networking www.grotto-networking.com.

Slides:



Advertisements
Similar presentations
CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 The 21 st Century Intelligent Network Tony Li, Carl DeSousa.
Advertisements

Chapter 4 Computer Networks
1 Understanding which market scenarios are best served by active Ethernet point-to-point (EP2P) and which are best served by point-to-multipoint PON architectures.
Computer Network Topologies
B Capacitated Design: Part II Dr. Greg Bernstein Grotto Networking
City of Cape Town Broadband Project Municipal networks and the growth of the Internet Leon Van Wyk Manager: Telecommunications City of Cape Town September.
Technologies from the point of view of Network Design Dr. Greg Bernstein Grotto Networking
LPs and MIPs background and solution approaches Dr. Greg Bernstein Grotto Networking
B Multi-Layer Network Design II Dr. Greg Bernstein Grotto Networking
N Group0/1: Yangfei WANG z Amrita Manayil z Thangappan Madavan V K z Peng Fu z Shuo Sun z Total Slides :19 In-Operation.
Compute Aggregate 1 must advertise this link. We omit the physical port on the switch to which the node is directly connected. Network Aggregate Links.
Optimization Problems in Optical Networks. Wavelength Division Multiplexing (WDM) Directed: Symmetric: Optic Fiber.
Network Topologies CS 1202.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Reconfigurable Optical Networks using WSS based ROADMs Steven D. Robinson VP, Product Management  Five Essential Elements of the.
IPv6 addressing in National Network of Public Administration «SYZEFXIS» Dr. Haris Stellakis Program Manager Information Society SA April 21, 2015 Information.
Data Center Basics (ENCS 691K – Chapter 5)
Jennifer Rexford Princeton University MW 11:00am-12:20pm Data-Center Traffic Management COS 597E: Software Defined Networking.
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
OPEX FOR NETWORK OPERATORS Questionnaire Sofie Verbrugge Didier Colle Ilse Lievens.
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
The Hardware Behind the Internet A virtual tour. Pictorial View of the Internet Backbone The “Internet Backbone” refers to the principal data routes between.
B Multi-Layer Network Design Dr. Greg Bernstein Grotto Networking
Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang.
By Naranchuluun Davaanyam. IT Perspective for Developer Capital Expenditure (CapEx) for development environ. could be high Acquisition of hardware, software,
Wireless Mesh Networks 1. Overview 2 Wireless routers Gateways Printers, servers Mobile clients Stationary clients Intra-mesh wireless links Stationary.
Cable & Multichannel Business Operations. Getting Started Franchising Cable systems must be franchised through local authority Access to right of ways.
Chapter 4: Computer Networks Department of Computer Science Foundation Year Program Umm Alqura University, Makkah Computer Skills /1436.
The Three Important Topologies By: Parimal Satashia.
United Telecommunication Services Michael Gaari Manager Network Provisioning UTS
1 EL736 Communications Networks II: Design and Algorithms Class2: Network Design Problems -- Notation and Illustrations Yong Liu 09/12/2007.
WP2 TEA1 Feasibility of Bandwidth on-Demand Case study approach, models and issues Stuttgart meeting th of September 2005 WP2.3/2.5 Håkon.
Network Aware Resource Allocation in Distributed Clouds.
Fiber Optic Data Network Project Tuscaloosa County School System 2006.
Metro/regional optical network architectures for Internet applications Per B. Hansen, Dir. Bus. Dev. Internet2’s Spring Member Meeting May 3, 2005.
17 th International Teletraffic Congress Topological design of telecommunication networks Michał Pióro a,b, Alpar Jüttner c, Janos Harmatos c, Áron Szentesi.
B Topological Network Design: Access Networks Dr. Greg Bernstein Grotto Networking
Chapter 21 Topologies Chapter 2. 2 Chapter Objectives Explain the different topologies Explain the structure of various topologies Compare different topologies.
Three types of network cabling Star Topology Tree Topology Linear Bus.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Basic Computer Knowledge. Outline Notes 1 Notes 2 Assessment.
Minimal Spanning Tree Problems in What is a minimal spanning tree An MST is a tree (set of edges) that connects all nodes in a graph, using.
1 Recommendations Now that 40 GbE has been adopted as part of the 802.3ba Task Force, there is a need to consider inter-switch links applications at 40.
NETWORK TOPOLOGIES NETWORK DEVICES. TOPOLOGY The physical topology of a network refers to the configuration of cables, computers, and other peripherals.
Graphcut Textures Image and Video Synthesis Using Graph Cuts
Network Information: Manipulation, Sharing, and Visualization Dr. Greg Bernstein Grotto Networking
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
1 EL736 Communications Networks II: Design and Algorithms Class7: Location and Topological Design Yong Liu 10/24/2007.
Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.
© Copyright 2006 Glimmerglass. All Rights Reserved. More than just another single point of failure? Optical Switching.
1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Approximation Algorithms based on linear programming.
Computer Networks Part 2
Introduction Chapter 1. Introduction  A computer network is two or more computers connected together so they can communicate with one another.  Two.
Internet Strucure Internet structure: network of networks Question: given millions of access ISPs, how to connect them together? access.
Yiting Xia, T. S. Eugene Ng Rice University
Chapter 1 Introduction Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.
Introduction to Networks
A Bandwidth-Efficient and Low-Latency Packet Assembly Strategy for Optical Burst Switching in Metro Ring Prasanna Krishnamoorthy, Andrea Fumagalli Optical.
Ad-hoc Networks.
A Study of Group-Tree Matching in Large Scale Group Communications
How a Network Works The network in this presentation belongs to Informa Software, Maitland FL.
Network Configurations
Customer Presentation
Frank Yeong-Sung Lin (林永松) Information Management Department
Frank Yeong-Sung Lin (林永松) Information Management Department
CSCI 465 Data Communications and Networks Lecture 16
Presentation transcript:

B Topological Network Design: Link Locations Dr. Greg Bernstein Grotto Networking

Outline Network Node Types – Access vs. transit Expenses: – Capital and Operating Link Placement Problem – With installation (capital) and operating costs – Book sections 2.7 (pg 65), 6.3 (pg )

Node Types Access Nodes – Originate and terminate traffic demand but do not switch traffic not associated with themselves Transit Nodes – Do not originate or terminate demand traffic, but switch it for other nodes VoD example: User Regions R0-R3 Data Centers DC0-DC2 Core Switches N0-N8 Which are access and which are transit?

Node Type Caveats I Management/Control Plane Traffic – All nodes must, in some way, be involved with the management or control planes and hence transit nodes originate and terminate some traffic. – In general demand traffic is much, much greater than management or control traffic. Why? Additional Access Switching and/or De- multiplexing – Access nodes may represent entire networks themselves with some internal nodes acting as transit nodes – Even end systems perform de-multiplexing. Can you think of examples?

Node Type Caveats II Hybrid Nodes – IXP’s with co-location services for CDNs Internet Exchange Points ( ) – Netflix co-locating at ISPs goes-edge-internet goes-edge-internet Sometime node definitions depend on the “granularity” of our view. – In network design we tend to start with coarser grained models and then refine them if warranted.

Types of Expenses Capital Expenses (CapEx) – Costs to “build it” Installation and acquisition of infrastructure, cables, and equipment Examples: digging trenches, laying conduit, acquiring cables, laying cables, cable trays, equipment racks, switches, etc… Operational Expense (OpEx) – Costs to “run it” Power, network administrators, repair, maintenance, depreciation

Link Placement Design IA

Link Placement Design IB

Link Placement Design IC

Link Placement Design ID

Example 1 Demands – ('B14', 'B2'): 26.4, ('B5', 'B14'): 17.9, ('B5', 'B2'): 25.1, ('B5', 'B8'): 18.4, ('B8', 'B14'): 26.7

Example 1 CapEx Visualization (B7, B8): (B4, B5): (B0, B1): (B5, B9): (B6, B7): (B3, B5): (B3, B4): (B2, B0): (B2, B1): (B10, B9): (B12, B13): (B12, B8): (B11, B9): (B10, B11): (B4, B9): (B14, B13): (B5, B11): (B3, B1): (B3, B7): (B2, B3): (B8, B13): (B14, B12): (B6, B8): (B6, B0): (B4, B8): (B14, B10): (B10, B13): CapEx based on length and a random multiplying integer – CapEx shown as width of dashed lines

Example 1: Results A With a CapEx bound of 18, Optimum OpEx value of 50,116.57

Example 1: Results B With a CapEx bound of 12, (lower) Optimum OpEx value of 50, (bigger)

Example 1: Results C With a CapEx bound of 11, (lower) Optimum OpEx value of 51, (bigger)

Example 1: Results D With a CapEx bound of 9, (lower) Optimum OpEx value of 64, (bigger)

Optimizing both CapEx and OpEx What if we… – Want to optimize on CapEx? – Optimize on a combination of CapEx and OpEx – Find the minimum CapEx to produce a viable network? Can we reuse some of what we have?

Optimizing CapEx and OpEx

Example Result from minimization with previous CapEx values and OpEx values scalled down by 0.01 – Objective value = 9,283.33, used this as a basis for the CapEx bounds in the previous formulation examples.