KR20010087488A - Method for allocating bandwidth to the multi-users in a network and computer readable medium therefor - Google Patents

Abstract

PURPOSE: A method for assigning a bandwidth to a plurality of users on a communication network and a recording medium therefor are provided to efficiently assign the bandwidth to a plurality of users who have a maximum and minimum bandwidth requesting amount and use the communication network in the communication network connected with a plurality of links. CONSTITUTION: Each maximum/minimum bandwidth request amount is received from a plurality of users using a communication network connected with a plurality of links(210). A reference value of a suitable allocation bandwidth of a link 1 included in an aggregation L is determined using a bandwidth of the link 1 and a maximum/minimum bandwidth request amount of each user who uses the link 1(220). A link aggregation P having a minimum reference value of the suitable allocation bandwidth is generated(230). A bandwidth of a link included in the aggregation P is allocated and assigned to each user using the link included in the aggregation P with reference to the reference value of the suitable allocation bandwidth and a maximum/minimum bandwidth request amount of each user using the link included in the aggregation P(240). The maximum/minimum bandwidth request amount of each user using the link included in the aggregation P is temporarily as the assigned bandwidth(250). The link included in the aggregation P is removed from the aggregation L, and the aggregation L is updated(260). A size of the aggregation L is checked(270).

Description

Method for allocating bandwidth to a plurality of users on a communication network and a recording medium therefor {Method for allocating bandwidth to the multi-users in a network and computer readable medium therefor}

The present invention relates to a method for allocating bandwidth, and more particularly, to a method for efficiently allocating bandwidth to a plurality of users who use a communication network with maximum and minimum bandwidth requirements in a communication network to which a plurality of links are connected.

The current Internet is based on the best-effort model, which treats all packets equally. The flow control technique based on the Transmission Control Protocol (TCP) used in the Internet operates by refraining transmission to the transmitting end when congestion is detected on the communication network.

However, this best effort model causes a lot of problems as the number of Internet users increases rapidly with the development of communication network technology, especially the World Wide Web (WWW) technology. For example, on the Internet where all users share network resources equally, and where there is no external policy for resource allocation, certain users gain unusually high bandwidth, It can do damage. In this environment, many applications, for example web browsers such as Netscape, take advantage of the best effort model by establishing multiple connections to the web server to obtain as much bandwidth as possible. have.

In addition, best effort models are not easy to ensure quality of service (QoS) for real time applications that require guaranteed bandwidth and latency, for example applications such as real time audio or video. In addition, in the best effort model, it is not easy to ensure adequate quality of service for users who wish to pay an additional fee for a particular quality of service.

In order to provide an optimal Internet service to an increasing number of Internet users, an extensive research on the expansion of network bandwidth, that is, the speed of the Internet, is being conducted. On the other hand, various researches are being conducted to ensure the quality of service by efficiently allocating the limited bandwidth of the communication network to the user.

Among the studies on fair distribution of network bandwidth, a typical allocation policy (allocation policy) is the Max-Min Policy. An example is presented by Bertsekas et al., Which models the case where all users have the same requirements (D. Bertsekas and R. Galager, Data Networks, Prentice Hall, 1992). However, in reality, the requirements of network users cannot be the same, and Bertsekas et al. Has a limitation that it is difficult to accommodate the needs of various users. Another example is Hou et al., Which model a distribution policy that can be used in general when each user has a maximum / minimum transmission rate (Y. Hou, H. Tzeng, and S. Panwar, "A generalized max-min network capacity assignment policy with a simple ABR implementation for an ATM LAN ", Proceedings of IEEE Globecom, 1997). However, the method of Hou et al. Provides only general solutions and does not provide a detailed explanation (application example) of the operation principle of the proposed method. In addition, it does not provide proof of whether the Max-Min policy has been achieved, calculation time, or convergence of calculations.

The technical problem to be solved by the present invention is to solve the above problems, satisfies the maximum / minimum policy within a predetermined time to a plurality of users using the communication network with the maximum and minimum bandwidth requirements in the communication network to which a plurality of links are connected. And a method of allocating bandwidth while providing a recording medium therefor.

1A is a flow diagram of a method for allocating bandwidth to a plurality of users using a particular link with maximum / minimum bandwidth requirements, in accordance with an embodiment of the present invention.

FIG. 1B is a flowchart of a specific method of determining a reference value of an appropriate allocation bandwidth in FIG. 1A.

FIG. 1C is a flowchart of a specific method of allocating bandwidth while satisfying a maximum / minimum bandwidth requirement to each user with reference to the reference value of the appropriate allocation bandwidth in FIG. 1A.

2 is a flowchart illustrating a method of allocating bandwidth to a plurality of users having a maximum / minimum bandwidth requirement in a communication network to which a plurality of links are connected according to an embodiment of the present invention.

