1 / 66

The Network Layer

The Network Layer. Week 5. Network Layer Design Isues. Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented Service Comparison of Virtual-Circuit and Datagram Subnets.

liza
Télécharger la présentation

The Network Layer

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. The Network Layer Week 5

  2. Network Layer Design Isues • Store-and-Forward Packet Switching • Services Provided to the Transport Layer • Implementation of Connectionless Service • Implementation of Connection-Oriented Service • Comparison of Virtual-Circuit and Datagram Subnets

  3. Store-and-Forward Packet Switching fig 5-1 The environment of the network layer protocols.

  4. Implementation of Connectionless Service Routing within a diagram subnet.

  5. Implementation of Connection-Oriented Service Routing within a virtual-circuit subnet.

  6. Comparison of Virtual-Circuit and Datagram Subnets 5-4

  7. Routing Algorithms • The Optimality Principle • Shortest Path Routing • Flooding • Distance Vector Routing • Link State Routing • Hierarchical Routing • Broadcast Routing • Multicast Routing • Routing for Mobile Hosts • Routing in Ad Hoc Networks

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

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

  10. Flooding 5-8 top Dijkstra's algorithm to compute the shortest path through a graph.

  11. Flooding (2) 5-8 bottom Dijkstra's algorithm to compute the shortest path through a graph.

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

  13. Distance Vector Routing (2) The count-to-infinity problem.

  14. Link State Routing 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. • Compute the shortest path to every other router.

  15. Measuring Line Cost A subnet in which the East and West parts are connected by two lines.

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

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

  18. Hierarchical Routing Hierarchical routing.

  19. Broadcast Routing Reverse path forwarding. (a) A subnet. (b) a Sink tree. (c) The tree built by reverse path forwarding.

  20. Multicast Routing (a) A network. (b) A spanning tree for the leftmost router. (c) A multicast tree for group 1. (d) A multicast tree for group 2.

  21. Routing for Mobile Hosts A WAN to which LANs, MANs, and wireless cells are attached.

  22. Routing in Ad Hoc Networks Possibilities when the routers are mobile: • Military vehicles on battlefield. • No infrastructure. • A fleet of ships at sea. • All moving all the time • Emergency works at earthquake . • The infrastructure destroyed. • A gathering of people with notebook computers. • In an area lacking 802.11.

  23. Route Discovery • (a) Range of A's broadcast. • (b) After B and D have received A's broadcast. • (c) After C, F, and G have received A's broadcast. • (d) After E, H, and I have received A's broadcast. Shaded nodes are new recipients. Arrows show possible reverse routes.

  24. Route Maintenance (a) D's routing table before G goes down. (b) The graph after G has gone down.

  25. Node Lookup in Peer-to-Peer Networks (a) A set of 32 node identifiers arranged in a circle. The shaded ones correspond to actual machines. The arcs show the fingers from nodes 1, 4, and 12. The labels on the arcs are the table indices. (b) Examples of the finger tables.

  26. Congestion Control Algorithms • General Principles of Congestion Control • Congestion Prevention Policies • Congestion Control in Virtual-Circuit Subnets • Congestion Control in Datagram Subnets • Load Shedding • Jitter Control

  27. Congestion When too much traffic is offered, congestion sets in and performance degrades sharply.

  28. General Principles of Congestion Control • Monitor the system . • detect when and where congestion occurs. • Pass information to where action can be taken. • Adjust system operation to correct the problem.

  29. Congestion Prevention Policies 5-26 Policies that affect congestion.

  30. Congestion Control in Virtual-Circuit Subnets (a) A congested subnet. (b) A redrawn subnet, eliminates congestion and a virtual circuit from A to B.

  31. Hop-by-Hop Choke Packets (a) A choke packet that affects only the source. (b) A choke packet that affects each hop it passes through.

  32. Jitter Control (a) High jitter. (b) Low jitter.

  33. Quality of Service • Requirements • Techniques for Achieving Good Quality of Service • Integrated Services • Differentiated Services • Label Switching and MPLS ( MultiProtocol Label Switching) Quality of service refers to resource reservation control mechanisms rather than the achieved service quality. Quality of service is the ability to provide different priority to different applications, users, or data flows, or to guarantee a certain level of performance to a data flow. QoS sometimes used as a quality measure, with many alternative definitions, rather than referring to the ability to reserve resources.

  34. Requirements 5-30 How stringent the quality-of-service requirements are.

  35. Buffering Smoothing the output stream by buffering packets.

  36. The Leaky Bucket Algorithm (a) A leaky bucket with water. (b) a leaky bucket with packets.

  37. The Token Bucket Algorithm 5-34 (a) Before. (b) After.

  38. Admission Control 5-34 An example of flow specification.

  39. Packet Scheduling (a) A router with five packets queued for line O. (b) Finishing times for the five packets.

  40. RSVP-The ReSerVation Protocol (a) A network, (b) The multicast spanning tree for host 1. (c) The multicast spanning tree for host 2.

  41. Expedited Forwarding Expedited packets experience a traffic-free network.

  42. Assured Forwarding A possible implementation of the data flow for assured forwarding.

  43. Label Switching and MPLS Transmitting a TCP segment using IP, MPLS, and PPP.

  44. Internetworking • How Networks Differ • How Networks Can Be Connected • Concatenated Virtual Circuits • Connectionless Internetworking • Tunneling • Internetwork Routing • Fragmentation

  45. Connecting Networks A collection of interconnected networks.

  46. How Networks Differ 5-43 Some of the many ways networks can differ.

  47. How Networks Can Be Connected (a) Two Ethernets connected by a switch. (b) Two Ethernets connected by routers.

  48. Concatenated Virtual Circuits Internetworking using concatenated virtual circuits.

  49. Connectionless Internetworking A connectionless internet.

  50. Tunneling Tunneling a packet from Paris to London.

More Related