Abstract

In a network, a route which can be uniquely identified is constructed by selecting an arbitrary packet-switching node and an arbitrary transmission line in an arbitrary order from the network. A route memory unit stores data indicating which route is involved in which transmission line within the network. A congested state detecting unit detects a congested state of a transmission line accommodated within its own node. The detected congested state is transmitted to another node by a congested state informing unit as congested state information. A route identifying unit receives the congested state information from the other node and retrieves a route within a corresponding transmission line from the route memory unit to thereby identify the route accommodated within its node. A route control unit carries out control of the congested state of the identified route on the basis of the received congested state information. As described above, since traffic passing the transmission line is classified into "route" and grouped, an object whose congestion is to be supervised is limited and each node can regulated only the traffic passing the transmission line in which the congestion occurred in units of routes.

Other References

• D. W. Glazer et al., "On Congestion Based Dynamic Routing," International Conference on Communications, vol. 2, Jun. 1987, pp. 974-979
• R. Jain et al., "Congestion Avoidance in Computer Networks with a Connectionless Network Layer: Concepts, Goals, and Methodology,", Computer Networking Symposium, Apr. 1988, pp. 134-143
• P. Joos et al., "A Statistical Bandwidth Allocation And Usage Monitoring Algorithm For ATM Networks," IEEE International Conference on Communications, vol. 1, Jun. 1989, pp. 415-422
• D. Chiu et al., "Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks", Computer Networks and ISDN Systems, vol. 17, No. 1, Jun. 1989, pp. 1-1