Core concerns Quality of service (QoS)Network designSelection among alternativesOngoing management (OAM&P)Network visibility (SNMP) © 2013 Pearson 1.

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

Ethernet Switch Features Important to EtherNet/IP
© 2009 Pearson Education, Inc. Publishing as Prentice Hall 4-1 Multi-Switch Ethernet LAN Operation.
IP datagrams Service paradigm, IP datagrams, routing, encapsulation, fragmentation and reassembly.
Larger Site Networks Part 1. 2 Small Site –Single-hub or Single- Switch Ethernet LANs Large Site –Multi-hub Ethernet LANs –Ethernet Switched Site Networks.
COS 338 Day 7. DAY 7 Agenda Questions? Capstone Proposal must be approved by OCT 6 Submit at any time (prior to Oct 6) using format specified in Capstone.
Jaringan Komputer Lanjut Packet Switching Network.
© 2009 Pearson Education, Inc. Publishing as Prentice Hall An Introduction to Networking Chapter 1 Raymond Panko’s Business Data Networks and Telecommunications,
Chapter 13 Network Design and Management
1 MM3 - Reliability and Fault tolerance in Networks Service Level Agreements Jens Myrup Pedersen.
Network Management Chapter 4
Chapter 4 Panko and Panko Business Data Networks and Telecommunications, 8 th Edition © 2011 Pearson Education, Inc. Publishing as Prentice Hall Panko.
Chapter 4 Panko and Panko: Business Data Networks and Security, 9 th edition Copyright Pearson 2013 Panko and Panko: Business Data Networks and Security,
Computer Networks Performance Metrics Advanced Computer Networks.
Computer Networks: Performance Measures1 Computer Network Performance Measures.
Larger Site Networks Part2. 2 Ethernet Virtual LANs Hubs versus Switches –Hubs broadcast bits out all ports –Switches usually send a frame out a one port.
Technology Focus: Network and Communications Technology.
Networks: Performance Measures1 Network Performance Measures.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
TCP/IP Reference Model Host To Network Layer Transport Layer Application Layer Internet Layer.
Performance Management (Best Practices) REF: Document ID
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.
CS332 Ch. 28 Spring 2014 Victor Norman. Access delay vs. Queuing Delay Q: What is the difference between access delay and queuing delay? A: I think the.
Network Hardware for Expanding Network. Expanding Networks When do we need expansion:  Network cable is full of data movements  Printing tasks needs.
Data Communications and Networking
More on the IP Internet Protocol. Internet Layer Process Transport layer process passes EACH TCP segment to the internet layer process for delivery Transport.
Panko, Chapter 4. Core concerns Quality of service (QoS)Network designSelection among alternativesOngoing management (OAM&P)Network visibility (SNMP)
Chapter 4 Panko and Panko Business Data Networks and Telecommunications, 8 th Edition © 2011 Pearson Education, Inc. Publishing as Prentice Hall Panko.
Chapter 2 The Infrastructure. Copyright © 2003, Addison Wesley Understand the structure & elements As a business student, it is important that you understand.
Performance Management (Best Practices) REF: Document ID
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
Frame Relay Most Popular PSDN Today –Offers speeds of 64 kbps to about 40 Mbps; This covers the range of greatest corporate demand –Most demand is at the.
S3C2 – LAN Switching Addressing LAN Problems. Congestion is Caused By Multitasking, Faster operating systems, More Web-based applications Client-Server.
ATM Switches Cells Scalable QoS Perspective Virtual Circuits.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
LAN Switching and Wireless – Chapter 1
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Network Instruments VoIP Analysis. VoIP Basics  What is VoIP?  Packetized voice traffic sent over an IP network  Competes with other traffic on the.
IP ADDRESSING, SUBNETTING & VLSM 1. Decimal vs. Binary Numbers – Decimal numbers are represented by the numbers 0 through 9. – Binary numbers are represented.
Computer Networks with Internet Technology William Stallings
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Static Routing Routing and Switching Essentials.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.
Performance Management (Best Practices) REF: Document ID
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
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.
Sem1 - Module 8 Ethernet Switching. Shared media environments Shared media environment: –Occurs when multiple hosts have access to the same medium. –For.
Network and Security Management
Advanced Computer Networks Lecturer: E EE Eng. Ahmed Hemaid Office: I 114.
Network Performance.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Performance Management (Best Practices) REF: Document ID
Network management Network management refers to the activities, methods, procedures, and tools that pertain to the operation, administration, maintenance,
CSE 413: Computer Network Circuit Switching and Packet Switching Networks Md. Kamrul Hasan
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
11 ROUTING IP Chapter 3. Chapter 3: ROUTING IP2 CHAPTER INTRODUCTION  Understand the function of a router.  Understand the structure of a routing table.
Data Communications and Networks Chapter 6 – IP, UDP and TCP ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
Chapter 4 Network Design & Management KuangChiu Huang Ph.D. Institute of Telecommunications Management National Cheng Kung University.
© 2001 Caspian Networks, Inc. CONFIDENTIAL AND PROPRIETARY INFORMATION Internet Intelligence and Traffic Growth Lawrence G. Roberts Chairman & CTO Caspian.
Chapter 28 Q and A IS 333 Spring A quiz question Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer.
The Concept of Universal Service
Instructor Materials Chapter 6: Quality of Service
Chapter 9 Optimizing Network Performance
Planning and Troubleshooting Routing and Switching
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Congestion Control, Quality of Service, & Internetworking
Requirements Definition
Chapter-5 Traffic Engineering.
Presentation transcript:

