Telephonic communications – Plural exchange network or interconnection – Connection call model
Patent
1994-04-12
1996-07-16
Hofsass, Jeffery
Telephonic communications
Plural exchange network or interconnection
Connection call model
379207, 370 16, H04M 700
Patent
active
055374689
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND OF THE INVENTION
The invention relates to a method for the non-hierarchical routing of traffic in a communications network.
A prior art method is already known from the printed document ITC-11 (1985) pp. 795-801, "Use of a trunk status map for real-time DNHR" by G. R. Ash. The known method exhibits significant losses in throughput under overload.
A prior art method is also known from the U.S. Pat. No. 4,669,113.
U.S. Pat. No. 4,669,113 discloses an integrated network controller for a dynamic non-hierarchical routing switching network.
From the European document EP-A-0 449 480 (corresponding to U.S. Pat. No. 5,101,451), a decentralized and near-real-time routing method is also known in which only a single alternate route is always used.
From the European document EP-A-0 376 556 (corresponding to U.S. Pat. No. 5,101,451), a decentralized and near-real-time routing method is also known in which only a single alternate route is always used.
From the document "Dynamic alternative routing in the British Telecom trunk Network", Stacey et al., ISS 87, a decentralized and near-real-time routing method is also known in which only a single alternate route is always used. As soon as a call overflowing to this alternate route is blocked, another possible alternate route is selected in accordance with the principle of random selection which is then used, in turn, as the only alternate route for the overflow traffic.
All previously known dynamic methods for the non-hierarchical routing of traffic only achieve optimum throughput values under certain traffic loads, i.e. they exhibit significant losses in throughput either under overload or under high or rated load.
SUMMARY OF THE INVENTION
The invention is based on the problem of achieving optimum throughput values for all traffic loads. This problem is solved by a method of the present invention for the non-hierarchical routing of traffic in a communications network which comprises a number of switching nodes which are intermeshed with one another via links in such a manner that a number of connection paths exist between two such switching nodes. The traffic between two such switching nodes is directed via at least one planned route. The traffic is directed via alternate routes in accordance with an alternate route sequence when a connection via a planned route is not possible. The alternate-route sequence represents an order of alternate routes ordered in accordance with increasing traffic loading states and is periodically determined in near-real-time time intervals. The alternate-route sequence is determined in the respective originating switching node. The alternate-route sequence is determined from a predetermined set of alternate routes, an alternate route, the traffic load condition of which exceeds a certain threshold value, also not being included in the alternate-route sequence.
Due to the real-time status-controlled adaptation of the number and order of the alternate routes available for the traffic, i.e. the alternate-route sequence, almost optimum throughput values or minimum transport costs are achieved under all load conditions.
If all alternate routes of a traffic pair are overloaded, only the planned routes or the planned route are finally still available for the traffic.
Due to this state-controlled route selection, the heavy load specific to traffic pairs is reduced, on the one hand, but, at the same time, the background load (traffic over planned routes plus overflow from other network sections) on the affected link sections is favored. This increases the successful throughput of the entire communications network. The method for non-hierarchical routing of traffic according to the invention therefore operates conservatively with reserved access and compatibly with other routing environments. It utilizes the generally non-coincident traffic minima (multi-hour routing) in real time by knowing allocation of idle channels (multi-service routing).
The method according to the invention can be called state-controlled dynamic non-hierarchical ro
REFERENCES:
patent: 4284852 (1981-08-01), Szybicki et al.
patent: 4345116 (1982-08-01), Ash et al.
patent: 4669113 (1987-05-01), Ash et al.
patent: 4704724 (1987-11-01), Krishnan et al.
patent: 4788721 (1988-11-01), Krishman et al.
patent: 4991204 (1991-02-01), Yamamoto et al.
patent: 5058105 (1991-10-01), Mansour et al.
patent: 5142570 (1992-08-01), Chaudhary et al.
"Towards Dynamic Network Control", Richards et al, Proceedings of the National Communications Forum, Oct. 1985, Rosemont, IL, pp. 596-600.
"Dynamic Alternative Routing In the British Telecom Trunk Network", Stacey et al, International Switching Symposium, Mar. 1987, Phoenix, AZ, pp. 984-988.
"Use of A Trunk Status Map For Real-Time DNHR", G. R. Ash, AT&T Bell Laboratories, Holmdel, N.J., ITC-11, 1985, pp. 795-801.
Hofsass Jeffery
Siemens Aktiengesellschaft
Wolinsky Scott
LandOfFree
Method for the non-hierarchical routing of traffic in a communic does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for the non-hierarchical routing of traffic in a communic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for the non-hierarchical routing of traffic in a communic will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1791042