ity of a link, the individual bandwidth shares are summed up. In the second case, it is assumed that there is a complete bandwidth sharing among different traffic classes. That means a traffic class can use any bandwidth available in the network that is not used by others. In this thesis, strict priority scheduling is performed between the circuit-switched traffic (high priority) and the elastic traffic (low priority) in the transport network. At any time the low priority traffic is able to utilize the bandwidth which is not used by high priority traffic. For this case, the analytical dimensioning model needs to guarantee the QoS of both traffic types. Thus the processor sharing model for elastic traffic and the Erlang model for circuit-switched traffic need to be combined, but additionally the resultant multiplexing gain due to the bandwidth sharing has to be considered. This thesis will focus on this case with a full bandwidth sharing between the two traffic types. For dimensioning to meet the network-relevant QoS such as packet delay or packet loss ratio over the lub interface, the suggested analytical dimensioning models are queuing models which model the packet level. The arrival process of the queuing models needs to capture the important characteristics of the aggregated traffic on the link. They are usually Non- Markovian Arrival Processes. The server process depends on the packet length distribution and the given link capacity. In this context, the server refers to the link that needs to be dimensioned. In the mixed traffic scenario, a non-preemptive priority queuing model is considered. Once the basic analytical queuing models are determined for certain QoS criteria and traffic scenarios, a number of extensions of the basic queuing models can be derived for adding specific resource control functions like BRA or CAC, traffic control functions such as DiffServ or deploying certain network topology. In this thesis, two network scenarios are considered for the lub interface: single lub link scenario and mul