Bottlenecks on the Internet and Denial of Service attacks on a server are both caused by excessive demands made on a system. This proposal is to reduce the ill-effects of either by building on our previous theoretical work on strongboxes of combinatorial designs. In the case of bottlenecks, the demands are legitimate but badly timed, and our approach will redistribute the demands more evenly. In the case of Denial of Service attacks, the demands are malicious, and our approach will respond in such a way as to deplete the resources of the attacker.