Ibrahim Matta, Azer Bestavros, and Marwan Krunz. Load profiling based routing for guaranteed bandwidth flows. European Transactions on Telecommunications, 10(2), 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....While shortestpath, WSP, and our new algorithm all perform a single shortest path computation to route a request, MIRA performs a maximum flow computation per ingress egress pair , each of which can be several orders of magnitude more expensive than the shortest path calculation. Matta et al. MBK99] also use a profile for making routing decisions. For each source destination pair, their profile contains a probability density function (PDF) describing the likelihood of individual request sizes. This PDF is then used to reduce the link wastage among a set of alternate routes. Load profiling ....

....B j j to our objective function, which is exponential in the bandwidth not routed, for a tunable fairness parameter #. This guarantees that one class receiving an unfairly low bandwidth allocation leads to a steep cost, and will be avoided. Combination with Load Profiling. If load profiles [MBK99] are available, they can be used to route large requests in order to minimize call blocking due to insu#cient contiguous bandwidth. We expect it to achieve only minimal improvement under small requests or heavy overload. With large requests, load profiles should result in significantly postponing ....

Ibrahim Matta, Azer Bestavros, and Marwan Krunz. Load profiling based routing for guaranteed bandwidth flows. European Transactions on Telecommunications, 10(2), 1999.

....Related Work: In the context of QoS routing in ATM networks, 1] proposed the least loaded routing scheme to achieve load balancing. Alternatively, 2, 3] proposed routing schemes based on load packing techniques. In these works, the performance measure was connection blocking probability. In [4], the performance measure was the weighted carried traffic and a load profiling based RRA scheme that attempts to maximize the weighted carried traffic was proposed. In the context of QoS routing in the Internet, 5] proposed the shortestwidest path scheme as a way of minimizing the call blocking ....

I. Matta, A. Bestavros, and M. Krunz, "Load profiling based routing for guaranteed bandwidth flows", European Transactions on Telecommunications, 10(2), pp. 165-- 182, 1999.

....to evenly distribute the load among the candidate routes. As an alternative to the load balancing concept, VC packing techniques were proposed in [9] 10] for VC routing. These schemes try to pack narrow band VCs on some paths so that wide band VCs can be routed on other paths. 11] 12] [13] proposed the concept of load profiling as an alternative to load balancing and packing schemes for VC routing. Load profiling techniques allow the distribution of available bandwidth across a set of candidate routes to match the characteristics of incoming VC requests. In the context of QoS ....

I. Matta, A. Bestavros, and M. Krunz, "Load profiling based routing for guaranteed bandwidth flows", European Transactions on Telecommunications - Special Issue on Architectures, Protocols and Quality of Service for the Internet of the Future, vol. 10, no. 2, pp. 165--182, 1999.

....networks. In the context of QoS routing in ATM networks, 1] proposed the least loaded routing scheme to achieve load balancing. Alternatively, 2] 3] proposed routing schemes based on load packing techniques. In these works, the performance measure was connection blocking probability. In [4], the performance measure was the weighted carried traffic and a load profiling based RRA scheme that attempts to maximize the weighted carried traffic was proposed. In the context of QoS routing in the Internet, 5] proposed the shortest widest path scheme as a way of minimizing the call ....

I. Matta, A. Bestavros, and M. Krunz, "Load profiling based routing for guaranteed bandwidth flows", European Transactions on Telecommunications, 10(2), pp. 165--182, 1999.

....networks. In the context of QoS routing in ATM networks, 1] proposed the least loaded routing scheme to achieve load balancing. Alternatively, 2] 3] proposed routing schemes based on load packing techniques. In these works, the performance measure was connection blocking probability. In [4], the performance measure was the weighted carried traffic and a load profiling based RRA scheme that attempts to maximize the weighted carried traffic was proposed. In the context of QoS routing in the Internet, 5] proposed the shortest widest path scheme as a way of minimizing the call blocking ....

I. Matta, A. Bestavros, and M. Krunz, "Load profiling based routing for guaranteed bandwidth flows", European Transactions on Telecommunications, 10(2), pp. 165--182, 1999.

....guarantees by proper rate allocation. Related Work: Traditionally, the design of routing schemes in VC routed networks has been based on the concept of Least Loaded Routing (LLR) 2] As an alternative to the load balancing concept, VC packing techniques were proposed in [3] 4] for VC routing. [5] proposed the concept of load profiling as an alternative to load balancing and packing schemes for VC routing. Load profiling techniques allow the distribution of available bandwidth across a set of candidate routes to match the characteristics of incoming VC requests. In the context of QoS ....

I. Matta, A. Bestavros, and M. Krunz, "Load profiling based routing for guaranteed bandwidth flows", European Transactions on Telecommunications, 10(2), pp. 165--182, 1999.

....While shortest path, WSP, and our new algorithm all perform a single shortest path computation to route a request, MIRA performs a maximum flow computation per ingress egress pair , each of which can be several orders of magnitude more expensive than the shortest path calculation. Matta et al. [13] also use a profile for making routing decisions. For each sourcedestination pair, their profile contains a probability density function (PDF) describing the likelihood of individual request sizes. This PDF is then used to reduce the link wastage among a set of alternate routes. Load profiling is ....

....we add # B j j to our objective function, which is exponential in the bandwidth not routed, for a tunable parameter #. This guarantees that one class receiving an unfairly low bandwidth allocation leads to a steep cost, and will be avoided. Combination with Load Profiling. If load profiles [13] are available, they can be used to route large requests in order to minimize call blocking due to insu#cient contiguous bandwidth. We expect it to achieve only minimal improvement under small requests or heavy overload. With large requests, load profiles should result in significantly postponing ....

I. Matta, A. Bestavros, M. Krunz, Load profiling based routing for guaranteed bandwidth flows, European Transactions on Telecommunications 10 (2), (1999).

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