Core concerns Quality of service (QoS)Network designSelection among alternativesOngoing management (OAM&P)Network visibility (SNMP) © 2013 Pearson 1

2 Networking must go beyond the systems development life cycle to the full system life cycle over the network’s life. It also needs to understand the business system in which each network component operates. Networking must go beyond the systems development life cycle to the full system life cycle over the network’s life. It also needs to understand the business system in which each network component operates.

© 2013 Pearson 3 User demand is growing much faster than network budgets. Cost efficiency is always critical. User demand is growing much faster than network budgets. Cost efficiency is always critical.

© 2013 Pearson 4

Quality of service (QoS) Network designNetwork visibility (SNMP) © 2013 Pearson 5

 Networks today must work well.  Companies measure quality-of-service (QoS) metrics to measure network performance.  Examples: ◦ Speed ◦ Availability ◦ Error rates ◦ And so on © 2013 Pearson 6

 Normally measured in bits per second (bps) ◦ Not bytes per second ◦ Occasionally measured in bytes per second  If so, labeled as Bps ◦ Metric prefixes increase by factors of 1,000 (not 1,024 as in computer memory) © 2013 Pearson 7

PrefixMeaningExample kbps*1,000 bps33 kbps is 33,000 bps Mbps1,000 kbps3.4 Mbps is 3,400,000 bps 3.4 Mbps is 3,400 kbps Gbps1,000 Mbps62 Gbps = 62,000,000,000 bps = 62,000 Mbps Tbps1,000 Gbps5.3 Tbps = 5,300,000,000,000 © 2013 Pearson 8 *Note that the metric prefix kilo is abbreviated with a lowercase k

 Expressing speed in proper notation ◦ There must be one to three places before the decimal point, and leading zeros do not count. © 2013 Pearson 9 As WrittenPlaces before decimal point Space between number and prefix? Properly written Mbps2YesOK as is 2,300 kbps4No2.3 Mbps 0.5Mbps0No500 kbps

 Expressing speed in proper notation ◦ There must be a space before the metric suffix. ◦ 5.44 kbps is OK ◦ 5.44kbps is incorrect (no space between the number and the metric prefix) © 2013 Pearson 10

 Doing Conversions ◦ Decimal numbers have a number and a prefix  34.5 kbps ◦ Like two numbers multiplied together  c = a * b  34.5 * kbps © 2013 Pearson 11

 Doing Conversions ◦ If multiply one and divide the other by the same, get the same value  c = a * b  c = a/10 * b*10  Example  2,500 Mbps  = 2,500/1000 * Mbps*1000  = 2.5 Gbps © 2013 Pearson 12

 Doing Conversions ◦ If multiply one and divide the other by the same, get the same value  c = a * b  c = a*10 * b/10  Example .0737 Gbps  = *1000 * Gbps/1000  = 73.7 Mbps © 2013 Pearson 13

 Doing Conversions ◦ To multiply a number by 1,000 …  Move the decimal point three places to the right .2365*1000 = ◦ To divide a number by 1,000 …  Move the decimal point three places to the left  9,340/1000 = © 2013 Pearson 14

 Write the following properly: ◦ 34,020 Mbps.0054 Gbps 12.62Tbs © 2013 Pearson 15

 Rated Speed ◦ The speed a system should achieve, ◦ According to vendor claims or the standard that defines the technology.  Throughput ◦ The speed a system actually provides to users ◦ (Almost always lower) © 2013 Pearson 16

 Aggregate Throughput ◦ The aggregate throughput is the total throughput available to all users.  Individual Throughput ◦ An individual’s share of the aggregate throughput © 2013 Pearson 17

