Scribd
Upload
81 views5 pages

HW 05 Solutions

This document provides instructions for homework 4 on network layer control plane in CS 555. It states that the homework should be completed individually and submitted as a PDF by the due date, with a 15% late penalty per day. It then provides 4 questions to answer on distance vector routing algorithms, network topologies, inter-AS routing protocols, and using Dijkstra's algorithm to compute shortest paths from node x in a network.

Uploaded by

gmu.rajendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views5 pages

HW 05 Solutions

This document provides instructions for homework 4 on network layer control plane in CS 555. It states that the homework should be completed individually and submitted as a PDF by the due date, with a 15% late penalty per day. It then provides 4 questions to answer on distance vector routing algorithms, network topologies, inter-AS routing protocols, and using Dijkstra's algorithm to compute shortest paths from node x in a network.

Uploaded by

gmu.rajendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CS 555: Computer Communications and Networking

(Fall 2023)
HW-4: Network Layer- Control Plane
Due date: 11/15, 11:59pm

Grading, submission and late policy:

- You are expected to complete this homework on your own (not with a partner)
- Standard late policy applies - Late penalty for this homework will be 15% for each day.
Submissions that are late by 2 days or more will not be accepted.
- You will submit your solution via Blackboard (only pdf file).
- Handwritten scanned pdf document will not be considered for grading.
- Naturally, show your work and do NOT just write down numbers!

Answer the following questions [100pt]

1. [40pt] Consider the network shown below. Starting from node z, show who sends out
the DV and which other nodes update/modify their DV in each iteration?

Dv(u) = min{cv,u+Du(u), cv,x +Dx(u), cv,z+Dz(u)} = min{8,∞,∞} = 8


Iteration1:

Cost to (Particular router)


FROM U V X Y Z
V
X
z
u
v

2. [8 pt] Consider three types of graphs - (1) fully connected, (2) star, (3) ring and (4) line as
shown below in figure. Assume each graph has n node. After how many iterations the
distance vector algorithm will converge? Why? Explain your answer. Assume that at the
beginning, nodes only know the cost to their neighbors.

Image source: https://commons.wikimedia.org/wiki/File:NetworkTopologies.svg

It should be the diameter of the graph (means the shortest longest path between two
nodes in the graph). Answers would be 1 (fully connected), 2 (star), 3 (ring), 5(line).

3. [12 pt] Consider the network shown below. Suppose AS3 and AS2 are running OSPF for
their intra-AS routing protocol. Suppose AS1 and AS4 are running RIP for their intra-AS
routing protocol. Suppose eBGP and iBGP are used for the inter-AS routing protocol.
Initially suppose there is no physical link between AS2 and AS4.
a. Router 3c learns about prefix x from which routing protocol: OSPF, RIP, eBGP, or
iBGP?
b. Router 3a learns about x from which routing protocol?
c. Router 1c learns about x from which routing protocol?
d. Router 1d learns about x from which routing protocol?
4. [40 pt] Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path
algorithm to compute the shortest path from x to all network nodes. Draw the resulting forwarding table at
x?

Routing. Table at x
Y (x,y)
Z (x,z)
U (x,v)
V (x,v)
W (x,w)
T (x,v)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy