Multi-hour network planning based on domination between sets of traffic matrices

Authors:
P. Pavon-Marino;B. Garcia-Manrubia;R. Aparicio-Pardo
Affiliations:
Technical University of Cartagena (UPCT), Plaza Hospital 1, 30202 Cartagena, Spain;Technical University of Cartagena (UPCT), Plaza Hospital 1, 30202 Cartagena, Spain;Technical University of Cartagena (UPCT), Plaza Hospital 1, 30202 Cartagena, Spain
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2011

Citing 11
Cited 1

A nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternate routing communications network

Operations Research
Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks

IEEE/ACM Transactions on Networking (TON)
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing

IEEE/ACM Transactions on Networking (TON)
The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees

Information Technology and Management
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Finding Critical Traffic Matrices

DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
A quantitative measure for telecommunications networks topology design

IEEE/ACM Transactions on Networking (TON)
Domination Between Traffic Matrices

Mathematics of Operations Research
MatPlanWDM: an educational tool for network planning in wavelength-routing networks

ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

IEEE Journal on Selected Areas in Communications - Part Supplement

On traffic domination in communication networks

PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges

Quantified Score

Hi-index	0.01

Visualization

Abstract

In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the week can be exploited. This paper investigates the application of the traffic domination relation between sets of traffic matrices to multi-hour network planning. Two problem variants are considered: a network with a static, and with a dynamic traffic routing. We derive a set of techniques for, given a multi-hour traffic demand potentially composed of hundreds of matrices, obtaining a traffic series with a smaller number of matrices. The traffic domination relation guarantees that the network designed for the simplified series is suitable for the original one. Also, we apply the domination relation to derive lower bounds to the network cost, and upper bounds to the suboptimality incurred by simplifying the traffic demand. The algorithms proposed are tested in a case of study with the Abilene network. In our tests, a long traffic series could be reduced to a small number of traffic matrices, and be effective for network planning.