© 2013 Pearson 18 Individual throughput Aggregate throughput Rated speed

 Availability ◦ The time (percentage) a network is available for use  Example: 99.9% ◦ Downtime is the amount of time (minutes, hours, days, etc.) a network is unavailable for use.  Example: An average of 12 minutes per month © 2013 Pearson 19

 Error Rates ◦ Errors are bad because they require retransmissions. ◦ More subtly, when an error occurs, TCP assumes that there is congestion and slows its rate of transmission. ◦ Packet error rate: the percentage of packets that have errors. ◦ Bit error rate (BER): the percentage of bits that have errors. © 2013 Pearson 20

 Latency ◦ Latency is delay, measured in milliseconds. ◦ When you ping a host’s IP address, you get the latency to the host. ◦ When you use tracert, you get average latency to each router along the route. ◦ Beyond about 250 ms, turn-taking in conversations becomes almost impossible. ◦ Latency hurts interactive gaming. © 2013 Pearson 21

 Jitter ◦ Jitter is variation in latency between successive packets. (Figure 4.7) ◦ Makes voice and music speed up and slow down over milliseconds—sounds jittery. © 2013 Pearson 22

 Application Response Time (Figure 4.8) © 2013 Pearson 23

 Application Response Time (Figure 4.8) ◦ Is not purely a network matter. ◦ To control application response time, networking, server, and application people must work together to improve user experiences. © 2013 Pearson 24

 Service Level Agreements (SLA) ◦ Guarantees for performance ◦ Increasingly demanded by users ◦ Penalties if the network does not meet its QoS metric guarantees © 2013 Pearson 25

 Service Level Agreements (SLA) ◦ Guarantees are often written on a percentage of time basis.  “No worse than 100 Mbps 99.95% of the time.”  As percentage of time requirement increases, the cost to provide service increases exponentially.  So SLAs cannot be met 100% of the time. © 2013 Pearson 26

 Service Level Agreements (SLA) ◦ SLAs specify worst cases (minimum performance to be tolerated)  Penalties if worse than the specified performance  Example: latency no higher than 50 ms 99.99% of the time ◦ If specified the best case (maximum performance), you would rarely get better  Example: No higher than 100 Mbps 99% of the time. Who would want that? © 2013 Pearson 27

 Jitter ◦ No higher than 2% variation in packet arrival time 99% of the time  Latency ◦ No higher than 125 Mbps 99% of the time  Availability ◦ No lower than 99.99% ◦ Availability is a percentage of time, so its SLA does not include a percentage of time © 2013 Pearson 28

Quality of service (QoS) Network design Network visibility (SNMP) © 2013 Pearson 29

 To manage a network, it helps to be able to draw pictures of it. ◦ Network drawing programs do this. ◦ There are many network drawing programs. ◦ One is Microsoft Office Visio.  Must buy the correct version to get network and computer templates © 2013 Pearson 30

 You must be able to compute what traffic a line must carry in each direction to select an appropriate transmission line. © 2013 Pearson 31

© 2013 Pearson 32

© 2013 Pearson 33

© 2013 Pearson 34

 Topologies describe the physical arrangement of nodes and links. ◦ “Topology” is a physical layer concept.  Many standards require specific topologies.  In other cases, you can select topologies that make sense in terms of transmission costs, reliability through redundancy, and so on. © 2013 Pearson 35

© 2013 Pearson 36 How many possible paths are there between A and B? How many possible paths are there between A and B?

© 2013 Pearson 37 How many possible paths are there between A and B? How many possible paths are there between A and B?

© 2013 Pearson 38 In a hierarchy, each node has one parent. How many possible paths are there between A and B?

© 2013 Pearson 39 How many possible paths are there between A and B?

© 2013 Pearson 40 What do you think will happen if A and B transmit at the same time?

© 2013 Pearson 41 Many real networks have complex topologies incorporating the pure topologies we have just seen.

© 2013 Pearson 42

© 2013 Pearson 43

 Full-mesh and hub-and-spoke topologies are opposite ends of a spectrum.  Real network designers must balance cost and reliability when designing complex networks. © 2013 Pearson 44

 Normally, network capacity is higher than the traffic.  Sometimes, however, there will be momentary traffic peaks above the network’s capacity—usually for a fraction of a second to a few seconds. © 2013 Pearson 45

 This congestion causes latency because switches and routers must store frames and packets while waiting to send them out again.  Buffers are small, so packets are often lost. © 2013 Pearson 46

 Overprovisioning is providing far more capacity than the network normally needs.  This avoids nearly all momentary traffic peaks but is wasteful. © 2013 Pearson 47

 With priority, latency-intolerant traffic, such as voice, is given high priority and will go first if there is congestion.  Latency-tolerant traffic, such as , must wait.  More efficient than overprovisioning; also more labor-intensive. © 2013 Pearson 48

 QoS guarantees reserved capacity for some traffic, so this traffic always gets through.  Other traffic, however, must fight for the remaining capacity. © 2013 Pearson 49

 Overprovisioning, priority, and QoS reservations deal with congestion.  Traffic shaping prevents congestion by limiting incoming traffic. © 2013 Pearson 50

