Un algorithme de controle d'admission pour la garantie de qualite de service dans le reseau de coeur des systemes de troisieme generation (French text)

Next generation mobile communication networks must offer multimedia services inspired mainly from applications existing in the current Internet. Among these services, many multimedia real-time and non real-time applications have differentiated Quality of Service requirements. Actual cellular networks being able to provide only “best-effort” service, Quality of Service guarantees and efficient resource allocation are becoming major issues in designing 3rd generation networks. Call admission control mechanisms are an integral part of the challenge and closely related to other aspects of networks.; In this thesis, we propose a novel call admission control scheme based on generalized processor sharing discipline for packet service at the session level. Based on properties derived by Parekh and Gallager[1] [2], a deterministic estimate of the amounts of resources necessary to the satisfaction of QoS requirements is carried out in the context of future mobile communication networks. This estimate helps the design of a call admission control scheme which takes place in an original architecture for control and decision.; A comparison of performances for various levels of call admission control schemes towards “best-effort” service is carried out for typical distributions of sessions. Specific properties of developed call admission control scheme are highlighted to define the characteristics of proposed architecture for control and decision. Finally, implemented prototype with OPNET network simulation tool allows the investigation of particular aspects in a global approach to design and dimension next generation wireless communication networks.