Advertisement

Photonic Network Communications

, Volume 19, Issue 1, pp 42–54 | Cite as

Virtual topology design and flow routing in optical networks under multihour traffic demand

  • Pablo Pavon-Marino
  • Ramon Aparicio-PardoEmail author
  • Belen Garcia-Manrubia
  • Nina Skorin-Kapov
Article

Abstract

This article addresses the problem of finding a static virtual topology design and flow routing in transparent optical wavelength division multiplexing networks under a time-varying (multihour) traffic demand. Four variants of the problem are considered, using fixed or dynamically adaptable (meaning variable) flow routing, which can be splittable or unsplittable. Our main objective is to minimize the number of transceivers needed which make up for the main network cost. We formulate the problem variants as exact integer linear programs (ILPs) and mixed ILPs. For larger problem instances, we also propose a family of heuristics based on the concept of domination between traffic matrices. This concept provides the theoretical foundations for a set of techniques proposed to reduce the problem complexity. We present a lower bound to the network cost for the case in which the virtual topology could be dynamically reconfigured along time. This allows us to assess the limit on the maximum possible benefit that could be achieved by using optical reconfigurable equipment. Extensive tests have been conducted, using both synthetically generated and real-traced traffic demands. In the cases studied, results show that combining variable routing with splittable flows obtains a significant, although moderate, cost reduction. The maximum cost reduction achievable with reconfigurable virtual topologies was shown to be negligible compared to the static case in medium and high loads.

Keywords

Virtual topology design Flow routing Periodic traffic Traffic domination 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    TOTEM Project: Toolbox for Traffic Engineering MethodsGoogle Scholar
  2. 2.
    Konda, V.R., Chow, T.Y.: Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In: Proceedings of IEEE Workshop on High Performance Switching and Routing, Dallas, TX, pp. 218–221 (2001)Google Scholar
  3. 3.
    Zhu K., Zhu H., Mukherjee B.: Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming. IEEE Netw. 17(2), 8–15 (2003)CrossRefGoogle Scholar
  4. 4.
    Srinivas N., Siva Ram Murthy C.: Design and dimensioning of a WDM mesh network to groom dynamically varying traffic. Photon. Netw. Commun. 7(2), 179–191 (2004)CrossRefGoogle Scholar
  5. 5.
    Mukherjee B., Banerjee D., Ramamurthy S., Mukherjee A.: Some principles for designing a wide-area WDM optical network. IEEE/ACM Trans. Netw. 4(5), 684–696 (1996)CrossRefGoogle Scholar
  6. 6.
    Oriolo G.: Domination between traffic matrices. Math. Oper. Res. 33(1), 91–96 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kratz M., Ackerman M., Hanss T., Corbato S.: NGI and Internet2: accelerating the creation of tomorrow’s internet. Stud. Health Technol. Inform. 84(1), 28–32 (2001)Google Scholar
  8. 8.
    Pioro M., Medhi D.: Multi-hour and multi-time-period network modelling and design. In: Pioro, M., Medhi, D. (eds) Routing, Flow, and Capacity Design in Communication and Computer Networks, pp. 455–474. Morgan Kaufmann, San Francisco (2004)CrossRefGoogle Scholar
  9. 9.
    Agrawal, G., Medhi, D.: Lightpath topology configuration for wavelength-routed IP/MPLS Networks with time-dependent traffic. In: Proceedings of IEEE Globecom’06, San Francisco, CA, pp. 1–5 (2006)Google Scholar
  10. 10.
    Ricciato, F., Salsano, S., Belmonte, A., Listanti, M.: Offline configuration of a MPLS over WDM network under time-varying offered traffic. In: Proceedings of Infocom’02, New York, pp. 57–65 (2002)Google Scholar
  11. 11.
    Garcia-Manrubia, B., Aparicio-Pardo, R., Pavon-Mariño, P., Skorin-Kapov, N., Garcia-Haro, J.: MILP formulations for scheduling lightpaths under periodic traffic. In: Proceedings of ICTON’09 (invited paper), Azores, Portugal (2009)Google Scholar
  12. 12.
    Skorin-Kapov, N., Pavon-Mariño, P., Garcia-Manrubia, B., Aparicio-Pardo, R.: Scheduled virtual topology design under periodic traffic in transparent optical networks. In: Proceedings of Broadnets’09, Madrid, Spain (2009)Google Scholar
  13. 13.
    Wang, B., Li, T., Luo, X., Fan, Y., Xin, C.: On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks. In: Proceedings of IEEE Broadnets’05, Boston, MA, pp. 15–24 (2005)Google Scholar
  14. 14.
    Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing and scheduling algorithms for optical networks. In: Proceedings of 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, pp. 412–423 (1994)Google Scholar
  15. 15.
    Pavon-Marino, P., Aparicio-Pardo, R., Moreno-Muñoz, G., Garcia-Haro, J., Veiga-Gontan, J.: MatPlanWDM: an educational tool for network planning in wavelength-routing networks. In: Proceedings of IFIP International Conference on Optical Network Design and Modeling, Athens, Greece, pp. 58–67 (2007)Google Scholar
  16. 16.
    Holmström, K., Göran, A.O., Edvall, M.M.: User’s Guide for TOMLAB/CPLEX v11.2 (2009)Google Scholar
  17. 17.
    Milbrandt, J., Menth, M., Kopf, S.: Adaptive bandwidth allocation: impact of traffic demand models for wide area networks. In: Proceedings of 19th International Teletraffic Congress (ITC19), Beijing, China (2005)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Pablo Pavon-Marino
    • 1
  • Ramon Aparicio-Pardo
    • 1
    Email author
  • Belen Garcia-Manrubia
    • 1
  • Nina Skorin-Kapov
    • 2
  1. 1.Technical University of Cartagena (UPCT)CartagenaSpain
  2. 2.Faculty of Electrical Engineering and Computing (FER)University of ZagrebZagrebCroatia

Personalised recommendations