LINK CAPACITY SHARING FOR THROUGHPUT-BLOCKING OPTIMALITY

Abstract: The invention concerns an efficient strategy for sharing link bandwidth in a mixed rigid-elastic traffic environment, as well as a strategy for sharing bandwidth among elastic traffic flows. The idea according to the invention is to share the link bandwidth among rigid and elastic traffic by dividing the link bandwidth into a first common part (C_COM) for elastic as well as rigid traffic and a second part (C_ELA) dedicated for elastic traffic. Subsequently, one or more admission control parameters (N_ELA) for the elastic traffic are determined in order to restrict the number of elastic traffic flows simultaneously present on the link. In particular, by formulating a call-level model for elastic traffic and determining a maximum number (N_ELA) of admissible elastic traffic flows based on call-level constraints for the elastic traffic related to throughput and/or blocking, the so-called throughput-to-blocking trade-off for the elastic traffic can be fully considered.

Description: LINK CAPACITY SHARING FOR THROUGHPUT-BLOCKING OPTIMALITY TECHNICAL FIELD OF THE INVENTION The present invention generally relates to the field of communication networks, and in particular to link capacity sharing and link bandwidth allocation in such networks. BACKGROUND Many communication networks of today support so-called elastic traffic such as the "best effort" services provided in Internet Protocol (IP) based networks or the Available Bit Rate (ABR) traffic in ATM networks. Elastic traffic is typically established for the transfer of a digital object, such as a data file, a Web page or a video clip for local playback, which can be transmitted at any rate up to the limit imposed by the link capacity. Web browsing on the Internet in particular is a good and representative example of elastic traffic. Here, the "elasticity" of the traffic is apparent as the user-perceived throughput (normally given in transmitted bits or bytes per time unit) when downloading for example a web page fluctuates in time depending on the overall system load. The services delivered by IP based networks and the Internet in particular are called "best effort", because the networks generally do not provide any guarantee of the quality of service (QoS) received by the applications. The IP network only makes a best effort to provide the requested service. For instance, if an application requests the network to deliver an IP packet from one end-point to another, the network normally can not say what the delay through the network will be for that packet. In fact, the network does not even guarantee that the packet will be delivered at all. Therefore, teπninals connected to an IP network have to handle packet losses and excessive packet delay situations. Such situations occur when there are too many applications simultaneously using the network resources. These congestion situations have a non-zero probability in IP based networks, because IP networks do not exercise call admission control (CAC). In other words, IP networks do not restrict the number of simultaneously connected users, and consequently if there are too many users utilizing the network resources there will be congestion and packet losses. However, with the advent of real-time traffic and QoS requirements in IP networks, there is a need for exercising call admission control (CAC) in order to restrict the number of connections simultaneously present in the network. An important aspect of call or connection admission control is that new calls arriving to the network may be rejected service in order to protect in-progress calls. In general, CAC algorithms such as those commonly in use for rigid traffic in conventional ATM networks provide a basic means to control the number of users in the network, thereby ensuring that admitted users get the bandwidth necessary to provide the QoS contracted for. Consequently, a CAC algorithm represents a trade-off between the blocking probability for new calls and the provided throughput for in-progress calls. In other words, the more users that the CAC algorithm admits into the network (which reduces the blocking probability) the smaller the provided throughput per-user becomes, since a greater number of users will share the total bandwidth, and vice versa. Recent research has indicated that it is meaningful to exercise call admission control even for elastic traffic, because CAC algorithms provide a means to prevent TCP sessions from excessive throughput degradations. The issue of applying CAC for elastic connections, and thereby providing a minimum throughput for Transmission Control Protocol (TCP) connections in the Internet has been addressed by Massoulie and Roberts in references [1-3]. Here, bandwidth is allocated to different users according to some fairness criteria. It has been recognized by Gibbens and Kelly in references [4-5] that there is an intimate relationship between throughput and blocking probabilities for elastic traffic, and that this trade-off is connected to the issue of charging. It has also been shown by Feng et al. in reference [6] that providing a minimum rate guarantee for elastic services is useful, because in that case the performance of the TCP protocol can be optimized. As the Internet evolves from a packet network supporting a single best effort service class towards an integrated infrastructure for several service classes, there is also a growing interest in devising bandwidth sharing strategies, which meet the diverse needs of peak-rate guaranteed services and elastic services. Similarly, modern ATM networks need to support different service classes such as Constant Bit Rate (CBR) and Available Bit Rate (ABR) classes, and it is still an open question how to optimally share the link capacity among the different service classes. In general, the issue of bandwidth sharing, in the context of dynamically arriving and departing traffic flows and especially when users have different throughput and blocking requirements, is known from the classical multi-rate circuit switched framework to be an extremely complex problem. SUMMARY OF THE INVENTION The present invention overcomes these and other drawbacks of the prior art arrangements. It is a first object of the invention to devise a link capacity/bandwidth sharing strategy that meets the diverse needs of rigid and elastic services in a mixed rigid-elastic traffic environment. In particular, it is desirable to treat the issues of bandwidth sharing and blocking probabilities for elastic traffic in a common framework. In this respect, it is a second object of the present invention to provide a link capacity sharing mechanism that considers the throughput-to-blocking trade-off for elastic traffic. Specifically, it would be beneficial to develop and utilize a link capacity sharing algorithm that optimizes the throughput-to-blocking trade-off. It is a further object of the invention to provide an appropriate call-level model of a transmission link carrying elastic traffic and to apply the call-level model for dimensioning the link bandwidth sharing for throughput-blocking optimality. These and other objects are met by the invention as defined by the accompanying patent claims. The invention concerns an efficient strategy for sharing link bandwidth in a mixed rigid-elastic traffic environment, as well as a strategy for sharing bandwidth among elastic traffic flows. Briefly, the idea according to the invention is to share link capacity in a network by dividing the link capacity into a first common part for elastic as well as rigid (non- elastic) traffic and a second part dedicated for elastic traffic based on received network traffic inputs. Subsequently, one or more admission control parameters for the elastic traffic are determined based on the division of link capacity as well as received network traffic inputs. The division of link capacity generally serves to share the link capacity between rigid and elastic traffic, and in particular to reserve a part of the link capacity to elastic traffic. Preferably, a nmiimum required capacity of the common part relating to rigid traffic is determined given a maximum allowed blocking probability for the rigid traffic. In this way, a certain grade of service (GoS) on call level is guaranteed for the rigid traffic on the link. The admission control parameter(s) determined for elastic traffic generally serves to restrict the number of elastic traffic flows simultaneously present on the link. In particular, by formulating a call-level model for elastic traffic and deternrining a maximum number of admissible elastic traffic flows based on call-level constraints for the elastic traffic related to throughput and/or blocking, the throughput-to-blocking trade-off is fully considered. In this respect, the invention is capable of optimally allocating link bandwidth among elastic connections in the sense that blocking probabilities are niiiώnized under throughput constraints, or the other way around, in the sense that the throughput is maximized under blocking constraints. In this way, the invention provides maximum link bandwidth utilization, either in terms of minimum blocking under throughput constraints or maximum throughput under blocking constraints. Accordingly, an efficient strategy for sharing bandwidth in a mixed rigid-elastic traffic environment is provided. In particular, the bandwidth sharing algorithm guarantees a maximum blocking for rigid traffic as well as a ntinimum throughput and/or a maximum blocking for elastic traffic. An important technical advantage of the invention is its ability to meet the diverse needs of rigid traffic and elastic traffic. Another advantage of the invention is the ability to provide predictable quality of service for both the user and the network provider while at the same time ensuring high network provider revenue. By considering only the elastic traffic of the overall traffic in a mixed rigid-elastic traffic environment, or alternatively by reducing the common bandwidth part to zero so that the entire link is reserved for elastic traffic, the overall link capacity sharing mechanism is reduced to the deteirriination of one or more admission control parameters for elastic traffic. Admission control for requested new elastic connections can then be exercised based on such admission control parameter(s). In particular, by minimizing the blocking probabilities with respect to the number of admissible elastic connections under given throughput constraints for the elastic traffic, excessive blocking probabilities are avoided, while ensuring a given user throughput. Another aspect of the invention concerns the application of a call-level model of a link supporting elastic traffic, for dimensioning the link bandwidth sharing for throughput- blocking optimality in an admission-control enabled IP network. In particular, an elastic traffic flow is modeled as having a bandwidth that fluctuates between a minimum bandwidth and peak bandwidth during the holding time of the traffic flow. Furthermore, the elastic traffic is associated with at least one of a minimum accepted throughput and a maximum accepted blocking probability. A further aspect of the invention concerns a computational method for determining a Markov chain steady state distribution that is particularly advantageous for large state spaces. The Markov chain describes the dynamics of a link carrying a number of traffic classes including non-adaptive elastic traffic, and the computational method provides a good initial approximation of the steady state distribution based on Markov chain product form calculations. Other aspects or advantages of the present invention will be appreciated upon reading of the below description of the embodiments of the invention. BRIEF DESCRIPTION OF THE DRAWINGS The invention, together with further objects and advantages thereof, will be best understood by reference to the following description taken together with the accompanying drawings, in which: Fig. 1 is a schematic diagram of a communication network according to a preferred embodiment of the invention; Fig. 2 is a schematic flow diagram of the overall link capacity sharing algorithm applied in a mixed rigid-elastic IP traffic environment according to a preferred embodiment of the invention; Fig. 3 is a schematic block diagram of pertinent parts of an IP router according to a preferred embodiment of the invention; Fig. 4 is a Markov chain state space diagram for an illustrative transmission link system; Fig. 5 is a graph illustrating the mean and the variance of the throughput of adaptive elastic flows as a function of their service time for an illustrative example of a transmission link system; Fig. 6 is a schematic diagram illustrating the elastic cut-off parameters that fulfill given QoS requirements for an illustrative example of a link system; and Fig. 7 is a schematic flow diagram of the overall link capacity sharing algorithm for a mixed CBR-ABR traffic environment according to a preferred embodiment of the invention. DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION Throughout the drawings, the same reference characters will be used for corresponding or similar elements. Throughout the disclosure, the terms connection and flow are used more or less interchangeably for what is traditionally denoted as a call. System overview of an illustrative communication network For a better understanding, a general overview of an illustrative commumcation network according to a preferred embodiment of the invention will now be made with reference to Fig. 1. Fig. 1 is a schematic diagram of a communication network according to a preferred embodiment of the invention. The communication network is here illustrated as an IP based network, but may be in the form of an ATM network or any other type of network or combination of networks capable of supporting elastic traffic. The commumcation network 10 is based on a number of interconnected IP routers 20 (ATM switches in the case of an ATM network) forming the core network. The core network is accessed by different users 30 (computers, servers, etc.) through access points, with a so called user-network interface (UNI) being defined for the interaction between the IP routers and the user equipment. Typically, a plurality of users are connected to some form of aggregation point, such as an access router (AR) 40, which acts an intermediate between the end-users and the core network. Link capacity sharing, also referred to as bandwidth control in the network context, and packet scheduling normally reside on the network side of the UNI, within the IP routers 20. In particular, the bandwidth control and packet scheduling are preferably implemented at the output port side of the routers 20. The overall bandwidth control has two main functions. First, the bandwidth control serves to share the bandwidth between different traffic classes. Second, the bandwidth control serves to restrict the number of simultaneously active connections within the traffic classes. The latter function is hereinafter referred to as call admission control (CAC), and is normally exercised at the input port side of the IP routers 20, where connections are accepted or rejected in accordance with some CAC algorithm. The overall bandwidth control algorithm, including the CAC algorithm, may for example be implemented as hardware, software, firmware or any suitable combination thereof. The user-network contract (UNC) is typically defined at the UNI. The UNC usually indicates the QoS to which the user is entitled and also the specification of the traffic, which the user may inject into the network, along with supplementary data. The supplementary data may include, for example, the time of day during which the user has access to a particular service, etc. For instance, the UNC may specify that no more than 1 % of the user-injected IP packets (or ATM cells) may be lost by the network and that the user may send in 10 Mbits during any one second through the UNI. The CAC part of the bandwidth control algorithm may use the UNC information of multiple users to provide a basic means to control the number of simultaneously present users in the network, thereby ensuring that the admitted users receive the bandwidth required to provide the contracted QoS. The CAC algorithm represents a trade-off between blocking probabilities and the provided throughput; the more users that the CAC algorithm admits into the network (which reduces the blocking probability), the smaller the provided throughput per user becomes because a greater number of users will share the network bandwidth. CAC may be realized by means of the classical signaling exchange known for example form conventional communication circuit-switched networks. However, if the majority of the elastic flows in the network are short, such as for many TCP flows on the Internet today, the introduction of classical signaling exchange to perform admission control may result in large overheads. Therefore, an on-the-fly decision to accept or discard the first packet of a flow as suggested in reference [3] would be more beneficial. For this reason, a mechanism based for example on the existing Resource Reservation Protocol (RSVP) is provided for keeping track of the identities of currently active flows, and for classifying packets according to these identities as and when they arrive. To determine whether a flow is new or not, it is sufficient to compare its identifier with that of the flows on a special list of active flows. If no packet was received for a certain flow within a given time-out period, the flow would be removed from the list of active flows. Admission control is preferably realized by determining a maximum number of admissible flows based on the prevailing traffic situation in the system, and setting the size of the list of active flows accordingly. If the list is full, a new flow will be rejected. Otherwise, the flow will be accepted and entered into the list. Link capacity sharing algorithm - the D? network example In the following, a link capacity sharing algorithm according to a preferred embodiment will be described with reference to the particular application of an IP based network carrying rigid as well as elastic traffic. First, a proper call-level traffic model needs to be formulated. Unfortunately, the application of the classical multi-rate call-level models for management of elastic traffic, such as best effort traffic in IP networks or ABR traffic in ATM networks, is eveiything but straightforward. For example, it is not possible to associate elastic traffic with a constant bandwidth. Instead, the bandwidth occupied by elastic traffic flows fluctuates in time depending on the current load on the link and the scheduling and rate control algorithms applied in the network nodes. The notion of blocking, when applied to elastic traffic flows, is not as straightforward as for rigid traffic, because an arriving elastic flow might get into service even if at the arrival instant there is no bandwidth available. Besides, for many services, the actual residency time of an elastic flow depends on the throughput actually received by the elastic flow. Multi-class model of a transmission link for mixed rigid-elastic traffic In the following, an example of a feasible Markovian model of a transmission link serving both peak-bandwidth assured (rigid or non-elastic) and elastic traffic classes is formulated. For simplicity and clarity, only a single rigid traffic class and two elastic traffic classes are considered. It should be noted that the model as well as the accompanying link sharing algorithm can be extended to more general cases, and of course even simpler cases. The system under consideration comprises a transmission link of capacity C, which by way of example can be regarded as an integer number in some suitable bandwidth unit, say Mbps. In this example, calls arriving at the link generally belong to one of the following three traffic classes: • Class 1 - Rigid traffic class flows, characterized by their peak bandwidth requirement b l5 flow arrival rate λ,_ and departure rate μ x . • Class 2 - Adaptive elastic class flows, characterized by their peak bandwidth requirement b 2 , minimum bandwidth requirement b 2 min , flow arrival rate ^ and departure rate μ 2 . Although the bandwidth occupied by adaptive elastic flows may fluctuate as a function of the link load, their actual holding time is not influenced by the received throughput throughout their residency in the system. This is the case for instance with an adaptive video codec, which, in case of throughput degradation decreases the quality of the video images and thereby occupies less bandwidth. • Class 3 - Non-adaptive elastic class flows, characterized by their peak bandwidth requirement b 3 , minimum bandwidth requirement b 3 m , flow arrival rate λ 3 and ideal departure rate μ 3 . The ideal departure rate is experienced when the peak bandwidth is available. The real instantaneous departure rate is proportional to the bandwidth of the flows. We denote the actual bandwidth allocated (reserved) to a flow of class-2 and class-3 in a given system state with b 2 r and b 3 r , both of which vary in time as flows arrive and depart. We will also use the quantity r mιn = b, 1 "" 1 / b ; (for i=2 or i=3) associated with elastic flows with minimum bandwidth requirements. One may think of a non-adaptive elastic class flow as one that upon arrival has an associated amount of data to transmit (W) sampled from an exponentially distributed — ^x service requirement, with distribution G(x) = 1 - e μ3 ,which in the case when the peak bandwidth b 3 is available during the entire duration of the flow gives rise to an exponentially distributed service time with mean 1/ μ 3 . Since the free capacity of the link fluctuates in time according to the instantaneous number of flows in service, the bandwidth given to the non-adaptive elastic flows may drop below the peak bandwidth requirement, in which case the actual holding time of the flow increases. All three types of flows arrive according to independent Poisson processes, and the holding time for the rigid and adaptive flows are exponentially distributed. As we will see, the moments of the holding time of the non-adaptive flows can be determined using the theory of Markov reward processes. In short, two types of elastic traffic are considered. Elastic traffic is associated with both a peak and a minimum bandwidth requirement, and allowed into service only as long as the πiinimum bandwidth requirement is fulfilled. The two elastic traffic classes primarily differ in terms of how their residency time depends on the acquired throughput. To ensure a given QoS of the different elastic classes (that, in general, differ in their peak and rninimum bandwidth, i.e. b 2 ≠ b 3 , b 2 mm ≠ b 3 m ) we need to establish some policy, which generally governs the bandwidth sharing among the different elastic classes. For this reason, we define the following general bandwidth sharing rules between the elastic classes. The following presentation concerns only two elastic classes, but it extends naturally to more than two elastic classes. • If there is enough bandwidth for all flows to get their respective peak bandwidth demands, then class-2 and class-3 flows occupy b 2 and b 3 bandwidth units, respectively. • If there is a need for bandwidth compression, i.e. nι b + n 2 -b 2 + n 3 -b 3 > C, then the bandwidth compression of the elastic flows is such that r 2 = r 3 , where r 2 = b 2 7b 2 and, r 3 = b 3 7b 3 , as long as the minimum rate constraint is met for both elastic classes (i.e. b 2 mιn / b 2 < r 2 < 1 and b 3 π,m / b 3 < r 3 < 1). • If there is still need for further bandwidth compression, but either one of the two elastic classes does not tolerate further bandwidth decrease (i.e. r, is already b I m "7 b, for either i = 2 or i = 3) at the time of the arrival of a new flow, then the service class which tolerates further compression decreases equally the bandwidth occupied by its flows, as long as the minimum bandwidth constraint is kept for this traffic class. Three underlying assumptions of the above exemplary model are noteworthy. First of all, it is assumed that both types of elastic flows are greedy, in the sense that they always occupy the maximum possible bandwidth on the link, which is the smaller of their peak bandwidth requirement (b 2 and b 3 , respectively) and the equal share (in the above sense) of the bandwidth left for elastic flows by the rigid flows (which will depend on the link allocation policy used). Second, it is assumed that all elastic flows in progress share proportionally equally (i.e. the r s are equal) the available bandwidth among themselves, i.e. the newly arrived elastic flow and the in-progress elastic flows will be squeezed to the same r, value. This assumption, as we will see, provides a quite "fair" resource sharing among the elastic flows. To have different elastic traffic classes with significantly different QoS this assumption needs to be modified. If a newly arriving flow decreased the elastic flow bandwidth below b 2 mm and b 3 m (i.e. both elastic classes are compressed to their respective minima), that flow is not admitted into the system, but it is blocked and lost. Arriving rigid as well as elastic flows are allowed to "compress" the in-service elastic flows, as long as the minimum bandwidth constraints are kept. As a third point, the model assumes that the rate control of the elastic flows in progress is ideal, in the sense that an infinitesimal amount of time after any system state change (i.e. flow arrival and departure) the elastic traffic sources readjust their current bandwidth on the link. While this is clearly an idealizing assumption, the buffers at the IP packet layer could be made large enough to absorb the IP packets until TCP throttles the senders. The fact that the model assumes immediate source rate increase whenever possible make the formcoming throughput and blocking calculations conservative rather than optimistic. It is intuitively clear that the residency time of the non-adaptive elastic flows in this system depends not only on the amount of data they want to transmit, but also on the bandwidth they receive during their holding times, and vice versa, the amount of data transmitted through an adaptive elastic flow depends on the received bandwidth. In order to specify this relationship we define the following quantities: • θ 2 (t) and θ 3 (t) defines the instantaneous throughput of adaptive and non- adaptive flows, respectively, at time t. For example, if there are n l5 n 2 and n 3 rigid, adaptive, and non-adaptive flows, respectively, in the system at time t, the instantaneous throughputs for adaptive and non-adaptive flows are min(b 2> (C-njbi- n 3 r 3 b 3 )/n 2 ) and min(b 3 , (C-n^ - n 2 r 2 b 2 )/n 3 ), respectively. Note that θ 2 (t) and θ 3 (t) are discrete random variables for any t≥O. • θ t = - rθ 2 (τ)dτ defines the throughput of an adaptive flow having a holding time equal to t. • θ = H 0 τ dF(τ) = μ 2 JT θ τ e _μ2τ dτ (random variable) defines the throughput of an adaptive flow, where F(t) is the exponentially distributed holding time. • T x = infϊ| fθ 3 (τ)dτ ≥ xj (random variable) gives the time it takes for the system to transmit x amount of data through an elastic non-adaptive flow. • Θ x = x/T x defines the throughput of an non-adaptive flow during the transmission of x data units. Note that θ x is a continuous random variable. • θ = J^ § x dG(x) = μ 3 / b 3 ζ θ x e ~x μ3 b3 dx (random variable) defines the throughput of an non-adaptive flow, where the amount of transmitted data is exponentially distributed with parameter μ 3 /b 3 . Although a number of general bandwidth sharing rules have been defined above, a more specific link capacity sharing policy, especially one that considers the diverse requirements of rigid and elastic traffic, still needs to be presented. Link capacity sharing algorithm According to the invention, the Partial Overlap (POL) link allocation policy, known from reference [7] describing the POL policy for simulative analysis in the classical multi-rate circuit switched framework, is adopted and modified for a traffic environment that includes elastic traffic. According to the new so-called elastic POL policy, the link capacity C is divided into two parts, a common part C C0M for rigid as well as elastic traffic and a dedicated part C^, which is reserved for the elastic flows only, such that C = C C0M + C ELA . Furthermore, admission control parameters, one for each elastic traffic class present in the system, are introduced into the new elastic POL policy. In this particular example, N EL2 denotes the admission control parameter for adaptive elastic flows and N EL3 denotes the admission control parameter for non-adaptive elastic flows. Each admission control parameter stands for the maximum number of admissible flows of the corresponding elastic traffic class. The admission control parameters are also referred to as cut-off parameters, since as long as the maximum number of simultaneous elastic flows of a certain class are present on the link, new elastic flows will be rejected; a form of cut-off. Under the considered elastic POL policy, the number (n l 5 n 2 , n 3 ) of flows in progress on the link is subject to the following constraints: Nπa-bz™ + N EL3 .b 3 < C ELA (2) n 2 < N EL2 (3) n 3 < N EL3 (4) In (1) the elastic flows are protected from rigid flows. In (2-4) the maximum number of elastic flows is limited by three constraints. Expression (2) protects rigid flows from elastic flows, while (3-4) protect the in-progress elastic flows from arriving elastic flows. The new elastic POL policy is fully deteimined by the division of the link capacity, specified by C C0M , and the admission control parameters N EL2 , N EL3 . These parameters are referred to as the output parameters of the system. The performance of the elastic POL policy can be tuned by the output parameters, and in particular, it has been realized that the setting of the output parameters C C0M , N EL2 and N EL3 , allows for a tuning of the throughput-to-blocking trade-off for the elastic traffic classes. With respect to the throughput-to-blocking trade-off for elastic traffic, the invention is generally directed towards the provision of a high link bandwidth utilization under one or more call-level constraints that are related to at least one of elastic throughput and elastic blocking probability. According to a preferred embodiment of the invention, the link capacity sharing algorithm aims at setting the output parameters of the elastic POL policy in such a way as to minimize call blocking probabilities B 2 and B 3 for elastic flows, while being able to take into account a blocking probability constraint (GoS) for the rigid flows as well as πύnimum throughput constraints for the elastic flows. The throughput constraints for the elastic flows are introduced because it has been recognized that there is a minimum acceptable throughput below which the users gain no actual positive utility. Therefore, the rigid traffic class is associated with a maximum accepted call blocking probability B^" 3 *, and the elastic adaptive and elastic non-adaptive traffic classes are associated with minimum accepted throughputs θ mm and θ mιn , respectively. Preferably, the throughput constraints are formed as constraints on the probability that the user-perceived throughput during transfer of certain amount of data drops below a given threshold. Such a performance measure is easier for the user to verify than the traditional fairness criteria discussed in references [1-3]. Although the blocking probabilities for elastic traffic are being minimized, it is nevertheless normally advisable, although not necessary, to have a worst-case guarantee of the call blocking for elastic traffic, and associate also the two elastic traffic classes with maximum allowed blocking probabilities 2 max and B 3 max . In this case, the traffic input parameters of the system are the set of arrival rates (λ l 5 λ^, λ 3 ) and departure rates (μ μ 2 , μ 3 ) obtained from the network, the bandwidths (b, , b 2 , b 3 ), the minimum elastic bandwidth demands (V™, b , the blocking probability constraints (B,""* or the whole set of B,""*, B 2 πax and B 3 max ) and the elastic throughput constraints ( O^ and θ mιn ). The departure rate for non-adaptive class can be estimated under the assumption that the bandwidth of the non-adaptive flows equals b 3 . The parameters and performance measures associated with the rigid traffic class and the two elastic traffic classes are summarized in Table I below. Table I The problem of determining the output parameters of the elastic POL policy under blocking and throughput constraints is outlined below with reference to Fig. 2, which is a schematic flow diagram of the overall link capacity sharing algorithm according to a preferred embodiment of the invention. In the first step 101, the required input parameters, such as current arrival and departure rates, bandwidth requirements as well as the constraints imposed on the traffic, are provided. In step 102, the GoS (call blocking) requirement for rigid traffic is guaranteed by the proper setting of C C0M . In particular, we determine the minimum required capacity of C C0M for rigid flows that guarantees the required blocking probability B 1 max : min{C C0M : B x < ^} (5) where B ! is the blocking probability of rigid flows. For example, the well-known Erlang-B formula can be used to estimate such a value of C C0M based on arrival and departure rates and peak bandwidth requirement for the rigid traffic as inputs. In addition, a maximum number N C0M of admissible rigid flows can be determined based on the Erlang-B analysis and used for admission control of the rigid traffic. Next, we have to determine a maximum number of elastic flows (N EL2 , N EL3 ) that can be simultaneously present in the system at the same time as the required throughput and blocking requirements are fulfilled. It is intuitively clear that if the maximum number N EL2 of adaptive elastic flows is increased, the blocking probability B 2 of adaptive elastic flows decreases and the throughput decreases as well. Unfortunately, changing N EL2 affects both the blocking probability B 3 and throughput of non-adaptive elastic flows and vice- versa. In this particular embodiment, the link capacity sharing algorithm aims at minimizing the blocking probabilities of the elastic traffic classes under throughput-threshold constraints. To accomplish this, the invention proposes an iterative procedure, generally defined by steps 103-107, for tuning the cut-off parameters so that the throughput-threshold constraints are just fulfilled, no more and no less. First, in step 103, initial values of the cut-off parameters are estimated. Next, the performance of the system is analyzed (step 104) with respect to elastic throughputs. In particular, the throughputs θ and θ offered in the system controlled by the initial values of the cut-off parameters are analyzed (step 104) and related (step 105) to the throughput-threshold constraints θ mιn and Q mn . If the offered throughputs are too low, then the cut-off parameters are reduced (step 106), increasing the blocking probabilities and also increasing the throughputs. On the other hand, if the offered throughputs are higher than the throughput-thresholds, then the cut-off parameters can be increased (step 107) so that the blocking probabilities (as well as the throughputs) are reduced. In this way, by iteratively repeating the steps 104, 105 and 106/107, the blocking probabilities can be reduced to a minimum, while still adhering to the throughput constraints. Once the constraints are fulfilled to a satisfactory degree, the algorithm outputs (step 108) the parameters C COM , (C ELA ), (N COM ), N EL2 , N EL3 for use in controlling the actual bandwidth sharing of the considered transmission link. Naturally, the steps 101 to 108 are repeated in response to changing traffic conditions so as to flexibly adapt the bandwidth sharing to the prevailing traffic situation. In general, the cut-off parameters have to be reduced to fulfill the throughput constraints. On the other hand, as the aim is to minimize the elastic blocking probabilities, and as it is advisable to have a worst-case guarantee of the blocking probabilities for elastic traffic, the cut-off parameters must at the same time be as high as possible, and at least high enough to fulfill the worst-case blocking constraints. Depending on the model parameters and the given bounds, it may be the case that all the constraints can not be satisfied at the same time, which means that the link is overloaded with respect to the GoS requirements. Fig. 3 is a schematic block diagram of pertinent parts of an IP router (or an ATM switch) in which a link capacity sharing algorithm according to the invention is implemented. The IP router 20 is associated with an input link and an output link. The router 20 has a control unit 21, a CAC unit 22, an output port buffer 23 for rigid traffic, an output port buffer 24 for elastic traffic, and an output port scheduler 25. The control unit 21 is preferably, although not necessarily, realized as software running on a computer system. The software may be written in almost any type of computer language, such as C, C + + , Java or even specialized proprietary languages. In effect, the link capacity algorithm is mapped into a software program, which when executed on the computer system produces a set of output control parameters C_ELA, C_COM, N_ELA, N_COM in response to appropriate traffic input parameters received from the network and the UNCs by conventional means. The N_ELA, N_COM parameters represents the cut-off parameters for rigid traffic and elastic traffic, respectively. In the example of Fig. 3, only a single elastic traffic class is considered, and hence only a single cut-off parameter N_ELA for elastic traffic is produced by the control unit 21. The cut-off parameters are forwarded to the CAC unit 22, which accepts or rejects new flows based on the forwarded cut-off parameters. For each requested new flow, the traffic class of the flow is determined so that admission control can be exercised based on the relevant cut-off parameter. IP packets belonging to accepted rigid flows (restricted by N_COM) are forwarded to the output port buffer 23 for subsequent scheduling by the output port scheduler 25. In the same way, IP packets belonging to accepted elastic flows (restricted by N_ELA) are forwarded to the output port buffer 24. The C_ELA, C_COM parameters are forwarded from the control unit 21 to the output port scheduler 25. The output port scheduler 25 represents the bandwidth of the output link, and the actual bandwidth representation used in the traffic scheduling is determined by the C_ELA, C_COM parameters. In the output port scheduler 25, the bandwidth of the output link is divided into a common part C_COM, and a dedicated part C_ELA reserved for elastic traffic only. In scheduling IP packets, the output port scheduler 25 can use only the common bandwidth part C_COM for IP packets from the output port buffer 23 for rigid flows. For IP packets from the output port buffer 24 for elastic flows on the other hand, the scheduler 25 can use both the dedicated bandwidth part C_ELA and the common bandwidth part C_COM. In this way, the output port output port scheduler 25 decides how many IP packets that can be sent on the output link per time unit and traffic class. Analysis of throughput and blocking probability measures of elastic flows The throughput constraints used in the evaluation step 105 (Fig. 2) may for example be constraints on the average throughput, where the cut-off parameters fulfills the throughput constraints if: E( θ ) > θ mιn , E(θ ) ≥ θ mm (6) where E stands for the expected value. To make a plausible interpretation of this type of constraints, let us assume that the distribution of θ is fairly symmetric around E(θ). In other words, the median of θ is close to E(θ). In this case, the probability that an elastic flow obtains less bandwidth than θ"™ is around 0.5. However, users often prefers more informative throughput constraints, and an alternative constraint may require that the throughput of adaptive and non-adaptive flows are greater than θ mιn and θ mιn with predetermined probabilities (l-ε 2 ) and (l-ε 3 ), respectively, independent of the associated service requirements (x) or holding times (t): Pr(θ t > θ.) > (l-ε 2 ), Pr(θ x > θ mm ) > (l-ε 3 ) (7) The worst-case constraints on the elastic blocking probabilities can simply be expressed as: B 2 ≤ B 2 max , B 3 < B 3 max (8) In order to obtain the elastic throughput measures (step 104) and possibly also the elastic blocking measures for given values of the cut-off parameters so as to enable evaluation (step 105) against the given constraints, the steady state distribution of a Markov chain describing the dynamics of the mixed rigid-elastic traffic needs to be determined. As implied in connection with the formulation of the multi-class model above, the system under investigation can be represented as a Continuous Time Markov Chain (CTMC), the state of which is uniquely characterized by the number of flows of the different traffic classes (n n 2 , n 3 ). It is clear that in order to obtain the performance measures of the system we have to determine the CTMC's generator matrix Q and its steady state distribution P = {p { } , where P τ • Q = 0 and T. Pj = 1. The notions of a generator matrix and a steady state distribution of a Markov chain are considered well known to the skilled person. For a general introduction to loss networks, Markov theory and the general stochastic knapsack problem, reference is made to [8], and especially pages 1-69 thereof. For given values of the parameters C C0M , N EL2 , N EL3 , the set of triples (n l5 n 2 , n 3 ) that satisfies the constraints of the elastic POL policy given by (1-4) constitute the set of feasible states of the system denoted by S. The cardinality of the state space can be determined as: #S = CQOM , (N EL2 + 1) . (N EL3 + 1) (9) i It is easy to realize that the generator matrix Q possesses a nice structure, because only transitions between "neighboring states" are allowed in the following sense. Let q^ denote the transition rate from state i to state j. Then, taking into account the constraints (1-4) on the number of flows in the system defined by the elastic POL policy, the non-zero transition rates between the states are: qy k+ = k k = 1, 2, 3 (10) where i 1+ = ^ + 1, n 2 , n 3 ) when i = (n l t n 2 , n 3 ); i k+ and i k . (k = 1 , 2, 3) are defined similarly. Expression (10) represents the state transitions due to a call arrival, while (11) and (12) represent transitions due to call departures. The quantity defined in (12) denotes the total bandwidth of the non-adaptive flows when the system is in state i. The generator matrix Q of the CTMC is constructed based on the transition rates defined in (10-12). For illustrative purposes, let us consider a small system with a rigid class, an adaptive elastic class and a non-adaptive elastic class, where the link capacity C =7. For simplicity, assume a division of the link capacity such that n, = l is kept fixed, i.e. the available bandwidth for elastic flows is 6 bandwidth units. Furthermore, bj = l , b 2 =3 and b 3 =2. The elastic flows are characterized by their minimum accepted bandwidths, which here are set to b 2 mιn = 1.8 and b 3 mιn =0.8. Setting the cutoff parameters to N EL2 =2 and N EL3 =3, gives rise to 12 feasible states as illustrated in the Markov chain state space diagram of Fig. 4. There are 5 (gray) states where at least one of the elastic flows is compressed below the peak bandwidth specified by b 2 and b 3 . The states are identified by the number of active connections (n 1? n 2 , n 3 ). The values below the state identifiers indicate the bandwidth compression of the adaptive and non-adaptive elastic traffic (r 2 , r 3 ). The state (1 , 2, 3) is the only one where the bandwidth compression of the adaptive class and the non-adaptive class differs due to different minimum bandwidth requirements (r 2 mιn =0.6, r 3 mιn =0.4). Different numerical solutions can be used to obtain the steady state distribution of a so-called multidimensional Markov chain. Direct methods such as the Gaussian elimination method compute the solution in a fixed number of operations. However, when considering the size of the state space for practically interesting cases, i.e. large state spaces in the order of 10 4 or higher, the computational complexity of the direct methods is usually unacceptable. Therefore, an iterative method, such as the biconjugate gradient method applied here, is much more feasible for the steady state analysis. The biconjugate gradient method is also detailed in reference [9]. The computation time of an iterative method depends on factors such as the speed of convergence and the complexity of each iteration step. The computation time is also highly dependent on the initial guess. A good initial guess will significantly reduce the overall computation time. For this reason, according to the invention, a heuristic direct method is applied for calculating a fairly close initial guess to be applied in the iterative method. Some special multidimensional Markov chains exhibit a so called product form solution, which means that the steady state probability of state (i,j) can be efficiently determined in product form as f(i)-g(j) instead of h(i,j). Unfortunately, due to the occasional reduction of the bandwidth (and corresponding departure rate) of the non-adaptive elastic flows, the CTMC of the studied system does not exhibit the nice properties of reversibility and product form solution, but the proposed initial guess used for the subsequent iterative numerical procedure is calculated as if the Markov chain exhibited product form. In other words, the initial form of the steady state distribution of a Markov chain describing a traffic system that includes non- adaptive elastic traffic is determined based on Markov chain product form calculations, and applied in an iterative steady state analysis method. The fact that only non-adaptive elastic flows disturb the reversibility is utilized, and the Markov chain that describes the number of rigid and adaptive elastic flows in the system is reversible, and p(n,,n 2 ) = 2 « , i= E 0 3 P( n ι > n 2 »i) > ( n ι » n 2 ) e S is obtained from: p'(0,0) = 1 (13) λ λ p * (m > n 2 ) = p * (n r l,n 2 1 = p * (n,_,n 2 -l) ^— (14) n 1 - μ l n 2 - μ 2 « p / („n l 5 n, 2 \) = P ^ * (nι * , n 2 ) n (15) ∑ P (a,b) (a.b)eS where the p * (n l 5 n 2 ) unnormalized steady state probabilities are auxiliary variables of the iterative method. From the steady state distribution of the rigid and adaptive flows (p(n ! ,n 2 )), the overall steady state behavior (p(n ! ,n 2 ,n 3 )) is obtained by fixing the number of rigid flows and assuming that the obtained Markov chain is reversible, even though this is not the case. This assumption allows us to evaluate an initial guess for the iterative method as follows. For all possible fixed values of n x (n, =i): p 0,0) = 1 (16) p . (,ι., „n 2 ,n „ 3 ) v _ = P * (i> n - l , n 3 ) • λ 2 + P * (i, n 2 , n 3 - 1) • 3 (17) n 2 - μ 2 + n 3 - μ 3 ■ r 3 ∑ p'( ) p(i, nι ,n 2 ) = p' fcn, ,!^) a s . (18) ∑ P (ι,a, b) (a,b)eS In other words, we group states with common n l5 n 2 parameters, summing up their probabilities, to obtain a new 2-dimensional Markov chain. The obtained 2- dimensional Markov chain exhibits product form, and its steady state distribution is calculated using equations (13-15). Next, we "share" the probability of the state groups among the individual states that define a state group using equations (16-18). The steady state distribution of traffic classes other than the non-adaptive traffic class is calculated as if there was no non-adaptive traffic in the system, and then state probabilities are calculated under the assumption of equilibrium between incoming and outgoing traffic of one of the other traffic classes and the non-adaptive elastic traffic class. In the present example, the steady state distribution of the rigid traffic class and the adaptive elastic traffic class is calculated as if there was no non- adaptive elastic traffic in the system, and state probabilities are determined assuming that the incoming and outgoing adaptive and non-adaptive elastic traffic are in equilibrium. It should though be understood that equations (13-18) can be adapted to a variety of applications, for example traffic systems with several rigid traffic classes but only a single elastic traffic class. It should also be understood that the above procedure for calculating an initial approximation of a steady state distribution is generally applicable to any multi- dimensional Markov chain and can be adapted to different applications. The obtained initial approximation of the steady state distribution is used as a good initial guess for an iterative method, such as the biconjugate gradient based method, which improves the initial guess step-by-step to an appropriate accuracy. Based on the steady state distribution of the CTMC, the call blocking probabilities can be calculated as: B k = ∑ p, , k = l, 2, 3 (19) ieS,ik+«S The calculation of the average throughput of the adaptive and non-adaptive elastic flows is also quite straightforward once the steady state distribution of the CTMC is determined: E(θ) (21) Thus, the blocking probability constraints in (5) and (8) as well as the average throughout constraints in (6) can be evaluated. Unfortunately, it is much harder to check the throughput threshold constraints in (7), since neither the distribution nor the higher moments of θ t and θ x can be analyzed based on the steady state distribution of the above studied Markov chain. Hence, a new analysis approach is applied. The throughput threshold constraint on adaptive elastic flows can be checked based on the distribution of θ t and the throughput threshold constraint on non-adaptive elastic flows can be checked based on the distribution of T x , because: Pr(θ x > θ mιn ) = Pr(x/T x > θ mn ) = Pr(T * < x e mn ) (22) Since it is computationally to hard to evaluate the distribution of T x and θ t for realistic models, but there are effective numerical methods to obtain their moments, we check the throughput threshold constraint by applying a moment based distribution estimation method as disclosed in reference [10] and summarized in Table II below. In Table II, μ„ denotes the «th moment of the random variable X and the formulas present an upper and lower bound on the distribution of X. Table II is valid for any non-negative random variable, i.e. we do not utilize the fact that T x and θ t are upper bounded in our system. Table II The method to evaluate the moments of T x and θ t is based on a tagging an elastic flow arriving to the system, and carefully examining the possible transitions from the instance this tagged flow enters the system until it leaves the system. The system behavior during the service of the tagged flow can be described by a slightly modified Markov chain. To analyze θ t a tagged adaptive elastic flow is considered, while to analyze T x a tagged non-adaptive elastic flow is considered. The modified system used to evaluate θ t (or T has the following properties: • Since it is assumed that at least the tagged elastic flow is present in the system we exclude states where n 2 = 0 (or n 3 = 0). With each state of the state space there is an associated entrance probability, which is the probability of the event that the modified CTMC starts from that state. When the tagged elastic flow finds the system in state (n ! ,n 2 ,n 3 ) it will bring the system into state (n ! ,n 2 + l,n 3 ) (or state unless the state (n ! ,n 2 ,n 3 ) happens to be a blocking state of the tagged flow. Let {Z(t), t > 0} be the modified CTMC assuming the tagged elastic flow never leaves the system over the finite state space F with generator B. F can be defined as: 1 (or 0) < n 2 < N EU (24) 0 (or 1) < n 3 < N EU (25) Indeed, F=S S 0 where S 0 is the states in S where n 2 = 0 (or n 3 = 0). The state transition rates in B are closely related to the appropriate rates in Q: b 1,ik+ = λ k k = l, 2, 3 (26) b ul- = n μι (27) bi,i2- = (ϋ2-l>μ 2 (or n 2 -μ2) (28) b iιi3 , = n 3 -r 3 -μ 3 (or (n 3 -l) -r 3 -μ 3 ) (29) The initial probability of the modified Markov chain p + (n 1 ,n 2 ,n 3 ) is obtained by considering the system state immediately after the tagged flow joins the system in steady state. This means that the probability that the system is in state (n 1? n 2 ,n 3 ) after the tagged flow's arrival is proportional to the steady state probability of state (n l5 n 2 - l,n 3 ) (or (n ! ,n 2 ,n 3 -l)). Consequently: p"<n,*A> = (30) p»(n lA ,n 3 ) = (3 1) To obtain the moments of θ t , a Markov Reward model is defined over {Z(t), t > 0} in accordance with reference [11]. θ t is a random variable which depends on the random arrival and departure of the rigid, adaptive and non-adaptive elastic flows as described by B. The reward rate associated we the states of the modified Markov chain represents the bandwidth of the tagged adaptive elastic flows in that state. Let tj be the reward rate (the bandwidth of the tagged adaptive elastic flow) in state i and T the diagonal matrix composed of the tj entries, ^ = r 2 (i)-b 2 , where r 2 (i) is the bandwidth compression in state i. In this way, the dynamics of the number of flows in the system during the service of the tagged flow is described by the Modified Markov chain, and the instantaneous bandwidth of the tagged flow is described by the instantaneous reward rate. If there are more flows in the system, the bandwidth of the tagged flow decreases towards b ™" 1 and if there are less flows, it increases towards b 2 . The generator matrix B and the reward matrix T define the Markov Reward model that accumulates t- θ t amounts of reward in the interval (0, t). This means that the reward accumulated in the interval (0, t) represents the amount of data transmitted through the tagged flow in this interval, and θ t is the amount of transmitted data / 1. T x is the random amount of time that it takes to transmit x units of data through the tagged flow. By defining a Markov Reward model as above, the reward accumulated in the interval (0, t) represents the random amount of data transmitted through the tagged flow, and hence T x is the time it takes to accumulate x amounts of reward. This measure is commonly referred to as completion time. Having the initial probability distribution p 2+ (n ! ,n 2 ,n 3 ), and p 3+ (n ! ,n 2 ,n 3 ), the generator matrix B and the reward matrix T, the numerical analysis method proposed in reference [11] is applied to evaluate the moments of θ t and T x . This numerical method is applicable for Markov Reward models with large state spaces ( " 10 6 states). Numerical examples of the application of the link capacity sharing algorithm By way of example, consider a transmission link of capacity C = 100 Mbps and supporting three different service classes: rigid, adaptive elastic and non-adaptive elastic service classes. The parameters, given as network traffic inputs and deteπnined by the link sharing algorithm, of this system are as follows: C C0M = 20 Mbps, C ELA = 80 Mbps; b j = 1 Mbps, b 2 = 5 Mbps, b 3 = 3 Mbps; λ j = λ 3 = 12 1/min; r^ = 0.05, r^ = 0.001; N C0M = 20, N = 20, N EU = 20. The effect of the arrival rate j of the adaptive elastic flows on the corresponding blocking probability for a number of values of minimum accepted throughput is demonstrated in Table HI below. Table HI As the minimum accepted throughput 0^ for the adaptive elastic traffic is assigned higher and higher values, the probability that an adaptive elastic flow obtains this throughput decreases. The increase of the arrival rate of the adaptive elastic flows results in more adaptive elastic flows in the system, and hence the throughput decreases together with the probability that the adaptive elastic flows obtain the required bandwidth. The effect of the arrival rate λ 3 of the non-adaptive elastic flows on the corresponding blocking probability for a number of values of rninimum accepted throughput is demonstrated in Table IN below. In this case, the system parameters are: C= 250 Mbps; C COM = 50 Mbps, C ELA = 200 Mbps; bj = 1 Mbps, b 2 = 3 Mbps, b 3 = 5 Mbps; λ x = 40 1/min, ^ = 25 1/min; r 2 πun = 0 4 ^ r m = o 05; N COM = 50, N EL2 = 120, N EL , = 180. Note that in this case the modified Markov chain describing the system behavior during the service of a tagged non-adaptive elastic flow has 1,116,951 states and 6,627,100 transitions. Table IN In similarity to the effects demonstrated in Table HI, as the minimum accepted throughput for the non-adaptive elastic traffic is assigned higher and higher values, the probability that a non-adaptive elastic flow obtains this throughput decreases. Also, the increase of the arrival rate results in a decreasing probability that the non-adaptive elastic flows obtain the required bandwidth. To get an impression of the relation of average throughput and throughput threshold constraints reference is made to Fig. 5, which illustrates the mean and the variance of the throughput of adaptive elastic flows as a function of their service time. The graph of Fig. 5 relates to the system considered for Table HI, with ^ = 14. The mean throughput is shown by a solid line, whereas the variance is shown by a dashed line. It can thus be seen that for "short" (with respect to service time) connections , the variance of the throughput is quite significant, and consequentiy, the average throughput and the throughput threshold constraints have significantly different meanings. For "long" connections, the variance of the throughput almost vanishes, and the mean throughput provides a meaningful description of the bandwidth available for adaptive elastic flows. Note that θ t tends to approach a deterministic value, the steady state throughput, as t goes to infinity. Finally, we study an example of how to select N^ and N^ to provide the required QoS parameters. Assume that after the division of the link capacity and the dimensioning of the rigid class, the system parameters have the following values: C= 100 Mbps; C COM = 20 Mbps, C^ = 80 Mbps; bj = 1 Mbps, b 2 = 5 Mbps, b 3 = 3 Mbps; λj = 12 1/min, λ = 12 1/min, λ 3 = 12 1/min; μi = \ = μ3 = 1 s Cb- ere expressed as mean holding time); b 3 min = 0.1 Mbps; The parameters N^ and N ΕL3 have to be such that the elastic blocking probabilities are less than 1 % (B 2 < 0.01, B 3 < 0.01) and the average throughput parameters fulfill E(θ ) > 4.05 and E(θ) > 2.35. The set of N EL2 and N^ parameters that fulfill the QoS requirements are depicted in the gray area of Fig. 6. The blocking probability limit of the adaptive elastic class is a vertical line due to the independence on the load of the non-adaptive elastic class. The blocking probability limit of the non-adaptive elastic class is a horizontal line. With the considered low level of overall load, the average elastic throughputs are hardly sensitive to the N^ and N EU parameters after a given limit. In this example, the tighter of the two bandwidth limits that determines the acceptable N^ and N EL3 values, is the E(θ ) > 4.05 bound. Inversion of the optimization task The new elastic POL policy allows for a natural inversion of the optimization task so that instead of minimizing blocking probabilities for elastic traffic under throughput constraints, the elastic throughputs are maximized under blocking probability constraints. In similarity to the link capacity sharing method illustrated in the flow diagram of Fig. 2, traffic input parameters are received (similar to step 101), the common link capacity part C C0M is determined (similar to step 102) and initial values of the cut-off parameters are selected (similar to step 103). Next, the performance of the system is analyzed (similar to step 104), but now primarily with respect to elastic blocking probabilities. In particular, the elastic blocking probabilities in the system are analyzed and related (similar to step 105) to the blocking probability constraints. If the blocking probabilities are too high, then the cut-off parameters are increased, reducing the blocking probabilities and also reducing the throughputs. On the other hand, if the blocking probabilities are lower than the blocking constraints, then the cut-off parameters can be reduced so that the blocking probabilities as well as the throughputs are increased. In this way, by way of iteration, the throughputs can be increased to a maximum, while still adhering to the blocking constraints for elastic flows. As the aim now is to maximize the elastic throughputs, and as it might be advisable to have a worst-case guarantee for the throughputs of elastic traffic, the cut-off parameters must be as low as possible, and at least low enough to fulfill the worst-case throughput constraints, while still fulfilling the blocking probability constraints imposed on the elastic traffic. Naturally, the link capacity sharing algorithm, irrespective of whether it is adapted for minimizing elastic blocking or for maximizing elastic throughput, is also applicable to elastic traffic only. For example, in the absence of rigid traffic, C COM is reduced to zero, and the overall link capacity sharing algorithm is reduced to the mathematical formulas for determining the cut-off parameters under throughput/blocking constraints. Furthermore, in the case of a single elastic traffic class, only a single cut-off parameter needs to be determined according to the above iterative link sharing algorithm. Link capacity sharing algorithm - the ATM network example Although, the link capacity sharing algorithm has been described above with reference to an IP network carrying a single rigid traffic class and two different elastic traffic classes, it should be understood that the invention is not limited thereto, and that the algorithm is applicable to other types of networks and other traffic classes. In fact, an example of the elastic POL algorithm applied in an ATM network carrying narrowband CBR (Constant Bit Rate) traffic and wide-band CBR traffic, as well as ABR (Available Bit Rate) traffic will be outlined below. In this example, calls arriving at a transmission link generally belong to one of the following three traffic classes: • Class 1 - Narrow-band CBR calls, characterized by their peak bandwidth requirement b call arrival rate λ l and departure rate μ,. • Class 2 - Wide-band CBR calls, characterized by their peak bandwidth requirement b 2 , call arrival rate λ^ and departure rate μ^. • Class 3 - ABR calls, characterized by their peak bandwidth requirement b 3 , minimum bandwidth requirement b 3 πάa , call arrival rate λ 3 and ideal departure rate μ 3 . The ideal departure rate is experienced when the peak bandwidth is available during the entire duration of the call. It should be noted that the CBR classes can be likened by the rigid traffic class of the above IP network example, and that the ABR class can be likened by the non- adaptive elastic traffic class described above in connection with the IP network example. In this respect, the assumptions in the model formulated in the IP network example are equally applicable in the present example. The elastic POL policy described above is applied to the mixed CBR-ABR traffic environment in the ATM network considered. This means that the link capacity C is divided into two parts, a common part C C0M for CBR calls as well as ABR calls, and a dedicated part C ABR , which is reserved for the ABR calls, such that C = C COM + C ABR . An admission control parameter N ABR , also referred to as a cut-off parameter, is introduced for the ABR calls. Under the elastic POL policy, the number n l 5 n 2 and n 3 of narrow-band CBR, wide-band CBR and ABR calls, respectively, in progress on the link is subject to the following constraints: A BR -ba 1 ^ < C^ R (33) n 3 ≤ N ABR (34) In (1) the ABR calls are protected from CBR calls. In (2-3) the maximum number of ABR calls is limited by two constraints. Expression (2) protects CBR calls form ABR calls, while (3) protects the in-progress ABR calls from new ABR calls. In this case, the elastic POL policy is fully determined by the division of the link capacity, specified by C COM , and the admission control parameter N ABR . The performance of the elastic POL policy is tuned by these parameters. According to a preferred embodiment of the invention, the link capacity sharing algorithm aims at setting the output parameters C C0M and N ABR of the elastic POL policy in such a way as to πiinimize the call blocking probability for the ABR calls, while being able to take into account blocking probability constraints (GoS) for the different types of CBR calls and a minimum throughput constraint for the ABR calls. Therefore, each CBR class is associated with a maximum accepted call blocking probability B^ and B 2 πm , and the ABR class is associated with a rninimum accepted throughput 0-^, which can be treated in similarity to the minimum accepted throughput Q mn for the non-adaptive elastic traffic of the IP network example. Although the ABR blocking probability is being minimized, it is nevertheless normally advisable, although not necessary, to have a worst-case guarantee of the call blocking probability for ABR calls, and associate also the ABR class with a maximum allowed blocking probability B 3 max . The parameters and performance measures associated with the CBR classes and the ABR class are summarized in Table N below. Table N The problem of determining the output parameters of the elastic POL policy under the above constraints is outlined below with reference to Fig. 7, which is a schematic flow diagram of the overall link capacity sharing algorithm for a mixed CBR-ABR traffic environment according to a preferred embodiment of the invention. In the first step 201, the required input parameters are provided. In step 202, the GoS (call blocking) requirement for CBR traffic is guaranteed by the proper setting of C C0M . In particular, we determine the minimum required capacity of C C0M for CBR calls that guarantees the required blocking probabilities B,™* and B max. '2 min{C C0M : B, < B^, B, < B^ } (35) For example, the well-known Erlang-B formula can be used to estimate such a value of C OM based on arrival and departure rates and peak bandwidth requirements for the CBR classes as inputs. Next, we have to determine a maximum number of ABR calls (N ABR ) that can be simultaneously present in the system at the same time as the required throughput and blocking requirements are fulfilled. In this particular embodiment, the link capacity sharing algorithm aims at minimizing the blocking probability of the ABR calls under a minimum throughput constraint. To accomplish this, the invention proposes an iterative procedure, generally defined by steps 203-207, for tuning the cut-off parameter so that the throughput-threshold constraint is just fulfilled, generally no more and no less. First, in step 203, an initial value of the cut-off parameter is estimated. Next, the performance of the system is analyzed (step 204) with respect to the ABR throughput, and related (step 205) to the throughput-threshold constraint. If the ABR throughput is too low, then the cut-off parameter is reduced (step 206), increasing the blocking probability and also increasing the throughput. On the other hand, if the ABR throughput is higher than the throughput-threshold, then the cut-off parameter can be increased (step 207) so that the blocking probability (as well as the throughput) is reduced. In this way, by iteratively repeating the steps 204, 205 and 206/207, the ABR blocking probability can be reduced to a rninimum, while still adhering to the throughput constraint. Preferably, the performance measures, ABR throughput and possibly also ABR blocking, are analyzed in more or less the same way as described above in connection with the IP network example. In short, this means determining the steady state distribution of the Markov chain that describes the dynamics and behavior of the mixed CBR-ABR environment, and calculating blocking and throughput measures based on the determined distribution. It should though be noted that here the throughput- threshold constraint, analogous to expression (7), is checked based on the transient analysis of the Markov chain that describes the mixed CBR-ABR environment using the numerical method proposed in reference [11] and applying the Markov inequality. It is of course possible to invert the optimization task also for the ATM network example, in substantially the same manner as explained above for the IP network example. Numerical examples of the application of the link capacity sharing algorithm By way of example, consider an ATM transmission link of capacity C = 155 Mbps and supporting three different service classes: two CBR classes and an ABR class, as described above. The input parameters of this ATM transmission link system are: b, (n-CBR) = 3 Mbps, b 2 (w-CBR) = 6 Mbps, b 3 (ABR) = 10 Mbps; λj = 6 1/s, λ 2 = 3 1/s, λ 3 = 12 1/s; r^ = 0.05, r 3 min = 0.001; Furthermore, it is required that the blocking probabilities of the narrow-band and wideband CBR calls are less than B,™* = 2% and B^ = 4%, respectively. It thus follows that the minimal bandwidth for C C0M necessary to provide these blocking probabilities is 60 Mbps, which leaves C ABR = 95 Mbps for the ABR calls. To examine the trade-off between throughput and blocking probability for the ABR traffic, reference is made to Table VI below, which illustrates the average throughput E(θ) and the blocking probability B 3 for the ABR traffic class for different values of Table VI From Table VI, the trade-off between throughput and blocking is apparent; high- blocking = high throughput, and low blocking = low throughput. In the elastic POL policy according to the invention, this trade-off is conveniently controlled by means of the N AB cut-off parameter as can be seen from Table VI. For instance, when constraint θ 1 ™ 1 on the average throughput is set to 2.2 Mbps, the maximum number (N ABR ) of simultaneously active ABR calls is limited to 100. In simulations, it has been observed that the elastic POL policy is superior to the well- known Complete Partitioning (CP) policy under all loads, both in terms of blocking probabilities and ABR throughput. This is partly due to the fact that the POL policy allows ABR calls to make use of any bandwidth of the C COM part currently not used by CBR calls. Finally, to examine the impact of the C COM parameter on the blocking probabilities and the average throughput of ABR traffic, reference is made to Table VH below. Table VH The C C0M parameter offers a way of controlling the trade-off between the CBR blocking probabilities on one hand, and the ABR blocking probability and throughput on the other hand. From Table VH, it can be seen that both the ABR throughput (increasing) and the ABR blocking (decreasing) are improved at the expense of degrading CBR blocking probabilities. It is important to understand that the preceding description is intended to serve as a framework for an understanding of the invention. The embodiments described above are merely given as examples, and it should be understood that the present invention is not limited thereto. Further modifications, changes and improvements which retain the basic underlying principles disclosed and claimed herein are within the scope and spirit of the invention. REFERENCES [1] L. Massoulie, J. Roberts, "Bandwidth Sharing : Objectives and Algorithms", IEEE Infocom '99, pp. 1395-1403, March 1999. [2] L. Massoulie, J. Roberts, "Bandwidth Sharing and Admission Control for Elastic Traffic", ITC Specialist Seminar, Yokohama, October 1998. [3] L. Massoulie, J. Roberts, "Arguments in Favour of Admission Control for TCP Flows", 16 th International Teletraffic Congress, Edinburgh, UK, June, 1999. [4] R.J. Gibbens and F.P. Kelly, "Distributed Connection Acceptance Control for a Connectionless Network", 16 th International Teletraffic Congress, Edinburgh, UK, June, 1999. [5] F. P. Kelly, "Charging and Rate Control for Elastic Traffic", European Transaction on Telecommunications, pp. 33-37, Vol. 8, 1997. [6] Wu-chang Feng, Dilip D. Kandlur, Debanjan Saha and Kang. G. Shin, "Understanding and Improving TCP Performance Over Networks with Minimum Rate Guarantees" , IEEE/ ACM Transactions on Networking, pp. 173-187, Vol. 7, No. 2, April 1999. [7] E. D. Sykas, K. M. Vlakos, I. S. Venieris, E. N. Protonotarios, "Simulative Analysis of Optimal Resource Allocation and Routing in DBCN's" , IEEE J-SAC, Vol. 9, No. 3, 1991. [8] Keith W. Ross, "Multi-service Loss Models for Broadband Telecommunication Networks", Springer- Verlag, 1995, ISBN 3-540-19918-7. [9] W. J. Stewart, "Introduction to the Numerical Solution of Markov Chains" , pp. 220-221 , Princeton University Press, Princeton, New Jersey, ISBN 0-691- 03699-3, 1994. [10] M. Frontini, A. Tagliani, "Entropy-convergence in Stieltjes and Hamburger moment problem", AppL Math, and Comp., 88, pp. 39-51, 1997. [11] M. Telek and S.Racz, "Numerical analysis of large Markov reward models", Performance Evaluation, 36&37:95-114, August 1999. [12] A. Smith, J. Adams, G. Tagg, "Available Bit Rate - A New Service for ATM", Computer Networks and ISDN Systems, 28, pp. 635-640, 1996.

