The flexibility and the wide deployment of IP technologies have driven the development of IP-based solutions for wireless networks, like IPbased Radio Access Networks (RAN). These networks have different characteristics when compared to traditional IP networks, imposing very strict requirements on Quality of Service (QoS) solutions, such as fast dynamic resource reservation, simplicity, scalability, low cost, severe congestion handling and easy implementation. A new QoS framework, called Resource Management in Differentiated Services (RMD), aims to satisfy these requirements. RMD has been introduced in recent publications. It extends the IETF Differentiated Services (Diffserv) architecture with new admission control and resource reservation concepts in a scalable way. This paper gives an overview of the RMD functionality and its performance behavior. Furthermore, it shows that the mean processing delay of RMD signaling reservation messages is more than 1330 times smaller then the mean processing delay of RSVP signaling reservation messages.

No abstract

In this paper a novel call level model based on the extension of the classical Erlang multi-rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi-service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP-based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Figure 9. Impact of partial blocking and queueing on total call holding times of: (a) ABR1 sources and (b) ABR2 sourcesAll in all, from the numerical results we conclude that in PB-Q systems, which we have used as models for multi-rate 'per-session state aware' connection-oriented networks, there are a number of means to control blocking probabilities and thus network resource utilization and fairness. As we have seen on the numerical examples, call queueing and partial blocking, in general, decreases the blocking probabilities at the expense of increased holding times. We are currently working on the formulation of optimization criteria and an optimization model for the PB-Q system. Relationship to and comparison with related works Related worksRouting high-bandwidth traffic in a fair manner and resource allocation in multi-service networks supporting best effort (also called 'elastic') traffic are the topics of current state-of-the-art research papers.\\ Also, the issue of fairness is in the focus of both the ITU-T and the ATM Forum. Although these papers delve into important aspects of fairness 117