KR20010028707A - Method for allocating and deallocating resources in telecommunication system - Google Patents

Abstract

PURPOSE: A method for allocating and releasing resources in a communication system is provided to minimize the fragmentation of the resources, and make the allocation and release thereof efficient, by allocating the resources with priority which have the minimum allocable sub-resources capable of supporting the service with a required speed. CONSTITUTION: All resources are initialized as a S0 state(210). A system gets the group index of the resources that includes the minimum allocable sub-resources capable thereof(215). The system waits the request for allocating service resources(220). When the request for the same is received(225), the value according to the speed of the requested service is inserted into a variable of i(230). It is checked if the value of cnt(i) is larger than '0'(235). If the value of cnt(i) is not larger than '0', it is checked whether the value of i is larger than '0'(240). If the value of i is larger than '0', it is decreased by 1(245). If the value of i is not larger than '0', the system regards this state as the failure of allocating the resources(250). If the value of cnt(i) is larger than '0', the system updates the state value and group index of the resources(255-270).

Description

How to allocate and release resources in a communication system {METHOD FOR ALLOCATING AND DEALLOCATING RESOURCES IN TELECOMMUNICATION SYSTEM}

The present invention relates to a method for allocating and releasing resources in a communication system, and more particularly, to a method for minimizing fragmentation of allocated resources.

In communication systems such as multiple access communication systems and other network switching systems, it is common practice to provide services with the same data transfer rate. Recently, however, multiple access communication systems and other network switching systems provide various speed services such as voice and video. In this case, the system provides a service by allocating a wireless or wired resource to each subscriber, and resources are allocated differently according to the type of service, and generally, a specific constraint is given to resource allocation.

For example, if the voice subscriber requests 8Kbps or 16Kbps service and the data service subscriber requests 64Kbps service, if the system unintentionally allocates limited PCM time slot or wireless Hadamard code, Even if there are enough resources to provide a service, fragmentation of resources that cannot provide 64 Kbps service may occur because the remaining resources are not contiguous. Therefore, the system can provide 4 or more services of 16Kbps, but there are no sub-timeslots allocated as needed, or multiple Hadamard codes with multiple orders of magnitude. There is a case where the extended code remains from the base order code, so that the required high-speed data service cannot be provided.

As described above, fragmentation of resources occurs when allocating resources such as PCM timeslots, Hadamard codes, and time switches in a sequential or random allocation scheme in a wireless or wired communication system that provides various speed services. Done. In other words, despite the fact that there are resources to be allocated, each resource is scattered in small units through repeated allocation and release processes, so that a specific high speed service cannot be provided.

On the other hand, recently, a method of periodically reallocating resources (Defragmentation) has been discussed as a way to prevent this phenomenon. However, the periodic resource reallocation scheme may not be easily applied to a general communication system or may cause service discontinuity. In addition, even if the above-mentioned problem of application and service discontinuity are solved, the actual implementation of the function is quite difficult. For example, in a code division multiple access communication system using an actual Hadamard code, reassignment of the Hadamard code means that many service radio sections must be reconfigured. In addition, in order for a wired system to reallocate PCM timeslots or time switches, which are resources belonging to a wired section, to provide a call path, a complicated control message is required between modules inside the entire system.

Accordingly, an object of the present invention is to provide a method for minimizing resource fragmentation and efficiently allocating and releasing resources in a communication system.

Another object of the present invention is to allocate resources by first selecting a resource having a minimum assignable sub-resource capable of supporting a service of a required rate in order to minimize resource fragmentation in a communication system providing various transmission rates. In providing a method.

In addition, another object of the present invention is to define the status of each resource according to the presence or absence of sub-resources in order to minimize resource fragmentation and efficient resource allocation and distribution in the communication system, and to define the event of resource allocation / release The present invention provides a method for efficiently allocating and releasing resources by defining a resource set based on the number of unallocated sub resources of a resource and the speed at which the service can be performed.

In addition, another object of the present invention is to define the status of each resource according to the presence or absence of sub-resources in order to minimize resource fragmentation and efficient resource allocation and distribution in the communication system, and to define the event of resource allocation / release Define a set of resources based on the number of unallocated sub-resources of each resource and the speed at which they can be serviced, and define a group index of resources with the minimum assignable sub-resources that can support the service at the required rate. When a service resource allocation request of a predetermined rate occurs, the resource group having the next step is sequentially checked from the group index (i_max) to minimize resource fragmentation and efficient resource allocation, even when there are special resource allocation constraints. It provides a way to unlock.

