Time-Sensitive Networking (TSN) is a collection of standards that extend Ethernet to support safety-critical and real-time applications. TSN integrates multiple traffic types, i.e., Time-Triggered (TT) traffic scheduled based on Gate-Control-Lists (G-CLs), Credit-Based Schaper (CBS) traffic that requires bounded latencies, and Best-Effort (BE) traffic , for which no guarantees are provided. This paper considers multiple classes of AVB/CBS traffic in TSN networks, and models its into network calculus theory , in order to compute upper bounds on delays and memory use in such network.