Skip to main content
Log in

Dynamic routing and admission control for virtual circuit networks

  • Papers
  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

The dynamic joint routing and admission control problem in multiple class multiple source-destination virtual circuit networks is considered. A nonlinear dynamic queueing model for virtual circuit networks that considers the dynamic interaction among the virtual circuit and packet processes is introduced. Then a multi-objective cost function of rejecting and maintaining virtual circuits, as well as of delaying and servicing packets is defined. The combined problem is formulated as an optimal control problem. Necessary optimality conditions are provided by Pontryagin's maximum principle. Sufficient optimality conditions based on the convexity of the Hamiltonian function are also given. For the finite horizon, the optimal controls can be found after numerically solving a Two-Point Boundary-Value Problem. For the longrun stationary equilibrium, the state-dependent routing and admission controls are derived.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Kleinrock,Queueing Systems, Vol. 1: Theory. J. Wiley & Sons, 1975.

  2. E. F. Wunderlich, An analysis of dynamic virutal circuit routing.Proc. IEEE National Telecommunications Conference, pp. A3.3–A3.3.6, IEEE 1981.

  3. A. Gersht, Analytical model of dynamic routing in virtual circuit packet switching network.Proc. International Conference on Computer Communicatons, pp. 76–80, IEEE 1992.

  4. E. M. Gafni and D. P. Bertsekas, Path assignment for virtual circuit routing.Proc. ACM SIGCOMM 1983 Conference, pp. 21–25, ACM 1983.

  5. J. M. Jaffe and A. Segall, Threshold design for dynamic routing.Proc. IEEE International Communications Conference, pp. 90–92, IEEE 1986.

  6. D. Tipper and M. K. Sundareshan, An optimal control approach to decentralized dynamic virtual circuit routing in computer networks.Proc. IEEE Infocom 90, pp. 926–933, IEEE 1990.

    Google Scholar 

  7. A. A. Economides, P. A. Ioannou, and J. A. Silvester, Decentralized adaptive routing for virtual circuit networks using stochastic learning automata.Proc. of IEEE Infocom 88 Conference, pp. 613–622, IEEE 1988.

  8. A. A. Economides, P. A. Ioannou, and J. A. Silvester, Adaptive routing and congestion control for window flow controlled virtual circuit networks.Proc. 27th Annual Allerton Conference on Communications, Control, and Computing, pp. 849–857, 1989.

  9. A. A. Economides, A unified game-theoretic methodology for the joint load sharing, routing and congestion control problem. Ph.D. Dissertation, University of Southern California, August 1990.

  10. A. A. Economides, P. A. Ioannou, and J. A. Silvester, Adaptive virtual circuit routing. submitted.

  11. M. G. H. Katevenis, Fast switching and fair control of congested flow in broadband networks.IEEE Journal on Selected Areas in Communications, Vol. SAC-5, No. 8, pp. 1315–1326, Oct. 1987.

    Article  Google Scholar 

  12. S. P. Morgan, Window flow control on a trunked bute-stream virtual circuit.IEEE Tr. on Communications, Vol. 36, No. 7, pp. 816–825, July 1988.

    Article  Google Scholar 

  13. J. Filipiak, Optimal control of store-and-forward networks.Optimal Control Applications & Methods, Vol. 3, pp. 155–176, 1982.

    Google Scholar 

  14. J. Filipiak,Modelling and Control of Dynamic Flows in Communication Networks. Springer-Verlag, 1988.

  15. A. E. Jr. Bryson and Y.-C. Ho,Applied Optimal Control. Hemisphere Publ. Co, 1975.

  16. W. A. Gruver and E. Sachs,Algorithmic Methods in Optimal Control. Pitman Advanced Publ, 1980.

  17. L. D. Berkovitz,Optimal Control Theory. Springer-Verlag, 1974.

  18. M. I. Kamien and N. L. Schwartz, Sufficient conditions in optimal control theory.Journal Economic Theory, Vol. 3, pp. 207–214, 1971.

    Article  Google Scholar 

  19. A. Seierstad and K. Sydsaeter, Sufficient conditions in optimal control theory.International Economic Review, Vol. 18, No. 2, pp. 367–391, June 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by the National Science Foundation under Grant DMC-8452002 together with matching funds from AT&T Information Systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Economides, A.A., Ioannou, P.A. & Silvester, J.A. Dynamic routing and admission control for virtual circuit networks. J Netw Syst Manage 3, 173–194 (1995). https://doi.org/10.1007/BF02146082

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02146082

Key Words

Navigation