In order to solve the above technical problem, a bandwidth allocation method according to one aspect of the present invention is a method for allocating bandwidth to a plurality of users using a specific link on a communication network with maximum and minimum bandwidth requirements, (a) the specific Receiving maximum and minimum bandwidth requirements from each user using the link; (b) using the bandwidth of the specific link and the minimum and maximum bandwidth requirements of each user received in step (a) to determine a reference value of the appropriate allocation bandwidth to properly distribute the bandwidth of the specific link to each user. Doing; And (c) referring to the reference value of the appropriate allocation bandwidth determined in step (b) and the minimum and maximum bandwidth requirements of each user received in step (a), while satisfying the minimum and maximum bandwidth requirements of each user. Allocating and allocating bandwidth of the link to each user.

Further, in step (c), for each user who uses the specific link, (c1) if the maximum bandwidth requirement of the user is smaller than the reference value of the appropriate allocation bandwidth determined in step (b), Allocating a maximum bandwidth requirement of the user; (c2) if the minimum bandwidth requirement of the user is greater than the reference value of the appropriate allocation bandwidth determined in step (b), assigning the minimum bandwidth requirement of the user to the user; And (c3) if the reference value of the appropriate allocation bandwidth determined in step (b) is greater than or equal to the minimum bandwidth requirement of the user and less than or equal to the maximum bandwidth requirement, the bandwidth corresponding to the reference value of the appropriate allocation bandwidth determined in step (b) to the user. It is preferable to include the step of assigning.

In the step (b), the set K of the user using the specific link is set, the bandwidth of the specific link is C, the reference value of an appropriate allocation bandwidth to be allocated to the user belonging to the set K is F, and the set K is set. A set of users whose minimum bandwidth requirement is greater than F among users belonging to set A, and a set of users whose minimum bandwidth requirement is smaller than F among users belonging to set K are set B, (b1) Calculating F by dividing by the size of the set K; (b2) According to F calculated in step (b1), (b21) generates the set A, and is a sum of the difference between the minimum bandwidth requirements of each user belonging to the set A and F calculated in step (b1). Calculating a DA; And (b22) generating the set B and calculating a DB which is the sum of the difference between the F calculated in the step (b1) and the maximum bandwidth requirement of each user belonging to the set B; (b3) comparing the size of the DA and the DB calculated in the step (b21) and the step (b22), and (b31) if the DA calculated in the step (b2) is larger than the DB, the set A in the set K; Removing the users belonging to and reducing the C by the sum of the minimum bandwidth requirements of the users belonging to the set A to update the sets K and C; (b32) if the DA calculated in the step (b2) is smaller than the DB, the user belonging to the set B is removed from the set K, and the C is reduced by the sum of the maximum bandwidth requirements of the users belonging to the set B; Updating the sets K and C; And (b33) when the size of the DA and the DB calculated in the step (b2) is the same or the size of the set K updated in the step (b31) or the step (b32) is 0, the final proper allocation of the F is performed. Determining a reference value of the bandwidth; And (b4) unless F is determined as the reference value of the final optimal allocation bandwidth by step (b33), until (F) is determined as the reference value of the final appropriate allocation bandwidth in step (b33), and repeating steps (b1) to (b3) using the updated sets K and C in step b31) or step (b32).

In addition, the communication network is preferably a communication network providing differentiated services of different quality of service to users through a service of an Internet protocol layer, a communication network supporting ABR service of an ATM network, or a communication network supporting a virtual path of an ATM network. Do.

According to another aspect of the present invention, there is provided a method for allocating bandwidth to a plurality of users having maximum and minimum bandwidth requirements in a communication network to which a plurality of links are connected. Receiving a maximum and minimum bandwidth requirement from each user using a link belonging to the subset of set L, referred to as set L; (b) for each link belonging to the set L, (b1) the bandwidth of the link, using the bandwidth of the link and the minimum and maximum bandwidth requirements received in step (a) of each user using the link; Determining a reference value of an appropriate allocation bandwidth of a corresponding link for appropriately allocating to each user who uses the corresponding link; (c) generating a set P which is a set of links having a minimum reference value of the proper allocation bandwidth determined in step (b) among the links belonging to the set L, and (c1) belongs to the set P determined in step (b) The minimum of each user using a link belonging to the set P, with reference to the reference value of the appropriate allocation bandwidth of the link and the minimum and maximum bandwidth requirements of each user using the link belonging to the set P received in step (a). Allocating and allocating bandwidth of a link belonging to the set P to each user using a link belonging to the set P while satisfying a maximum bandwidth requirement; And (c2) temporarily changing the minimum and maximum bandwidth requirements of each user who uses the link to the bandwidth allocated in step (c1); (d) updating the set L by removing a link belonging to the set P from the set L; And (e) if the set L updated in step (d) is not 0, the set L updated in step (d) until the size of set L updated in step (d) becomes 0. And repeating steps (b) to (d) using the temporary and minimum bandwidth requirements of the user whose bandwidth is allocated in step (c1) using the temporarily changed value in step (c2). It is characterized by.