According to the present invention for achieving the above object, the resource allocation and release method in the communication system, the status of each resource according to the presence or absence of sub-resources, define the resource allocation / release event and each resource allocation A first step of defining a resource set based on the number of unresourced sub-resources and the speed at which they can be serviced, and defining a group index of resources having a minimum assignable sub-resource capable of supporting a required rate of service; When a service resource allocation request of a predetermined rate occurs, a second step of first checking a resource group corresponding to the group index, sequentially examining resource groups having a next level, and selecting a corresponding resource to allocate the required resource Process, and when a request for releasing a service resource at a predetermined rate occurs, And a fourth process of releasing a resource or the corresponding resource, and a fourth process of updating a state value of the corresponding resource and an index of the resource set according to resource allocation or release of the corresponding resource.

1 is a diagram illustrating a state transition table of resource allocation and release according to an embodiment of the present invention in a communication system.

2 is a flowchart illustrating a resource allocation method according to an embodiment of the present invention in a communication system.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following description of the present invention, detailed descriptions of related well-known functions or configurations are omitted when it is determined that the detailed description may unnecessarily obscure the subject matter of the present invention.

In the case of a time slot on a PCM line, which is generally a wired resource in a communication system, one time slot is generally composed of 8 bits, and the system can transmit 64 Kbps of data. The system also defines eight or four sub-timeslots by dividing one timeslot into one or two bits for services up to 64 Kbps. The system then allocates the sub timeslots appropriately to provide 8Kbps or 16Kbps service. For example, if you define a time slot as four sub timeslots, the system allocates one sub timeslot for a 16 Kbps service request, two sub timeslots for a 32 Kbps service request, and a 64 Kbps service. The request is allocated by all four sub-timeslots in one time slot to provide service.

Also, in general, the allocation of sub timeslots provided in different timeslots to provide one service is limited due to time slot management, switching device, and communication protocol complexity.

In the case of the Hadamard code, which is generally a radio resource in a communication system, the base order code for the highest speed service and 1/2 times and 1/4 times the code of the base order in order to provide services of various transmission rates. It consists of extension codes for assigning to low speed services. That is, one code of the basic order can generate two or four extension codes, and the constraints of the extension code assignment are similar to those of the wired resource. For example, extension codes extended from different base codes may not be allocated for one high-speed service, and if one of extension codes extended from a given base code is assigned to another service, Certain base codes cannot be assigned as the base code itself.

On the other hand, the resource allocation constraint of the PCM timeslot or Hadamard code is similarly applied to other resources. Accordingly, the present invention assumes any resource having the above-mentioned resource allocation constraint.

The configuration according to an embodiment of the present invention is as follows. There are N random resources A in the system, and each resource A [0] to A [N-1] consists of four sub-resources A ([n] [0] to [n] [3]). Lose. And it is assumed that three services are provided that require three transmission rates of R0 = 2 × R1 = 4 × R2. In this case, four sub resources must be allocated for the service of the R0 rate, two sub resources must be allocated for the service of the R1 rate, and one sub resource must be allocated for the service of the R2 rate. do. In addition, sub-resources provided for a single service must belong to the same resource (A [n]). When two sub resources are allocated for a given service, they can be allocated only in the form of A [n] [0] and A [n] [1] or A [n] [2] and A [n] [3]. Assume

