The Chinese University of Hong Kong
Department of Systems Engineering and Engineering
Management
SEEM5770/ECLT5840
Open Systems/Electronic
Commerce
2016-17
Assignment 1: Networking
The assignment is due at 11:59pm on October 27, 2016. This assignment counts
for 15% of the units assessment. The late penalty will be 10% per day. A
submission will not be accepted five days after the deadline. You need to put
down your student id and your name when you submit your assignment. A
hard-copy submission can be placed in the assignment box C19 on the 5th floor
of ERB, and a soft-copy submission can be submitted to the online eLearning
system. You are responsible to make sure that your hard-copy is placed in the
right assignment box, if you do so. If you submit both, we only mark your
assignment on the hard-copy.
The questions in this assignment ask for explanations. Answer all the questions.
The explanations should be concise descriptions of your understanding. You
should clearly show all the formulas you use, and all the steps followed to get
your answers.1
Q-1: Consider the following scenario which is demonstrated in Figure 1a: Users
A, B and C are in an institutional network with 20Mbps LAN. A server
that holds two web pages, namely, homework.html and project.html,
is connected to the institutional network with a 2Mbps link. The homework.html and project.html are both of size 1M bits. Specially, homework.html references 3 figures, each of which is 0.3M bits. The server
supports only non-persistent HTTP. To download an object from the
server, it needs totally 20,000 bits (including requests and responses) to
create a TCP connection. A HTTP request is 10,000 bits, and a HTTP
response is 10,000 bits plus the size of the object contained. Processing
delay, queuing delay, and propagation delay are assumed to be 0 in this
1
Departmental Guideline for Plagiarism (Department of Systems Engineering and Engineering Management): If a student is found plagiarizing, his/her case will be reported to the
Department Examination Panel. If the case is proven after deliberation, the student will automatically fail the course in which he/she committed plagiarism. The definition of plagiarism
includes copying of the whole or parts of written assignments, programming exercises, reports,
quiz papers, mid-term examinations and final examinations. The penalty will apply to both
the one who copies the work and the one whose work is being copied, unless the latter can
prove his/her work has been copied unwittingly. Furthermore, inclusion of others works or
results without citation in assignments and reports is also regarded as plagiarism with similar
penalty to the offender. A student caught plagiarizing during tests or examinations will be
reported to the Faculty office and appropriate disciplinary authorities for further action, in
addition to failing the course.
2016-17
question.
(a) What is the total time for user A to download homework.html and
then project.html?
(b) After A has finished, how much time it takes for B to download
homework.html and then for C to download project.html?
(c) If a proxy server is installed for the institutional network (see Figure 1b), what is the total time for user A to download homework.html and then project.html? Compare with (a).
(d) After A has finished, how much time it takes for B to download
homework.html and then for C to download project.html provided the proxy server is present, comparing with the question (b)?
server
server
2Mbps
2Mbps
router
router
20Mbps LAN
(a) Without proxy
proxy
20Mbps LAN
(b) With a proxy
Figure 1: Network 1
Q-2: Given all the fields but the checksum field of a UDP segment shown
in Table 1, calculate the checksum field. The structure of Table 1 is
as follows: the first two lines are the header of the segment, while the
remaining two lines are payloads in the segment.
0000 0000 0000 0101 0000 0000 0010 0011
0000 0000 0010 0000
checksum
1000 1001 0101 0011 0111 1111 0011 0000
1010 1101 0100 0111 1111 0101 0000 1110
Table 1: A UDP segment with checksum unknown
Q-3: Consider a reliable data transfer protocol that uses only negative acknowledgments (NAK). Suppose the sender sends data only infrequently. Would
a NAK-only protocol be preferable to a protocol that uses ACKs? Why?
2016-17
3
s
f
8
3
1
1
Figure 2: Network 2
Q-4: Consider the network shown in Figure 2. With the indicated link costs,
use Dijkstras shortest-path algorithm to compute the shortest path from
s to all network nodes. Show how the algorithm works by computing a
table similar to the table shown in the lecture note of Chapter4 5th.ppt
slide 4-21. And show the forwarding table for the router represented by
s.
e
5
3
14
8
Figure 3: Network 3
Q-5: Consider the network shown in Figure 3. Assume that each node initially
knows the costs to each of its neighbors. Following the distance-vector
algorithm, show the steps to compute the distance tables until it is converged.
