Assume that machines a and b are on the same network 10.3.2.0/24. machine a sends out spoofed packets, and machine b tries to sniff on the network. when machine a spoofs packets with a destination 1.2.3.4, b can always observe the spoofed packets. however, when machine a tries to spoof packets with a destination ip address 10.3.2.30, b cannot see the spoofed packets. there is nothing wrong with the spoofing or sniffing program. apparently, the spoofed packet has never been sent out. what could be the reason?

Consider a slotted aloha system, where the time slot equals the fixed duration of each packet. assume that there are 4 stations a, b,c, d sharing the medium. (a) stations a, b,c, d receive one packet each from higher layers at times 1.3, 1.5, 2.6,5.7 respectively. show which transmissions take place when, according to the slottedaloha protocol; describe all transmissions until all four packets have been successful. when needed, each station has access to the following sequence of random number, provided by a random number generator and drawn uniformly between 0 and 1: (1) station a draws numbers: 0.31, 0.27, 0.78, 0.9, 0.9, 0.11, 0. (2) station b draws numbers: 0.45, 0.28, 0.11, 0.83, 0.37, 0.22, 0. (3)station c draws numbers: 0.1, 0.2, 0.3, 0.4, 0. (4) station d draws numbers: 0.36, 0.77, 0.9, 0.1, 0.1, 0.1, 0.1, 0. (b) in slotted aloha, a station transmits in each time slot with a given probability. what probabilities would you assign to each of the four stations so as to: (i) maximize the efficiency of the protocol? (ii) maximize fairness among the four stations? (c) will the efficiency increase or decrease if we modify slotted aloha as follows: (i) get rid of slots and allow stations to transmit immediately? (ii) implement carrier sensing? (iii) implement collision detection? (iv) implement collision avoidance?

Telling a computer that is already on to turn again is known as what type of boot?

Arun is 5 years older than anu. five years ago, the ratio of their ages was 3: 2 . find their present age