Skip to main content
SpringerLink
Log in

Routing control in IP-networks with the variable performance criterion

  • Computer-Aided Design and Programming
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

For routing control in backbone IP-networks, we propose to part the control time interval into two segments and to use different performance criteria on them. It is assumed that distribution of flows is realized at the first step by the Dijkstra algorithm which is included in OSPF and is used in Sisco routers. The minimax criterion is proposed at the second step; it is realized in the robust algorithm of data incoming flows distribution adjustment. The object of the adjustment algorithm is to prevent or lower the probability of networks congestion. Characteristics of the proposed algorithm are studied. Efficiency of the adjustment algorithm application for network controlling is demonstrated by the Monte Carlo method. Speed characteristics of the proposed algorithm are compared with some optimal algorithms.

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

Access this article

Log in via an institution

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. Feldmann, A., Greenberg, A., Lund, C., et al., Derivin Traffic Demands for Operational IP Networks: Methodology and Experience, IEEE/ACM Trans. Network, 2001, vol. 9, no. 3, pp. 265–279.

    Article  Google Scholar 

  2. Kuznetsov, N.A., Control Algorithm Design under the Variable Criterion, Avtom. Telemekh., 1996, no. 5, pp. 5–14.

  3. Kuznetsov, N.A., Methods of Relay-linear Algorithms Realizing, Avtom. Telemekh., 1966, no. 7, pp. 110–118.

  4. Fortz, B. and Thorup, M., Optimizing OSPF/IS-IS Weights in a Changing World, IEEE J. Selected Commun., 2002, vol. 20(4), pp. 756–766.

    Article  Google Scholar 

  5. Lin, F.Y.S. and Wang, J.L., Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Services, Proc. IEEE Int. Conf. Commun., 1993, vol. 2, pp. 666–670.

    Google Scholar 

  6. Bertsekas, D.P., Optimal Routing and Flow Control Methods for Communication Networks, in Analysis and Optimization of Systems, Bensoussan, A. and Lions, J.L., Eds., New York: Springer-Verlag, 1982.

    Google Scholar 

  7. Ramakrishnan, K.G. and Manoel, A.R., Optimal Routing in Shortest-Path Data Networks, Bell Labs Tech. J., 2001, pp. 117–137.

  8. Tsai, W.K., Antonio, J.K., and Huang, G.M., Complexity of Gradient Projection Method for Optimal Routing in Data Networks, IEEE/ACM Trans. Network, 1999, vol. 7, no. 6, pp. 897–905.

    Article  Google Scholar 

  9. Applegate, D. and Cohen, E., Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs, Proc. ACM SIGCOMM’03 Conf. ACM, 2003.

  10. Sridharan, A., Guerin, R., and Diot, C., Achieving Near-Optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks, IEEE Trans. Network, 2005, vol. 13, no. 2, pp. 110–118.

    Google Scholar 

  11. Kuznetsov, N.A. and Fetisov, V.N., Robust Control of Information Networkks, Avtom. Telemekh., 2005, no. 8, pp. 86–101.

  12. Hill, B., Cisco: The Complete Reference, Osborne: McGraw-Hill, 1998. Translated under the title Polnyi spravochnik po Cisco, Moscow: Vil’yams, 2004.

    Google Scholar 

  13. Cisco—OSPF Design Guide, in Cisco Systems, 2002 (www.bspu.secna.ru/:_swp/cisco/ospf-design-guide.pdf).

  14. Schwartz, M., Telecommunication Networks: Protocols, Modelling, and Analysis, Reading: Addison-Wesley, 1987. Translated under the title Seti svyazi: protokoly, modelirovanie i analiz, Moscow: Nauka, 1992.

    Google Scholar 

  15. Kurose, J. and Ross, K., Computer Networking. A Top-Down Approach Featuring the Internet, Pearson: Addison-Wesley, 2000. Translated under the title Komp’yuternye seti. Mnogourovnevaya Arkhitektura Interneta, St. Petersburg: Piter, 2004.

    Google Scholar 

  16. Medina, A., Taft, N., Salamatian, K., et al., Traffic Matrix Estimation: Existing Techniques and New Directions, Proc. ACM SIGCOMM’02 Conf. ACM, 2002.

  17. Naugle, M. Illustrated TCP/IP. A Graphic Quide to the Protocol Suite, New York: Wiley, 2001. Translated under the title TCP/IP. Illyustrirovannyi uchebnik, Moscow: DMK, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    N. A. Kuznetsov & V. N. Fetisov

Authors
  1. N. A. Kuznetsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. N. Fetisov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © N.A. Kuznetsov, V.N. Fetisov, 2007, published in Avtomatika i Telemekhanika, 2007, No. 7, pp. 180–189.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuznetsov, N.A., Fetisov, V.N. Routing control in IP-networks with the variable performance criterion. Autom Remote Control 68, 1284–1293 (2007). https://doi.org/10.1134/S0005117907070144

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117907070144

PACS number

Search

Navigation