Integer and combinatorial optimization
Integer and combinatorial optimization
The convex hull of two core capacitated network design problems
Mathematical Programming: Series A and B
Routing Through Virtual Paths in Layered Telecommunication Networks
Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Integrated traffic grooming in converged data-optical networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Traffic Grooming in Optical WDM Mesh Networks (Optical Networks)
Traffic Grooming in Optical WDM Mesh Networks (Optical Networks)
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Traffic grooming in WDM networks
IEEE Communications Magazine
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Network Design and Cost Optimization for Label Switched Multilayer Photonic IP Networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Single-path routing of stochastic flows in networks
Operations Research Letters
Dynamic routing at different layers in IP-over-WDM networks - Maximizing energy savings
Optical Switching and Networking
Hi-index | 0.00 |
The possibility of adding multi protocol label switching (MPLS) support to transport networks is considered an important opportunity by telecom carriers that want to add packet services and applications to their networks. However, the question arises whether it is suitable to have MPLS nodes just at the edge of the network to collect packet traffic from users, or to introduce also MPLS facilities on a subset of the core nodes in order to exploit packet switching flexibility and multiplexing, thus inducing a better bandwidth allocation. In this paper, we propose a mathematical programming model for the design of two-layer networks where MPLS is considered on top of transport networks (SDH or WDM depending on required link speed). Our models take into account the tradeoff between the cost of adding MPLS support in the core nodes and the savings in the link bandwidth allocation due to the statistical multiplexing and the traffic grooming effects induced by MPLS nodes. The traffic matrix specifies for each point-to-point request a pair of values: a mean traffic value and an additional one. Using this traffic model, the effect of statistical multiplexing on a link allows to allocate a capacity equal to the sum of all the mean values of the traffic demands routed on the link and only the highest additional one. We propose a path-based Mixed Integer Programming (MIP) model for the problem of optimizing the number and location of MPLS nodes in the network and the link capacities. We apply Lagrangian relaxation to this model and use the subgradient method to obtain a lower bound of the network cost. As the number of path variables used to model the routing grows exponentially with the graph size, we use an initially limited number of variables and a column generation approach. We also introduce a heuristic approach to get a good feasible solution. Computational results are reported for small size and real-world instances.