Scribd
Upload
150 views

Homework 2: Due Date: 2 Jan., 2019

This homework assignment involves 6 questions related to computer networking concepts: 1. Using Dijkstra's algorithm to find the least-cost path between nodes in a network. 2. Calculating IP fragmentation when sending a datagram larger than the MTU. 3. Assigning IP addresses and translating NAT table entries in a home network. 4. Analyzing BGP routing and BitTorrent data transfer between autonomous systems. 5. Computing the remainder value R given a generator G and dividend D. 6. Calculating probability of success for nodes using slotted ALOHA channel access.

Uploaded by

Tam Hoang
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
150 views

Homework 2: Due Date: 2 Jan., 2019

This homework assignment involves 6 questions related to computer networking concepts: 1. Using Dijkstra's algorithm to find the least-cost path between nodes in a network. 2. Calculating IP fragmentation when sending a datagram larger than the MTU. 3. Assigning IP addresses and translating NAT table entries in a home network. 4. Analyzing BGP routing and BitTorrent data transfer between autonomous systems. 5. Computing the remainder value R given a generator G and dividend D. 6. Calculating probability of success for nodes using slotted ALOHA channel access.

Uploaded by

Tam Hoang
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/ 3

Homework 2

Due date: 2nd Jan., 2019


Total points: 100

1. (10 points) Consider the following network. With the indicated link costs, use Dijkstra’s least-
cost path algorithm to compute the least-cost path from x to all the network nodes. Show how
the algorithm works by computing the following table.

Step N’ D(t), p(t) D(u),p(u) D(v), p(v) D(w),p(w) D(y), p(y) D(z), p(z)
0
1
2
3
4
5
6

2. (10 points) Consider sending a 1600-byte datagram into a link that has an MTU of 500 bytes.
Suppose that the original datagram is stamped with the identification number 291.
(a) How many fragments are generated?
(b) What are the values in the various fields in IP datagrams generated related to fragmentation?

3. (10 points) Consider the network setup in the following. Suppose that the ISP instead assigns
the router the address 24.34.112.235 and that the network address of the home network is 192.
168.1/24.

1
(a) Assign addresses to all interfaces in the home network.
(b) Suppose each host has two ongoing TCP connections, all to port 80 at host 128.119.40.86.
Provide the six corresponding entries in the NAT translation table.

4. (30 points) In the following network,

(a) Consider the path information that reaches stub network W, X, and Y. Based on the
information available at W and X, what are their respective views of the network topology?
The topology view at Y is shown in the following.

(b) B would never forward traffic destined to Y via X based on BGP routing. But in BitTorrent,
data packets go to X first then flow to Y. Describe how data packets follow a path not given
by BGP algorithm.
(c) Suppose that there is another stub network V that is a customer of ISP A. Suppose that B
and C have a peering relationship, and A is a customer of both B and C. Suppose that A
would like to have the traffic destined to W to come from B only, and the traffic destined

2
to V from either B or C. How should A advertise its route to B and C? What AS route does
C receive?

5. (10 points) Consider the generator G=1001, and suppose that D has the value 11000111010.
What is the value of R?

6. (20 points) Suppose four active nodes, A, B, C, and D, are competing for access to a channel
using slotted ALOHA. Assume each node has an infinite number of packets to send. Each node
attempts to transmit in each slot with probability p. The first slot is numbered slot 1, the second
slot is numbered slot 2, and so on.
(a) What is the probability that node A succeeds for the first time in slot 5?
(b) What is the probability that some node (either A, B, C, or D) succeeds in slot 4?
(c) What is the probability that the first success occurs in slot 3?
(d) What is the efficiency of this four-node system?

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