« PreviousContinue »
Traffic Engineering Techniques for Determining Trunk Requirements in Altemate Routing Trunk Networks”, C. J . Truitt, Bell System Technical Journal, vol. 23, No. 2, Mar. 1954, pp. 277-302.
Bell System Technical Journal, vol. 43, No. 5, Sep. 1964, Parts 1 and 2 (entire issue).
“DDD Network Optimization in Field Engineering—From Theory to Application”, Alfred Lotze, IEEE Transactions on Communications, vol. COM~22, No. 12, Dec. 1974, pp. 1921-1931.
“Engineering Traffic Networks for More Than One Busy Hour”, M. Eisenberg, Bell System Technical Journal, vol. 56, No. l, Jan. 1977, pp. 1-20.
Bell System Technical Journal, vol. 56, No. 7, Sep. 1977 (entire issue).
Bell System Technical Journal, vol. 57, No. 2, Feb. 1978 (entire issue).
“Large Scale Communication Networks—Design and Analysis”, Fischer et al., Omega. The International Jour
nal of Management Science, vol. 6, No. 4, 1978, pp. 331-340.
Primary Examiner-—Thomas W. Brown Attorney, Agent, or Firm—Richard J . Roddy
In a network for routing traffic from an originating node to a terminating node, it is common to provide alternate routes in order to increase the number of route choices between the originating and terminating nodes. The Bell System toll network employs a hierarchical alternate routing arrangement wherein various nodes, or control switching points (CSPs), are rank ordered for defining a process of routing calls through the network, whereby some CSPs are prohibited from routing traffic through other CSPs. Hence, known hierarchical alternate routing arrangements tend to inhibit route choices, which tends toward longer, and hence more costly, routes. Such problems tend to arise from the limited capability of electromechanical switching equipment. But with the increasing use of electronic stored program controlled CSPs, they can be solved with our alternate routing method which allows route choices without regard to network hierarchy. A plurality of routing sequences is generated, each route sequence including a plurality of route choices and being time sensitive to traffic demands, subject to a grade of service constraint and used for some predetermined time interval during which the sequence tends to mitigate network cost. An appropriate routing sequence is selected and in response thereto a signal is generated to identify a route choice. The route choice signal is then extended, perhaps on a call-by-call basis, to a node which is intermediate to the originating and terminating nodes for identifying the route to be followed in completing the call. In the event a link on the route choice is unavailable, a crankback signal is returned to the originating node. Responsive to the crankback signal, a second route choice from the routing sequence may be attempted from the originating node. This flexible, time sensitive arrangement tends toward increasing the number of route choices and toward mitigating or reducing route length and hence route cost.
7 Claims, 6 Drawing Figures