At this time, if the state of each resource A [0] ~ A [N-1] is STATE [0] ~ STATE [N-1], respectively, if the system repeats allocation and release of resources, STATE [n] on that resource A [n] can be up to 16 ( There are a few cases. At this time, the state STATE [n] of the resource A [n] is any one of s0: '0000' to s15: '1111'. Here, '0' means a state in which the corresponding sub resources A [n] [0] through A [n] [3] are not allocated, and '1' means a state in which the corresponding sub resource is allocated.

In addition, according to the embodiment of the present invention, the following 10 events are defined according to the type when allocation or release of the resource A [n] occurs. The event E0 means an event of allocating one sub resource for a service of the R2 rate. Event E1 refers to an event of allocating two sub-resources for R2 speed service. Event E2 refers to an event of allocating four sub resources for a service of the R0 rate. Event E3 refers to an event in which the service using the first sub-resource A [n] [0] of the resource A [n] is terminated and releases the first sub-resource. Event E4 refers to an event of releasing the second sub-resource after the service using the second sub-resource terminates. Event E5 refers to an event of releasing the third sub-resource after the service using the third sub-resource terminates. Event E6 refers to an event of releasing the fourth sub-resource after the service using the fourth sub-resource terminates. Event E7 terminates the service using the first sub-resource A [n] [0] and the second sub-resource A [n] [1] of resource A [n] to terminate the two sub-resources. It means an event to release. E8 releases the two sub resources because the service using the third sub resource A [n] [2] and the fourth sub resource A [n] [3] of resource A [n] is terminated. It means an event. Event E9 indicates an event in which all sub-resources of resource A [n] that have been allocated after the service at the rate R0 is terminated are released.

In addition, if each state (s1 to s15) of the corresponding resource A [n] is divided into sets based on the number of unassigned sub-As and the serviceable speed, the respective states of the corresponding resource A [n] are as follows. It can be divided into the same six resource sets. That is, the resource set G [0] is a resource set in a state in which all sub-As are not used and can be allocated for the service of the RO speed. At this time, s0 belongs to the resource set G [0]. The resource set G [1] is a resource set of states in which three sub-As are not used and can be allocated to service R1 and R2 rates. In this case, s1, s2, s3, and s4 belong to the resource set G [1]. The resource set G [2] is a resource set of states in which two sub-As are not used and can be allocated to service R1 and R2 rates. At this time, s5 and s6 belong to the resource set G [2]. The resource set G [3] is a resource set of states in which two sub-As are not used and can be allocated for the service of the R2 rate. In this case, s7, s8, s9, and s10 belong to the resource set G [3]. The resource set G [4] is a resource set of states in which one sub-A is not used and can be allocated for the service of the R2 rate. In this case, s11, s12, s13, and s14 belong to the resource set G [4]. Resource set G [5] is a resource set in which all sub-As are not used. S15 belongs to the resource set G [5].

That is, if the resource A [n] is in the state of s0, it belongs to the resource set G [0]. If the resource A [n] is in the state of s1 to s4, it belongs to the resource set G [1]. If [n] is in the states s5 and s6, it belongs to resource set G [2]. If the corresponding resource A [n] is in the states s7 to s10, it belongs to resource set G [3]. If the state of s11 to s14 belongs to the resource set G [4], and if the resource A [n] is to the state of s15, it belongs to the resource set G [5]. In this case, the number of resource states belonging to each resource set is referred to as a resource set count (cnt [0] to cnt [5]).

1 illustrates a state transition table of resource allocation and release according to an embodiment of the present invention in a communication system.

Reference numeral 110 denotes resource allocation, and reference numeral 120 denotes resource release. As shown, in the embodiment of the present invention, resource allocation 110 is defined as event E0, event E1 and event E3. The resource release 112 is defined as an event E3 to an event E9.

At this time, in the state (s0 to s15) of the corresponding resource A [n], when event E0 occurs, the system allocates the first sub-resource A [n] [0] and operation 0A and the second sub Operation 1A for allocating a resource A [n] [1], operation 2A for allocating a third sub-resource A [n] [2], and fourth sub-resource A [n] [3]. May perform operation 3A for assigning.

In addition, in the corresponding state (s0 to s15) of the corresponding resource A [n], when event E1 occurs, the system subsumes the first sub-resource A [n] [0] and the second sub-resource A [n] [ 1]) consecutively assigns 01A, and the third sub-resource A [n] [2] and the fourth sub-resource A [n] [3] are sequentially allocated. have.

On the other hand, reference numeral 114 denotes the state of the resource, the state of the resource 114 is represented by s0 to s15. The resource state 114 is divided into G0 through G5 resource groups based on the number of unassigned sub-As and the serviceable speed. And s1 to s4 belong to resource group G1. S5 and s6 belong to resource group G2, s7 to s10 belong to resource group G3, s11 to s14 belong to resource group G4, and s16 belongs to resource group G5.

At this time, if E0 occurs in the s0 state of the resource A [n], the system performs 0A, that is, allocates the first sub-resource according to the embodiment of the present invention. This causes state s0 to transition to state s1. In this case, the system does not perform operations 1A to 3A for efficient state transition management. In addition, when E1 occurs in the s0 state of the resource A [n], the system performs operation 01A according to the embodiment of the present invention. Also, at this time, the system does not perform 23A operation for efficient state transition management. If E2 occurs in the s0 state of the resource A [n], the system performs the AA operation according to the embodiment of the present invention.