In order to solve the above other technical problem, a computer-readable recording medium in one aspect of the present invention (a) has a maximum and minimum bandwidth requirements from a plurality of users using a specific link on the communication network with the maximum and minimum bandwidth requirements Receiving; (b) using the bandwidth of the specific link and the minimum and maximum bandwidth requirements of each user received in step (a) to determine a reference value of the appropriate allocation bandwidth for properly allocating the bandwidth of the specific link to each user. Making; And (c) referring to the reference value of the appropriate allocation bandwidth determined in step (b) and the minimum and maximum bandwidth requirements of each user received in step (a), while satisfying the minimum and maximum bandwidth requirements of each user. And recording a program for executing by the computer the step of allocating and allocating the bandwidth of the link to each user.

According to another aspect of the present invention, a computer-readable recording medium includes (a) when a set of a plurality of links connected in a communication network is called a set L, a link belonging to the subset of the set L with maximum and minimum bandwidth requirements Receiving maximum and minimum bandwidth requirements from each user using; (b) for each link belonging to the set L, (b1) the bandwidth of the link, using the bandwidth of the link and the minimum and maximum bandwidth requirements received in step (a) of each user using the link; Determining a reference value of an appropriate allocation bandwidth of a corresponding link for appropriately allocating to each user who uses the corresponding link; (c) generating a set P which is a set of links having a minimum reference value of the proper allocation bandwidth determined in step (b) among the links belonging to the set L, and (c1) belongs to the set P determined in step (b) The minimum of each user using a link belonging to the set P, with reference to the reference value of the appropriate allocation bandwidth of the link and the minimum and maximum bandwidth requirements of each user using the link belonging to the set P received in step (a). Allocating and allocating bandwidth of a link belonging to the set P to each user using a link belonging to the set P while satisfying a maximum bandwidth requirement; And (c2) temporarily changing the minimum and maximum bandwidth requirements of each user who uses the link to the bandwidth allocated in step (c1); (d) updating the set L by removing a link belonging to the set P from the set L; And (e) if the set L updated in step (d) is not 0, the set L updated in step (d) until the size of set L updated in step (d) becomes 0. And repeating steps (b) to (d) using the temporarily changed value in step (c2) of the user whose bandwidth is allocated in step (c1). Recording a program for execution.

Hereinafter, with reference to the accompanying drawings will be described in detail a preferred embodiment of the configuration and operation of the present invention.

The present invention proposes a method of allocating an optimal bandwidth to each user in one network. That is, each user is based on the capacity of each of the interconnected links in a network and the requirements (maximum / minimum bandwidth requirements) of each user (using a connection made up of a specific set of links). We present an optimal way of distributing bandwidth.

Attempts are being made to ensure QoS for each user on the Internet operating in the best effort, and one of the methods is differentiated service (DiffServ; Differentiated Service) standardized by the Internet Engineering Task Force (IETF). to be. DiffServ models the case where users passing through a specific node have the lowest and highest data rates. Through the Internet protocol layer service, the entire network guarantees the lowest data rate of each user, while a certain form is available for users exceeding the maximum data rate. It will put a constraint on it. In order to provide such a differentiated service, a network supporting DiffServ calculates an optimal allocation bandwidth by synthesizing the requirements of all users, distributes network resources, and applies network access control accordingly. The present invention can be a method for optimal bandwidth distribution for users who have different maximum / minimum bandwidth requirements (ie, different QoS) in a DiffServ domain and use a communication network connected to a specific node or a plurality of nodes. .

In addition, the present invention may be a method for optimally allocating bandwidth to each user in an available bit rate (ABR) service of an Asynchronous Transfer Mode (ATM) network. ABR is an ATM service category, and it is a method of economically supporting a user having vague requirements (hereinafter, a user means a connection actually used by the user). A user using the ABR service can present a Peak Cell Rate (PCR) and Minimum Cell Rate (MCR) for establishing an ABR session, and change his or her input rate. In addition, the present invention can be utilized as a method for setting the capacity for the virtual path (virtual path) for users having the maximum / minimum bandwidth requirements in the ATM network.

First, a method of allocating bandwidth to users who use the link with a maximum / minimum bandwidth requirement (hereinafter referred to as the first embodiment), limited to a specific link on a communication network, will first be described. Will be described next.

1A is a flow diagram of a method for allocating bandwidth to a plurality of users using a particular link with maximum / minimum bandwidth requirements, in accordance with an embodiment of the present invention. FIG. 1B is a flowchart illustrating a specific method of determining a reference value of an appropriate allocation bandwidth in FIG. 1A, and FIG. 1C is a bandwidth while satisfying a maximum / minimum bandwidth requirement for each user with reference to the reference value of an appropriate allocation bandwidth in FIG. 1A. This is a flowchart of a specific method of distributing.

First, a respective maximum / minimum bandwidth requirement is received from a plurality of users who wish to use a particular link on the communication network (hereafter link l) (step 110). Here, it is assumed that the bandwidth requirements of each user are different from each other, and the present invention provides a method for efficiently allocating bandwidth to users requiring different QoS.

