• Corpus ID: 5566533

Load Pro ling for E cient Route Selection in Multi Class Networks

  title={Load Pro ling for E cient Route Selection in Multi Class Networks},
  author={Azer Bestavros and Ibrahim Matta},
High speed networks such as ATM networks are ex pected to support real time Quality of Service QoS guarantees required by many applications such as those that involve voice and video communication To sup port such services routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Cir cuit VC have been proposed Commonly these algo rithms assign VCs to routes using the least loaded con cept and thus result in balancing the load over the set of all candidate routes… 

Figures from this paper

Evaluation of a Load Pro ling Approach to RoutingGuaranteed Bandwidth Flows
This paper thoroughly characterize the performance of VC routing using load prooling and contrast it to routing usingload balancing and load packing and shows that the load-prooling VC routing scheme performs better or as well as the traditional load-balancing VC routing in terms of revenue under both skewed and uniform workloads.
A load profiling approach to routing guaranteed bandwidth flows
  • I. Matta, Azer Bestavros
  • Computer Science
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
The findings confirm that load balancing is not desirable as it results in VP bandwidth fragmentation, which adversely affects the likelihood of accepting new flow requests, and load-profiling routing improves routing fairness by proactively increasing the chances of admitting high-bandwidth flows.
Asymptotic performance limits for routing and rate allocation in rate-based multi-class networks
  • A. Diwan, J. Kuri
  • Computer Science
    Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE
  • 2002
An upper bound on the weighted carried traffic of any RRA algorithm is derived and it is shown that a fixed RRA algorithms achieves the bound asymptotically and can be used as an absolute benchmark for the performance of various R RA algorithms.
Evolutionary-fuzzy prediction for strategic inter-domain routing: Architecture and mechanisms
An extended routing protocol is described, which is able to carry richer information, which, in turn, will be used to take decisions with a better picture of the network and is proposed to be incorporated into the MISA Management of Integrated SDH and ATM network architecture.
Study of sidewalks in the UPC campuses of Barcelona through route planning techniques
A specialized bibliographic reference work and an analysis of a first version of the route planning application, which were used as support material, are presented.


Real-time network routing in a dynamic class-of-service network
This paper describes an adaptive routing method called real-time network routing (RTNR), which implements new class-of-service routing capabilities for dynamic networks, and the results of analysis
Performance modeling and management of high-speed networks
A performance methodology is developed that accounts for bursty nature of traffic, nested segmentation and reassembly of the packets, window flow control, and bandwidth allocation policies, associated with heterogeneous networks.
A Dynamic Connection Management Scheme for Guaranteed Performance Services in Packet-Switching Integrated Services Networks.†
It is contention that availability and flexibility can be enhanced in a network by providing the network with the ability to modify the performance parameters and/or the route of any guaranteed performance connection in the network without violating the previously made performance contracts.
Packing and least-loaded based routing in multi-rate loss networks
  • I. Matta, M. Krunz
  • Business, Computer Science
    Proceedings of ICC'97 - International Conference on Communications
  • 1997
Simulation results show that under skewed workload, the packing based scheme outperforms a traditional least-loaded based scheme in terms of revenue (or equivalently, network utilization).
Routing in virtual path based ATM networks
The issue of routing requests for virtual circuits in a virtual path based asynchronous transfer mode (ATM) network is addressed and simple admission rules for virtual circuit requests are proposed.
Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks
The authors propose a computationally simple approximate expression to provide a unified metric to represent the effective bandwidth used by connections and the corresponding effective load of network links, which can then be used for efficient bandwidth management, routing, and call control procedures aimed at optimizing network usage.
A scalable virtual circuit routing scheme for ATM networks
A scalable VC routing protocol based on the viewserver hierarchy that saves money in storage and performs as well or better in terms of the VC carried load and blocking probability over a wide range of real-time workload.
QoS Routing Mechanisms and OSPF Extensions
The overall goal of this study is to identify a framework and possible approaches to allow deployment of QoS routing capabilities with the minimum possible impact to the existing routing infrastructure.
Computing approximate blocking probabilities for large loss networks with state-dependent routing
A reduced load approximation for estimating point-to-point blocking probabilities in loss networks (e.g., circuit switched networks) with state-dependent routing is considered and results for six-node and 36-node asymmetric networks are given.
Performance Studies of Dynamic Load Balancing in Distributed Systems
Load balancing is found to reduce significantly the mean and standard deviation of job response times, especially under heavy and/or unbalanced workload, which is strongly dependent upon the load index.