A Lagrangean relaxation approach for QoS networks CFA problems |
| |
Authors: | Emilio CG Marco Emilio Marco Ajmone |
| |
Affiliation: | aDepartment of Electronics, Federal University of Technology–Paraná, Av. Sete de Setembro 3165, 80230-901 Curitiba (PR), Brazil;bDepartment of Electronics, Turin Polytechnic, Corso Duca degli Abruzzi 24, 10129 Turin, Italy |
| |
Abstract: | This paper is about design methodologies for packet networks, under the constraints of end-to-end quality of service (QoS) metrics. The network modeling also considers the dynamics of today's packet networks. We are particularly considering the problem of capacity and flow assignment where the routing assignments and capacities are considered to be decision variables. An efficient Lagrangean relaxation-based heuristic procedure is developed to find bounds and solutions for a corporate virtual private network (VPN), where the traffic is mostly based on TCP connections. Numerical results for a variety of problem instances are reported. |
| |
Keywords: | Network design and planning Queueing theory Mathematical programming/optimization Lagrangean relaxation |
本文献已被 ScienceDirect 等数据库收录! |
|