When E0 occurs in the s1 state of the corresponding resource A [n], the system performs 1A according to an embodiment of the present invention, that is, allocates a second sub-resource. This causes state s1 to transition to state s5. However, at this time, the system does not perform operations 2A to 3A in order to minimize resource fragmentation. In addition, when E1 occurs in the s1 state of the resource A [n], the system performs operation 23A according to the embodiment of the present invention. This causes state s1 to transition to s13.

When E0 occurs in the s2 state of the resource A [n], the system performs 0A, that is, allocates the first sub-resource according to the embodiment of the present invention. This causes state s2 to transition to state s5. However, at this time, the system does not perform operations 1A to 3A in order to minimize resource fragmentation. In addition, when E1 occurs in the s2 state of the resource A [n], the system performs operation 23A according to the embodiment of the present invention. This causes state s2 to transition to state s14.

If E0 occurs in the s3 state of the corresponding resource A [n], the system performs 3A, that is, allocates a fourth sub-resource according to the embodiment of the present invention. This causes state s3 to transition to state s6. However, at this time, the system does not perform operations 0A to 2A in order to minimize resource fragmentation. In addition, when E1 occurs in the s3 state of the resource A [n], the system performs operation 01A according to the embodiment of the present invention. This causes state s3 to transition to state s11.

If E0 occurs in the s4 state of the corresponding resource A [n], the system performs 2A according to an embodiment of the present invention, that is, allocates a third sub-resource. This causes state s4 to transition to state s6. However, at this time, the system does not perform operations 0A and 1A in order to minimize resource fragmentation. In addition, when E1 occurs in the s4 state of the resource A [n], the system performs operation 01A according to the embodiment of the present invention. This causes the s4 state to transition to the s12 state.

On the other hand, the state s5 and state s6 of the resource A [n] belong to resource group G2. When E0 occurs in the s5 state, the system performs 2A according to an embodiment of the present invention, that is, allocates a third sub resource. This causes state s5 to transition to state s11. However, at this time, the system does not perform the 3A operation for efficient management of the state transition. If E1 occurs in the s5 state of the resource A [n], the system performs 23A according to the embodiment of the present invention. This causes state s5 to transition to s16.

If E0 occurs in the s6 state, the system performs 0A, that is, allocates the first sub-resource according to the embodiment of the present invention. This causes state s6 to transition to s13. However, at this time, the system does not perform 1A operation for efficient management of state transition. In addition, when E1 occurs in the s6 state, the system performs operation 01A according to the embodiment of the present invention. This causes state s6 to transition to state s15.

The s7 state to the s10 state of the resource A [n] belong to the resource group G3. When E0 occurs in the s7 state, the system performs operation 1A according to an embodiment of the present invention. However, at this time, the system does not perform 0A operation for efficient management of state transition. When E0 occurs in the s8 state, the system performs operation 1A according to an embodiment of the present invention. This causes the s8 state to transition to the s12 state. However, at this time, the system does not perform 2A operation for efficient management of state transition. When E0 occurs in the s9 state, the system performs operation 0A according to an embodiment of the present invention. This causes the s9 state to transition to the s11 state. However, at this time, the system does not perform 3A operation for efficient management of state transition. When E0 occurs in the s10 state, the system performs operation 0A according to an embodiment of the present invention. This causes the s9 state to transition to the s12 state. However, at this time, the system does not perform 2A operation for efficient management of state transition.

The state s11 to state s14 of the resource A [n] belong to resource group G4. When E0 occurs in the s11 state, the system performs operation 3A according to an embodiment of the present invention. When E0 occurs in the s12 state, the system performs operation 2A according to an embodiment of the present invention. When E0 occurs in the s13 state, the system performs operation 1A according to an embodiment of the present invention. When E0 occurs in the s14 state, the system performs operation 0A according to an embodiment of the present invention.

On the other hand, in the case of resource release 112, since the resource A [n] itself or a specific sub-resource of the resource A [n] in which the service is terminated must be released, an embodiment of the present invention provides an event that can be generated. It is defined in detail as E4 to E9. When the events E3 to E9 occur in each state s0 to s15 of the resource A, the system performs the state transition operation as shown in FIG. 1 according to an embodiment of the present invention.

