Introduction to algorithms
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Algorithms for the multi-resource generalized assignment problem
Management Science
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
A genetic algorithm for the generalised assignment problem
Computers and Operations Research
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Traffic Engineering with MPLS
Estimating flow distributions from sampled flow statistics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
A model of BGP routing for network engineering
Proceedings of the joint international conference on Measurement and modeling of computer systems
Optimizing cost and performance for multihoming
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A methodology for estimating interdomain web traffic demand
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Enabling Scalable Inter-AS Signaling: A Load Reduction Approach
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Traffic matrix reloaded: impact of routing changes
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
A scalable architecture for end-to-end QoS provisioning
Computer Communications
Benefits of traffic engineering using QoS routing schemes and network controls
Computer Communications
BGRP: Quiet Grafting Mechanisms for Providing a Scalable End-to-End QoS solution
Computer Communications
Interdomain traffic engineering with BGP
IEEE Communications Magazine
Provisioning for interdomain quality of service: the MESCAL approach
IEEE Communications Magazine
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Service-driven traffic engineering for intradomain quality of service management
IEEE Network: The Magazine of Global Internetworking
Optimized protection schemes for resilient interdomain traffic distribution
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Supporting dynamic inter-domain network composition: domain discovery
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.24 |
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and establishing service level agreements for end-to-end bandwidth guarantees between ASes. We then present a network dimensioning system that uses traffic engineering mechanisms for the provisioning of end-to-end bandwidth guarantees. The network dimensioning system solves two problems: (1) the economic problem of how to determine the optimum amount of bandwidth that needs to be purchased from adjacent downstream ASes at a minimum total cost; (2) given the available bandwidth resources within and beyond the AS as a result of (1), the engineering problem of how to assign bandwidth guaranteed routes to the predicted traffic while optimizing the network resource utilization. We formulate both as integer-programming problems and prove them to be NP-hard. An efficient genetic algorithm and an efficient greedy-penalty heuristic are, respectively, used to solve the two problems and we show that these perform significantly better than simple heuristic and random approaches.