1. Chapter 4 Panko and Panko: Business Data Networks and Security, 9 th edition Copyright Pearson 2013 Panko and Panko: Business Data Networks and Security, 9 th edition Copyright Pearson 2013 Revised August 2013

2.  Chapter 4 is the final introductory chapter.  It deals with network management, with a strong focus on network design.  Subsequent chapters will apply the concepts in these four introductory chapters to specific situations, including wired switched and wireless LANs and WANs, internets, and applications. © 2013 Pearson 2

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

4. 4 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.

5. © 2013 Pearson 5 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.

6. © 2013 Pearson 6

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

8.  Networks today must work well or the cost to the firm will be high  Companies measure quality-of-service (QoS) metrics to measure network performance. ◦ Speed ◦ Availability ◦ Error rates ◦ … © 2013 Pearson 8

9.  Speed is the most basic QoS metric  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 9

10.  Officially, International System of Units (SI)  Basic expression: ◦ Number BaseUnit ◦ 43.6 m  Metric Prefixes for base units: ◦ Number MetricPrefix BaseUnit ◦ 43.6 km = 43,600 m ◦ k means kilo (1,000) © 2013 Pearson 10

11. 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 bps © 2013 Pearson 11 *Note that the metric prefix kilo is abbreviated with a lowercase k

12.  Expressing speed in proper notation ◦ Rule 1: 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) ◦ Which is correct?  67Gbps  32 Mbps © 2013 Pearson 12

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

14.  Doing Conversions ◦ Quantities have a number, prefix, and base unit  34.5 kbps ◦ Like numbers multiplied together  c = a * b * c  34.5 * k * bps © 2013 Pearson 14

15.  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  To divide a number by 1,000, move the decimal point three places to the left © 2013 Pearson 15 2,500.

16.  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  = 0.0737*1000 * Gbps/1000 = 73.7 Mbps  To multiply a number by 1,000, move the decimal point three places to the right © 2013 Pearson 16.0737

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

18.  Rated Speed ◦ The speed a system should provide ◦ 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 18

19.  Aggregate Throughput ◦ The aggregate throughput is the total throughput available to all users.  Individual Throughput ◦ An individual’s share of the aggregate throughput ◦ If a line’s aggregate throughput is 100 Mbps ◦ And there are 50 users sharing it ◦ And five are transmitting at a certain moment ◦ Individual throughput will be about 20 Mbps © 2013 Pearson 19

20. © 2013 Pearson 20 Individual throughput Aggregate throughput Rated speed

21.  Example ◦ An access point’s rated speed is 200 Mbps ◦ Its aggregate throughput is 100 Mbps ◦ There are 50 users sharing it ◦ 5 are transmitting at a certain moment ◦ Individual throughput will be … © 2013 Pearson 21

22.  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 22

23.  Error Rates ◦ Errors 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 23

24.  Latency ◦ Latency is delay, measured in milliseconds (ms). ◦ Pinging a host’s IP address gives 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 24

25.  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 25

26.  Application Response Time (Figure 4.8) © 2013 Pearson 26

27.  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 27

28.  Service Level Agreements (SLAs) ◦ Guarantees for one or more QoS metrics ◦ Increasingly demanded by users ◦ Penalties if the network does not meet its QoS metric guarantees © 2013 Pearson 28

29.  Service Level Agreements (SLAs) ◦ 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 numbers cannot be met 100% of the time economically. © 2013 Pearson 29

30.  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 30

31.  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 31

32. Core concernsQuality of service (QoS) Network design Selection among alternativesOngoing management (OAM&P)Network visibility (SNMP) © 2013 Pearson 32

33.  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 33

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

35. © 2013 Pearson 35 Line QR Line RS

36. © 2013 Pearson 36 Line QR Line RS

37. © 2013 Pearson 37 Line QR Line RS

38. © 2013 Pearson 38 Another Example

39. © 2013 Pearson 39

40.  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 40

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

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

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

44. © 2013 Pearson 44 How many possible paths are there between A and B? 1 4 3 2

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

46. © 2013 Pearson 46 Many real networks have complex topologies incorporating more than one of the basic topologies we have just seen.

47. © 2013 Pearson 47

48. © 2013 Pearson 48

49.  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 49

50.  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 50

51.  Congestion causes latency because switches and routers must store frames and packets while waiting to send them out again.  Buffers are limited, so some packets may be lost. © 2013 Pearson 51

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

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

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

55.  Overprovisioning, priority, and QoS reservations limits some of the damage of congestion but do not prevent it.  Traffic shaping prevents congestion by limiting incoming traffic. © 2013 Pearson 55

56. © 2013 Pearson 56

57.  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 57

58.  Filtering out or limiting undesirable incoming traffic may substantially reduce overall network costs.  “Gee, all those cat videos were consuming a lot of capacity!” © 2013 Pearson 58

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

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

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

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

63.  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 63

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

65.  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 65

66.  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 66

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

68.  4.19: Scalability © 2013 Pearson 68

69.  Multicriteria decision making is a disciplined way to look at and evaluate all aspects of alternatives. © 2013 Pearson 69 Product AProduct B Criterion Weight (Max 5) Product Rating (Max 10) Criterion Score Product Rating (Max 10) Criterion Score Functionality5840420 Ease of management 28168 Cost*428832 Total Score6468 *Higher cost ratings indicate lower cost. Each criterion is given an importance weight. Larger is always better.

70.  Multicriteria decision making is a disciplined way to look at and evaluate all aspects of alternatives. © 2013 Pearson 70 Product AProduct B Criterion Weight (Max 5) Product Rating (Max 10) Criterion Score Product Rating (Max 10) Criterion Score Functionality5840420 Ease of management 28168 Cost*428832 Total Score6468 Each product is rated on each criterion.

71.  Multicriteria decision making is a disciplined way to look at and evaluate all aspects of alternatives. © 2013 Pearson 71 Product AProduct B Criterion Weight (Max 5) Product Rating (Max 10) Criterion Score Product Rating (Max 10) Criterion Score Functionality5840420 Ease of management 28168 Cost*428832 Total Score6468 *Higher cost ratings indicate lower cost. Product’s score on a criterion is the criterion weight times the product weighting on that criterion

72.  Multicriteria decision making is a disciplined way to look at and evaluate all aspects of alternatives. © 2013 Pearson 72 Product AProduct B Criterion Weight (Max 5) Product Rating (Max 10) Criterion Score Product Rating (Max 10) Criterion Score Functionality5840420 Ease of management 28168 Cost*428832 Total Score6468 Adding criterion scores gives the product’s rating Which product should you choose? Adding criterion scores gives the product’s rating Which product should you choose?

73.  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 73

74.  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 ◦ TCO includes carrier costs  Carrier pricing is complex and difficult to analyze  Often locked in by multi-year leases © 2013 Pearson 74

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

76.  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 76

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

78.  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 78

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

80.  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 80

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

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

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

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

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

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

87.  We have finished the four introductory chapters. ◦ How we got here ◦ Network standards ◦ Network security ◦ Network design and management  We will apply the concepts you learned in these chapters throughout the book. © 2013 Pearson 87

88.  The remaining chapters go “up through the layers” ◦ Chapter 5: Wired Ethernet LANs (L1 and L2) ◦ Chapters 6&7: Wireless LANs (L1 and L2) ◦ Chapters 8&9: TCP/IP Internetworking (L3 and L4) ◦ Chapter 10: Wide Area Networks (L1 to L4) ◦ Chapter 11: Networked Applications (L5) ◦ You will apply introductory concepts to the materials in each chapter. © 2013 Pearson 88

89. © 2013 Pearson 89