Abstract:
A call-processing arrangement (200) views a network numbering plan as a language in the mathematical/computer science sense and takes a lexicographic approach to call processing. Numbering plan syntax is defined by data in tree data structures (320, 330), and numbering plan grammar is defined by data in matrix data structures (400, 410). The data structures are used by numbering plan-independent functions to determine the meaning of call-associated digit strings and to specify the treatment (e.g., routing, features,) to be given to the call based on that meaning. A string-identification function (340) applies collected digits to the trees and matrices to find leafs (312) that define digit strings that make up the number. A string-action function (341) uses the definitions in the found leafs to form a call- route-specifying or call-feature-specifying index (254) for the call. A generalized route- selection function (343) uses a set of first call characteristics including the route-or-feature-specifying index to select from multi-dimensional matrices (1200, 1202) either a feature module (205) to be invoked or a routing-pattern number (1201), and in the latter case uses a set of second call characteristics including the routing-pattern number to select a route preference (1701) from routing pattern-preference tables (1300). A digit-sending function (344) uses the route preference to select an entry of digit-sending information (1701) from a sending table (1700) and uses the sending information to establish a call path and to outpulse digits. A digit modification function (343) and a table (1000) of digit modifications are also provided for purposes of number conversion, such as between different network numbering plans when more than one is defined.
Abstract:
A common adjunct switch (150) integrated with a telecommunications network (100) and associated with a plurality of predetermined telephone numbers prefixed by a common code is provided with a facility which allows telephone subscribers (S1, S2...) that are assigned respective ones of the telephone numbers to personalize the way in which they receive telephone calls. For example, a subscriber may program an associated service record to put into effect call forwarding or call screening. In addition, a subscriber may be associated with one or more caller identification numbers, in which a caller identification number is used to determine whether a call placed to a service number is billed to the called subscriber or the calling party.
Abstract:
Method and apparatus for handling incoming telephone calls and, in particular: (a) for delivering predetermined messages to predetermined calling parties; (b) predetermined, prioritorized screening of incoming telephone calls; and (c) for re-routing incoming telephone calls on the basis of predetermined selection criteria. The predetermined selection criteria include information such as the calling parties' call origination information, call origination information with wildcards, time, date, or a combination of these factors. Call origination information includes, but is not limited to, Automatic Number Identification ("ANI"), private network tie line identification, trunk ID, Wide Area Telephone Service ("WATS"), and extension numbers.
Abstract:
This invention relates to a method and apparatus for establishing connections over a public switched telephone network to a customer whose telephone number is in a block associated, for routing purposes, with a first telephone switching system (40), but who is actually served by a second telephone switching system (50). The method is desirable in order to serve customers who need the advanced functions of a digital switching system, who are currently served by an analog switching system (40), and do not wish to have their telephone number changed when they switch to being served by the digital switching system (50). In the invention, a centralized database (90) is queried to find the identity of the switch serving the called customer. The database retums a routing index (95) for routing the call to that switch.
Abstract:
5 n7 This invention relates to a method of establishing connections over a public switched telephone network to a customer whose telephone number is in a block associated, for routing purposes, with a first telephone switching system, but who is actually served by a second telephone switching system. The facility for carrying out this method is desirable in order to serve customers who need the advanced functions of a digital switching system, who are currently served by an analog switching system, and do not wish to have their telephone number changed when they switch to being served by the digital switching system. In accordance with the invention, a common channel signaling initial address message is sent to the first system. The first system translates the telephone number of that initial address message and finds that the customer for that telephone number is now served by a second switch. The first switch then sends a release message containing the identification of the second switch back to the source of the initial address message. The source of the first initial address message then sends a second initial address message to the identified second switch and the call connection can now be established to the customer served by the second switch. During the time the customer is being moved from the first switch to the second switch, one of the two returns a "temporarily out of service" type of announcement.
Abstract:
A decentralized, state dependent access-control and routing strategy for real-time control of circuit switched networks. To decentralize the traffic control tasks, we partition the network into subnets and assign a specific traffic controller to each one. The traffic controllers obtain periodic (approximately every 5 minutes) subnet measurements and compute the optimal traffic control policy of the subnet through an iterative and parallel dialog with the other controllers. Each controller implements the new control policy within its subnet until the next measurement epoch, thereby allowing decentralized call handling. In the formulation of the joint access-control and routing problem, we allocate the incoming demand (for a given period), the optimal strategy to maximize the predicted minimum (over all network Trunk Groups) Trunk Group residual capacity. Secondly, when the projected demand can not be accommodated through this strategy, the optimal strategy rejects the extra demand at source, in an "equitable" manner. The mathematical formulation of the above routing and access-control objectives leads to an Equilibrium Programming Problem (EPP). The EPP formulation is decomposed into a number of subproblems and solved--in parallel--by the inter-communicating subnet controllers, thereby satisfying real-time control requirements. The ensemble of the subproblem solutions forms the network-wide (globally) optimal traffic management strategy for the upcoming period.
Abstract:
An effective private line service between predetermined stations (101,103) is provided by means of a public switched network (110). When a calling station (101) goes off-hook, a non-dial able routing number (RN) is identified, either (178) in a database held in the local switch (120) or (176) in a central software-defined network control point (130). This routing number is used to set up a connection between the two stations.
Abstract:
In a telecommunication system having a plurality of cooperating exchanges and using a separate signaling network, an existing exchange (101) is replaced by a new exchange (102) by a piecemeal transferring of interexchange trunks (130,140) from the existing exchange to the new exchange and testing the trunks on the new exchange. All signaling messages pertaining to trunks originally resident on the existing exchange are addressed to the existing exchange, are intercepted and are selectively forwarded to the new exchange on the basis of recorded data defining moved to the new exchange. One embodiment uses a point code converter (120) connected between a signal transfer access point (110) for the signaling network and both the old (101) and the new (102) exchange. The converter receives all messages addressed to the existing exchange and transfers the messages to either the old or the new exchange, depending on the present location of the trunk. Messages transmitted from the new exchange to other exchanges of the network are modified by inserting the identity of the old exchange as the source of the message. Another embodiment assigns a pseudo point code (address) to the new exchange and messages addressed to the existing exchange and pertaining to trunk circuits on the new exchange, are modified to include the pseudo point code and are transmitted via the signal transfer point to the new exchange. Messages from the new exchange destined for other exchanges of the network are relayed via the old exchange to the ultimate destination of the message.
Abstract:
There is provided herein a system and method for automatic configuration of data routings for use with electronic data such as phone calls, faxes, etc. In the preferred embodiment, when more than one carrier might potentially terminate the transmission, the carriers are ordered based on some screening criterion (e.g., transmission price). Data transmissions are then assigned to the carriers based on the sorting order, with the second place and lower carriers (e.g., the higher priced carriers) not being selected unless the first carrier cannot complete the transaction. The switch instructions necessary to implement this scheme are generated automatically.