Question

3) Consider the switch shown below. Suppose that all datagrams have the same fixed length, that the switch operates in a slotted, synchronous manner, and that in one time slot a datagram can be transferred from an input port to an output port. The switch fabric is a crossbar so that at most one datagram can be transferred to a given output port in a time slot, but different output ports can receive datagrams from different input ports in a single time slot. What is the minimal number of time slots needed to transfer the packets shown from input ports to their output ports, assuming any input queue scheduling order you want (i.e., it need not have HOL blocking)? What is the largest number of slots needed, assuming the worst-case scheduling order you can devise, assuming that a non-empty input queue is never idle? Output port X_> Switch fabric -output port Y → Output port Z

Answer 1

The Switch tabic 冰 The mimm.o tima slots leaisted is

ir) Ine to avo HoL bloctin The Scheduling olaus as 米 米 gen Bu in the ist case HA fme slos gueu요 ·'s assumed as xitRe