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

Slides:



Advertisements
Similar presentations
Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Advertisements

13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
B Topological Network Design: Link Locations Dr. Greg Bernstein Grotto Networking
B Multi-Layer Network Design II Dr. Greg Bernstein Grotto Networking
Networking Problems in Cloud Computing Projects. 2 Kickass: Implementation PROJECT 1.
B Network Design Problems: An Overview Dr. Greg Bernstein Grotto Networking Based on Chapter 2 of Pioro and Medhi
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
B Flows to Paths Dr. Greg Bernstein Grotto Networking
B Network Dimensioning Problems: Where to put the capacity and how much… Dr. Greg Bernstein Grotto Networking
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Xiaowei Ying Xintao Wu Univ. of North Carolina at Charlotte 2009 SIAM Conference on Data Mining, May 1, Sparks, Nevada Graph Generation with Prescribed.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Traffic Engineering With Traditional IP Routing Protocols
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
1 Caching/storage problems and solutions in wireless sensor network Bin Tang CSE 658 Seminar on Wireless and Mobile Networking.
Outline IS400: Development of Business Applications on the Internet Fall 2004 Instructor: Dr. Boris Jukic Web Applications for Business: Performance Issues.
Scalability and Accuracy in a Large- Scale Network Emulator Amin Vahdat, Ken Yocum, Kevin Walsh, Priya Mahadevan, Dejan Kostic, Jeff Chase, and David Becker.
1 Caching Game Dec. 9, 2003 Byung-Gon Chun, Marco Barreno.
1 CT30A8901 Service Oriented Communications Chapter ?: Book Group ?: Firstname Lastname.
B Multi-Layer Network Design Dr. Greg Bernstein Grotto Networking
Network Design and Optimization Introduction Dr. Greg Bernstein Grotto Networking
Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
Chapter - 2 What is “GIT” VERSION CONTROL AND GIT BASICS.
BRITE integration with ns-3 Joshua Pelkey and Dr. George Riley Wns3 March 25, 2011.
Network management Reinhard Laroy BIPT European Parliament - 27 February 2012.
IT 211 Project Integration and Deployment Lab #11.
Network Aware Resource Allocation in Distributed Clouds.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
P2Pedia A Distributed Wiki Network Management and Artificial Intelligence Laboratory Carleton University Presented by: Alexander Craig May 9 th, 2011.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Content distribution networks (CDNs) r The content providers are the CDN customers. Content replication r CDN company installs hundreds of CDN servers.
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.
Section 5.1 Midsegment Theorem and Coordinate Proof.
Analysis and algorithms of the construction of the minimum cost content-based publish/subscribe overlay Yaxiong Zhao and Jie Wu
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
ASSIGNMENT, DISTRIBUTION AND QOS PROVISIONING IN COMMUNICATION NETWORKS.
Network Information: Manipulation, Sharing, and Visualization Dr. Greg Bernstein Grotto Networking
Heuristic Methods for Topological Design of Telecommunication Networks Andrzej Mysłek, Piotr Karaś Institute of Telecommunications Warsaw University of.
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.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
1 Optimizing the Topology of Bluetooth Wireless Personal Area Networks Marco Ajmone Marsan, Carla F. Chiasserini, Antonio Nucci, Giuliana Carello, Luigi.
Thin Clienting Justin Spratt. What is thin clienting? Thin clienting is a form of cloud computing—running applications on a server rather than on a local.
Optimizing server placement in distributed systems in the presence of competition Jan-Jan Wu( 吳真貞 ), Shu-Fan Shih ( 施書帆 ), Pangfeng Liu ( 劉邦鋒 ), Yi-Min.
Project 1 : Phase 1 22C:021 CS II Data Structures.
Facility Location and Network Design Models. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of.
Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banergee and Biswanath Mukherjee,
SIP6 Platform Updates Based on CNGI-CERNET2 Network Research Center Tsinghua University.
Towards an integrated multimedia service hosting overlay Dongyan Xu Xuxian Jiang Proceedings of the 12th annual ACM international conference on Multimedia.
Network Topology Deals with a circuit model called graph, which is a collection of line segments called branches and points called nodes Circuit diagram.
Constraint-Based Routing
DATA COMMUNICATION Lecture-5.
What is the average rate of change of the function f (x) = 8 x - 7 between x = 6 and x = 7? Select the correct answer:
ME 521 Computer Aided Design 15-Optimization
Performance Comparison of Tarry and Awerbuch Algorithms
Raymond Exclusive Algorithm
Replica Placement Heuristics of Application-level Multicast
The Geometric Distributions
QuickBooks Error H202 - Fix QuickBooks issues
Presentation transcript:

B Topological Network Design: Access Networks Dr. Greg Bernstein Grotto Networking

Outline Topological Design Problem Types – Location and installation costs Node Placement Problems – chapter 6 (intro information), 6.1 (but not 6.1.1) access, but not proof of proposition 6.1. Link Installation Costs – Book sections 2.7 (pg 65), 6.3 (pg )

Node Placement Problems Network Access/Edge – Where to put points of presence (PoPs). – Where to put core network edge nodes Servers and Content – Where to locate web or application servers for a given customer base – Where to locate content replicas in a CDN

Access network design problem Figure out where to install “access nodes” how to connect to “user areas” Fixed user area locations Possible access node locations

Requirements & Costs

Variable Selection

Requirements as Constraints

Objective Total connectivity costTotal location cost

Generating Test Problems Use geometric distance for connectivity cost between users and nodes. Generate two types of nodes and place into a graph (n_users, n_nodes) Give nodes random locations within prescribed limits. Try different values of node capacity and location costs to see how these influence the problem.

Python Problem Generator Example usage:

Example Network 2 Access node locations modified from purely random

Example Network 3 Access node locations modified from purely random

Python MIP Formulation Problem formulation function:

Python Formulation Setup User and access type node lists – Need these to generate variables Distances – Put in a dictionary for generality, but could have directly used the distance() function.

Python Formulation: Variables & Objective User-Access link like variables, Access node use variables Objective function in terms of link and node costs

Python Formulation: Constraints Node capacity constraints User connectivity constraints Node capacity Node a indicator

Example 1A K = 6, Cost = 50 per node, Average distance from user to access node Note 8 out of 10 access nodes used. Why aren’t the access nodes being used to capacity?

Example 1B K = 6, Cost = 500 per node, Average distance from user to access node Note 5 out of 10 access nodes used. Why are the access nodes running at full capacity?