Skip to main content

Dynamic Bandwidth Reservation in Avirtual Private Network Under Uncertain Traffic

  • Chapter
Telecommunications Modeling, Policy, and Technology

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 44))

  • 527 Accesses

Abstract

A Virtual Private Network (VPN) is a telecommunication network, built by an operator, between distant sites of a customer’s firm. The aim of the operator is to manage optimally his network. The originality of the article lies in the representation of the problem as an iterative two side game. Indeed, the network operator wants to provide dynamically the best Quality of Service to his customers, while saving his resources. Consequently, he must be able to forecast the worst traffic evolution, so as to optimize dynamically bandwidth allocation. We use Markov Decision Processes to model the traffic uncertainty and Bellman optimality equation to determine optimal policies. Finally, to manage the curse of dimensionality due to the state space growth, we introduce techniques of simulation based on optimization over the policy space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Duffield, Goyal, Greenberg. (1999). A Flexible model for Resource Management in Virtual Private Networks.ACM SIGCOMM.

    Google Scholar 

  2. Naldi (2005). Risk Reduction in the Hose Model for VPN Design. EURONGI Workshop on QoS and Traffic Control.

    Google Scholar 

  3. Kumar, Rastogi et al. (2002). Algorithms for provisioning Virtual Private Networks in the Hose Model. IEEE Transactions on Networking.

    Google Scholar 

  4. Hiriart-Urruty (1996). L’Optimisation. Presses Universitaires de France.

    Google Scholar 

  5. Filar, Vrieze (1996). Competitive Markov Decision Processes. Springer.

    Google Scholar 

  6. Zhang, Liu, Gong, Towsley (2005). On the Interaction Between Overlay Routing and Traffic Engineering (MPLS), Conflicts in Routing Games. INFOCOMM.

    Google Scholar 

  7. Ben-Ameur, Kerivin (2005). Routing of Uncertain Traffic Demands. Springer Science & Business Media, Optimization and Engineering.

    Google Scholar 

  8. Korilis, Lazar, Orda (1997). Achieving Network Optima Using Stackelberg Routing Strategies. IEEE/ACM Transactions on Networking. Vol.5.

    Google Scholar 

  9. Nilim, El Ghaoui (2004). Algorithms for Air Traffic Flow Management under Stochastic Environments. Proceedings of American Control Conference.

    Google Scholar 

  10. Smallwood, Sondik (1973). The Optimal Control of Partially Observable Markov Processes over a Finite Horizon. Operational Research. vol 21. pp.1071-1088.

    MATH  Google Scholar 

  11. Monahan (1982). A Survey of POMDPs: Theory, Models, and Algorithms. Management Science, Vol.28.

    Google Scholar 

  12. Lovejoy (2005). A survey of Algorithmic Methods for POMDPs. Annals of Operations Research. Springer Netherlands.

    Google Scholar 

  13. Pineau, Gordon, Thrun (2003). Point-based value iteration: An anytime algorithm for POMDPs. UAI.

    Google Scholar 

  14. Marbach, Tsitsiklis (2001). Simulation-Based Optimization of Markov Reward Processes. IEEE Transactions on Automatic Control. Vol.46.

    Google Scholar 

  15. Marbach, Tsitsiklis (2003). Approximate Gradient Methods in Policy-Space Optimization of Markov Reward Process. Journal of Discrete Event Dynamical Systems. Vol.13.

    Google Scholar 

  16. Raghunath, Ramakrishnan et al. (2005). Trade-offs in Resource Management for Virtual Private Network. IEEE INFOCOMM.

    Google Scholar 

  17. Melo, Ribeiro (2006). Convergence of Classical Reinforcement learning Algorithms and Partial Observability. Technical Report.

    Google Scholar 

  18. Gunnar, Johansson, Telkamp (2004). Traffic Matrix Estimation on large IP Backbone- A comparison on Real Data. IMC’04.

    Google Scholar 

  19. Medinan, Salamatian, Battacharyya, Diot (2002). TrafficMatrix Estimation: Existing techniques and New Directions. SIGCOMM’02.

    Google Scholar 

  20. Vaton, Bedo, Gravey (2005). Advanced Methods for the Estimation of the Origin- Destination Traffic matrix, Performance evaluation and Planning Methods for the Next Generation Internet. Book of the 25 th GIRARD’s birthday.

    Google Scholar 

  21. Zhang, Roughan, Donoho (2003). An Information-Theoretic Approach to Traffic Matrix Estimation. in Proceedings ACM SIGCOMM.

    Google Scholar 

  22. Roughgarden, Tardos (2000). How Bad is Selfish Routing?. IEEE Symposium on Foundations of Computer Science.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Cadre, H.L., Bouhtou, M. (2008). Dynamic Bandwidth Reservation in Avirtual Private Network Under Uncertain Traffic. In: Raghavan, S., Golden, B., Wasil, E. (eds) Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces, vol 44. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77780-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-77780-1_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-77779-5

  • Online ISBN: 978-0-387-77780-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics