I. Matta and M. Krunz, "Packing and leastloaded based routing in multi-rate loss networks ", In Proc. IEEE ICC, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....as the revenue accrued by accepting a connection belonging to that class. The weighted carried traffic is the weighted sum of the carried traffics. 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 ....

I. Matta and M. Krunz, "Packing and leastloaded based routing in multi-rate loss networks ", In Proc. IEEE ICC, 1997.

....[4] 5] 6] 7] 8] These schemes try setting up the VC on the least utilized route chosen from a set of candidate paths, thereby attempting 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 ....

I. Matta and M. Krunz, "Packing and least-loaded based routing in multi-rate loss networks", In Proc. IEEE ICC, pp. 827--831, 1997.

....connection holding period. In this paper the problem under consideration is the performance evaluation of RRA algorithms in rate based multi class 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 ....

I. Matta and M. Krunz, "Packing and least-loaded based routing in multi-rate loss networks", In Proc. IEEE ICC, 1997.

....connection holding period. In this paper the problem under consideration is the performance evaluation of RRA algorithms in rate based multi class 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 ....

I. Matta and M. Krunz, "Packing and least-loaded based routing in multi-rate loss networks", In Proc. IEEE ICC, 1997.

....with certain QoS 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 ....

I. Matta and M. Krunz, "Packing and least-loaded based routing in multi-rate loss networks", In Proc. IEEE ICC, 1997.

....the load of intermediate nodes as the main route selection metric and monitors the congestion status of active routes to reconstruct the path when nodes of the route have their interface queue overloaded. Routing with load balancing in wired networks has been exploited in various approaches [2] [10], 15] 16] In ad hoc networks, only Associativity Based Routing (ABR) 17] considers the load as the metric. ABR, however, uses the routing load as the secondary metric. Furthermore, the load is measured in the number of routes a node is a part of, and hence the protocol does not account for ....

I. Matta and M. Krunz, "Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks," Proceedings of IEEE ICC'97, Montreal, Canada, June 1997, pp. 827-831.

....node routing loads for route selection metric. The protocol also monitors the congestion status of active routes and reconstructs the path when nodes of the route have their interface queue overloaded. Routing with load balancing in wired networks has been exploited in various approaches [16, 107, 144, 157]. In ad hoc networks, only Associativity Based Routing (ABR) 159] considers the load as the metric. ABR, however, uses the routing load as the secondary metric. Furthermore, the load is measured in the number of routes a node is a part of, and hence the protocol does not account for various ....

I. Matta and M. Krunz, "Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks," Proceedings of the IEEE International Conference on Communications (ICC), Montreal, Canada, June 1997, pp. 827831.

.... been proved to be inefficient for networks where resources needed for each connection serviced vary, which is the case for guaranteedservice networks [20] This problem is similar to the packing problem and a most loaded route approach was measured to be more efficient than least loaded routing [15]. While these schemes do not rely on any other information except for 5 link load, Matta and Bestavros [16] proposed load profiling which utilizes load profiles to achieve low blocking rates by matching load and availability profiles. Our work resembles a generalization of Matta s rationale ....

I.Matta, M.Krunz, Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks, International Conference on Communications (ICC), 1997

....bandwidth, which in turn results in (2) improved fairness by increasing the chances of admittance for wideband VCs. A routing scheme based on the packing concept was proposed in [8] The scheme attempts to pack class s VCs in order to reduce blocking for only the next higher class of VCs. In [9], we extended the scheme in order to reduce blocking for all higher classes. Both schemes are, however, based on pessimistic deterministic analysis. They only account for the different bandwidth requirements of different classes, but not on their traffic intensities (demands) These traffic ....

I. Matta and M. Krunz. Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks. In Proc. IEEE ICC, pages 132-139, 1997.

....class 1 VC on R 1 , even though it is not the least loaded route. Note that packing results in loading routes non uniformly. A routing scheme based on the packing concept was proposed in [10] The scheme attempts to pack class s VCs by keeping in perspective only the next higher class of VCs. In [12], we extended the scheme in order to account for all higher classes. Both schemes are, however, based on pessimistic deterministic analysis. They only account for the different bandwidth requirements of different classes, but not on their traffic intensities (demands) These traffic intensities ....