2 is a flowchart illustrating a resource allocation method according to an embodiment of the present invention in a communication system. In FIG. 2, it is assumed that resources in the system are A [0] to A [N-1].

In step 210, the system initializes all resources A [0] ~ A [N-1] to s0. The system then uses the resource group g [0] = {A [0], A [1], ----, A [N-1]}, g [1] = --- g [N-1] = { }. And the system puts cnt [0] = N, cnt [1] = cnt [2] = --- = cnt [N-1] = 0.

In operation 215, the system obtains a group index i_max of a resource having a minimum assignable sub-resource capable of supporting a service of a required speed. For example, if the serviceable service rate is R0 = 2 R1 = 4 If R2 is the required speed of the current service, the group index i_max of the resource having the minimum assignable sub-resource becomes '0', and the resource group becomes g [0]. However, if the current required service rate is R1, the group index of the resource having the minimum assignable sub-resource becomes '2' and the resource group becomes g [2]. In addition, if the current required service rate is R2, the group index of the resource having the minimum assignable sub-resource becomes '4', and the resource group is g [4].

In step 220, the system waits for a service resource allocation request.

In operation 225, when the system requests a service resource allocation of a predetermined rate, in operation 230, the system assigns i_max (eg, '1', '2', and '4') to the variable i according to the requested service rate. Fill in.

In step 235, the system checks whether cnt [i] is greater than '0'. Here, for example, if the required service rate is R2 and i_max is '4', the variable i becomes '4'. And cnt [4] means the number of groups of resources that are not using one sub-resource and can be allocated for the service of the speed of R2. If cnt [4] is greater than '0', g [4]. ] Means that at least one resource has a status value (for example, s10, s11, s13, s14) belonging to the system, the system selects the resource A [n] belonging to g [i] in step 255 and requests the resource. Allocate resources

On the other hand, if the cnt [i] is not greater than '0' in step 235, the system checks whether i is greater than '0' in step 240, and if the i is greater than '0', the system in step 245 Decrease by 1 and perform step 235 again.

That is, in step 235, if cnt [i] is not greater than '0', it means that no resource having the minimum assignable sub-resource capable of supporting the service of the required rate does not exist. In step 245, the index i is decreased by '1' to check the resource group having the next step that can support the service, and then step 235 is performed again.

If the index i is not greater than '0' in step 240, since there is no resource that can support the service of the required speed, the system determines that resource allocation fails in step 250.

On the other hand, in step 235, if cnt [i] of the corresponding reduced index is greater than '0', that is, for example, for a service of the required service R1 rate, the predetermined belonging to the resource group g [1]. If at least one resource A [N] exists, in step 255, the system selects the corresponding resource A [N] belonging to g [i] corresponding to the index i and allocates the requested resource. However, at this time, the system allocates the requested resource in consideration of minimizing resource fragmentation and managing state transition of each resource A [0] to A [N-1]. For example, if the state value of the resource A [n] is '0010', the system performs operation 3A. This causes the state of resource A [n] to transition from '0010' to '0011'. In addition, the resource allocation operation of the system is predetermined as shown in FIG.

In operation 260, the system removes the corresponding A [n] from the resource group g [i] (eg, g [1]) to which the corresponding A [n] belongs and sets the value of cnt [i] to ' 1 'decrease.

In step 265, the system changes the state value of STATE [n] according to the resource allocation for the corresponding resource A [n] (for example, from '0010' to '0011'). The state value change is predetermined as shown in FIG. 1.

In addition, in step 270, the system attaches the corresponding resource A [n] to a new g [i_new] according to the new state value, and increases the value of cnt [i_new] by '1'. The system then performs the control operation from step 220 again.

On the other hand, the resource allocation method according to an embodiment of the present invention in a communication system is as follows. That is, when a specific service is terminated and the specific sub-resource included in the predetermined resource A [n] or the resource A [n] itself is released, the system releases the requested resource in the first step and releases the released resource A [ n is removed from the resource group g [i_old] to which n] belongs, and cnt [i_old] is decreased by '1'. In a second step, the system changes the state value of STATE [n] (eg, from '0011' to '0010') in response to the release of resources for the corresponding resource A [n]. The state value change is predetermined as shown in FIG. 1. In the third step, the system assigns the resource A [n] to the new g [i_new] according to the new state value and increases the value of cnt [i_new] by '1'.

