Network Design and Optimization Introduction Dr. Greg Bernstein Grotto Networking www.grotto-networking.com.

Slides:



Advertisements
Similar presentations
TRAINING SERVICES NIGTEL-CS TRAINING SERVICE Mobile Telecommunications in Africa especially Nigeria has recorded rapid growth and expansion in the.
Advertisements

Network Design and Optimization Python Introduction
B Multi-Layer Network Design II Dr. Greg Bernstein Grotto Networking
Project Lead the Way An Orientation American High School.
Network Design and Optimization Queueing Theory Overview 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
MAT 3749 Introduction to Analysis Fall 2013
Teaching Courses in Scientific Computing 30 September 2010 Roger Bielefeld Director, Advanced Research Computing.
Department of Mathematics and Computer Science
Decision Making: An Introduction 1. 2 Decision Making Decision Making is a process of choosing among two or more alternative courses of action for the.
FIN 685: Risk Management Topic 5: Simulation Larry Schrenk, Instructor.
COMP1261 Advanced Algorithms n 15 credits, Term 1 (Wednesday 9-12) n Pre-requisites: Calculus and Mathematical Methods, Numerical Mathematics and Computer.
CSCD 433/533 Advanced Computer Networks Lecture 1 Course Overview Fall 2011.
Discrete-Event Simulation: A First Course Steve Park and Larry Leemis College of William and Mary.
Western Oregon University's Pre-Service Middle School Mathematics Focus Laurie Burton & Rachel Harrington TOTOM 2010.
The Islamic University of Gaza Faculty of Engineering Numerical Analysis ECIV 3306 Introduction.
Computing Fundamentals 2 Overview Lecturer: Patrick Browne Room [KA] , Lab [KA] Based on Chapter 19. A Logical approach to Discrete Math.
Financial Engineering Club Career Path and Prep. Entry Level Career Paths Type 1: Research based Background: Physics, Electrical Engineering, Applied.
Overview of the MS Program Jan Prins. The Computer Science MS Objective – prepare students for advanced technical careers in computing or a related field.
Statistical Hydrology By Prof. Dr. Eng. Amro Elfeki Faculty of Meteorology, Environment and Arid Land Agriculture (Room 207)
Chapter 12: Simulation and Modeling Invitation to Computer Science, Java Version, Third Edition.
B Multi-Layer Network Design Dr. Greg Bernstein Grotto Networking
Performance Evaluation of Computer Systems and Networks By Behzad Akbari Tarbiat Modares University Spring 2012 In the Name of the Most High.
PREAMBLE OF INDUSTRIAL MANAGEMENT (TAS-601)
1 Programming Thinking and Method (0) Zhao Hai 赵海 Department of Computer Science and Engineering Shanghai Jiao Tong University
Lecture 1 What is Modeling? What is Modeling? Creating a simplified version of reality Working with this version to understand or control some.
Introduction to Operation Research
Modeling and simulation of systems Simulation optimization and example of its usage in flexible production system control.
Operations Research Lecturer Eng. Ahmed H. Abo absa 2 nd Semester ITGD4207 University of Palestine.
Mathematics in Computer Science at Loras College Steve Mosiman.
Company Overview for GDF Suez December 29, Enthought’s Business Enthought provides products and consulting services for scientific software solutions.
Proposal for Background Requirements Changes For the current MS/PhD programs, background requirements are expressed in the "Background Preparation Worksheet"
1 High-Level Carrier Requirements for Cross Layer Optimization Dave McDysan Verizon.
Computer Science Department 1 Undergraduate Degree Program Computer Science Chair Dr. Kurt Maly.
Chapter 3 System Performance and Models. 2 Systems and Models The concept of modeling in the study of the dynamic behavior of simple system is be able.
1 Computer Programming (ECGD2102 ) Using MATLAB Instructor: Eng. Eman Al.Swaity Lecture (1): Introduction.
1 CS6320 – SW Engineering of Web- Based Systems L. Grewe.
Monté Carlo Simulation  Understand the concept of Monté Carlo Simulation  Learn how to use Monté Carlo Simulation to make good decisions  Learn how.
CMSC104 Problem Solving and Computer Programming Spring 2011 Section 04 John Park.
CMSC104 Problem Solving and Computer Programming Spring 2009 Sections 0201 & 0301 Ms. Dawn Block.
Most of contents are provided by the website Introduction TJTSD66: Advanced Topics in Social Media Dr.
Tue, 28 Aug 2002EChew: ISE330: Lecture 11 ISE330: Introduction to Operations Research Fall 2002 University of Southern California DJE-ISE Department.
Page th IETF – Vancouver, December 2007 Signaling Extensions for Wavelength Switched Optical Networks Greg
Introduction to GAMS, Netlib, Numerical Recipes CS 3414.
Computer Science in Context Evangelos E. Milios Professor and Graduate Coordinator Faculty of Computer Science Dalhousie University.
CS Curriculum Changes Fall, BS Computer Science 2015 COMPUTER SCIENCE COURSES—64 Hours COMPUTER SCIENCE CORE (48 Hours) CS 258Intro to Object-Oriented.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
CSCD 330 Network Programming Winter 2015 Lecture 1 - Course Details.
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.
Fall CSE330/CIS550: Introduction to Database Management Systems Prof. Susan Davidson Office: 278 Moore Office hours: TTh
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
 Problem solving involves a number of well- defined steps, which are as follows:  Define the problem.  Analyze the problem.  Identify and evaluate.
