1 / 59

Introduction to Data Communications IDC ECI-M-917

2. Some Issues. Plagiarism- not acceptable to hear ?I didn't know" There are severe penalties if caught. If you are not sure ASK ME!Caxton House (English help, dyslexia testing etc, money worries). Most Importantly all help and advice is FREEIf you have any academic problems with this course COME AND SEE ME, SOONER RATHER THAN LATER.LASTLY- MOBILE PHONES OFF!.

chaz
Download Presentation

Introduction to Data Communications IDC ECI-M-917

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. 1 Introduction to Data Communications (IDC) ECI-M-917

    2. 2 Some Issues Plagiarism- not acceptable to hear “I didn’t know” There are severe penalties if caught. If you are not sure ASK ME! Caxton House (English help, dyslexia testing etc, money worries). Most Importantly all help and advice is FREE If you have any academic problems with this course COME AND SEE ME, SOONER RATHER THAN LATER. LASTLY- MOBILE PHONES OFF!

    3. 3 Lectures 6 weeks will cover three layers of interest Network, Transport and Application Layers Lectures 1-2 Network layer Lectures 3-4 Transport Layer And Lectures 5-6 Application Layer

    4. 4 Outline

    5. 5 A Sample Network

    6. 6 Where is the network layer? There are 7 layers from OSI model and 5 layers from TCP/IP model (discuss later!) From OSI, the Network layer rests between the upper layer called the transport layer and the lower layer called the Data Link Layer. From the TCP/IP model, the Network layer is called the Internet layer and it rests between the upper Transport layer and the lower Host to Network layer.

    7. 7

    8. 8

    9. 9

    10. 10

    11. 11

    12. 12

    13. 13

    14. 14

    15. 15

    16. 16

    17. 17

    18. 18

    19. 19

    20. 20

    21. 21

    22. 22 Comparison of Virtual-Circuit and Datagram Approaches

    23. 23 The Optimality Principle (a) A subnet. (b) A sink tree for router B.

    24. 24

    25. 25 Shortest Path Routing The first 5 steps used in computing the shortest path from A to D. The arrows indicate the working node.

    26. 26 Distance Vector Routing (a) A subnet. (b) Input from A, I, H, K, and the new routing table for J.

    27. 27 Distance Vector Routing (2)

    28. 28 Link State Routing Idea Behind LSR: Each router must do the following: Discover its neighbors, learn their network address. Measure the delay or cost to each of its neighbors. Construct a packet telling all it has just learned. Send this packet to all other routers (flooding). Compute the shortest path to every other router. In effect the complete topology and all the delays are experimentally measured and distributed to every router, then Dijkstra’s algorithm can be run to find the shortest path to every other router.

    29. 29 Building Link State Packets (a) A subnet. (b) The link state packets for this subnet.

    30. 30 Distributing the Link State Packets The packet buffer for router B in the previous slide (Fig. 5-13).

    31. 31 Hierarchical Routing Hierarchical routing.

    32. 32 Internet Protocol (IP)

    33. 33 IP Packet Header

    34. 34 IP Addresses

    35. 35 Why network IDs?

    36. 36 Another routing example in IP

    37. 37 Routing table with network and host addresses

    38. 38 Sample Internet

    39. 39 Subnetting in Classful Addresses

    40. 40 Subnetting in Classful Addresses

    41. 41 Subnetting in Classful Addresses

    42. 42 Subnetting in Classful Addresses

    43. 43 Classless InterDomain Routing (CIDR) Addressing in Internet Protocol

    44. 44 Classless InterDomain Routing (CIDR) Addressing in Internet Protocol

    45. 45 Classless InterDomain Routing (CIDR) Addressing in Internet Protocol

    46. 46 Routing Tables in IP with CIDR

    47. 47 Routing Tables in IP with CIDR

    48. 48 Routing Table Maintenance in the Internet

    49. 49 Routing Table Maintenance in the Internet

    50. 50 Routing Table Maintenance in the Internet

    51. 51 Routing Architecture in the Internet

    52. 52 Routing Architecture in the Internet

    53. 53 Routing Information Protocol (RIP)

    54. 54 OSPF – The Interior Gateway Routing Protocol (a) An autonomous system. (b) A graph representation of (a).

    55. 55 OSPF (2) The relation between ASes, backbones, and areas in OSPF.

    56. 56 OSPF (3)

    57. 57 BGP – The Exterior Gateway Routing Protocol

    58. 58 Further Reading

    59. 59 Copyright Information

More Related