© 2013 Pearson 51

 Filtering out or limiting undesirable incoming traffic can also substantially reduce overall network costs. © 2013 Pearson 52

 Some traffic can be banned and simply filtered out.  Other traffic has both legitimate and illegitimate uses; it can be limited to a certain percentage of traffic. © 2013 Pearson 53

 Compression can help if traffic chronically exceeds the capacity on a line. © 2013 Pearson 54 8 Gbps is needed. The line can carry only 1 Gbps. 8 Gbps is needed. The line can carry only 1 Gbps.

 Data often contains redundancies and can be compressed. © 2013 Pearson 55

 Must have compatible compression equipment at the two ends of the line. © 2013 Pearson 56

 Often, the design of a building naturally constrains the topology of a design. © 2013 Pearson 57

 In a multistory building, for in- stance, it often makes sense to place an Ethernet workgroup switch on each floor and a core switch in the basement. © 2013 Pearson 58

Core concernsQuality of service (QoS)Network design Selection among alternatives Ongoing management (OAM&P)Network visibility (SNMP) © 2013 Pearson 59

 Comparing Alternatives ◦ Designers must select among competing approaches and even competing technologies. ◦ When learning about technologies and network designs, you need to look carefully at pros and cons. ◦ Comparing alternatives is a major theme of this book. ◦ Do not study concepts in isolation. © 2013 Pearson 60

 Minimum Requirements ◦ Specifications that set particular requirements must be met. ◦ Noncompliant products that do not meet a minimum requirement cannot be considered further. ◦ A failure to scale to meet expected traffic would be an example. © 2013 Pearson 61

 4.19: Scalability © 2013 Pearson 62 There is a maximum expected traffic volume. There is a maximum expected traffic volume.

 4.19: Scalability © 2013 Pearson 63

 Multicriteria decision making is a disciplined way to look at and evaluate all aspects of alternatives. © 2013 Pearson 64 Product AProduct B Criterion Weight (Max 5) Product Rating (Max 10) Criterion Score Product Rating (Max 10) Criterion Score Functionality Ease of management Cost* Total Score6468 *Higher cost ratings indicate lower cost.

 Cost is difficult to measure.  Systems Development Life Cycle Costs ◦ Hardware: full price—base price plus necessary optional components ◦ Software: full price—base price plus necessary optional modules ◦ Labor costs: Network staff and user costs during development ◦ Outsourced development cost ◦ Total development investment © 2013 Pearson 65

 System Life Cycle Costs ◦ Development cost plus ongoing cost, which usually is much larger than development cost ◦ Measured as the total cost of ownership (TCO)  All costs over a system’s total life ◦ SDLC cost plus carrier costs  Carrier pricing is complex and difficult to analyze  Often locked in by multi-year leases © 2013 Pearson 66

Core concernsQuality of service (QoS)Network designSelection among alternatives Ongoing management (OAM&P) Network visibility (SNMP) © 2013 Pearson 67

 Described as OAM&P  Operations ◦ Moment-by-moment traffic management ◦ Network operations center (NOC)  Administration ◦ Paying bills, administering contracts, and so on ◦ Dull but necessary © 2013 Pearson 68

 Maintenance ◦ Fixing things that go wrong ◦ Also, preventative maintenance ◦ Maintenance staff should be separate from the operations staff  Different skill set © 2013 Pearson 69

 Provisioning (providing service) ◦ Includes physical installation ◦ Includes setting up user accounts and services ◦ Reprovisioning when things change ◦ Deprovisioning when accounts and services are no longer appropriate ◦ Collectively, extremely expensive © 2013 Pearson 70

Quality of service (QoS)Network design Network visibility (SNMP) © 2013 Pearson 71

 It is desirable to have network visibility—to know the status of all devices at all times.  Ping can determine if a host or router is reachable.  The simple network management protocol (SNMP) is designed to collect extensive information needed for network visibility. © 2013 Pearson 72

 Central manager program communicates with each managed device.  Actually, the manager communicates with a network management agent on each device. © 2013 Pearson 73

 The manager sends commands and gets responses.  Agents can send traps (alarms) if there are problems. © 2013 Pearson 74

 Information from agents is stored in the SNMP management information base. © 2013 Pearson 75

 Network visualization programs analyze information from the MIB to portray the network, do troubleshooting, and answer specific questions. © 2013 Pearson 76

 SNMP interactions are standardized, but network visualization program functionality is not, in order not to constrain developers of visualization tools. © 2013 Pearson 77