L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing min-max fairness," UCSC-CRL-95-29 Computer Engineering Dept. University of California, Santa Cruz, Tech. Rep., June 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....specified so that various vendors can implement their own switch rate allocation algorithms and distinguish their products. The switch rules simply ensure that switches from different vendors will interoperate, though the operation may not be optimal. Several switch algorithms have been developed [2] [10] This paper describes one of the earliest of such switch algorithms. The explicit rate indication for congestion avoidance (ERICA) algorithm was presented at the ATM Forum in February 1995. Since then, its performance has been independently studied in many papers [5] 6] 8] Also, we ....

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing max--min fairness," in Proc. 6th IFIP Int. Conf. High Performance Networking, Sept. 1995.

....to the sources This research was partially sponsored by Rome Laboratory C3BC Contract #F30602 96 C 1056 Shivkumar Kalyanaraman is with Dept of ECSE, Rensselaer Polytechnic Institute, Troy NY 12180 asking them to change their transmission rates. Several switch algorithms have been developed [4, 5, 6, 7, 8] to calculate feedback intelligently. The resource management (RM) cells (which carry feedback from the switches) travel from the source to the destination and back. One of the options of the ABR framework is the Virtual Source Virtual Destination (VS VD) option. This option allows a switch to ....

L. Kalampoukas, A. Varma, K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing max-min fairness," Proceedings of the 6th IFIP International Conference on High Performance Networking, September 1995.

....are called BRM cells. The switches along the RM cell path indicate the rate which they can currently support. congestion information [2] Distributed algorithms for the congestion control using explicit rate feedback were given in [3, 4] Improved, simpler distributed algorithms were proposed in [5, 6, 7, 8, 9, 10]. Recently, a generalized definition of max min fairness and its distributed implementation were presented in [11, 12] A discussion of weight based max min fairness policy and its implementation in ABR service is given [13] The fairness criteria in the presence of MCR guarantees is discussed ....

L. Kalampoukas, A. Varma, K. K. Ramakrishnan. "An efficient rate allocation algorithm for ATM networks providing max-min fairness". In Proc. of the 6th IFIP International Conference on High Performance Networking, September 1995.

....of the ABR feedback control algorithm (switch scheme) is not yet standardized. 2] used binary feedback to advise source about congestion information. Distributed algorithms which emulated the centralized algorithm were given in [3, 4] Improved, simpler distributed algorithms were proposed in [5, 6, 7, 8, 9, 10]. Recently, 11, 12] discuss a generalized definition of max min fairness and its distributed implementation. 13] discusses a weight based max min fairness policy and its implementation in ABR service. 14, 15] discuss the fairness in the presence of MCR guarantees. In [16] we had proposed a ....

L. Kalampoukas, A. Varma, K. K. Ramakrishnan. "An efficient rate allocation algorithm for ATM networks providing max-min fairness". In Proc. of the 6th IFIP International Conference on High Performance Networking, September 1995.

