Assignemnt (1)
Assignemnt (1)
1. For each one of the following subnet addresses, give an example of an IP address that can be
assigned to that subnet, and one that can not
subnet IP address IP address in subnet outside subnet
67.56.0.0/16
121.34.56.64/30
121.232.111.128/25
128.131.9.0/16
128.131.10.0/16
93.20.10.0/28
128.0.0.0/8
200.220.0.0/12
200.220.76.0/24
128.242.138.0/18
2. Router has output interfaces with a buffer (queue) that can hold up to 64 packets and with links
each capable of transmitting up to 10000 packets per second. The router has 4 input interfaces,
each one receiving an average of 6000 packets per second. Suppose that at some point, and for
a long period of time, all traffic happens to be forwarded to the same output interface.
a. Assuming that both input ports and switch fabric are capable of handling the input flow, is
the router congested during this period? If so, what is the probability that a packet be
dropped? Assume the router uses a “drop-tail” policy. Justify your answer.
b. Assume that each input port is capable of receiving and processing 10000 packets per
second, and that the switching fabric can process 20000 packets per second. Assume also
that the router processes packets in a first-come first-served manner. What is he expected
latency during this period? Justify your answer.
3. The minimal size of an Ethernet packet is 64 bytes (header plus payload). Explain the need for
a minimal-size requirement, as well as the specific value of 64 bytes. In your explanation,
assume that the maximum length of an Ethernet segment is 2500 meters, possibly including
multiple sub-segments connected by repeaters, that the round-trip delay is 51μs, and that the
transmission speed is 10Mbit/s, as in the 10BASE5 version of the Ethernet standard.
4. A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/μsec.
Repeaters are not allowed in this system. Data frames are 256 bits long, including 32 bits of
header, checksum, and other overhead. The first bit slot after a successful transmission is
reserved for the receiver to capture the channel in order to send a 32-bit acknowledgement
frame. What is the effective data rate, excluding overhead, assuming that there are no
collisions?
5. A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a 1000-bit
frame on average once every 100 sec, even if the previous one has not yet been sent (e.g., the
stations can buffer outgoing frames). What is the maximum value of N?
6. A computer on a 6-Mbps network is regulated by a token bucket. The token bucket is filled at
a rate of 1 Mbps. It is initially filled to capacity with 8 megabits. How long can the computer
transmit at the full 6 Mbps?
7. Suppose you purchase a wireless router and connect it to your cable modem. Also suppose that
your ISP dynamically assigns your connected device (that is, your wireless router) one IP
address. Also suppose that you have five PCs at home that use 802.11 to wirelessly connect to
your wireless router. How are IP addresses assigned to the five PCs? Does the wireless router
use NAT? Why or why not?
8. Consider again the SDN OpenFlow network shown in Figure 4.30. Suppose that the desired
forwarding behaviour for datagrams arriving from hosts h3 or h4 at s2 is as follows:
• Any datagrams arriving from host h3 and destined for h1, h2, h5 or h6 should be
forwarded in a clockwise direction in the network;
• Any datagrams arriving from host h4 and destined for h1, h2, h5 or h6 should be
forwarded in a counter-clockwise direction in the network.
9. Consider the following AS-level topology and the given allocation of addresses in the above
figure. Write all the BGP route advertisements produced by each one of the autonomous
systems. For each advertisement write only destination and AS path. Assume that autonomous
systems are always willing to accept and forward route advertisements. (Hint: remember that
addresses should be combined in router advertisements.)
10. Suppose nodes A and B are on the same 12 Mbps broadcast channel, and the propagation delay
between the two nodes is 316 bit times. Suppose CSMA/CD and Ethernet packets are used for
this broadcast channel. Suppose node A begins transmitting a frame and, before it finishes, node
B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted?
Why or why not? If the answer is yes, then A incorrectly believes that its frame was successful
transmitted without a collision. Hint: Suppose at time t = 0 bits, A begins transmitting a frame.
In the worst case, A transmits a minimum-sized frame of 512 + 64 bit times. So A would finish
transmitting the frame at t = 512 + 64 bit times. Thus, the answer is no, if B’s signal reaches A
before bit time t = 512 + 64 bits. In the worst case, when does B’s signal reach A?