The role of the push-based architecture in modern wireless telecommunication systems has been gaining momentum over the past few years. However, these systems pose a challenging problem: the creation of the optimal common broadcast schedule that best fits the needs of the totality of the available clients. To this end, various approaches have been proposed, with one of the most well known and widely accepted approaches being the Broadcast Disks method. This method ensures the periodicity and proportionality attributes of the broadcast schedule but leaves ample room for performance optimization, which is a task traditionally assigned to heuristic algorithms. This paper presents a mathematical analysis of the Broadcast Disks method, which establishes a new analytical performance-optimization procedure. Comparison with other related well-known algorithms yielded better performance in every client test case. Finally, the analysis showed that even small deviations from optimal parameter values may lead to significant performance degradation in terms of the clients' mean waiting time.