Chapter-5 Traffic Engineering.

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg
Chapter 13 Network Design and Management
Module 3.4: Switching Circuit Switching Packet Switching K. Salah.
Wide Area Networks School of Business Eastern Illinois University © Abdou Illia, Spring 2007 (Week 11, Thursday 3/22/2007)
William Stallings Data and Computer Communications 7th Edition
CSCI 4550/8556 Computer Networks Comer, Chapter 15: Networking Ownership, Service Paradigm.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Ch. 28 Q and A IS 333 Spring Q1 Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer data across.
Top-Down Network Design Chapter Two Analyzing Technical Goals and Tradeoffs Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Network Management 1 School of Business Eastern Illinois University © Abdou Illia, Spring 2006 (Week 15, Friday 4/21/2006) (Week 16, Monday 4/24/2006)
Switching Techniques Student: Blidaru Catalina Elena.
Data Communications and Networking
These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (
EITnotes.com For more notes and topics visit:
1 Performance Evaluation of Computer Systems and Networks Introduction, Outlines, Class Policy Instructor: A. Ghasemi Many thanks to Dr. Behzad Akbari.
 Protocols used by network systems are not effective to distributed system  Special requirements are needed here.  They are in cases of: Transparency.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Data and Computer Communications Circuit Switching and Packet Switching.
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 2: Overview of Computer Network.
25-Oct-15Network Layer Connecting Devices Networks do not normally operate in isolation.They are connected to one another using connecting devices. The.
Cisco 3 - Switching Perrine. J Page 16/4/2016 Chapter 4 Switches The performance of shared-medium Ethernet is affected by several factors: data frame broadcast.
Business Data Communications, Fourth Edition Chapter 11: Network Management.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Computer Simulation of Networks ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
Cisco 3 - Switch Perrine. J Page 17/3/2016 Chapter 3 Which of the following are found in the EIGRP neighbor table? (Choose two.) 1.routes installed by.
Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.
Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 10 – Circuit Switching and Packet Switching.
Data and Computer Communications Ninth Edition by William Stallings Chapter 10 – Circuit Switching and Packet Switching Data and Computer Communications,
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Muhammad Waseem Iqbal Lecture # 20 Data Communication.
M ODULE 1 UNIT 3 ROUTING. R OUTING Routing protocols are the set of rules used by the routers to communicate between source and destination. They do not.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
William Stallings Data and Computer Communications
Chapter 2 PHYSICAL LAYER.
What is a Protocol A set of definitions and rules defining the method by which data is transferred between two or more entities or systems. The key elements.
COMPUTER NETWORKS CS610 Lecture-21 Hammad Khalid Khan.
Chapter 9 Optimizing Network Performance
Packet Switching Networks & Frame Relay
COMPUTER NETWORKS CS610 Lecture-21 Hammad Khalid Khan.
Topics discussed in this section:
CS408/533 Computer Networks Text: William Stallings Data and Computer Communications, 6th edition Chapter 1 - Introduction.
Fundamentals of Cellular Networks (Part IV)
Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Click to edit Master subtitle style
Configuring Virtual Circuits
Chapter 11 Network Management.
Chapter 6: Network Layer
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
18-WAN Technologies and Dynamic routing
Chapter 16: Distributed System Structures
Transport Layer Unit 5.
Computer Simulation of Networks
Chapter 3: Open Systems Interconnection (OSI) Model
ECE 4450:427/527 - Computer Networks Spring 2017
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Data and Computer Communications
Data Communication Networks
PRESENTATION COMPUTER NETWORKS
Switching Techniques.
Congestion Control (from Chapter 05)
IP Control Gateway (IPCG)
Optical communications & networking - an Overview
Requirements Definition
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Switching.
Presentation transcript:

Chapter-5 Traffic Engineering

Topics Background (Throughput calculations). Packets, frames and cells per second. Traffic Engineering Basics: Traffic characteristics and source models. Statistical Behavior of User Traffic Poisson Arrivals and Markov Processes: Statistical Behavior of User Traffic, Voice traffic Modeling Queued data and packet switched traffic modeling Causes of Delay ,Availability , Reliability and Maintainability Network Design Tools Physical and Statistical Design

Background (Throughput calculations) Before going to the topic of traffic engineering, let us know about throughput. Throughput is the actual amount of user data that is transmitted over the access circuit [Internet] and received by the network node [user]. Every user access circuit is regulated by throughput. Throughput can also be measured end to end across the entire network. The common units of measurement for throughput are bits, bytes, packets, frames and cells per second.

Packets, frames and cells per second The term packets, frames and cells per second are used throughput the calculation , but to simplify the discussion. The maximum achievable packet per second (PPS) rate on physical circuit can be calculated as follows:

Traffic Engineering Basics: Traffic characteristics and source models Source Model Traffic Parameter Characteristics There are two basic philosophies for characterizing source traffic parameters : Deterministic and probabilistic . Deterministic parameters are based upon a specific traffic contract, with conformance verifiable on a unit by unit basis. The probabilistic (also called stochastic) model is typically measurable only over a very long-term average. Since the method and interval for computing the average can differ, conformance testing defines the details of the measurement method. Specification of the statistical model is also required.

Traffic Engineering Basics: Traffic characteristics and source models General Source Model Parameters: Burstiness is a commonly used measure of how infrequently a source send traffic . Source that infrequently sends traffic is said to be very bursty. The formula for Burstiness –

Traffic Engineering Basics: Traffic characteristics and source models Poisson Arrivals and Markov Processes: Random arrival processes are described in general and the Poisson (Or Markov) process in particular with reference the following figure.

Traffic Engineering Basics: Traffic characteristics and source models Poisson Arrivals and Markov Processes….. If t : interval of time and : arrival rate per second This is called a memory less process, because the probability that the interval of time will be x second is independent of memory of how much time has already expired .

Statistical Behavior of User Traffic Traffic pattern can be calculated in many ways. User information arrives at the network node based on the statistical arrival rates. Typically , not all users need to communicate with all other user at the exact same time, therefore statistical approximation can be used to model these traffic patterns.

Voice traffic Modeling (Erlang Analysis) The standard for statistically calculating an estimate for user demand based on random call arrival and holding was modeled by A.K. Erlang. The unit of measure called the erlang is calculated as: Where = the call arrival rate in calls/hour and = average holding time in hours

Voice Traffic Modeling Voice Network

Queued data and packet switched traffic modeling While Erlangs work well predicting voice network and circuit-switched traffic rates, they do not work well with packet-switched networks. In packet-switched networks, some level of queuing is employed so that packets are queued in buffers and transmitted when congestion ceases, rather than being immediately blocked. Packet-switched networks provide a mix of protocol and traffic types, whereas voice and circuit-switched networks provide point-to-point, transparent homogeneous transport of information. Therefore, packet switching demands a different analysis of traffic handling

Designing for Peak When calculating the arrival rate of calls , a figure was called busy hour. Any network must be designed to handle the busiest traffic periods, or data will be blocked or lost

Causes of Delay Causes of delay in network: Propagation path delay Line speed Number of hops between routing or switching nodes Hardware and Software interface buffers Load on every component across the path Windows size Memory and buffers Pad functions Address or route database Security Changes in traffic load Filtering , forwarding and processing packets frames and cells

Availability and Reliability Two quality measures of hardware and software must be known by the network designer that is availability and reliability. These two measures are depend on MTBF (Mean Time Between Failure) and MTTR (Mean Time To Repair) this is given by the vendor.

Availability Availability: Availability is the amount of time the system is working when compared to the measured lifetime of the system. Availability is calculated by:

Reliability  

Maintainability Maintainability: Maintainability is defined as the measure of effort a user or network provider must put into the network to maintain its operating efficiency. Maintainability includes. Defining how the designer will expand as requirements increase Expandability and flexibility of the hardware platform Ease of software upgrades Build in tools for network monitoring, management, troubleshooting and reporting.

Designing Tools Cost model: calculate the cost of the transport , hardware, and software portions of the network. What if analysis: Recommend design changes based on failure or network configuration changes Failure analysis: Describes the completely the effects on demand traffic of failure of some portion of the transport network or devices within the network

Designing Tools… Visualize: Show the Network Elements and connection on the screen and on paper. Simulate: Models the operation of the network devices with respect physical, data link, network layers. Characterize: calculate key performance (KPIs) that describes design, efficiency utilization and so on

Designing Tools… Optimize: changes the network design to achieve the higher utilization or performance and models cost trade-offs. Design: produces transform demand and demand from profiles Report: produce utilization, link , equipment , site reports.

Model for Physical Design

Model for Statistical Design