Next, using the bandwidth of link l and the maximum / minimum bandwidth requirement of each user received in step 110, a reference value of the appropriate allocation bandwidth of link l is determined (step 130). A specific method of determining the reference value of the appropriate allocation bandwidth of link l is shown in FIG. 1B.

For convenience of description, the variables / constants used in FIG. 1B will be defined first. The set of users of link l is set Kl, the capacity (bandwidth) of link l is Cl, the minimum bandwidth requirement of user i belonging to set Kl is Ni, the maximum bandwidth requirement of user i belonging to set Kl is Mi, and the users belong to set Kl. The user set of Ni> Fl is Al, and the user set of Mi <Fl among users belonging to the set Kl is defined as Bl. Subsequently, a method of calculating Fl, which is a reference value of the appropriate allocation bandwidth of link l, using the variable / constant is described.

First, initial values of Kl and Cl are set (step 132).

Next, Fl is calculated by dividing Cl by the size (number of elements) of the set Kl (step 134).

Next, a series of steps for determining the suitability of Fl calculated in step 134 is performed (steps 136 to 146).

First, the set Al is generated among the users belonging to the set Kl by referring to Fl calculated in step 134, and the sum of the difference between the minimum bandwidth requirements of each user belonging to the set Al and the fl calculated in step 134 (refer to DA). Is calculated (step 136). Here, the size of the set Al may be 0 (DA = 0) or may include only one user. In this case, the process of calculating the difference or the process of calculating the sum does not need to be performed.

Next, the set Bl is generated among the users belonging to the set Kl with reference to Fl, and the sum (referred to as DB) of the difference between the fl calculated in step 134 and the maximum bandwidth requirement of each user belonging to the set Bl is calculated ( Step 136). Here, the size of the set Bl may be 0 (DB = 0) or may include only one user, in which case it is not necessary to perform the process of calculating the difference or the sum of the differences. As already explained. In addition, in FIG. 1B, steps 136 and 138 are sequentially shown, but this is for convenience of description and the execution order of steps 136 and 138 may be changed.

Next, compare the sizes of the DAs and DBs calculated in steps 136 and 138, and if DA> DB, remove the users belonging to the set Al from the set Kl, and determine Cl as the minimum bandwidth requirement of the users belonging to the set Al. Reduce the sum, update the set Kl and Cl, and if DA <DB, remove the user belonging to the set Bl from the set Kl, reduce the Cl by the sum of the maximum bandwidth requirements of the users belonging to the set Bl, and set Kl And Cl are updated (step 140). However, if the size of Al or Bl is not plural, there is no need to perform a summing process.

If DA = DB (same size), Fl calculated in step 134 is determined as a reference value of the final appropriate allocation bandwidth (step 142, step 146). Here, the execution order of steps 140 and 142 comparing the sizes of DA and DB, and the checking order of DA> DB or DA <DB in step 140 may be changed.

Next, if DA = DB, the size of the updated set Kl is checked in step 140. If the set Kl is an empty set, Fl calculated in step 134 is determined as a reference value of the final appropriate allocation bandwidth (step 142, Step 144, step 146).

Finally, if DA = DB and Kl are not empty, return to step 134 until the reference value of the final allocation bandwidth of the final link l is determined using Kl and Cl updated in step 140. Repeat as follows.

It will be understood by those of ordinary skill in the art that the above-described process of calculating Fl, which is a reference value of the appropriate allocation bandwidth of link l, is completed within a repetition number corresponding to the size of initial Kl. . For each iteration, at least one user will be removed from the set Kl.

Up to now, referring to FIG. 1B, a method of determining a reference value of the appropriate allocation bandwidth of link l has been described. Subsequently, referring to FIG. 1C, the reference value of the appropriate allocation bandwidth of link l and the maximum / minimum of each user are calculated in step 130. With reference to the bandwidth requirements, a specific method of allocating bandwidth of link l to each user will be described (step 150).

If the maximum bandwidth requirement of the specific user is smaller than the reference value of the appropriate allocation bandwidth of link l calculated in step 130, the maximum bandwidth requirement of the user is allocated to the corresponding user (step 152).

If the minimum bandwidth requirement of the particular user is greater than the reference value of the appropriate allocation bandwidth of link l calculated in step 130, the minimum bandwidth requirement of the user is allocated to the corresponding user (step 154).

If the reference value of the appropriate allocation bandwidth of the link l calculated in step 130 is greater than or equal to the minimum bandwidth requirement of the specific user and is less than the maximum bandwidth requirement, the bandwidth corresponding to the reference value of the appropriate allocation bandwidth of the link l calculated in step 130 to the user. (Step 156). Although FIG. 1C illustrates steps 152 to 156 sequentially, the execution order of each step may be changed.

Steps 152 to 156 are repeated for each user to allocate bandwidth of link l to all users (step 158).