....mean rate, since that would result in a decrease of his explicit rate. Such a feature of incentive compatibility is lacking in the existing flow control procedures where the network allocates in a fair way peak rates with no reference to the corresponding mean rates (e.g. see [CRL96, JKG 97, KVR95, and the references therein] and [ATMF96, Appendix I.5] 5.3.1 Controlling Effective Rates In this section we investigate implementation issues of the effective flow control procedure whose mathematical underpinnings are based on the pricing mechanism described by equations (5.5) and (5.9) ....

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan. An efficient rate allocation algorithm for ATM networks providing max-min fairness. In Proc. of 6th IFIP International Conference on High Performance Networking (HPN'95), September 1995.

....fairness criterion can be practically implemented using distributed algorithms. 5.2. Distributed algorithm With the advent of available bit rate (ABR) flow control found in ATM networks, distributed algorithms that emulate a centralized max min fair allocation algorithm have been proposed [26,27]. In [26] Charny proposes a distributed and asynchronous algorithm for max min fair allocation. At each bandwidth allocation iteration, a two step algorithm is used to partition flows into bottlenecked and satisfied sets, denoted by U l and L l , respectively. The fair allocation for ....

....function of U l , the set of bottlenecked flows. The composite function from the inverse utility function u 1 i ( and the aggregated utility function u l U ( captures the notion of weighted fairness, while the utility function has built in support for the minimum sustained rate. In [27], Kalampoukas simplifies Charny s iterative marking procedure (which has complexity of O(n) for each iteration where n is the number of flows) to an O(1) algorithm for each iteration. Instead of trying to partition all the flows at once, the algorithm only updates the bottlenecked satisfied status ....

[Article contains additional citation context not shown here]

L. Kalampoukas, A. Varma and K.K. Ramakrishnan, An efficient rate allocation algorithm for ATM networks providing max--min fairness, in: IFIP HPN'95, Spain (September 11--16, 1995).

....between the observed queue length and a queue threshold. In this type of approach, a certain fairness in rate allocation among users is accomplished as a consequence of the queue length control. Examples of this type can be found in [2,5 8,11,15 20] The other type of rate based flow control [3,10] is to compute directly rate allocations in a way that a certain fairness property is satisfied. Typically, in this latter approach, the queue length is not explicitly controlled. Communication between the node and the sources is done via special cells that are embedded into the individual data ....

....we consider a static scenario where Assumptions 2.4 and 2.5 hold. The bottleneck bandwidth and the buffer size B are, respectively, set to 150 Mbps and 5000 cells, and there are 50 active VCs sourcing the traffic into the link. The round trip delay # i of VCs is chosen uniformly in the range [10,40] (ms) to represent long propagation delays. To take into account the discrete time effect of control, the FRFC is applied in the sample and hold manner with intervals defined by the rate of VC. We choose this interval aggressively long as if RM (resource management) cells [12] are issued every 128 ....

[Article contains additional citation context not shown here]

L. Kalampoukas, A. Varma, K.K. Ramakrishnan, An efficient rate allocation algorithm for ATM networks providing max-- min fairness, Technical Report UCSC-CRL-95-29, Computer Engineering Dept., University of California, Santa Cruz, June 1995.

....is indeed beneficial in such a way that it makes the closed loop performance to be virtually independent of the number of locally bottlenecked VCs on a link. Fig. 1. Network model with a node of interest. Estimation of the number of locally bottlenecked VCs is a challenging research subject [8] [13] [15] The difficulty lies in that the dynamics of any estimation process interacts with those of the ER allocation process until the closed loop system reaches the steady state so that it can make the closed loop system unstable. In this paper, we also present a stable yet scalable estimation ....

....rate allocation is achieved automatically by virtue of the queue length control. There is another class of ER allocation algorithms [10] 17] where fair rate allocation with input output rate matching is the primary concern and queue length control, if any, is supplementary. The algorithms in [13] [16] require that each switch collects the information on the available bandwidth of the outgoing link, the fair rate of remotely bottlenecked VCs which is determined at remote links and the number of locally bottlenecked VCs. A common drawback of these algorithms is that they suffer from not ....

[Article contains additional citation context not shown here]

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing MAX--MIN fairness," Computer Engineering Dept., Univ. of California, Santa Cruz, CA, Tech. Rep. UCSC-CRL-95-29, June 1995.

....on a network with reduced link capacities. We repeat this process until all sources have been allocated the maximum that they can obtain. 3 The Original ERICA Switch Algorithm Several switch algorithms have been developed to compute the feedback to be indicated to ABR sources in RM cells [1, 13, 16, 17, 12]. The ERICA algorithm [10, 12] is one of the earliest and most studied explicit rate algorithms. The main advantages of ERICA are its low complexity, fast transient response, efficient allocations, and controlled queuing delay. In this section, we present the basic features of the original ....

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan. An efficient rate allocation algorithm for ATM networks providing max-min fairness. In Proceedings of the 6th IFIP International Conference on High Performance Networking, September 1995.

....source, 3) distinguish between overloading and underloading sources, or compute the number of overloading sources, 4) estimate the effective number of active sources. Such techniques are used in many of the popular point to point switch schemes, such as the MIT scheme [3] and the UCSC scheme [14]. Most switch schemes also use the current cell rate of the sources in the computation of the explicit rate. Algorithms which use the CCR values noted from backward RM cells are not fair for multipoint topoint connections. This is because it may be impossible to determine which source the RM ....

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan. An efficient rate allocation algorithm for ATM networks providing max-min fairness. In Proceedings of the 6th IFIP International Conference on High Performance Networking, September 1995.

....links in the network are full duplex with a capacity of 155 Mbits s each. The ATM switches are assumed to be non blocking, output buffered crossbars with infinite amount of buffering. The switches support the Explicit Rate Marking option of ABR. We used the rate allocation algorithm presented in [4] for this purpose. The Usage Parameter Control (UPC) or policing, function is enabled in the first ATM switch, so that the burstiness of the traffic at the output of the ATM end system node can be measured. The Generic Cell Rate Algorithm (GCRA) proposed in the ATM Forum Traffic Management ....

....Inter Cell Gap distribution for connections 7 and 8. 5 10 15 20 5 10 15 # cells # cells Figure 21: Burst size distribution for connections 7 and 8. 3.4 ABR Case To evaluate the performance for the ABR case, we use the network configuration of Figure 9. The algorithm proposed in [4], with minor modifications in order to support MCR guarantees at the source, is used in the modified model for the ATM end system node. The target utilization is set to 94 of the link rate for practical purposes. As a general guideline, ABR traffic should operate slightly below 100 so that ....

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan. An efficient rate allocation algorithm for ATM networks providing max-min fairness. In Proceedings of 6th IFIP International Conference on High- Performance Networking (HPN'95), pages 143-154, September 1995.

....requires scanning the state of each connection. Thus, it does not scale well with increasing number of connections. Scaling is a critical issue in ATM networks. The convergence and dynamic properties of this scheme as well as possible enhancements are discussed in [15] Kalampoukas et al. [55, 56] proposed an explicit rate allocation algorithm that has similar convergence and performance properties with Charny s scheme but with significantly better scaling properties: on the arrival of an RM cell only the state of the connection it belongs to needs to be extracted and possibly updated. ....

....on its outbound link. On reaching its destination, the RM cell is returned to the source, which now sets its rate based on that allocated on the bottleneck link in the path of the connection. Several rate allocation algorithms that operate in the explicit rate marking mode have been proposed [13, 46, 55] (for a survey, see [3] These approaches differ in terms of their execution time, implementation complexity, level of fairness in the allocation of the available bandwidth, responsiveness to network changes, convergence time, and stability properties. In this chapter we describe and algorithm ....

[Article contains additional citation context not shown here]

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing max-min fairness," in Proc. of 6th IFIP International Conference on High Performance Networking, HPN'95, pp. 143--154, September 1995.

....the NSF Young Investigator Award No. MIP9257103, a grant from Integrated Device Technology, and matching funds from the University of California MICRO program. bandwidth that can be allocated to each connection. Many such algorithms have been reported in the recent literature [2] 3] 4] 5] [6], 7] 8] for a survey, see [9] These, in general, can be divided into algorithms that maintain per VC bandwidth allocations, and those that do not. A state maintaining algorithm, in principle, has several advantages such as providing exact computation of max min fair rates, ability to support ....

