초록 ▼

The invention relates to a resource allocation method and system making use of a dynamically controlled boundary policy to satisfy the quality of service parameters guaranteed by the system for two traffic classes (a constant bit rate traffic, and a bursty data one also called VBR traffic) having to

The invention relates to a resource allocation method and system making use of a dynamically controlled boundary policy to satisfy the quality of service parameters guaranteed by the system for two traffic classes (a constant bit rate traffic, and a bursty data one also called VBR traffic) having to share a communication channel divided into frames. The boundary position (BP) between the traffic sub-frames and hence the allocation decision itself are defined by a resource allocator (23) for each frame, after monitoring the filling level of traffic request queues (21, 22).

대표청구항 ▼

1. A method of allocating channel slots to waiting calls coming from a plurality of user stations, for an integration of constant and variable bit rate (CBR and VBR) traffic into a communication channel divided into frames each of which includes N(F) time slots, wherein, under normal loading conditi

1. A method of allocating channel slots to waiting calls coming from a plurality of user stations, for an integration of constant and variable bit rate (CBR and VBR) traffic into a communication channel divided into frames each of which includes N(F) time slots, wherein, under normal loading conditions for both traffic types, each frame is subdivided into a CBR traffic sub-frame composed of N(C) slots, and a VBR traffic sub-frame composed of N(Vmin) slots and, between them, a sub-frame called common resource pool (CRP) and composed of the (N(F)-N(C)-N(Vmin)) remaining slots of the frame, said allocation method then comprising the following steps:(a) as the VBR traffic loading increases over that of CBR traffic, a boundary between them moves inside the CRP and the CBR sub-frame in order to include unallocated CBR channels; (b) as the CBR traffic goes up, at small VBR loads said boundary moves in the CRP towards the VBR sub-frame, wherein any displacement is limited by the minimum number of resources N(Vmin) permanently reserved for VBR traffic; (c) under high loading conditions for both traffic types, CBR traffic resources are limited to N(C), and remaining resources N(V)=N(F)-N(C) in the frame are available to VBR traffic.