C. L. Williamson, "Dynamic Bandwidth Allocation Using Loss-Load Curves", IEEE/ACM Transactions on Networking, Vol. 4, No. 6, December 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....networks will not necessarily mean unlimited access or free bandwidth. Without proper resource management schemes and resource reservation protocols, the bandwidth would be soon exhausted. New techniques that support dynamic bandwidth allocation (DRA) have been proposed to address this issue [99, 28, 24, 25, 26, 27]. Contrary to traditional resource allocation schemes that reserve network resources only at the beginning of the session, DRA allows reservation (increase and decrease) during the single session. Controlled access to the network resources in DRA is translated into QoS and formulated in terms of ....

C. L. Williamson, "Dynamic Bandwidth Allocation Using Loss-Load Curves", IEEE/ACM Transactions on Networking, Vol. 4, No. 6, December 1996.

....able to better utilize the network, however the translation is a non trivial task. A third option is to define new service classes that provide information to guide applications in use of the service; applications must then decide how to use this information. Loss load curves fall in this category [20]. A fourth option is to define new service classes that support specification of application layer performance parameters. We focus on this last approach. In this paper, we consider the use of an application layer performance measure the utility in the context of bandwidth allocation for ....

C. L. Williamson. Dynamic Bandwidth Allocation Using Loss-Load Curves. IEEE/ACM Transactions on Networking, Dec. 1996. 9

....from the network, the communication layer is able to make intelligent decisions about the communication configuration best suited for the currently available network resources. The specific network resource information utilized in this paper may be obtained from Loss Load Curves [WC91, Wil96] or via network flow metering [BMR97] The configuration decisions derived from application service specification and network resource monitoring concern the appropriate choice of the reliability level of data transfer. The novel techniques proposed in this paper address a large class of ....

Carey Williamson. Dynamic bandwidth allocation using loss-load curves. IEEE/ACM Transactions on Networking, 4(6):829--839, December 1996.

....high bandwidth applications. It is worthwhile noting that an individual application will benefit from an increase in network bandwidth, but this is not necessarily true when multiple traffic streams are competing for the available bandwidth. In this case, bandwidth allocation schemes [2] [22] are required for guaranteed performance. We do not discuss these issues here, however, since this is not the topic of this paper. Operating system: A UNIX kernel that supports single copy TCP IP has been used. This allows direct data copy from the network to the application. As a result, data ....

C.L. Williamson. "Dynamic Bandwidth Allocation Using Loss-Load Curves", IEEE/ACM Transactions on Networking, Vol. 4 No. 6, December 1996.

....the available network service. In general, this implies that the communication layer has knowledge about what quality of service to expect for a range of different service requests. This relationship can be represented with service availability curves, as proposed in the form of Loss Load Curves [Wil96] which characterize the dynamic service a network can provide to its clients. Given a specific transmission rate for a sender, loss load curves provide the sender with an expected loss rate. This information allows the communication layer itself to determine the tradeoff between higher output ....

Carey Williamson. Dynamic bandwidth allocation using loss-load curves. IEEE/ACM Transactions on Networking, 4(6):829--839, December 1996.

....Requested Loss Load Curve Packet Loss Probability and Raw Throughput Raw Throughput Curve Figure 3: A Sample Loss Load Curve and Throughput Curve 2.2. 3 Loss Load Curves Another possible dynamic pricing scheme is a congestion control scheme called loss load curves, proposed by Williamson [17]. Loss load curves [17] allocate bandwidth based on changing network conditions. An example of a loss load curve is shown in Figure 3. The curve expresses the expected packet loss probability for a user as a function of that user s offered load. The packet loss probability ranges from zero, in ....

....Packet Loss Probability and Raw Throughput Raw Throughput Curve Figure 3: A Sample Loss Load Curve and Throughput Curve 2.2. 3 Loss Load Curves Another possible dynamic pricing scheme is a congestion control scheme called loss load curves, proposed by Williamson [17] Loss load curves [17] allocate bandwidth based on changing network conditions. An example of a loss load curve is shown in Figure 3. The curve expresses the expected packet loss probability for a user as a function of that user s offered load. The packet loss probability ranges from zero, in which the capacity of the ....

[Article contains additional citation context not shown here]

C. Williamson, "Dynamic Bandwidth Allocation Using Loss-Load Curves", submitted to IEEE/ACM Transactions on Networking, January 1994. 20

....are inherited from ERICA (d, count and t) and four are new ones (D, a, b and QDLF) 2.3 The DEBRA Algorithm DEBRA (Dynamic Explicit Bid Rate Algorithm) is proposed by R. Gurski and C. Williamson [6] This algorithm is based on a rate based congestion control strategy called loss load curves [17]. In the loss load approach, switches compute and provide to traffic sources concise aggregate load information, allowing sources to compute precise transmission rates that provide the best trade off between offered load and the level of packet loss experienced in the network. The DEBRA algorithm ....

....to the traffic sources. Sources use the advertised function to determine optimal bids (i.e. how to maximise their own individual bandwidth allocation in the presence of traffic bids from other sources) DEBRA has proven mathematical properties of bounded load, convergence, fairness and stability [17]. There are three parameters for DEBRA: K, C and V. C and V control the target utilisation (e.g. C=0.95) of the ABR capacity, and the fraction of ABR bandwidth that is actually 7 advertised to traffic sources (e.g. V=1.0) respectively. The parameter K controls responsiveness, aggressiveness, ....

[Article contains additional citation context not shown here]

C. Williamson, "Dynamic Bandwidth Allocation Using Loss-Load Curves", IEEE/ACM Transactions on Networking, vol.4, No. 6, pp. 829-839, December 1996.

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