Those skilled in the art will understand that the bandwidth allocation method described so far is intuitively satisfying the Max-Min policy for all users.

The first embodiment has been described so far, and the second embodiment will now be described in which the first embodiment is extended to a communication network to which a plurality of links are connected. 2 is a flowchart illustrating a method of allocating bandwidth to a plurality of users having a maximum / minimum bandwidth requirement in a communication network to which a plurality of links are connected according to an embodiment of the present invention.

First, a respective maximum / minimum bandwidth requirement is received from a plurality of users using a communication network to which a plurality of links are connected (step 210). Here, the set of links connected in the communication network is defined as L. Of course, the bandwidth requirements of each user using a link belonging to the subset of set L are different as in the first embodiment.

Next, for each link l belonging to the set L, the reference value of the appropriate allocation bandwidth of the link l is determined using the bandwidth of the link l and the maximum / minimum bandwidth requirements of each user using the link l received in step 110. (Step 220). The specific method of determining the reference value of the appropriate allocation bandwidth for one link is the same as in the first embodiment. That is, step 220 repeats the content described in FIG. 1B for each link belonging to the set L. FIG.

Next, among the links belonging to the set L, a set of links (hereinafter, set P) having a minimum reference value of the appropriate allocation bandwidth determined in step 220 is generated (step 230). That is, the set P corresponds to a set of bottleneck links on the communication network. Here, a plurality of links belonging to the set P means that the reference values of appropriate allocation bandwidths of the links belonging to the set P are the same.

Next, the bandwidth of the link belonging to the aggregation P is aggregated by referring to the reference value of the appropriate allocation bandwidth calculated in step 220 of each link belonging to the aggregation P and the maximum / minimum bandwidth requirement of each user who uses the link belonging to the aggregation P. The distribution is allocated to each user who uses the link belonging to P (step 240). If there is only one link belonging to the set P, step 240 may be as described in FIG. 1C. In addition, even when a plurality of links are included in the set P, since the reference value of the appropriate allocation bandwidth calculated in step 220 of the link belonging to the set P is the same, all links belonging to the entire set P are regarded as one abstract link. It will be understood by those skilled in the art that the method described in FIG. 1C may be extended.

Next, temporarily change the maximum and minimum bandwidth requirements of each user who uses the link belonging to the set P to the bandwidth allocated in step 240 (step 250). This is because in the embodiment of the present invention, when the maximum and minimum bandwidth requirements are the same, the bandwidth requirement is always assigned to the corresponding user, so that the bandwidth of the already allocated user is kept constant regardless of the subsequent iteration process. .

Next, the set L is updated by removing the link belonging to the set P from the set L (step 260), and the size of the set L is checked (step 270). If set L is empty, it means that bandwidth allocation is complete for all users, and if set L is not empty, then the maximum and minimum bandwidth requirements for that user temporarily changed in step 250 until set L is empty. Steps 220 to 260 are repeated using the updated set L in.

It will be understood by those skilled in the art that the second embodiment described so far also satisfactorily satisfies the Max-Min policy for all users.

Embodiments of the present invention can be written as a program executable in a computer system. In addition, the program can be read from a computer readable recording medium having recorded such a program and executed in a general-purpose digital computer system. Such recording media include magnetic storage media (e.g., ROM, floppy disk, hard disk, etc.), optical reading media (e.g., CD-ROM, DVD, etc.) and carrier waves (e.g., transmission over the Internet). Media is included.

So far, the present invention has been described with reference to the preferred embodiment (s). Those skilled in the art will appreciate that the present invention can be implemented in a modified form without departing from the essential features of the present invention. Therefore, the disclosed embodiments should be considered in descriptive sense only and not for purposes of limitation. The scope of the present invention is shown in the appended claims rather than the foregoing description, and all differences within the scope will be construed as being included in the present invention.

According to the present invention, bandwidth can be efficiently allocated to a plurality of users who use a communication network with maximum and minimum bandwidth requirements in a communication network to which a plurality of links are connected while satisfying a maximum / minimum policy. In addition, the bandwidth allocation method according to the present invention is characterized in that the bandwidth can be allocated within a predetermined time to each user requiring a different QoS.

The present invention is representative of the communication network of the DiffServ domain, the network supporting the ABR service of the ATM network, and the network supporting the virtual path of the ATM network, which provide differentiated services with different quality of service to users through the service of the Internet protocol layer. Can be applied as

Claims (18)