Claims: CLAIMS 1. A method for sharing link capacity in a network (10), characterized in that said method comprises the steps of: receiving (101; 201) network traffic input parameters; dividing said link capacity into a first part common (C C0M ) to elastic traffic and non-elastic traffic and a second part (C ELA ; C ABR ) dedicated for elastic traffic, based on at least part of said network traffic input parameters; and deteimining (103-108; 203-208) at least one admission control parameter for said elastic traffic based on said division of link capacity and at least part of said network traffic input parameters. 2. The method according to claim 1, characterized in that said method further comprises the step of exercising admission control for elastic traffic flows based on said determined admission control parameter(s). 3. The method according to claim 1, characterized in that said dividing step includes the step of determining (102; 202) a minimum required capacity of said common part relating to non-elastic traffic given at least one maximum allowed blocking probability for said non-elastic traffic. 4. The method according to claim 1, characterized in that said step of determining at least one admission control parameter comprises the step of deteimining a maximum number (N EL2 , N EL3 , N ABR ) of admissible elastic traffic flows based on at least one call-level constraint imposed on said elastic traffic. 5. The method according to claim 4, characterized in that said step of deteimining a maximum number of admissible elastic traffic flows is based on a call-level model for elastic traffic, and said call-level constraint(s) is related to at least one of throughput and blocking probability of said elastic traffic. 6. The method according to claim 5, characterized in that said step of deteimining a maximum number of admissible elastic traffic flows comprises the steps of: deterrnining (103; 203) an initial value of the number of admissible elastic traffic flows on a link in said network; iteratively performing the steps of: i) evaluating (105; 205) said throughput/blocking constraints) imposed on said elastic traffic based on the initial/current value of the number of admissible elastic traffic flows; and ii) adjusting said number of admissible elastic traffic flows based on said evaluation; and terminating said iteration process and extracting (108; 208) said maximum number of admissible elastic traffic flows when said constraint(s) is/are met. 7. The method according to claim 6, characterized in that said step of adjusting said number of admissible elastic traffic flows based on said evaluation comprises the steps of: reducing (106; 206) said number of admissible elastic traffic flows if a value related to the throughput of said elastic traffic flows is lower than a predetermined threshold given by said throughput/blocking constraints); and increasing (107; 207) said number of admissible elastic traffic flows if said throughput related value is higher than said threshold. 8. The method according to claim 4, characterized in that said step of determining said maximum number of admissible elastic connections is based on minimizing the blocking probability of requested elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one throughput-threshold constraint for in-progress elastic traffic connections. 9. The method according to claim 8, characterized in that said minimization of the blocking probability of elastic traffic under at least one throughput-threshold constraint is performed also under at least one given constraint on maximum allowed blocking probability for elastic traffic. 10. The method according to claim 4, characterized in that said step of deterrnining said maximum number of admissible elastic connections is based on maximizing the elastic traffic throughput with respect to the number of admissible elastic traffic connections under at least one blocking probability constraint for requested elastic traffic connections. 11. The method according to claim 1 , characterized in that said elastic traffic comprises a number of elastic traffic classes, and said step of deteimining at least one admission control parameter comprises the step of determining, for each of one said elastic traffic classes, a maximum number of admissible elastic traffic flows based on a respective throughput blocking probability constraint imposed on the elastic traffic class. 12. The method according to claim 1, characterized in that said network traffic input parameters include at least said link capacity, at least one blocking probability constraint for non-elastic traffic, and at least one throughput/blocking constraint for elastic traffic. 13. The method according to claim 1 , characterized in that said network traffic input parameters further include arrival and departure rates as well as peak bandwidth requirements for non-elastic and elastic traffic, and a πmiimum bandwidth requirement for elastic traffic. 14. The method according to claim 1, characterized in that said elastic traffic comprises at least one of the following: adaptive elastic traffic flows of Internet Protocol (IP) networks, non-adaptive elastic traffic flows of IP networks, and Available Bit Rate (ABR) flows of ATM networks. 15. A method for allocating link bandwidth among and within different traffic classes in a network (10), wherein said traffic classes include at least one elastic traffic class, characterized in that said method comprises the steps of: partitioning said link bandwidth into a first part common (C C0M ) to all traffic classes, and a second part C ABR ) dedicated to connections of said elastic traffic class(es); and allocating said second dedicated part (C^; C ABR ) of said link bandwidth to connections of said elastic traffic class(es) based on link bandwidth utilization under at least one throughput/blocking constraint imposed on the connections of said elastic traffic class(es). 16. The method according to claim 15, characterized in that said method further comprises the step of allocating a minimum required bandwidth of said common part to connections of non-elastic traffic classes given at least one maximum allowed blocking probability for said non-elastic traffic connections. 17. The method according to claim 15, characterized in that said method further comprises the step of deteπnining (103-108; 203-208) a maximum number (N^, N^; N ABR ) of admissible elastic traffic connections on the link based on said throughput/blocking constraints), wherein said step of allocating bandwidth to connections of said elastic traffic class(es) is based on said maximum number of admissible elastic traffic connections. 18. The method according to claim 17, characterized in that said step of determining a maximum number of admissible elastic traffic connections is based on minimizing the blocking probability of elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one throughput-threshold constraint for in-progress elastic traffic connections. 19. The method according to claim 17, characterized in that said step of determining a maximum number of admissible elastic traffic connections is based on maximizing the throughput of in-progress elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one blocking probability constraint for requested elastic traffic connections. 20. The method according to claim 17, characterized in that said step of deteπnining a maximum number of admissible elastic traffic connections comprises the steps of: deteimining (103; 203) an initial value of the number of admissible elastic traffic connections on said link; iteratively performing the steps of: i) deterrnining (104; 204) throughput/blocking-probability measures based on the initial/current of the number of admissible elastic traffic connections on said link; ii) evaluating (105; 205) said throughput blocking constraint(s) imposed on said elastic traffic based on the determined throughput/blocking measures; and iii) adjusting (106/107; 206/207) said number of admissible elastic traffic connections based on said evaluation; and terminating said iteration process and extracting (108; 208) said maximum number of admissible elastic traffic connections when substantially meeting said constraint(s). 21. An electronically implemented method for sharing link capacity among elastic traffic connections in a network (10), characterized in that said method comprises the steps of: receiving (101; 201) network traffic input parameters; determining (103-108; 203-208) a maximum number (N^, N^, N ABR ) of admissible elastic traffic connections on said link based on said network traffic input parameters, said input parameters including at least one throughput blocking constraint imposed on said elastic traffic; receiving requests for elastic traffic connections on a link in said network; and exercising admission control for said requested elastic traffic connections based on said determined maximum number of admissible elastic traffic connections. 22. The method according to claim 21, characterized in that said step of deteπnining a maximum number of admissible elastic connections is based on minimizing the blocking probability of requested elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one throughput-threshold constraint for in-progress elastic traffic connections. 23. The method according to claim 21 , characterized in that said step of deterrnining a maximum number of admissible elastic connections is based on maximizing the throughput of in-progress elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one blocking probability constraint for requested elastic traffic connections. 24. The method according to claim 21, characterized in that said step of determining a maximum number of admissible elastic traffic connections comprises the steps of: initially deterrnining (103; 203) a number of admissible elastic traffic connections on said link; iteratively perfoπning the steps of: i) evaluating (105; 205) said throughput/blocking constraint(s) imposed on said elastic traffic based on the current number of admissible elastic traffic connections on said link; and ii) adjusting (106/107; 206/207) said number of admissible elastic traffic connections based on said evaluation; and terminating said iteration process and extracting (108; 208) said maximum number of admissible elastic traffic connections when said constraint(s) is/are met. 25. The method according to claim 24, characterized in that said step of adjusting said number of admissible elastic traffic connections based on said evaluation comprises the step of selectively, in dependence on the relation between a throughput/blocking measure and said throughput/blocking constraint(s), reducing (106; 206) or increasing (107; 207) said number of admissible elastic traffic connections. 26. The method according to claim 21, characterized in that: said elastic traffic comprises a number of elastic traffic classes; said step of determining a maximum number of admissible elastic traffic connections on said link comprises the step of deteimining, for each of said elastic traffic classes, a traffic-class specific maximum number (N^, N^) of admissible elastic traffic flows based on a respective throughput/blocking probability constraint imposed on the elastic traffic class in question; and said method further comprises the steps of: deterrnining the associated traffic class for each of said requested connections; and controlling admission of each requested connection based on the corresponding traffic-class specific maximum number of admissible elastic connections. 27. The method according to claim 21, characterized in that said network traffic input parameters include link capacity, arrival and departure rates, peak bandwidth and minimum bandwidth requirements for elastic traffic as well as at least one throughput blocking constraint imposed on said elastic traffic. 28. A device for sharing link capacity in a network (10), characterized in that said device comprises: means for receiving network traffic input parameters; means (21; 21, 25) for dividing said link capacity into a first part common to elastic traffic and non-elastic traffic and a second part dedicated for elastic traffic, based on at least part of said network traffic input parameters; and means (21) determining at least one admission control parameter for said elastic traffic based on said division of link capacity and at least part of said network traffic input parameters. 29. The device according to claim 28, characterized in that said device further comprises means (22) for exercising admission control for elastic traffic flows based on said determined admission control parameter(s). 30. The device according to claim 28, characterized in that said dividing means includes means for determining a minimum required capacity of said common part relating to non-elastic traffic given at least one maximum allowed blocking probability for said non-elastic traffic. 31. The device according to claim 28, characterized in that said means for deterrnining at least one admission control parameter comprises means for deteπnining a maximum number of admissible elastic traffic flows based on at least one throughput blocking constraint imposed on said elastic traffic. 32. The device according to claim 31, characterized in that said means for determining a maximum number of admissible elastic traffic flows is configured for: initially deterrnining a number of admissible elastic traffic flows on a link in said network; iteratively evaluating said throughput/blocking constraint(s) imposed on said elastic traffic based on the current number of admissible elastic traffic flows and adjusting said number of admissible elastic traffic flows based on said evaluation; and terminating said iteration process and extracting said maximum number of admissible elastic traffic flows when meeting said constraints). 33. The device according to claim 31, characterized in that said means for deteπnining a maximum number of admissible elastic traffic flows is configured to determine said maximum number based on minimizing the blocking probability of requested elastic traffic connections with respect to said maximum number of admissible elastic traffic connections under at least one throughput-threshold constraint for in-progress elastic traffic connections. 34. The device according to claim 31, characterized in that said means for determining a maximum number of admissible elastic traffic flows is configured to determine said maximum number based on maximizing elastic traffic throughput with respect to said maximum number of admissible elastic traffic connections under at least one blocking probability constraint for elastic traffic. 35. The device according to claim 28, characterized in that said receiving means receives network traffic input parameters including said link capacity, arrival and departure rates and peak bandwidth requirements for non-elastic as well as elastic traffic, a minimum bandwidth requirement for elastic traffic, at least one blocking probability constraint for non- elastic traffic, and at least one throughput/blocking constraint for elastic traffic. 36. The device according to claim 28, characterized in that said elastic traffic comprises at least one of the following: adaptive elastic traffic flows of Internet Protocol (IP) networks, non-adaptive elastic traffic flows of IP networks, and available bit rate (ABR) flows of ATM networks. 37. An electronic system for allocating link bandwidth among and within different traffic classes in a network (10), at least one of said different traffic classes being an elastic traffic class, characterized in that said electronic system comprises: a processor (21) configured for: partitioning said link bandwidth into a first part common to all traffic classes, and a second part dedicated to connections of said elastic traffic class(es); and allocating said second dedicated part of said link bandwidth to connections of said elastic traffic class(es) based on link bandwidth utilization under at least one throughput/blocking constraint imposed on the connections of said elastic traffic class(es). 38. The electronic system according to claim 37, characterized in that said processor (21) is configured for allocating a minimum required bandwidth of said common part to connections of non-elastic traffic classes given at least one maximum allowed blocking probability for said non-elastic traffic connections. 39. The electronic system according to claim 37, characterized in that said processor (21) is further configured for deteimining a maximum number of admissible elastic traffic connections on the link based on said throughput blocking constraint(s), and for allocating bandwidth to said elastic traffic connections based on said dedicated part of the link bandwidth as well as said maximum number of admissible elastic traffic connections. 40. The electronic system according to claim 39, characterized in that said processor (21) is further configured for determining said maximum number of admissible elastic connections based on minimizing the blocking probability of elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one throughput-threshold constraint for in-progress elastic traffic connections. 41. The electronic system according to claim 39, characterized in that said processor (21) is further configured for deteimining said maximum number of admissible elastic connections based on maximizing the throughput of elastic traffic connections with respect to the number of admissible elastic traffic connections under at least one blocking probability constraint for elastic traffic connections. 42. An electronic system for sharing link capacity among elastic traffic connections in a network (10), characterized in that said system comprises a processor (21) responsive to network traffic input parameters and configured for: determining a maximum number of admissible elastic traffic connections based on at least one throughput blocking constraint imposed on said elastic traffic; receiving requests for elastic traffic connections; and exercising admission control for said requested elastic traffic connections based on said deteimined maximum number of admissible elastic traffic flows. 43. The electronic system according to claim 42, characterized in that said processor (21) is further configured for deteimining said maximum number of admissible elastic connections based on iteratively improving link bandwidth utilization under said throughput blocking constraint(s). 44. The electronic system according to claim 43, characterized in that said processor (21) is further configured for deteimining said maximum number of admissible elastic connections based on minimizing the blocking probability of requested elastic traffic connections with respect to said maximum number of admissible elastic traffic connections under at least one throughput-threshold constraint for in-progress elastic traffic connections. 45. The electronic system according to claim 43, characterized in that said processor (21) is further configured for deteimining said maximum number of admissible elastic connections based on maximizing elastic traffic throughput with respect to said maximum number of admissible elastic traffic connections under at least one blocking probability constraint for elastic traffic. 46. A method for link bandwidth sharing in an admission-control enabled IP network (10), characterized in that said method comprises the step of: applying (101-108) a call-level model of a link carrying a number n, where n is an integer equal to or greater than 1, of elastic traffic classes for dimensioning the link bandwidth sharing for throughput-blocking optimality, wherein said call-level model is defined by: said link having a predetermined bandwidth capacity C; and for each one of said n elastic traffic classes, the elastic traffic being modeled as: i) having a peak bandwidth requirement and a minimum bandwidth requirement; ϋ) occupying the maximum possible bandwidth within said peak and minimum bandwidth requirements; and iii) being associated with at least one of a minimum accepted throughput and a maximum accepted blocking probability. 47. The method according to claim 46, characterized in that, for each one of said n traffic classes, the elastic traffic is further being modeled as: iv) arriving dynamically according to a Poisson process and being associated with an arrival rate as well as a departure rate; v) sharing proportionally equally the bandwidth available for the elastic traffic class among the elastic flows; and vi) being associated with a minimum holding time. 48. The method according to claim 46, characterized in that said n elastic traffic classes include a first traffic class for adaptive elastic flows, and a second traffic class for non-adaptive elastic flows. 49. A method for deteimining a steady state distribution of Markov chain describing the dynamics of a network link carrying traffic of a number of traffic classes including a non-adaptive elastic traffic class, characterized in that said method comprises the steps of: determining a link capacity sharing policy for said link; deteimining a multi-dimensional Markov chain having a set of feasible states for the number of active connections of said traffic classes according to constraints imposed by said link sharing policy; calculating an initial approximation of the steady state distribution of said Markov chain based on Markov chain product form calculations; and iteratively determining the steady state distribution starting from said initial approximation of the steady state distribution. 50. The method according to claim 49, characterized in that said step of calculating an initial approximation of the steady state distribution comprises the steps of: deterπiining the steady state distribution of traffic classes other than said non- adaptive traffic class as if there is no non-adaptive elastic traffic in the system; and deterrnining state probabilities assuming equilibrium of the incoming and outgoing traffic of one of said other traffic classes and said non-adaptive elastic traffic class. 51. The method according to claim 49, characterized in that said step of iteratively deteimining the steady state distribution is based on a biconjugate gradient method. 52. The method according to claim 49, characterized in that blocking probabilities for said traffic classes are calculated based on a steady state distribution resulting from said iterative determination.

Inventors: FODOR GABOR, RACZ SANDOR, TELEK MIKLOS, FODOR, GABOR, RACZ, SANDOR, TELEK, MIKLOS
Applicants: ERICSSON TELEFON AB L M, TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Application year: 2000
Main classification: H04L12
IPC codes: H04L12