1 / 33

Internet Technology NETW 902 Tutorial 6

Mohamed Esam. Internet Technology NETW 902 Tutorial 6. Curriculum. First 3 Chapters Chapter 4: from the chapter start (page 255) up to (page 372) Chapter 5: from page 491 to 554 . Main Points for Problems. Ch’s 1&2 Till page: 200. ALOHA Slotted ALOHA CSMA/CD

plato-vaughan
Download Presentation

Internet Technology NETW 902 Tutorial 6

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. Mohamed Esam Internet TechnologyNETW 902Tutorial 6

  2. Curriculum • First 3 Chapters • Chapter 4: from the chapter start (page 255) up to (page 372) • Chapter 5: from page 491 to 554 

  3. Main Points for Problems Ch’s 1&2 Till page: 200 • ALOHA • Slotted ALOHA • CSMA/CD • Token Ring, Token BUS & Ring Types. (last Tutorial) • BUS Segments • WLAN • FDDI • Spanning Tree • Performance of (Aloha, CSMA & Token Ring) • SONET/SDH • ATM • Virtual Connections • ISDN • Dial up • DSL Ex.1: LAN-Inter working & Spanning Tree Ex.2: MAC protocols Performance Ch’s 3 Till page: 255 Ex.3: IP Addressing, ATM & Access Networks

  4. Internet Arch. & IP Addressing. • ARP • MTU • Routing Functions • Forwarding • Routing Principles • Distance Vector Algor. • Link State Algor. • Path Vector Algor. • Routing in Internet. • Internet Routing Protocols • ARQ • UDP • TCP • QoS Some of Ch’s 4&5 Till page: 554 Ex.4: Distance Vector & Link State Routing Ex.5: TCP

  5. ARP (Automatic Resolution Protocol)

  6. In Star Network 10.10.10.1 PC1 PC2 10.10.10.2 • Switch is the responsible device in the network for ARP. • It’s done one time after connection and then updated regularly Send data to 10.10.10.3 Data 10.10.10.3 PC3 Internet Switch Router My MAC is 3B Who has IP 10.10.10.3, reply With MAC Address to MAC:8A IP:10.10.10.0 PC4 10.10.10.4 PC5 10.10.10.5

  7. MTU (Maximum Transmission Unit) • Sender doesn’t send larger than MTU of the used Technology. • Routers may divide the payload into smaller data units while forwarding.

  8. Dynamic Routing Update Routing Table periodically

  9. I- Distance Vector Algorithm • Bellman Ford Algorithm. 7 N2 N3 8 N4 6 1 5 N5 N6 4 N6 is the Destination 2 N7 N1 3 Link ID

  10. N6 is the Destination 7 N2 N3 8 Assumes whole links have the same cost (=1). So Total path cost = number of hops. In case of same cost select randomly. Not Unique Solution N4 6 1 5 N5 N6 4 2 N7 Distance (No. of hops) Link No. N1 3

  11. 7 N2 N3 8 N4 N6 is the Destination 6 1 5 N5 N6 4 2 N7 Distance (No. of hops) Link No. Shorter than (4, 2) N1 3

  12. 7 N2 N3 8 N4 N6 is the Destination 6 1 5 N5 N6 4 2 N7 Shorter than (4, 2) Shorter than (7,3) N1 3

  13. Repeat with All destinations  Get the routing Table • N7 to All Destinations

  14. Count to infinity Problem:

  15. Exerc.4 Part 1 Dynamic Routing

  16. Q2-a

  17. Q2-b

  18. Q2-C

  19. Q3-a

  20. Q3-b

  21. Q3-c • Looping (Count to Infinity)

  22. Q3-d

  23. II- Link State Algorithm • Discover the neighbours: • Measure the cost to each neighbour • Flooding: Send Link State packet to all routers saying the new information; includes: • Sender ID • Packet Sequence No. (32 bits) • Packet age (TTL) • List of neighbours and corresponding Cost. • Compute shortest path to all routers using Dijkstra algorithm. Echo (Round Trip) packet

  24. Part 2- Exerc.4 2 B 2 B 4 C 4 C 3 1 3 1 1 1 D 6 1 1 1 D 6 1 12 12 4 A 1 4 E A 1 E 5 5 Cost Link ID

  25. A- If Duplicate Messages are not avoided 2 B 4 2 C B 3 4 1 C 3 1 1 D 1 6 1 1 1 12 D 6 1 4 12 A 1 E 4 5 A 1 E

  26. B- Link State Database 2 B 4 C 3 1 1 1 D 6 1 12 4 A 1 E 5 Link ID Cost

  27. C- • Using Time Stamps (Synchronized routers) • Using Seq. Number: • 32 bits address to avoid Wrap around problem. • Incremented with every new message

  28. D- Apply Dijkstra 2 B 4 C 3 1 1 1 D 6 1 12 4 A 1 E 5 Cost Link ID

  29. D- Apply Dijkstra Doesn’t Send to the Source Node (A) 2 B 4 C 3 1 1 1 D 6 1 12 4 A 1 E 5 Cost Link ID

  30. D- Apply Dijkstra 2 B 4 C 3 1 1 1 D 6 1 12 4 A 1 E 5 Cost Link ID

  31. D- Apply Dijkstra 2 B 4 C 3 1 1 1 D 6 1 12 4 A 1 E 5 Cost Link ID

  32. D- Node A Routing Table

More Related