....in principle, has several advantages such as providing exact computation of max min fair rates, ability to support minimum rate guarantees, and provable convergence properties. In this paper, our focus is on the implementation and evaluation of such an algorithm proposed by Kalampoukas et al. [6], 10] The implementation of an algorithm for supporting the explicit rate option of ABR in the switches has been considered difficult and expensive for many reasons: First, for scalability across a large number of VCs, the processing performed by the algorithm on each cell must be broken into a ....

[Article contains additional citation context not shown here]

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing max-min fairness," in Proc. of International Broadband Communications Conference. Sept. 1995, pp. 143--54, IFIP-IEEE.

No context found.

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing min-max fairness," UCSC-CRL-95-29 Computer Engineering Dept. University of California, Santa Cruz, Tech. Rep., June 1995.

No context found.

L. Kalampoukas, A. Varma and K. K. Ramakrishnan. An efficient rate allocation algorithm for atm networks providing max-min fairness. In Proc. of the 6th IFIP International Conference on High Performance Networking, September 1995.

No context found.

L. Kalampoukas, A. Varma, and K. K. Ramakrishnan. An efficient rate allocation algorithm for ATM networks providing max-min fairness. In Proceedings of the 6th IFIP International Conference on High Performance Networking, September 1995.

No context found.

Lampros Kalampoukas, Anujan Varma, and K.K. Ramakrishnan. An efficient rate allocation algorithm for atm networks providing max-min fairness. In 6th IFIP International Conference on High Performance Networking (HPN), September 1995.

No context found.

L. Kalampoukas, A. Varma, K.K. Ramakrishnan, An efficient rate allocation algorithm for ATM networks providing max--min fairness, Proceedings of the Sixth IFIP International Conference on High Performance Networking, September, 1995.

No context found.

Lampros Kalampoukas, Anujan Varma, and K.K. Ramakrishnan. An efficient rate allocation algorithm for atm networks providing max-min fairness. In 6th IFIP International Conference on High Performance Networking (HPN), September 1995.

No context found.

Lampros Kalampoukas, Anujan Varma, and K. K. Ramakrishnan. An efficient rate allocation algorithm for ATM networks providing max-min fairness. In HPN, pages 143--154, 1995.

No context found.

Lampros Kalampoukas, Anujan Varma, and K.K. Ramakrishnan. An efficient rate allocation algorithm for atm networks providing max-min fairness. In 6th IFIP International Conference on High Performance Networking (HPN), September 1995.

No context found.

L. Kalampoukas, A. Varma, K.K. Rama!ishnan, An efficient rate allocation algorithm for ATM networks providing max min fairness, Proceedings of the Sixth IFIP International Conference on High Performance Networking, September, 1995.

No context found.

Lampros Kalampoukas, Anujan Varma, and K.K. Ramakrishnan. An efficient rate allocation algorithm for atm networks providing max-min fairness. In 6th IFIP International Conference on High Performance Networking (HPN), September 1995.

No context found.

Lampros Kalampoukas, Anujan Varma, and K.K. Ramakrishnan. An efficient rate allocation algorithm for atm networks providing max-min fairness. In 6th IFIP International Conference on High Performance Networking (HPN), September 1995.

No context found.

L. Kalampoukas, A. Varma and K. K. Ramakrishnan, "An efficient rate allocation algorithm for ATM networks providing max-min fairness," In Proceedings of the 6th IFIP International Conference on High Performance Networking, September 1995.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC