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

Computer Networks

Volumn 55, Issue 3, 2011, Pages 665-675

  Pavon Marino, P ^a   Garcia Manrubia, B ^a   Aparicio Pardo, R ^a  

^a TECHNICAL UNIVERSITY OF CARTAGENA   (Spain)

Author keywords

Multi hour traffic; Network planning; Traffic domination

Indexed keywords

DYNAMIC TRAFFIC ROUTING; LOWER BOUNDS; MULTI-HOUR TRAFFIC; NETWORK COSTS; NETWORK DESIGN; NETWORK PLANNING; PERIODIC TRAFFIC; SUBOPTIMALITY; TRAFFIC DEMANDS; TRAFFIC DOMINATION; TRAFFIC MATRICES; UPPER BOUND;

MATRIX ALGEBRA;

EID: 79951510290     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2010.10.013     Document Type: Article

References (24)

1. G.R. Ash, R.H. Cardwell, and R.P. Murray Design and optimization of networks with dynamic routing Bell Systems Technical Journal 60 October 1981 1787 1820
2. E. Rosenberg A nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternate routing communications network Operations Research 35 3 1987 354 364 (Pubitemid 18531620)
3. A. Girard, P.D. Lansard, B. Liau, A.M. Mongeon, and J.L. Thibault Multihour engineering and traffic routing optimization in hierarchical telephone networks Annals of Telecommunications 46 5 1991 335 350 (Pubitemid 21698461)
4. D. Medhi, and S. Guptan Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing IEEE/ACM Transactions on Networking 5 6 1997 944 957 (Pubitemid 127768500)
5. A. Amiri The multi-hour bandwidth packing problem with response time guarantees Information Technology and Management 4 1 2003 113 127
6. A. Dutta Capacity planning of private networks using DCS undermultibusy-hour traffic IEEE Transactions on Communications 42 7 1994 2371 2374
7. D. Medhi Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks IEEE/ACM Transactions on Network 3 6 1995 809 818
8. D. Medhi, and D. Tipper Some approaches to solving a multihour broadband network capacity design problem with single-path routing Telecommunication Systems 13 2-4 2000 269 291
9. I. Ouveysi, Y.K. Tham, Network design for multi-hour traffic profile, in: Proceedings of Australian Telecommunication Networks and Applications Conference '95, Clayton, Victoria, Australia, December 1995, pp. 1-6.
10. K. Chari Multi-hour design of computer backbone networks Telecommunication Systems 6 1 1996 347 365
11. W. Ben-Ameur Multi-hour design of survivable classical IP networks International Journal of Communication Systems 15 6 2002 553 572 (Pubitemid 34916044)
12. B.G. Józsa, D. Orincsay, L. Tamasi, Multi-hour design of dynamically reconfigurable MPLS networks, D. Hutchison, T. Kanade, J. Kittler, J. Kleinberg, A. Kobsa, F. Mattern, J.C. Mitchell, M. Naor, O.M. Nierstrasz, C. Pandu Rangan, B. Steffen, M. Sudan, D. Terzopoulos, J.D. Tygar and G. Weikum (Eds.), Lecture notes in computer science, vol. 3042, April 2004, pp. 502-513.
13. M. Pioro, and D. Medhi Routing, Flow and Capacity Design in Communication and Computer Networks 2004 Morgan Kaufmann San Francisco, CA pp. 455-474
14. N. Maxemchuk, I. Ouveysi, and M. Zukerman A quantitative measure for telecommunications networks topology design IEEE/ACM Transactions on Networking 13 4 2005 731 742 (Pubitemid 41269117)
15. TOTEM Project: Toolbox for Traffic Engineering Methods [Online]. Available from: (last access: 4-5-2010).
16. G. Oriolo Domination between traffic matrices Mathematics of Operations Research 33 1 2008 91 96
17. P. Pavon, M. Pioro, Technical report, On total traffic domination in non-complete graphs. Available from: (last access: 4-5-2010).
18. S.E. Terblanche, Contributions towards survivable network design with uncertain traffic requirements, Ph.D. dissertation, School of Computer, Statistical and Mathematical Sciences, Potchefstroom Campus, North-West University, South Africa, 2008.
19. P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, Virtual topology design and flow routing in optical networks under multihour traffic demand, Photonic network communications, August 2009.
20. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, and R. Douville Routing and wavelength assignment of scheduled lightpath demands IEEE Journal on Selected Areas in Communications 21 2003 1231 1240
21. N. Skorin-Kapov Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks IEEE Journal on Selected Areas in Communications 24 8 2006 2 15
22. Y. Zhang, Z. Ge, Finding critical traffic matrices, in: Proceedings of DSN'05, Yokohama, Japan, June 2005, pp. 188-197. (Pubitemid 41538233)
23. P. Pavon-Mariño, R. Aparicio-Pardo, G. Moreno-Muñoz, J. Garcia-Haro, J. Veiga-Gontan, MatPlanWDM: an educational tool for network planning in wavelength-routing networks, in: Proceedings of IFIP International Conference on Optical Network Design and Modelling, Athens, Greece, July 2007, pp. 58-67.
24. TOMLAB Optimization. Available from: (last access: 4-5-2010).