• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Efficient Provisioning Algorithms for Network Resource Virtualization with QoS Guarantees (2003)

by K Gopalan
Add To MetaCart

Tools

Sorted by:
Results 1 - 6 of 6

Load Balancing Routing with Bandwidth-Delay Guarantees

by Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin - IEEE Communications Magazine , 2004
"... Current generation of network carriers compete intensely to satisfy the diverse wide-area connectivity requirements of customers. At the same time, the carriers inherently wish to maximize the usage efficiency of their network infrastructure. Much of the research in network resource management has b ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
Current generation of network carriers compete intensely to satisfy the diverse wide-area connectivity requirements of customers. At the same time, the carriers inherently wish to maximize the usage efficiency of their network infrastructure. Much of the research in network resource management has been devoted to providing bandwidth guarantees and preventing network congestion. However, the rapid growth in number and diversity of real-time network applications has made it imperative to consider the impact of end-to-end delay requirements of traffic on network resource provisioning. We present an efficient network resource provisioning algorithm, called Link Criticality Based Routing (LCBR), which relies on the guiding theme that load balancing leads to higher resource utilization efficiency. LCBR applies a simple but very effective notion of link criticality to achieve network-wide load balance while simultaneously meeting the QoS requirements of bandwidth and end-to-end delay. In addition, LCBR can simultaneously provision both primary and backup routes to support fast recovery from node or link failures. This paper reviews the state-of-the-art in network resource provisioning with QoS guarantees, introduces the LCBR algorithm, and identifies future research challenges.
(Show Context)

Citation Context

...ong route r. (2) If there are sufficient resources, then P-LCBR partitions the end-to-end delay DN among the links of r. Existing algorithms to partition endto-end delay are described and compared in =-=[8]-=-. (3) After partitioning DN among links of r, P-LCBR recomputes thesR3 (3) R4 (1000) R1 (1) R2 (2) S D Figure 3: Disjoint Route Pair Selection Problem. per-link remaining capacity Rl and the projected...

Network-wide load balancing routing with performance guarantees

by Kartik Gopalan, Tzi-cker Chiueh, Yow-jian Lin - In Proc. of International Conference on Communications (ICC , 2006
"... Abstract — As wide-area network connectivity becomes commoditized, network service providers are offering premium services that generate higher revenues by supporting performance sensitive traffic (such as voice, multimedia, and online trading). An emerging example is a virtual private network path ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
Abstract — As wide-area network connectivity becomes commoditized, network service providers are offering premium services that generate higher revenues by supporting performance sensitive traffic (such as voice, multimedia, and online trading). An emerging example is a virtual private network path with quality of service (QoS) guarantees, or QVPN. The main technical challenge in offering the QVPN service is how to allocate a physical route for each QVPN so as to maximize the total number of QVPNs that a given physical network infrastructure can support simultaneously. We make the case that the key to addressing this challenge is to maintain network-wide load balance when selecting QVPN routes. By ensuring that different parts of the network are evenly loaded, no single critical link will tend to become a bottleneck resource. This paper describes a Link Criticality Based Routing (LCBR) algorithm, which achieves high network resource utilization efficiency while supporting QVPNs with endto-end delay and bandwidth guarantees. In addition, LCBR can select primary and backup routes for each QVPN simultaneously to support fast recovery from node or link failures. Using a simple yet effective metric that accurately quantifies networkwide load balance, LCBR significantly improves the total number of supported QVPNs when compared to state-of-the-art traffic engineering approaches. I.
(Show Context)

Citation Context

...ne topology with 41 nodes and 64 links. Due to space constraints, the results for two other topologies – the North American IP backbone topology of Sprint and a 5 × 5 Grid topology – are presented in =-=[21]-=-. Link capacities are chosen as a mix from 5 Gbps to 20 Gbps and sources-destination pairs are selected uniformly. Bandwidth demand profile B(s, d), is uniformly distributed between 5 Gbps and 20 Gbps...

Availability, Fairness, and Performance Optimization in

by unknown authors , 2006
"... by ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...ount all these system components, especially the network resources. There are new challenges in network resource management as it usually has to consider the network topology in resource reservation. =-=[41, 44, 45]-=- present algorithms for QoS guarantees in networks, but they do not address the QoS guarantees in multi-cast networks, which could be used for effective data transferring in storage replication and is...

QOS IN IP AND WIRELESS NETWORKS Load Balancing Routing with Bandwidth-Delay Guarantees

by Kartik Gopalan
"... Research performed while ..."
Abstract - Add to MetaCart
Research performed while
(Show Context)

Citation Context

...es along route r. • If there are sufficient resources, P-LCBR partitions the end-to-end delay D N among the links of r. Existing algorithms to partition end-to-end delay are described and compared in =-=[14]-=-. • After partitioning D N among links of r, PLCBR recomputes the per-link remaining capacity R l and the projected networkwide cost cost(G) that would result if route r is assigned to F N. The route ...

Slack Allocation Techniques for Intra-Path Load Balancing

by Kartik Gopalan, Tzi-cker Chiueh, Yow-jian Lin
"... Abstract: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end-to-end QoS guarantees. This paper focuses on the intra-path load balancing problem: How to partition the end-to-en ..."
Abstract - Add to MetaCart
Abstract: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end-to-end QoS guarantees. This paper focuses on the intra-path load balancing problem: How to partition the end-to-end QoS requirement of an aggregate network flow along the links of a given path such that the deviation in the loads on these links is as small as possible? We propose a set of new algorithms, called Load-balancing Slack Allocation (LSA), to solve this QoS partitioning problem for unicast and multicast traffic. The key concept in the LSA algorithms is the notion of slack, which quantifies the flexibility available in partitioning the end-to-end QoS requirement across the links of a selected path or tree. We show that one can improve network resource usage efficiency by carefully selecting a slack partition that explicitly balances the loads on the underlying links. These algorithms can simultaneously partition multiple QoS requirements such as delay and delay violation probability bounds. A detailed simulation study demonstrates that, compared with previous approaches, the LSA algorithms can increase the total number of long-term flows that can be provisioned along a network path by up to 1.2 times for deterministic and 2.8 times for statistical delay guarantees.
(Show Context)

Citation Context

...g along a path is not sufficient by itself to satisfy traffic engineering constraints. Rather, end-to-end QoS partitioning is only one of the components of a larger network resource management system =-=[10, 12]-=- in which network resources need to be provisioned for each flow at three levels. At the first level, a network path is selected between a given pair of source and destination that satisfies the flow ...

Resource Provisioning and Dynamic Resource Management in Intelligent Transportation Systems

by Aniruddha Gokhale, Mark P. Mcdonald, Laura Poff
"... Traffic congestion has adverse consequences on the safety, economy and environment. The loss of productivity due to delays stemming from traffic jams, and increased fuel consumption leads to adverse economic consequences. For ..."
Abstract - Add to MetaCart
Traffic congestion has adverse consequences on the safety, economy and environment. The loss of productivity due to delays stemming from traffic jams, and increased fuel consumption leads to adverse economic consequences. For
(Show Context)

Citation Context

...d obstructed views are yet another reason for discontinuities in network access, and hence degradation in performance. ITS applications therefore need effective mechanisms for resource virtualization =-=[5]-=- and dynamic resource management [6] to maximize the performance of ITS applications. The runtime substrates must also support multiple computing paradigms all at once. For example, vehicle-to-vehicle...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University