Dr. HO Kin-Hon, RoyRoyDr. HO Kin-HonHowarth, MichaelMichaelHowarthWang, NingNingWangPavlou, GeorgeGeorgePavlouGeorgoulas, StylianosStylianosGeorgoulas2023-09-182023-09-182007Computer Communications, 2007, Vol. 30(18), pp. 3757-3777.0140-3664http://hdl.handle.net/20.500.11861/7982This 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.enPeer Reviewed Journal Article10.1016/j.comcom.2007.09.008