1 EL736 Communications Networks II: Design and Algorithms Class1: Introduction Yong Liu 09/05/2007.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

June 27, 2007 FIND Meeting, From Packet-Switching to Contract- Switching Aparna Gupta Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Troy,
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.
All rights reserved © 2006, Alcatel Grid Standardization & ETSI (May 2006) B. Berde, Alcatel R & I.
All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 1 Transport-layer optimization for thin-client systems Yukio OGAWA Systems Development Laboratory,
Scalable Routing In Delay Tolerant Networks
ITU-T Workshop on IP/Optical Chitose, 9-11 July 2002 Session Network Performance N eal Seitz, Chair SG 13/WP 4 IP Performance Specifications: Progress.
ITU-T Workshop on Security Seoul (Korea), May 2002 Telecommunication network reliability Dr. Chidung LAC.
Chapter 1 Data Communications and NM Overview 1-1 Chapter 1
Long-Distance and Local Loop Digital Connection Technologies
Jennifer Rexford Princeton University MW 11:00am-12:20pm Logically-Centralized Control COS 597E: Software Defined Networking.
Chapter 9 Introduction to MAN and WAN
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
S Licentiate course on Telecommunications Technology (4+1+3 cr.) Course Topic Spring 2000: Routing Algorithms in the DiffServ MPLS Networks Introduction.
Scale Free Networks.
1 Adaptive Bandwidth Allocation in TDD-CDMA Systems Derek J Corbett & Prof. David Everitt The University of Sydney.
1 Introduction to Network Layer Lesson 09 NETS2150/2850 School of Information Technologies.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
CSC778 - Optical Networking Rudra Dutta, Fall 2007 General Overview: Static Traffic Network Design.
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
CS 408 Computer Networks Congestion Control (from Chapter 05)
Optical communications & networking - an Overview
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Giuseppe Bianchi Basic switching concepts circuit switching message switching packet switching.
Traffic Engineering With Traditional IP Routing Protocols
Wide Area Networks School of Business Eastern Illinois University © Abdou Illia, Spring 2007 (Week 11, Thursday 3/22/2007)
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 14.
A simulation-based comparative evaluation of transport protocols for SIP Authors: M.Lulling*, J.Vaughan Department of Computer science, University college.
The Design Philosophy of the DARPA Internet Protocols D. D. Clark.
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
Introduction 1-1 Lecture 3 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CS3516: These slides.
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.
Active Measurement tool for the EuQoS project René Serral-Gracià (Universitat Politècnica de Catalunya)
Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
Slides originally from Professor Williamson at U Calgary1-1 Introduction Part II  Network Core  Delay & Loss in Packet-switched Networks  Structure.
Switched network.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
Lecture 17. ATM VPs, circuit-switching D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
ECEN4533 Data Communications Lecture #2125 February 2013 Dr. George Scheets n Read 11.4 n Problems: Chapter 11.2, 4, & 5 n Quiz #2, 25 March (Live) < 1.
Outlines Received due 13 March %. Homework n Review for Midterm (1 March 2000) n Research Paper n Readings [9] “MPLS: Special Delivery” [10] “Diversifying.
RSC Part I: Introduction Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are, mainly, part of the companion slides to.
Computer Networks with Internet Technology William Stallings
EE6610: Week 6 Lectures.
What is Bandwidth on Demand ? Bandwidth on Demand (BoD) is based on a technology that employs a new way of managing and controlling SONET-based equipment.
Data and Computer Communications Chapter 11 – Asynchronous Transfer Mode.
Outlines Received due 13 March 30 %. NO CLASS Week of March (Spring Break)
1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
3-location Data Network Design 3 locations separated by 200 km among pairs. Give the new populations below 296 users, design the data network.
WAN – Packet and Cell-switched Networks
1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Network Layer4-1 Chapter 4 Network Layer All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
Network Layer Goals: Overview:
Network Core and QoS.
Optical communications & networking - an Overview
Chapter-5 Traffic Engineering.
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Network Core and QoS.
Presentation transcript:

1 EL736 Communications Networks II: Design and Algorithms Class1: Introduction Yong Liu 09/05/2007

