Abstract: A service control point having multiple independent control processor and multiple front end communication processors incorporates a deterministic rule message distribution process for balancing the traffic load among the front end processors from all the independent control processors. The deterministic rule method is applied independently in each control processor and queues all outgoing messages in one of three queues; those that must be transmitted on Linkset-0, those that must be transmitted on Linkset-1, and those that can be transmitted on either linkset. Our message distribution process keeps all messages in queue until message number or timer threshold is reached. The traffic is routed to a front end processor such that the resulting distribution is closest to the expected distribution.

Abstract: A broadcast oriented architecture for a data storage access system is disclosed. The architecture permits the implementation of high capacity query intensive data bases for mass market public applications such as directory assistance systems. In the architecture, a record storage pump cyclically transmits the entire data base over a downstream channel formed from a transmission medium such as an optical fiber. Record retrieval elements located at different positions along the downstream channel read the entire data base during each cycle and pick out requested records from the data base. An upstream channel between the record retrieval elements and the record storage pump is used to transmit data base update information from the record retrieval elements to the record storage pump to provide each record retrieval element with a consistent view of the updated data base during subsequent data base broadcast cycles.

Abstract: A distributed control switching system where multi-port hunt groups are controlled by hunting for idle group members in a sequential fashion starting with the members on one of the switching modules of the system and continuing through a predetermined sequence of modules until an idle group member is found. The busy/idle hunt data is distributed across the modules so that each module maintains the hunt data for only the group members on that module. Therefore, no inter-module control communication is devoted to updating the hunt data of other modules.