Name: Score:
20 Multiple choice questions
Definition 1 of 20
Autonomous Systems. ISPs, IXPs and CDNs can all operate as an ___.
An ___ is a group of routers including the links among them that operate under the same
administrative authority.
Masking Prefix Notation
Transmission Control
AS
What is the EvoArch model?
,Definition 2 of 20
We have an N-by-N crossbar switch.
Can we send the packet to an output link without queueing?
If we could, then assuming that a packet arrives at an output link, it can only block packets sent
to the same output link.
We could achieve that if we have the fabric running N times faster than the input links.
It relies on breaking up packets into fixed sizes (cell).
In practice, we suppose that the same output rarely receives N cells, and the expected
number is k (smaller than N).
Then we can have the fabric running k times as fast as an input link instead of N.
We may still have scenarios where the expected case is violated.
To accommodate these scenarios, we have one or more of a primitive switching element that
randomly picks the chosen output:
k = 1 and N = 2.
Randomly pick the output that is chosen. The switching element, in this case, is called a
concentrator.
k = 1 and N > 2.
One output is chosen out of N possible outputs.
We can use the same strategy of multiple 2-by-2 concentrators in this case.
k needs to be chosen out of N possible cells, with k and N arbitrary values.
We create k knockout trees to calculate the first k winners.
The drawback with this approach is that is it is complex to implement.
Describe the two types of multiplexing/demultiplexing.
Fast Searching using Set Pruning Tries
, ● Walk through an example of the link state routing algorithm.[1] [2] [3] [4]
I wonder if it's meant for us to go through an iteration instead of giving the logic behind
the algorithm.
Maybe, I wasn't entirely sure how to answer that one.
I'll post a comment in piazza later today. It would be good to know if we are going to be
given some values and have to go through an iteration.
Did you ever get an answer?
Avoiding Head-Of-Line Problem using Knockout Scheme
Definition 3 of 20
When the sender receives 3 duplicate ACKs for a packet, it considers the packet to be lost and
will retransmit it instead of waiting for the timeout.
Slow Start In TCP
Delayed Acks
Fast Retransmit
Stop And Wait ARQ
20 Multiple choice questions
Definition 1 of 20
Autonomous Systems. ISPs, IXPs and CDNs can all operate as an ___.
An ___ is a group of routers including the links among them that operate under the same
administrative authority.
Masking Prefix Notation
Transmission Control
AS
What is the EvoArch model?
,Definition 2 of 20
We have an N-by-N crossbar switch.
Can we send the packet to an output link without queueing?
If we could, then assuming that a packet arrives at an output link, it can only block packets sent
to the same output link.
We could achieve that if we have the fabric running N times faster than the input links.
It relies on breaking up packets into fixed sizes (cell).
In practice, we suppose that the same output rarely receives N cells, and the expected
number is k (smaller than N).
Then we can have the fabric running k times as fast as an input link instead of N.
We may still have scenarios where the expected case is violated.
To accommodate these scenarios, we have one or more of a primitive switching element that
randomly picks the chosen output:
k = 1 and N = 2.
Randomly pick the output that is chosen. The switching element, in this case, is called a
concentrator.
k = 1 and N > 2.
One output is chosen out of N possible outputs.
We can use the same strategy of multiple 2-by-2 concentrators in this case.
k needs to be chosen out of N possible cells, with k and N arbitrary values.
We create k knockout trees to calculate the first k winners.
The drawback with this approach is that is it is complex to implement.
Describe the two types of multiplexing/demultiplexing.
Fast Searching using Set Pruning Tries
, ● Walk through an example of the link state routing algorithm.[1] [2] [3] [4]
I wonder if it's meant for us to go through an iteration instead of giving the logic behind
the algorithm.
Maybe, I wasn't entirely sure how to answer that one.
I'll post a comment in piazza later today. It would be good to know if we are going to be
given some values and have to go through an iteration.
Did you ever get an answer?
Avoiding Head-Of-Line Problem using Knockout Scheme
Definition 3 of 20
When the sender receives 3 duplicate ACKs for a packet, it considers the packet to be lost and
will retransmit it instead of waiting for the timeout.
Slow Start In TCP
Delayed Acks
Fast Retransmit
Stop And Wait ARQ