2 From Telephone Networks to Data Networks voice calls vs. datagrams circuit switching vs. packet switching multiplexing/de-multiplexing at edge, shared network core

3 Network Service Providers multiple autonomous systems (ASes) managed by different network providers peering at gateway routers dealing with network design within one admin. domain

4 Traffic Networks vs. Transport Networks Traffic Networks: provide application services to end users the Internet telephone networks private networks Transport Networks: provide physical facility to transport traffic for customer networks setting up leased circuits/trunks (semi- )permanently SONET, WDM, cross connects

5 Network Resource & Cost link capacity (bps, pps) router/switch memory (bytes) processing power (CPU, Hz) network cost: provisioning cost ($, hours) operational cost ($, hours)

6 Network Demand traffic characteristics how much? point to point traffic volume stationary+stochastic + where? traffic demand matrix different natures for different networks the Internet: packets telephone network: calls transport network: circuits demand of traffic networks generated by end users demand of transport network generated by its customer traffic networks

7 Traffic Demand in Internet bits,bytes,packets/second very random controlled by end-users and protocol behaviors highly variable, bursty, long-range-dependent, self- similar, … predictable? reasonable models? characteristics on a single link packet arrival process: approximately Poisson :) packet size distribution: non-exponential :(

8 Packet Delay on a Single Link M/M/1 Approximation: packet delay on a T1(1.5Mbps) link benefit of multiplexing ten 1.5Mbps links vs. one 15Mbps link

9 Traffic in Telephone Network circuit switching calls blocked if no available circuit call arrivals approximately Poisson :) call duration approximately exponential :) offered load unit -- Erlang: call blocking probability Erlang-B loss formula 24 Erls to link with capacity 24 --> 14.6% loss 240 Erls to link with capacity > 4.9% loss

10 Demand in Transport Network demand to transport network is less dynamic well specified start-end time measured in modular data rates Signal NameBit Rate (Mbps) DS0 (voice)0.064 T11.54 T345 OC OC-482, OC-1929,953.28

11 A Simple Design Example set up links to carry demand under link utilization constraint of 60%. A BC 300Kbps demand matrix A BC 300Kbps three T1 links utili.=19.5% A BC 300Kbps two T1 links utili.=39%

12 Logical vs. Physical Network View traffic networks runs on top of transport network two independent logical links might go through same physical link implications on failure recovery, restoration, network reliability multiple-layer network design

13 Network Management Timescale Call Routing, Call Setup, Call Admission Control, Call Rerouting, Routing Information Update TCP Feedback control Packet Discarding Buffer Management Packet Routing Periodic Traffic Estimation Traffic Engineering, OSPF weight updates, Trunk Rearrangement Traffic Network Capacity Expansion Time ScaleMicro-secs Mili-secsSecondsMinutesHoursDays WeeksMonths Traffic Net. Trans. Net. SONET/SDH ring restoration Transport Network Routing/Loading Mesh Transport Network Restoration Transport Network Capacity Planning/Expansion

14 Network Management Cycle Real-Time Traffic Management Network Planning Capacity Management, Traffic Engineering secs-mins days-weeks months-years various controls routing update capacity change traffic data Forecast adjustment, Marketing input Network Management Traffic Network (IP, circuit-switched) Near Real-Time Management Network Planning Capacity Management, Network Engineering mins-hours days-weeks months-years restoration Route loading capacity expansion/ protection Network fill factor, loading New Transport Demand, Marketing input Network Management Transport Network

15 Course Scope Network View different routing, flow and link capacity representations uncertainties: link/node failures, traffic variations multi-layer interaction: traffic/transport, logical/physical large scale problems Approaches/algorithms/theory view model selection solution with optimization tools approximate/heuristic algorithms for large problems fundamental principles Small timescale management not covered here stochastic queueing analysis and simulation topics for EL735

16 List of Topics Network Design Problem Modeling Optimization Methods Multi-Commodity Flow Routing Location and Topological Design Fair Network Resilient Network Design Robust Network Design Multi-Layer Networks