A new routing assignment model for Internet

Article
Received:
  • 18 Downloads

Abstract

This paper builds a new traffic assignment model for Internet. The routing policy based on this model can realize load splitting in a network automatically, which overcomes the shortcoming of OSPF and satisfies the load balancing requirement of IETF.

Keywords

IP routing linear programming simulation 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tanenbaum, A. S., Computer Networks, 3rd ed., New York: Prentice-Hall International, Inc., 1995.Google Scholar
  2. 2.
    Schwartz, M., Stern, T. E., Routing techniques used in computer communication netwroks,IEEE Transactions on Communications, 1980, COM-28(4): 539.CrossRefGoogle Scholar
  3. 3.
    Rudin, H., On routing and delta routing a taxonomy and performance comparison for packet switched networks, IEEE Transactions on Communications, 1976, COM-24(1): 43.CrossRefGoogle Scholar
  4. 4.
    Hayes, J. F., Modeling and Analysis of Computer Communications Networks, New York: Plenum Press, 1984.Google Scholar
  5. 5.
    Villamizar, C., Ospf optimized multipath, Internet draft, IETF, March 1998, draft-ietf-omp-00.txt.Google Scholar
  6. 6.
    Villamizar, C., Li, T., Is-is optimized multipath, Internet draft, IETF, 1999, draft-ietf-isis-omp-01.txt.Google Scholar
  7. 7.
    Mitra, D., Morrison, J. A., Ramakrishnan, K. G., ATM network design and optimization: A multirate loss network framework, IEEE/ACM Transactions on Networking, 1996, 4(4): 531.CrossRefGoogle Scholar
  8. 8.
    Faragó, A., Blaabjerg, S., László, A., et al., A new degree of freedom in ATM network dimensioning: Optimizing the logical configuration, IEEE J. Selected Areas in Communications, 1995, 13(7): 1199.CrossRefGoogle Scholar
  9. 9.
    Chen, S. G., Nahrstedt, K., An overview of quality of service routing for next-generation high-speed networks: problems and solutions, IEEE Network, 1998, 12(6): 64.CrossRefGoogle Scholar
  10. 10.
    Foschini, G. J., A basic dynamic routing problem and diffusion, IEEE Transactions on Communications, 1978, COM-26, No. 3. 0110 0170 VGoogle Scholar
  11. 11.
    Spiess, H., Florian, M., Optimal strategies: A new assignment model for transit networks, Transpn. Res., 1989, 23B(2): 83.CrossRefGoogle Scholar

Copyright information

© Science in China Press 2001

Authors and Affiliations

  1. 1.Institute of Applied MathematicsChinese Academy of SciencesBeijingChina

Personalised recommendations