I. Matta and M. Krunz. Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks. In Proc. IEEE ICC, 1997. To appear.

....paper is organized as follows. Section 2 presents the different routing and admission control algorithms that will be examined. Section 3 compares the various algorithms using discrete event simulation. Section 4 concludes with future work. Details omitted because of lack of space can be found in [7]. 2 Routing and Admission Control Algorithms In this section, we present the routing and admission control algorithms that will be examined. We first introduce the following definitions. ffl A route is said to be QOS permissible if it has sufficient idle capacity to carry the VC. ffl In this ....

I. Matta and M. Krunz. Packing and leastloaded based routing in multi-rate loss networks. Technical Report NU-CCS-96-12, College of Computer Science, Northeastern University, Boston, MA 02115, September 1996. Available from http://www.ccs.neu.edu/home/matta.

....even though it is not the least loaded route. Note that load packing results in the routes being non uniformly loaded. A routing scheme based on this packing concept was proposed in [15] The scheme attempts to pack class s VCs in order to reduce blocking only for the next higher class of VCs. In [20], we extended the scheme in order to reduce blocking for all higher classes. Both schemes are, however, based on pessimistic deterministic analysis. They only account for the different bandwidth requirements of different classes, but not on their traffic intensities (demands) These traffic ....

....which is susceptible to even minor inaccuracies in knowledge about reserved bandwidth on various routes. We do not show in Section 3 simulation results for MLR and other packingbased schemes since we also found LPR to provide better or similar performance (results for these schemes can be found in [20]) Organization The remainder of this paper is organized as follows. Section 2 motivates load profiling by comparing it to load balancing and load packing we particularly examine the effect of VC request granularity. The comparison is done both analytically and via a pilot baseline simulation ....

I. Matta and M. Krunz. Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks. In Proc. IEEE ICC, pages 827--831, 1997.

....of available bandwidth, resulting in an (2) improved fairness by increasing the chances of admittance for wideband VCs. A routing scheme based on this packing concept was proposed in [7] The scheme attempts to pack class s VCs in order to reduce blocking only for the next higher class of VCs. In [8], we extended the scheme in order to reduce blocking for all higher classes. Both schemes are, however, based on pessimistic deterministic analysis. They only account for the different bandwidth requirements of different classes, but not on their traffic intensities (demands) These traffic ....

....carry the VC. TR permissibility: For simplicity, we will assume that all links have the same TR value. An alternative route is said to be TR permissible if only when it carries at least one direct VC on one of its links, the idle capacity must be greater than or equal to the reservation threshold [8]. This definition of TR permissibility requires that switches keep track of the number of direct VCs on outgoing links. This avoids unnecessary reservations for direct VCs when not present. Allowable Alternative Routes: A two link alternative route is said to be allowable if it is both ....

I. Matta and M. Krunz. Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks. In Proc. IEEE ICC, pages 827--831, 1997.

....R 1 , even though it is not the least loaded route. Note that load packing results in the routes being non uniformly loaded. A routing scheme based on the packing concept was proposed in [10] The scheme attempts to pack class s VCs by keeping in perspective only the next higher class of VCs. In [12], we extended the scheme in order to account for all higher classes. Both schemes are, however, based on pessimistic deterministic analysis. They only account for the different bandwidth requirements of different classes, but not on their traffic intensities (demands) These traffic intensities ....

I. Matta and M. Krunz. Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks. In Proc. IEEE ICC, 1997. To appear.

....of available bandwidth, resulting in an (2) improved fairness by increasing the chances of admittance for wideband VCs. A routing scheme based on this packing concept was proposed in [17] The scheme attempts to pack class s VCs in order to reduce blocking only for the next higher class of VCs. In [22], we extended the scheme in order to reduce blocking for all higher classes. Both schemes are, however, based on pessimistic deterministic analysis. They only account for the different bandwidth requirements of different classes, but not on their traffic intensities (demands) These traffic ....

I. Matta and M. Krunz. Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks. In Proc. IEEE ICC, pages 827--831, 1997.

No context found.

I. Matta, M. Krunz, Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks, International Conference on Communications (ICC), #997

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