Dynamic Network Provisioning for Time-Varying Traffic

  • Published : 2007.12.31

Abstract

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

Keywords

References

  1. 'Requirement for traffic engineering over MPLS,' IETF RFC 2702
  2. T. Anjali, C. Scoglio, and J. C. de Oliveira, 'New MPLS network management techniques based on adaptive learning,' IEEE Trans. Neural Netw., vol. 16, no. 5, Sept. 2005
  3. S. Bessler, 'Label switched paths re-configuration under time-varying traffic conditions,' ITC Specialist Seminar, Wurzburg, July 2002
  4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. The MIT Press, 1990
  5. B. Davie and Y. Rekter, MPLS - Technology and Applications. Academic Press, 2000
  6. N. Md. Din and N. Fisal, 'Dynamic resource allocation of IP traffic for a diffserv-MPLS interface using fuzzy logic,' in Proc. 9th Asia Pacific Conf. Commun. (APCC), 2003
  7. A. Elwalid, C. Jin, S. Low, and I. Widjaja, 'MATE: MPLS adaptive traffic engineering,' in Proc. IEEE INFOCOM, Anchorage, Mar. 2001
  8. D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems. Brooks Cole Publishers, 1996
  9. K. Kar, M. Kodialam, and T. V. Lakshman, 'Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications,' IEEE J. Sel. Areas in Commun., vol. 18, no. 12, Dec. 2000
  10. L. Kleinrock, Queueing Systems (Vol. II). John Wiley & Sons, 1975
  11. H. Levy, T. Mendelson, and G. Goren, 'Dynamic allocation of resources to virtual path agents,' IEEE/ACM Trans. Netw., vol. 12, no. 4, Aug. 2004
  12. F. Ricciato, S. Salsano, A. Belmonte, and M. Listanti, 'Offline configuration of a MPLS over WDM network under time-varying offered traffic,' in Proc. IEEE INFO COM, Anchorage, AK, Mar. 2001
  13. E. Rosen, A. Viswanathan, and R. Callon, 'Multiprotocol label switching architecture,' IETF RFC 3031
  14. S. Ross, Stochastic Processes. Wiley, 1995