On the other hand, selecting and removing or belonging to the resource A [n] in each resource group g [i] of the system is performed by queuing each group with a linked list. It can be implemented by constructing a structure such as a stack or a stack. In addition, the allocated resources become the new state after subtracting the old state, and the released resources become the remaining state minus the new state. For example, when a service of R1 (32Kbps) rate is newly requested and the state of the corresponding resource A [n] selected by the above method is s4: '0001', the state after resource allocation is s12: '1101'. At this time, the allocated resource becomes A [n] [0] and A [n] [1], that is, ('1100'), which is obtained by subtracting the previous state value ('0001') from the new state value '1101'. Also, for example, if the service at the R2 (16Kbps) rate is terminated and the resource allocated and used by this service was A [n] [2] ('0010'), the state of A [n] is s11: '1110'. Transitions to s5: '1100'. At this time, the released resource becomes the resource A [n] [2] by subtracting the new state value '1100' from the previous state value '1110'.

1 to 2, the resource allocation and release method according to an embodiment of the present invention in a communication system first defines a state of each resource according to whether or not a sub resource is allocated. An embodiment of the present invention defines an event of resource allocation / release, and defines a resource set based on the number of unassigned sub-resources of each resource and the speed at which the service can be performed. In the embodiment of the present invention, when a specific resource is selected at the time of resource allocation or resource release of a corresponding service rate, the resource allocation / release operation is performed in consideration of minimizing resource fragmentation, and the state of the specific resource is performed. Update the value, resource group value and count value. In addition, an embodiment of the present invention defines a group index of the resource having a minimum assignable sub-resource that can support the service of the required speed in order to minimize resource fragmentation, the system at the time of resource selection the group index (i_max) Sequentially checks the resource group for the next step. At this time, the group index of the resource having the minimum assignable sub-resource that can support the service of the required rate is determined according to the number of sub-resources provided in each resource, the type of serviceable rate, and the like.

As described above, in the present invention, even when the number of minimum units of resources has any value other than the above four, the state of each resource can be defined, and the definition of an event and a group can also be defined. Accordingly, the present invention can be effectively used for almost all resource allocation and release, and it can be seen that the present invention can allocate and release resources with minimal fragmentation of resources even when there are special constraints on the allocation scheme.

As described above, the present invention defines the status of each resource according to whether or not the sub-resources are allocated in the communication system, defines the event of resource allocation / release, and the number and number of unallocated sub-resources of each resource. Define a set of resources based on the possible speed. In the present invention, when a specific resource is selected, resource allocation / release is performed in consideration of minimizing resource fragmentation. In this case, the present invention defines a group index of the resource having the minimum assignable sub-resource that can support the service of the required speed, the present invention is the margin of the next step sequentially from the group index (i_max) at the time of resource selection By inspecting the resource group with, there is an advantage that the resource fragmentation can be minimized and efficient resource allocation / release operations can be performed even when there are special resource allocation constraints.

Claims (3)

In the method of allocating and releasing resources in a communication system, Define the status of each resource according to whether sub-resources are allocated or not, define the event of resource allocation / release, and define resource sets based on the number of unallocated sub-resources of each resource and the speed at which they can be serviced. A first step of defining a group index of a resource having a minimum assignable sub-resource capable of supporting a desired rate of service; A second process of first checking a resource group corresponding to the group index, sequentially checking a resource group having a next level, selecting a corresponding resource and allocating a required resource when a request for allocating a service resource at a predetermined rate occurs. and, A third process of releasing a specific sub-resource included in a corresponding resource or the corresponding resource when a request for releasing a service resource at a predetermined rate occurs; And a fourth process of updating a state value of the corresponding resource and an index of a resource set according to the resource allocation or release of the corresponding resource. The group index of resources according to claim 1, wherein the group index of resources having a minimum assignable sub-resource capable of supporting the required rate service is The method of allocating and releasing resources in a communication system, characterized in that it is determined according to the number of sub resources included in each resource and the type of serviceable speed. The method of claim 2, wherein the resource allocation or release operation for the corresponding resource, The resource allocation and release method of the communication system, characterized in that determined in advance by the state transition table according to the state of each resource, resource allocation / release, resource set.