CS402: Computer Communications and Networks

5.1: Principles

• Université Catholique de Louvain: Olivier Bonaventure's "Computer Networking: Principles, Protocols, and Practice" URL

  Read the introduction to chapter 5 and the beginning of section 5.1, "Principles," on pages 127-129. Stop at section 5.1.1, "Organisation of the Network Layer."

  The network layer includes the datagram and virtual circuit modes, the separation between the data plane and the control plane, and the algorithms used by routing protocols.

  As you read this section, it is important to understand the purpose of the router and the use of the packet in enabling you to send data and receive the response. How does the packet interact with the router?

• 5.1.1: Organization of the Network Layer

  • Université Catholique de Louvain: Olivier Bonaventure's "Computer Networking: Principles, Protocols, and Practice" URL

    Read section 5.1.1, "Organisation of the Network Layer," on pages 129-132.

    What are the two internal organizations used in the network layer? When are each used? What is a datagram? Explore this section of your textbook to see how a datagram is used in the network level. Compare and contrast the datagram organization with the virtual circuit discussed in this section.

    The concept of hop-by-hop forwarding is this section. What does this concept have to do with the routing table? What is the difference between the data and control planes?

• 5.1.2: The Control Plane

  • Université Catholique de Louvain: Olivier Bonaventure's "Computer Networking: Principles, Protocols, and Practice" URL

    Read the beginning of section 5.1.2, "The control plane," in chapter 5 of your textbook. Stop at "Static routing."

    In this section, the textbook explains how the control plane maintains the routing table. The three techniques to accomplish this are static routing, distance vector routing, and link state routing. As you explore the next three subunits describing each one in detail, note the advantages and disadvantages of each technique. How does each method deal with link and router failures?

  • 5.1.2.1: Static Routing

    • Université Catholique de Louvain: Olivier Bonaventure's "Computer Networking: Principles, Protocols, and Practice" URL

      Read "Static Routing" on pages 132-133. Stop at "Distance Vector Routing," which you will read below. As you read, consider the following questions: What is static routing? What are its advantages and disadvantages?

  • 5.1.2.2: Distance Vendor Routing

    • Université Catholique de Louvain: Olivier Bonaventure's "Computer Networking: Principles, Protocols, and Practice" URL

      Read "Distance Vector Routing" on pages 133-137. Stop at "Link State Routing," which you will read below. As you read, consider the following questions: What is distance vector routing? What are its advantages and disadvantages?

  • 5.1.2.3: Link State Routing

    • Université Catholique de Louvain: Olivier Bonaventure's "Computer Networking: Principles, Protocols, and Practice" URL

      Read "Link State Routing" on pages 137-140. Stop at section 5.2, "Internet Protocol." As you read, consider the following questions: What is link state routing? What are its advantages and disadvantages? How does link state routing handle link and routing failures?

    • Wikipedia: "Bellman-Ford Algorithm" URL

      Read this article for more details about the Bellman-Ford routing algorithm. This routing protocol is used in RIP, OSPF, and BGP.
      

    • Wikipedia: "Dijkstra's Algorithm" URL

      Read this article for more details about the Dijkstra routing algorithm. What is the Dijkstra Algorithm? How is the Dijkstra Algorithm used in link state routing? Like the Bellman-Ford algorithm, this routing protocol is used in RIP, OSPF, and BGP.
      

    • Geographic Information Technology Training Alliance: "Djikstra's Algorithm, Step by Step" URL

      Review this demonstration, which discusses how Djikstra's algorithm is implemented step-by-step.