CSCD 433/533 Advanced Computer Networks Lecture 1 Course Overview Spring 2016.
Traffic Simulation L2 – Introduction to simulation Ing. Ondřej Přibyl, Ph.D.
S5.40. Module Structure 30% practical tests / 70% written exam 3h lectures / week (except reading week) 3 x 2h of computer labs (solving problems practicing.
Specialties Description
OPERATING SYSTEMS CS 3502 Fall 2017
CMSC104 Problem Solving and Computer Programming Spring 2008
INTERMEDIATE PROGRAMMING WITH JAVA
CMSC104 Problem Solving and Computer Programming Fall 2010 Section 01
PH2150 Scientific Computing Skills
Optimization Techniques for Natural Resources SEFS 540 / ESRM 490 B
CMSC 104 Problem Solving and Computer Programming Fall 2010
CAPE INFORMATION TECHNOLOGY
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
Quality Function Deployment for Designing a Course
CMSC104 Problem Solving and Computer Programming Fall 2010
CAPE INFORMATION TECHNOLOGY
CSC 241: Introduction to Computer Science I
Presentation transcript:

Network Design and Optimization Introduction Dr. Greg Bernstein Grotto Networking

Outline Who we are… The Context for Network Design & Analysis What we will cover this quarter Class mechanics

Who am I? Part time lecturer – Networking, C++, OO Programing Consultant – Standards work at IETF, ITU-T, and OIF – GMPLS, WSON, PCE, MPLS – Book author, journal publications, patents… Part time hacker – Python, JavaScript, C++, HTML5, CSS, etc… Industry experience – Former director of software development at an acquired startup whose products are deployed in core networks around the world. Radio, IP, ATM, MPLS, GMPLS, SONET/SDH, WDM… – Lots of “optical plumbing” stuff ☺ Academics – B.S., M.S., Ph.D. University of California Berkeley

Who are you? Industry experience? – How many years? – Networking experience? What technologies? Programming languages – Python, Java, C++, JavaScript, HTML5, CSS? Math – Linear algebra?, calculus, more? Statistics – Probability?, Stochastic processes?, queueing theory?

Network analysis and design Context I Where do we fit in? – Telecom Operations Map from ITU-T M (2007)

Network analysis and design Context II Where do we fit in? – Telecom Operations Map from ITU-T M (2007) We are here

Network analysis and design Context III Where do we fit in? – Telecom Operations Map from ITU-T M (2007)

Network Analysis What can we get from a given network – Throughput, QoS, reliability What if Analysis? – Changing traffic patterns? – Changing statistical properties? – Disaster Planning and Restoration Performance Analysis

Network Design Green Field – Starting from “nothing” (rare) Incremental Build out – Network enhancements for new services, changing traffic and usage patterns Overlay Design – Design or redesign of layer in a multi-layer network, including “application overlays” such as CDNs. Optimization – How can performance or throughput improvements

Network Environments and Technologies Environments: – Data Center; Including HPC, extremely large multi-building – WAN (Wide Area Network) – MAN (Metropolitan Area Network) – Enterprise (from the home to Fortune 500 companies) Technologies: – IP, MPLS – Ethernet, SDN (OpenFlow) – TDM (G.709, SONET/SDH), – WDM, WSON, ULH (ultra long haul), UHC (ultra high capacity)

Course Mechanics I Objectives: – Understand essential network design and analysis concepts and algorithms and their relative strengths and weaknesses. Prerequisite: – An Upper division (Junior/Senior level) Networking class Required Text: – M. Pioro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, – Supplementary reading materials from the computing and networking literature will be assigned.

Programming in Python Python is a very flexible language that is relatively easy to get started with and has much support in the scientific, cloud computing and engineering communities. We will be using several common additional engineering and scientific packages with Python. For ease of getting started there are scientific "Python distributions" available for no cost via the web. We will use Python version 2.7 due to its compatibility with numerical packages such as Numpy, Matplotlib, SciPy, NetworkX, SimPy, etc... – Anaconda (Windows, Mac, Linux) – Python(x,y) (Windows) – Enthought Canopy Express

Math in this Course We will be describing our networks in a form suitable for “optimization”  mathematically We will be working with a large number of variables and constraints – We’ll use an essential minimum of mathematical notation to do this in a efficient way. – We will actually generate the equations via software. – We’ll use open source software to solve these equations We will use a fair number of mathematical results and algorithms – Most will be from Open Source libraries – Some algorithms are taken from the literature and implemented by me – We will not have time to prove these results  Ask Questions on unfamiliar notation or terms!!!

Topics for this Quarter A bit of Queueing Theory – Review of Random Variables, Waiting times, Blocking probabilities Discrete Event Simulation – How do performance evaluation tools such as Comnet, Omnet++, NS2 work? What are they good and not good for… Formulation of Network Design Problems – General techniques, Technology specifics – Automation of equation generation from network description Solution of Network Design Problems – Just scratching the surface; use of open source solvers – Processing results, visualizing results Network Measurements – For demand and statistic determination Using Python to assist all the above and web tools for visualization, e.g., D3.js (