Resource Management in Satellite Networks part 25. This book provides significant knowledge on innovative radio resource management schemes for satellite communication systems that exploit lower layer adaptivity and the knowledge of layer 3 IP QoS support and transport layer behavior. The book integrates competencies considering all the parts of system design: propagation aspects, radio resource management, access protocols, network protocols, transport layer protocols, and more, to cover both broadband and mobile satellite systems | 224 Tommaso Pecorella Giada Mennuti RCSTs in a given area with a minimum predefined amount of resources that must be guaranteed to them see Figure 9 . Fig. Scheduling bandwidth allocation hierarchy in DVB-RCS. See reference 9 . Copyright @2006 IEEE. Hence the scheduling strategy proposed is resources can be imagined as ATM cells but the solution can be applied identically to MPEG packets Compute per-area aggregated user requests and guaranteed minimum. Assign the guaranteed minimum to the areas. Allocate the remaining resources with a fair algorithm see the next paragraph . For each area the problem of distributing the assigned resources among the area terminals is solved similarly to the problem of distributing all the satellite resources among areas Collect the user requests but now per segment. Assign the minimum amounts to the segments. Allocate the remaining area resources among the segments with a fair algorithm. Finally the resources allocated to each segment are distributed among the RCSTs associated to that segment taking into account the priorities established by the capacity requests Chapter 7 DYNAMIC BANDWIDTH ALLOCATION 225 Allocate the resources to the users depending only on their CRA requests highest priority . Assign the remaining resources on the basis of the RBDC requests. Assign the remaining resources on the basis of the VBDC requests. In the next paragraph the problem of fair assignment of resources is stated and solved. Fair resource allocation The following maximization problem is presented in 33 where a fair allocation of P resources among N entities areas segments or terminals is achieved N max I xi X1 . XN i 1 N subject to x-i P i 1 dmini xi dmax. where xi is the amount of resources allocated to entity i dmin. is the part of resources guaranteed to i whereas dmaXi also indicated in what follows as di is the request of i. Compared to 33 the main difference is that now a minimum resource allocation must be guaranteed to each .