A method of allocating bandwidth to a plurality of users using a particular link on a communication network with maximum and minimum bandwidth requirements, (a) receiving maximum and minimum bandwidth requirements from each user using the particular link; (b) using the bandwidth of the specific link and the minimum and maximum bandwidth requirements of each user received in step (a) to determine a reference value of the appropriate allocation bandwidth to properly distribute the bandwidth of the specific link to each user. Doing; And (c) the specific link while satisfying the minimum and maximum bandwidth requirements of each user with reference to the reference value of the appropriate allocation bandwidth determined in step (b) and the minimum and maximum bandwidth requirements of each user received in step (a). Allocating and allocating a bandwidth of the bandwidth to each user. The method of claim 1, wherein step (c) comprises: For each user using the particular link, (c1) if the maximum bandwidth requirement of the user is less than the reference value of the appropriate allocation bandwidth determined in step (b), assigning the maximum bandwidth requirement of the user to the user; (c2) if the minimum bandwidth requirement of the user is greater than the reference value of the appropriate allocation bandwidth determined in step (b), assigning the minimum bandwidth requirement of the user to the user; And (c3) if the reference value of the appropriate allocation bandwidth determined in step (b) is greater than or equal to the minimum bandwidth requirement of the user and is less than the maximum bandwidth requirement, provide the user with a bandwidth corresponding to the reference value of the appropriate allocation bandwidth determined in step (b). And allocating the bandwidth. According to claim 1, wherein step (b), Set a set of users using the specific link to set K, a bandwidth of the specific link to C, a reference value of an appropriate allocation bandwidth to allocate to a user belonging to the set K, and a minimum bandwidth requirement among the users belonging to the set K; When a set of users larger than F is set A, a set of users whose minimum bandwidth requirement is smaller than F among users belonging to set K is set B, (b1) calculating F by dividing C by the size of the set K; (b2) according to F calculated in step (b1), (b21) generating the set A and calculating DA, which is a sum of a minimum bandwidth requirement of each user belonging to the set A and F calculated in the step (b1); And (b22) generating the set B and calculating a DB which is the sum of the difference between the F calculated in the step (b1) and the maximum bandwidth requirement of each user belonging to the set B; (b3) by comparing the size of the DA and DB calculated in the step (b21) and (b22), (b31) if the DA calculated in the step (b2) is larger than the DB, the user belonging to the set A is removed from the set K, and the C is reduced by the sum of the minimum bandwidth requirements of the users belonging to the set A, Updating the sets K and C; (b32) if the DA calculated in the step (b2) is smaller than the DB, the user belonging to the set B is removed from the set K, and the C is reduced by the sum of the maximum bandwidth requirements of the users belonging to the set B; Updating the sets K and C; And (b33) If the size of the DA and the DB calculated in the step (b2) is the same or the size of the set K updated in the step (b31) or the step (b32) is 0, the final appropriate allocation bandwidth is F. Determining a reference value of; And (b4) unless F is determined as the reference value of the final optimal allocation bandwidth by step (b33), until (F) is determined as the reference value of the final appropriate allocation bandwidth in step (b33); Or repeating steps (b1) to (b3) using the updated sets K and C in step (b32). The method according to any one of claims 1 to 3, The communication network is a communication network providing differentiated services having different quality of service to users through the service of the Internet protocol layer, And the user uses the differentiated service. The method according to any one of claims 1 to 3, The communication network is a communication network supporting the ABR service of an ATM network, And the user is a user who uses the ABR service. The method according to any one of claims 1 to 3, The communication network is a communication network supporting a virtual path of an ATM network, And the user is a user who uses the virtual path. A method of allocating bandwidth to a plurality of users having maximum and minimum bandwidth requirements in a communication network to which a plurality of links are connected, (a) receiving a maximum and minimum bandwidth requirement from each user using a link belonging to the subset of the set L when the set of the plurality of links connected in the communication network is the set L; (b) for each link belonging to the set L, (b1) appropriately allocating the bandwidth of the link to each user using the link, using the bandwidth of the link and the minimum and maximum bandwidth requirements received in step (a) of each user using the link. Determining a reference value of an appropriate allocation bandwidth of a corresponding link for the network; (c) generating a set P which is a set of links having a minimum reference value of the appropriate allocation bandwidth determined in the step (b) among the links belonging to the set L, (c1) refer to the reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in step (b) and the minimum and maximum bandwidth requirements of each user who uses the link belonging to the set P received in step (a) Distributing and allocating the bandwidth of the link belonging to the set P to each user using the link belonging to the set P while satisfying the minimum and maximum bandwidth requirements of each user using the link belonging to the set P; And (c2) temporarily changing the minimum and maximum bandwidth requirements of each user using the link to the bandwidth allocated in step (c1); (d) updating the set L by removing a link belonging to the set P from the set L; And (e) If the size of the set L updated in step (d) is not 0, the set L updated in step (d) until the size of the set L updated in step (d) becomes 0; The minimum and maximum bandwidth requirements of the user to whom the bandwidth is allocated in step (c1) include repeating steps (b) to (d) using the temporarily changed value in step (c2). Characterized by a bandwidth allocation method. The method of claim 7, wherein the step (c1), For each user using a link belonging to the set P, (c11) if the maximum bandwidth requirement of the user is less than a reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in the step (b), assigning the maximum bandwidth requirement of the user to the corresponding user; (c12) if the minimum bandwidth requirement of the user is greater than a reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in the step (b), assigning the minimum bandwidth requirement of the user to the corresponding user; And (c13) if the reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in step (b) is greater than or equal to the minimum bandwidth requirement of the corresponding user and is less than or equal to the maximum bandwidth requirement, the set user determined in step (b) And allocating a bandwidth corresponding to a reference value of an appropriate allocation bandwidth of a link belonging to the link. The method of claim 7, wherein step (b1), The minimum bandwidth requirement among the users belonging to the set K is set K, the bandwidth of the link is set to C, the reference value of the appropriate allocation bandwidth of the link to be allocated to the users belonging to the set K, and the minimum bandwidth requirement among the users belonging to the set K. When a set of users larger than F is set A, a set of users whose minimum bandwidth requirement is smaller than F among users belonging to set K is set B, (b11) calculating F by dividing C by the size of the set K; (b12) according to F calculated in the step (b11), (b121) generating the set A and calculating DA, which is a sum of a minimum bandwidth requirement of each user belonging to the set A and F calculated in the step (b11); And (b122) generating the set B and calculating a DB which is the sum of the difference between the F calculated in the step (b11) and the maximum bandwidth requirement of each user belonging to the set B; (b13) by comparing the size of the DA and DB calculated in the step (b121) and (b122), (b131) If the DA calculated in the step (b12) is larger than the DB, the user belonging to the set A is removed from the set K, and the C is reduced by the sum of the minimum bandwidth requirements of the users belonging to the set A, Updating the sets K and C; (b132) If the DA calculated in the step (b12) is smaller than the DB, the user belonging to the set B is removed from the set K, and the C is reduced by the sum of the maximum bandwidth requirements of the users belonging to the set B; Updating the sets K and C; And (b133) If the size of the DA and the DB calculated in the step (b12) is the same or the size of the set K updated in the step (b131) or the step (b132) is 0, the F is the final value of the link. Determining a reference value of an appropriate allocation bandwidth; And (b4) If F is not determined as the reference value of the final optimal allocation bandwidth of the link by step (b133), in step (b133) the F may be determined as the reference value of the final appropriate allocation bandwidth of the link. And repeating steps (b11) to (b13) using the updated sets K and C in step (b131) or step (b132). The method according to any one of claims 7 to 9, The communication network is a communication network providing differentiated services having different quality of service to users through the service of the Internet protocol layer, And the user uses the differentiated service. The method according to any one of claims 7 to 9, The communication network is a communication network supporting the ABR service of an ATM network, And the user is a user who uses the ABR service. The method according to any one of claims 7 to 9, The communication network is a communication network supporting a virtual path of an ATM network, And the user is a user who uses the virtual path. (a) receiving maximum and minimum bandwidth requirements from a plurality of users using specific links on the communication network with maximum and minimum bandwidth requirements; (b) using the bandwidth of the specific link and the minimum and maximum bandwidth requirements of each user received in step (a) to determine a reference value of the appropriate allocation bandwidth to properly distribute the bandwidth of the specific link to each user. Doing; And (c) the specific link while satisfying the minimum and maximum bandwidth requirements of each user with reference to the reference value of the appropriate allocation bandwidth determined in step (b) and the minimum and maximum bandwidth requirements of each user received in step (a). A computer-readable recording medium having recorded thereon a program for executing by a computer a step of allocating and allocating a bandwidth of each user. The method of claim 13, wherein step (c) comprises: For each user using the particular link, (c1) if the maximum bandwidth requirement of the user is less than the reference value of the appropriate allocation bandwidth determined in step (b), assigning the maximum bandwidth requirement of the user to the user; (c2) if the minimum bandwidth requirement of the user is greater than the reference value of the appropriate allocation bandwidth determined in step (b), assigning the minimum bandwidth requirement of the user to the user; And (c3) if the reference value of the appropriate allocation bandwidth determined in step (b) is greater than or equal to the minimum bandwidth requirement of the user and is less than the maximum bandwidth requirement, provide the user with a bandwidth corresponding to the reference value of the appropriate allocation bandwidth determined in step (b). A computer-readable recording medium having recorded thereon a program comprising: assigning. The method of claim 13, wherein step (b) comprises: Set a set of users using the specific link to set K, a bandwidth of the specific link to C, a reference value of an appropriate allocation bandwidth to allocate to a user belonging to the set K, and a minimum bandwidth requirement among the users belonging to the set K; When a set of users larger than F is set A, a set of users whose minimum bandwidth requirement is smaller than F among users belonging to set K is set B, (b1) calculating F by dividing C by the size of the set K; (b2) according to F calculated in step (b1), (b21) generating the set A and calculating DA, which is a sum of a minimum bandwidth requirement of each user belonging to the set A and F calculated in the step (b1); And (b22) generating the set B and calculating a DB which is the sum of the difference between the F calculated in the step (b1) and the maximum bandwidth requirement of each user belonging to the set B; (b3) by comparing the size of the DA and DB calculated in the step (b21) and (b22), (b31) if the DA calculated in the step (b2) is larger than the DB, the user belonging to the set A is removed from the set K, and the C is reduced by the sum of the minimum bandwidth requirements of the users belonging to the set A, Updating the sets K and C; (b32) if the DA calculated in the step (b2) is smaller than the DB, the user belonging to the set B is removed from the set K, and the C is reduced by the sum of the maximum bandwidth requirements of the users belonging to the set B; Updating the sets K and C; And (b33) If the size of DA and DB calculated in step (b2) is the same or the size of set K updated in step (b31) or step (b32) is 0, the final optimal allocation bandwidth of F is obtained. Determining a reference value of; And (b4) unless F is determined as a reference value of the final appropriate allocation bandwidth by step (b33), until (F) is determined as a reference value of the final appropriate allocation bandwidth in step (b33); And repeating steps (b1) to (b3) using the updated sets K and C in step (b32) or step (b32). . (a) receiving a maximum and minimum bandwidth requirement from each user who uses a link belonging to the subset of the set L with the maximum and minimum bandwidth requirements when the set L of a plurality of links connected in the communication network is set L; (b) for each link belonging to the set L, (b1) appropriately allocating the bandwidth of the link to each user using the link, using the bandwidth of the link and the minimum and maximum bandwidth requirements received in step (a) of each user using the link. Determining a reference value of an appropriate allocation bandwidth of a corresponding link for the network; (c) generating a set P which is a set of links having a minimum reference value of the appropriate allocation bandwidth determined in the step (b) among the links belonging to the set L, (c1) refer to the reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in step (b) and the minimum and maximum bandwidth requirements of each user who uses the link belonging to the set P received in step (a) Distributing and allocating the bandwidth of the link belonging to the set P to each user using the link belonging to the set P while satisfying the minimum and maximum bandwidth requirements of each user using the link belonging to the set P; And (c2) temporarily changing the minimum and maximum bandwidth requirements of each user using the link to the bandwidth allocated in step (c1); (d) updating the set L by removing a link belonging to the set P from the set L; And (e) If the size of the set L updated in step (d) is not 0, the set L updated in step (d) until the size of the set L updated in step (d) becomes 0; The minimum and maximum bandwidth requirements of the user to whom the bandwidth is allocated in step (c1) may be repeated by the computer by repeating steps (b) to (d) using the temporarily changed value in step (c2). A computer-readable recording medium that records a program for execution. The method of claim 16, wherein step (c1), For each user using a link belonging to the set P, (c11) if the maximum bandwidth requirement of the user is less than a reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in the step (b), assigning the maximum bandwidth requirement of the user to the corresponding user; (c12) if the minimum bandwidth requirement of the user is greater than a reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in the step (b), assigning the minimum bandwidth requirement of the user to the corresponding user; And (c13) if the reference value of the appropriate allocation bandwidth of the link belonging to the set P determined in step (b) is greater than or equal to the minimum bandwidth requirement of the corresponding user and is less than or equal to the maximum bandwidth requirement, the set user determined in step (b) And allocating a bandwidth corresponding to a reference value of an appropriate allocation bandwidth of a link belonging to the computer. The method of claim 16, wherein step (b1), The minimum bandwidth requirement among the users belonging to the set K is set K, the bandwidth of the link is set to C, the reference value of the appropriate allocation bandwidth of the link to be allocated to the users belonging to the set K, and the minimum bandwidth requirement among the users belonging to the set K. When a set of users larger than F is set A, a set of users whose minimum bandwidth requirement is smaller than F among users belonging to set K is set B, (b11) calculating F by dividing C by the size of the set K; (b12) according to F calculated in the step (b11), (b121) generating the set A and calculating DA, which is a sum of a minimum bandwidth requirement of each user belonging to the set A and F calculated in the step (b11); And (b122) generating the set B and calculating a DB which is the sum of the difference between the F calculated in the step (b11) and the maximum bandwidth requirement of each user belonging to the set B; (b13) by comparing the size of the DA and DB calculated in the step (b121) and (b122), (b131) If the DA calculated in the step (b12) is larger than the DB, the user belonging to the set A is removed from the set K, and the C is reduced by the sum of the minimum bandwidth requirements of the users belonging to the set A, Updating the sets K and C; (b132) If the DA calculated in the step (b12) is smaller than the DB, the user belonging to the set B is removed from the set K, and the C is reduced by the sum of the maximum bandwidth requirements of the users belonging to the set B; Updating the sets K and C; And (b133) If the size of the DA and the DB calculated in the step (b12) is the same or the size of the set K updated in the step (b131) or the step (b132) is 0, the F is the final value of the link. Determining a reference value of an appropriate allocation bandwidth; And (b4) If F is not determined as the reference value of the final optimal allocation bandwidth of the link by step (b133), in step (b133) the F may be determined as the reference value of the final appropriate allocation bandwidth of the link. And repeating steps (b11) to (b13) using the updated sets K and C in step (b131) or (b132) until the computer recorded the program. Readable media.