Theoretically, transmitting compressed data will optimize bandwidth use. Internet traffic is rarely compressed, thus this benefit is not fully realized. Compression algorithms should be increasingly effective as file size increases, up to a maximum determined by the data type and compression algorithm. However, these efficiencies are also not achieved. For enterprises with large data streams communicated between locations, this can result in substantial excess network bandwidth usage and cost. In order to reduce this cost, this paper examines the efficacy of compressing random Internet traffic. It describes a method to identify the Internet traffic block size that provides maximal compression. A general method for using Internet traffic compression between heavily communicating sites is proposed. Results suggest that high-efficiency compression may yield at least a thirty percent reduction in bandwidth consumed. Further, there may be communi- cation security implications.