collision

An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $$k$$ be the number...

Consider a LAN with four nodes S 1 , S 2 , S 3 and S 4 . Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision i...

A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first backoff race. A...