Introduction to Computer Networking
Download as PPTX, PDF3 likes2,989 views
The document provides an introduction to computer networking, covering fundamental concepts such as networking definitions, history, and components like wired and wireless connections. It discusses protocols like DHCP, ARP, DNS, and routing methodologies such as BGP, along with the differences between TCP and UDP transmission protocols. Additionally, it highlights the importance of manageability and industry expectations for modern data centers and the future of computer networks.
Introduction to Computer Networking
- 1. INTRODUCTION TO COMPUTER NETWORKING Amit Saha IIT Gandhinagar 13th, 14th March 2015
- 2. Ground Rules β’ There are no βsillyβ questions. Focus on βwhyβ β’ Slides with have fundamental concepts β’ Search on the web for anything you donβt understand β’ Almost everything is explained reasonably well on the web β’ You can send questions to amsaha+iitgn15s@gmail.com
- 3. Books β not mandatory β’ Data and Computer Communications - William Stallings β’ Internetworking with TCP/IP Volume 1 Principles, Protocols, and Architecture - Douglas E. Comer
- 4. What is Networking? β’ networking β the exchange of information or services among individuals, groups, or institutions β’ computer networking β the exchange of information or services among computers
- 5. A Brief History β’ http://visual.ly/brief-history-computer-network-technology
- 6. Schematic of a Computer Network
- 7. The first hop β wired
- 8. The first hop β wireless
- 9. Wireless First Hop - Possibilities β’ WLAN/WiFi β’ Cellular
- 10. Layering β Lets Break up the Problem TheoreticalPractical
- 11. Wireless First Hop β WiFi β’ IEEE 802.11 (a/b/g/n/β¦) standards β’ Infrastructure mode (common) or Ad hoc mode Ethernet Token Ring New 802.11n
- 12. Connecting to a WiFi Access Point β’ Scanning β’ Joining β’ Authentication β’ Association β’ The station feels as if it is βpluggedβ into a wired network
- 13. Communicating with a WiFi AP β’ Wireless is a half duplex channel β either speak or listen β’ Signal strength is inversely proportion to square of distance β’ Carrier Sense Multiple Access / Collision Avoidance (CSMA/CA) β’ Fancy name for how humans talk ο β’ This is generally true of all wireless systems (including humans)
- 14. WiFi Equipments
- 15. Wireless First Hop β Cellular β’ Not covered in this course
- 16. Wired First Hop - Ethernet β’ IEEE 802.3 standard β’ If two ends of the Ethernet cable (e.g., RJ45) is electrically up, connection is up. β’ Some authentication steps are usually there but we will skip those
- 17. CSMA/CD β’ Carrier Sense Multiple Access / Collision Detect
- 19. Now what?
- 20. Getting an IP address β’ DHCP β DHCP clients get IP addresses and networking parameters from DHCP server β’ Based on BOOTP β’ DHCPv6 (for IPv6) is also available
- 21. DHCP Packets β’ Discovery β’ Offer (possibly multiple) β’ Request β’ Acknowledge β’ Renew β’ Release Why do we need an IP address?
- 22. IP Packet Format
- 25. 5-Tuple/Flow
- 26. Got an IP! Hurray! β’ But now what? How do I βgo toβ some website? β’ IP is just an identity β’ Still need to βrouteβ to somewhere
- 27. DNS β Domain Name Service β’ We almost always try to reach a human readable name β’ But machines route based on IP addresses β’ There must be a mapping from names to IP addresses β’ But who is going to do this translation?
- 28. Default Gateway β’ If host does not know how to route, who does it ask? β’ There must be a βgotoβ guy in the network
- 29. Routing table β Host ubuntu@ubuntu-VirtualBox:~/Projects/OpenStack/New/cinder$ route Kernel IP routing table Destination Gateway Genmask Flags Metric Ref Use Iface default 10.0.2.2 0.0.0.0 UG 0 0 0 eth0 10.0.2.0 * 255.255.255.0 U 1 0 0 eth0 β’ Routing table becomes very interesting in a core router β’ 50,000 to 1,00,000 routes (entries like the above table) β’ We will get to it later
- 30. Who could β¦ β’ Be a hostβs Domain Name Server β’ Be a hostβs Default Gateway
- 31. Are we ready to send?
- 32. ARP β Address Resolution Protocol β’ What is the MAC address for a given IP? β’ ARP resolves network layer address to link layer address β’ Remember network layer is the same as routing layer. This is also known as Layer 3(L3) β’ Link Layer is Layer 2 (L2)
- 33. Ethernet β IEEE 802.3b β’ Broadcast medium β’ These days mostly switched Ethernet (point-to-point) β’ These days mostly Ethernet II β’ No LLC
- 34. Finally! β’ We can now send
- 35. Ethernet Header
- 36. An Example β’ Wireshark β Download it, install it and then play around with it β’ Instructions are there on the web itself β’ Will give you a lot of detail about packets and layering
- 37. DNS β Domain Name Service β’ Hierarchical way of managing name space β’ Managed by Internet Assigned Numbers Authority (IANA) β’ http://www.iana.org/domains/root/db
- 39. DNS β Root Servers β’ <a-m>.root-servers.net β 13 hostnames, around 500 instances β’ Use anycast to reach βnearestβ instance β BGP supports this β’ 12 of the 13 root servers A-M exist in multiple locations β’ 11 on multiple continents β’ Root server βhβ exists in two U.S. locations. β’ Root server βbβ exists in a single location in the Los Angeles Area β’ http://www.root-servers.org/
- 40. Subnetting β’ Routing to each individual hosts does not scale β’ Addresses grouped into different classes
- 41. CIDR β’ Any βclass systemβ is bad ο β’ IPv4 was running out of unique IP addresses β’ Hence IPv6 butβ¦ β’ Classless Inter Domain Routing β’ Network portion can be of any size β’ Addresses need to specify subnet mask as well
- 43. NAT β Network Address Translation
- 44. NAT β Send
- 45. NAT β Receive
- 46. Routing Hierarchy β’ Internet is divided into Autonomous Systems (AS) β’ Managed by a single administrator β’ 16 bit AS Number (ASN)
- 48. Intra-Domain Routing β’ Typically uses UDP β’ Distance Vector β’ RIP β Bellman β Ford Algorithm β’ Link State β’ OSPF β Dijkstraβs shortest path β’ ISIS β Dijkstraβs shortest path β’ Note: The fundamental concept here is Distance Vector and Link State as two types of algorithms, not that they are used for intra-domain routing
- 49. Inter-Domain Routing β’ Border Gateway Protocol (BGP) β BGP version 4 β’ Path β vector routing β’ Uses TCP β’ External BGP β eBGP β’ Internal BGP β iBGP β’ Not to be confused with intra-domain routing (though iBGP could do that ο) β’ Used to send information from one βsideβ of network to another β’ Policy engineering
- 50. Inter β Domain Routing
- 51. iBGP and eBGP
- 54. Transport Layer β’ Provides end-to-end connection β’ On top of the routing layer β’ Two types of transmissions β’ Unreliable β User Datagram Protocol (UDP) β’ Reliable β Transmission Control Protocol (TCP)
- 55. UDP β’ Best effort, connection-less β’ Just send as fast as possible β’ When is it okay? β’ Phone calls, gaming, etc. β’ Simple stuff like DNS
- 56. TCP β’ Connection oriented β’ Setup/teardown connection β’ Sends stream of bytes, not messages β’ Reliable and in-order delivery β’ Flow Control β’ Congestion Control β’ Analogous to how humans communicate
- 57. Basics of Reliable Connection β’ How do you make a transmission reliable? β’ What do you need to protect against?
- 58. Basics of Reliable Connection Data Ack Sender Receiver time
- 59. Speed it Up
- 60. TCP β Connection Setup β’ Three-Way Handshake
- 61. TCP Sliding Window β’ http://www2.rad.com/networks/2004/sliding_window/
- 62. TCP β Being a Good Citizen β’ Congestion Control β’ MaxWindow = min(Congestion Window, Receiver Window) β’ Congestion Window start at 1 β’ Original TCP: Additive Increase, Multiplicative Decrease
- 63. Congestion Avoidance Behavior Time Congestion Window Packet loss + Timeout Grabbing back Bandwidth Cut Congestion Window and Rate
- 64. Evolution of TCP 1975 1980 1985 1990 1982 TCP & IP RFC 793 & 791 1974 TCP described by Vint Cerf and Bob Kahn In IEEE Trans Comm 1983 BSD Unix 4.2 supports TCP/IP 1984 Nagelβs algorithm to reduce overhead of small packets; predicts congestion collapse 1987 Karnβs algorithm to better estimate round-trip time 1986 Congestion collapse observed 1988 Van Jacobsonβs algorithms congestion avoidance and congestion control (most implemented in 4.3BSD Tahoe) 1990 4.3BSD Reno fast retransmit delayed ACKβs 1975 Three-way handshake Raymond Tomlinson In SIGCOMM 75 Taken from Aditya Akellaβs slides, Dept. of Computer Science, University of Wisconsin - Madison
- 65. TCP Through the 1990s 1993 1994 1996 1994 ECN (Floyd) Explicit Congestion Notification 1993 TCP Vegas (Brakmo et al) real congestion avoidance 1994 T/TCP (Braden) Transaction TCP 1996 SACK TCP (Floyd et al) Selective Acknowledgement 1996 Hoe Improving TCP startup 1996 FACK TCP (Mathis et al) extension to SACK Taken from Aditya Akellaβs slides, Dept. of Computer Science, University of Wisconsin - Madison
- 66. TCP Header
- 67. Ethernet β’ Original Ethernet used hub β shared ethernet β’ These days β switched ethernet
- 68. Switched Ethernet β’ CSMA / CD β’ What is collision now? How is it handled?
- 69. Switching Types β’ Store and forward β’ Cut through
- 70. Switched Ethernet β Arbitrary Topology β’ Can cause loops β’ Unlike IP header, no TTL to prevent looping
- 71. STP β Spanning Tree Protocol β’ Creates a βtreeβ that βspansβ entire graph β’ Distributed implementation
- 72. STP β Root Bridge
- 73. STP β Root Ports
- 74. STP β Designated Ports
- 75. STP β Blocked Ports
- 76. STP β Link Failure
- 77. Virtual LAN
- 78. VLAN
- 79. IEEE 802.1q
- 80. IEEE 802.1q
- 81. STP Variants β’ Rapid STP β Converges faster than STP β’ VLAN STP β Each VLAN can have a different STP tree
- 82. Data Centers β’ Cloud computing β Making computing elastic β’ Software Defined Networking (SDN) β’ Universities are using data centers for compute resources β’ Pay-as-you-go pricing model β’ Power and Cooling most important ο
- 83. Data Centers β Network Properties β’ Large number of ports β’ Large number of L2 end points β’ Multiple VMs per port β’ Relatively fewer L3 end points β’ Prime importance - manageability
- 86. Example Equipment β Pictures/Prices β’ Go to websites such as www.cisco.com and www.juniper.net and look at their product portfolio β’ www.cisco.com has interactive 3D models β’ Search for prices on the web
- 88. Industry Expectations β’ Average loss $5600/minute ο¨ $300K/hour β’ Zero planned downtime is fast becoming the norm β’ Can you think of anything similar?
- 89. The Future of Computer Networks β’ Manageability β’ Monitoring β’ Trouble shooting β’ Automated Healing β’ More bandwidth β’ Energy efficiency β’ Faster way of implementing something β algorithms/algorithmics β’ OpenSource based β cheaper and βbetterβ β’ Broadband access will become a fundamental right