Patent US6115383A successfully refreshed from Google Patents.
US6115383A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method of message distribution in a telecommunications network
Assignee: WSOU Investments LLC
•
Filing: 1997-09-12
•
Granted: 2000-09-05
•
Expires: 2017-09-12
Abstract
Abstract A signal transfer point (14) in a telecommunications network (10) distributes messages to a plurality of service control points (16) as a result of global title translation processing. The signal transfer point (14) assigns a message allocation to each of the service control points (16). The signal transfer point (14) equally distributes messages to the service control points (16) in a sequential manner. The signal transfer point (14) keeps track of the number of messages sent to each service control point (16). When a particular service control point (16) reaches its message allocation, the signal transfer point (14) prevents further messages to be sent to the particular service control point (16). The signal transfer point (14) then continues sequential and equal distribution to the remaining service control points (16) until each service control point (16) reaches its message allocation. The signal transfer point (14) then resets to send a next set of messages to the service control points (16). Message allocation is adjusted when any service control point (16) becomes unavailable.
Inventors
- 👤 Ronald Bradley Bell
- 👤 Russell Richard Cook
- 👤 Robin Lee Stege
- 👤 Robin Chenghai Gan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 02:16
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/0016; H04Q3/0029; H04Q3/0045
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
126 words
A method of message distribution in a telecommunications network, comprising steps of: assigning a message allocation to each of a plurality of subsystems within each of a plurality of processing nodes, each subsystem within its associated processing node defining a different service handled by its associated processing node; equally distributing messages to each of the plurality of subsystems according to a service associated with each message; tracking a number of messages distributed to each of the plurality of subsystems; preventing distribution of messages to a particular subsystem in response to reaching its assigned message allocation according to a service the particular subsystem defines; equally distributing messages according to a service associated with each message to remaining subsystems that have not reached their respective assigned message allocations.
Claim 2
Independent Claim
126 words
A method of message distribution in a telecommunications network, comprising steps of: assigning a message allocation to each of a plurality of subsystems within each of a plurality of processing nodes, each subsystem within its associated processing node defining a different service handled by its associated processing node; equally distributing messages to each of the plurality of subsystems according to a service associated with each message; tracking a number of messages distributed to each of the plurality of subsystems; preventing distribution of messages to a particular subsystem in response to reaching its assigned message allocation according to a service the particular subsystem defines; equally distributing messages according to a service associated with each message to remaining subsystems that have not reached their respective assigned message allocations.
Claim 3
Dependent Claim
49 words
The method of claim 1, wherein the messages are distributed in message sets, and further comprising a step of: resetting the tracking of the number of messages distributed to each of the plurality of subsystems after each message set in order to distribute messages from a subsequent message set.
Claim 4
Dependent Claim
44 words
The method of claim 1, further comprising steps of: determining whether each of the plurality of subsystems is available for message distribution; adjusting the message allocation for all available processing nodes and subsystems in response to an identification of unavailable processing nodes and subsystems.
Claim 5
Dependent Claim
30 words
The method of claim 3, further comprising a step of: readjusting the message allocation for all available subsystems in response to identification of an available subsystem previously identified as unavailable.
Claim 6
Dependent Claim
23 words
The method of claim 1, further comprising a step of: sequentially selecting the plurality of subsystems for message distribution for a given service.
Claim 7
Dependent Claim
36 words
The method of claim 5, further comprising steps of: determining whether a selected subsystem is available for message distribution; incrementing a transport counter associated with the selected subsystem in response to availability of the selected subsystem.
Claim 8
Dependent Claim
36 words
The method of claim 5, further comprising steps of: determining whether a selected subsystem is available for message distribution; incrementing a failure counter associated with the selected subsystem in response to unavailability of the selected subsystem.
Claim 9
Dependent Claim
45 words
The method of claim 5, further comprising steps of: determining whether any of the plurality of subsystems are available for message distribution for the given service; incrementing a group counter in response to unavailability of all of the plurality of subsystems for the given service.
Claim 10
Independent Claim
230 words
A method of message distribution in a telecommunications network, comprising steps of: assigning a message allocation to each of a plurality of processing nodes and to each subsystem within each of the plurality of processing nodes; equally distributing messages to each of the plurality of processing nodes and subsystems; tracking a number of messages distributed to each of the plurality of processing nodes and subsystems; preventing distribution of messages to a particular processing node in response to reaching its assigned message allocation; equally distributing messages to remaining processing nodes and subsystems that have not reached their respective assigned message allocations; determining whether each of the plurality of processing nodes and subsystems is available for message distribution; adjusting the message allocation for all available processing nodes and subsystems in response to an identification of unavailable processing nodes and subsystems, wherein the readjusting step includes altering a traffic load for each available processing node and subsystem according to a following equation: Z=(X*Y)/(T1*T2) where Z is a percent of traffic load to be added to a current traffic load of a particular available processing node, X is a total message allocation of all unavailable processing nodes, Y is the message allocation of the particular available processing node, T1 is a total message allocation of all of the plurality of processing nodes, and T2 is a total message allocation of all available processing nodes.
Claim 11
Independent Claim
230 words
A method of message distribution in a telecommunications network, comprising steps of: assigning a message allocation to each of a plurality of processing nodes and to each subsystem within each of the plurality of processing nodes; equally distributing messages to each of the plurality of processing nodes and subsystems; tracking a number of messages distributed to each of the plurality of processing nodes and subsystems; preventing distribution of messages to a particular processing node in response to reaching its assigned message allocation; equally distributing messages to remaining processing nodes and subsystems that have not reached their respective assigned message allocations; determining whether each of the plurality of processing nodes and subsystems is available for message distribution; adjusting the message allocation for all available processing nodes and subsystems in response to an identification of unavailable processing nodes and subsystems, wherein the readjusting step includes altering a traffic load for each available processing node and subsystem according to a following equation: Z=(X*Y)/(T1*T2) where Z is a percent of traffic load to be added to a current traffic load of a particular available processing node, X is a total message allocation of all unavailable processing nodes, Y is the message allocation of the particular available processing node, T1 is a total message allocation of all of the plurality of processing nodes, and T2 is a total message allocation of all available processing nodes.
Claim 12
Independent Claim
144 words
A method of message distribution in a telecommunications network, comprising steps of: assigning a message allocation to each of a plurality of processing nodes and to each subsystem within each of the plurality of processing nodes; equally distributing messages to each of the plurality of processing nodes and subsystems; tracking a number of messages distributed to each of the plurality of processing nodes and subsystems; preventing distribution of messages to a particular processing node in response to reaching its assigned message allocation; equally distributing messages to remaining processing nodes and subsystems that have not reached their respective assigned message allocations; partitioning the plurality of processing nodes and subsystems into primary and secondary processing nodes and subsystems; assigning a non-zero message allocation to each of the primary processing nodes and subsystems; assigning a zero message allocation to each of the secondary processing nodes and subsystems.
Claim 13
Independent Claim
144 words
A method of message distribution in a telecommunications network, comprising steps of: assigning a message allocation to each of a plurality of processing nodes and to each subsystem within each of the plurality of processing nodes; equally distributing messages to each of the plurality of processing nodes and subsystems; tracking a number of messages distributed to each of the plurality of processing nodes and subsystems; preventing distribution of messages to a particular processing node in response to reaching its assigned message allocation; equally distributing messages to remaining processing nodes and subsystems that have not reached their respective assigned message allocations; partitioning the plurality of processing nodes and subsystems into primary and secondary processing nodes and subsystems; assigning a non-zero message allocation to each of the primary processing nodes and subsystems; assigning a zero message allocation to each of the secondary processing nodes and subsystems.
Claim 14
Dependent Claim
69 words
The method of claim 10, further comprising steps of: sequentially selecting the primary processing nodes and subsystems for message distribution; determining whether a selected primary processing node and subsystem is available for message distribution; adjusting message distribution among the secondary processing nodes and subsystems according to the message allocation of the selected primary processing node and subsystem in response to unavailability of the selected primary processing node and subsystem.
Claim 15
Dependent Claim
32 words
The method of claim 11, further comprising a step of: dividing the message allocation of the unavailable selected primary processing node and subsystem approximately equally among the secondary processing nodes and subsystems.
Claim 16
Dependent Claim
34 words
The method of claim 11, further comprising steps of: readjusting message distribution back to the selected primary processing node and subsystem in response to the selected primary processing node and subsystem becoming newly available.
Claim 17
Dependent Claim
45 words
The method of claim 11, further comprising steps of: determining whether all secondary processing nodes and subsystems are available for message distribution; adjusting message distribution among available secondary processing nodes and subsystems according to the message allocation of the selected primary processing node and subsystem.
References Cited (Backward Citations)
US5719930A
Cited
US5878129A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-09-05 | 2004-03-06 | 2004-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-09-05 | 2008-03-06 | 2008-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-09-05 | 2012-03-06 | 2012-09-05 | $7700.00 | Window Closed / Lapsed |