Deterministic network calculus is a theory based on the (min,plus) algebra. Its aim is to compute worst-case performance bounds in communication networks. Our goal is to provide a comprehensive view of this theory and its recent advances, from its theoretical foundations to its implementations. The book is divided into three parts. The first part focuses on the (min,plus) framework and its algorithmic aspects. The second part defines the network calculus model and analyzes one server in isolation. Different service and scheduling policies are discussed, particularly when data is packetized. The third part is about network analyses. Pay burst only once and pay multiplexing only once phenomena are exhibited, and different analyses are proposed and compared. This includes the linear programming approaches that compute tight performance bounds. Finally, some partial results on the stability are detailed.