Advertisement

Cluster Computing

, Volume 3, Issue 2, pp 139–150 | Cite as

Traffic load monitoring and load balancing for the Internet

  • Bing Chen
  • Shahram Latifi
Article

Abstract

This paper proposes a class-based multipath routing algorithm to support Quality of Service (QoS). The algorithm is called Two-level Class-based Routing with Prediction (TCRP). Since frequently flooding routing information is very expensive for dynamic routing, the TCRP is designed to have the traffic load information monitored in one stable period as a guide to control traffic forwarding in the next stable period. The monitoring function is implemented by adopting the leaky bucket mechanism. In TCRP, the path selection function can utilize resources on multipath to achieve load balancing, increase network throughput and reduce the queuing delay. The extensive simulation is conducted to analyze the performance of the TCRP algorithm. The simulation results show that the TCRP can reduce packet drops and increase network throughput in any size network topology.

Keywords

Packet Forwarding Packet Drop Outgoing Link Bottleneck Link Destination Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Attar, A distributed adaptive multi-path routing-consistent and conflicting decision making, in: Proc. of 5th Berkeley Workshop on Distributed Data Management and Computer Networks (1981).Google Scholar
  2. [2]
    S. Bahk and M.E. Zarki, Dynamic mulit-path routing and how it compares with other dynamic routing algorithms for high speed wide area networks, in: Proc. of IEEE/ACM SIGCOMM'92 (1992) pp. 53-64.Google Scholar
  3. [3]
    Y. Bernet, J. Binder et al., A framework for differentiated services, IETF draft draft-ietf-diffserv-framework-00.txt (May 1998).Google Scholar
  4. [4]
    D. Bertsekas, Linear Network Optimization: Algorithms and Codes (The MIT Press, Cambridge, MA, 1991).Google Scholar
  5. [5]
    R. Callon, P. Doolan et al., A framework for multiprotocol label switching, IETF draft draft-ietf-mplsframework-02.txt (July 1997).Google Scholar
  6. [6]
    I. Cidon, R. Rom and Y. Shavitt, Multi-path routing combined with resource reservation, in: Prof. of Infocom'97 (1997).Google Scholar
  7. [7]
    M.R. Garey and D.S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).Google Scholar
  8. [8]
    Y. Goto et al., Path QoS collection for stable hop-by-hop QoS routing, in: Proc. of INET'97 (June 1997).Google Scholar
  9. [9]
    P. Harshavardhana et al., Congestion control for connectionless networks via alternate routing, in: Proc. of IEEE GLOBECOM'91 (1991) pp. 11.3.1-11.3.8.Google Scholar
  10. [10]
    J. Heinanen et al., Assured forwarding PHB group, IETF draft draft-ietf-diffserv-af-06.txt (February 1999).Google Scholar
  11. [11]
    C.E. Hopps, Analysis of an ECMP algorithm, IETF draft draft-hopps-ecmp-algo-analysis-00.txt (5 January 1999).Google Scholar
  12. [12]
    Q. Ma et al., Routing traffic with quality-of-service guarantees in integrated services networks, in: Proc. of Workshop on Network and Operating System Support for Digital Audio and Video (July 1998).Google Scholar
  13. [13]
    I. Matta and A.U. Shankar, Type-of-service routing in datagram delivery systems, in: Proc. of IEEE INFOCOM'94 (1994).Google Scholar
  14. [14]
    S. Murthy and J.J. Garcia-Luna-Aceves, Congestion-oriented shortest multipath routing, in: Proc. of IEEE INFOCOM, San Francisco (March 1996) pp. 1028-1036.Google Scholar
  15. [15]
    D.J. Nelson et al., An extended least-hop distributed routing algorithm, IEEE Transactions on Communications 38(4) (April 1990) 520–528.CrossRefGoogle Scholar
  16. [16]
    K. Nichols et al., A two-bit differentiated services architecture for the Internet, IETF draft draft-nichols-diff-svcarc-00.txt (November 1997).Google Scholar
  17. [17]
    Network simulation tool, http://www-mash.cs.berkeley.edu/ns/.Google Scholar
  18. [18]
    N.S.V. Rao and S.G. Batsell, QoS routing via multiple paths using bandwidth reservation, in: Proc. of IEEE INFOCOM'98 (1998).Google Scholar
  19. [19]
    Y. Shavitt, Burst control in high-speed networks, Ph.D. dissertation, Israel Institute of Technology (July 1996).Google Scholar
  20. [20]
    D.M. Topkis, A K shortest path algorithm for adaptive routing in communications networks, IEEE Transactions on Communications 36(7) (July 1988).Google Scholar
  21. [21]
    C. Villamizar, OSPF otimized multipath (OSPF-OMP), IETF draft draft-ietf-ospf-omp-00 (13 March 1998).Google Scholar
  22. [22]
    Z. Wang and J. Crowcroft, QoS routing for supporting resource reservation, IEEE/ACM Transactions on Networking 14(7) (1996) 1228–1234.Google Scholar
  23. [23]
    Z. Zhang, C. Sanchez et al., Quality of service extensions to OSPF (QOSPF), IETF draft draft-zhang-qos-ospf-01.txt.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Bing Chen
  • Shahram Latifi

There are no affiliations available

Personalised recommendations