US5491798A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for network call management
Assignee: International Business Machines Corp
•
Filing: 1993-11-10
•
Granted: 1996-02-13
•
Expires: 2013-11-10
Abstract
Abstract A network comprises a set of nodes, each comprising a computer workstation in a computer network and including means responsive to messages from other computers in the network to join or leave a call. Each node maintains a list of calls in which that node is participating, an entry in the list for a call including the identities of all the other nodes in that call. In order to split a single call one node sends messages to a subset of nodes to join a second call, and leave the original call. The remaining parties in the original call then continue in a call of reduced scope. In order to merge two calls together, a node that is common to both calls sends messages to all the nodes in both calls, instructing them to leave the existing call and join a new call.
Inventors
- 👤 Gordon W. Bonsall
- 👤 Howard S. Lambert
- 👤 H. David Mitchell
- 👤 Barry K. Aldred
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 08:38
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/64; H04Q3/66; H04Q3/665; H04L; H04L12/00; H04L12/02; H04L12/16; H04L12/18; H04L12/1813; H04M; H04M3/00; H04M3/42; H04M3/56; H04M3/567; H04L12/185
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
188 words
A method of splitting an initial call that exists across an initial set of nodes into first and second calls across first and second disjoint subsets of the initial set, each node comprising a computer workstation in a computer network and including means responsive to messages from other computers in said network to join or leave a call, and each node maintaining a list of calls in which that node is participating, an entry in the list for a call including the identities of all the other nodes in that call, the method comprising the steps of: producing at one node in said initial set a list of said first subset of nodes to be included in said first call, whereby said second call is to be between nodes in the initial set for but in said first subset; said one node sending a message to each node in said first subset of nodes including instructions to leave said initial call and join said first call; and each node upon receipt of said message performing the necessary actions to leave said initial call and join said first call.
Claim 2
Independent Claim
188 words
A method of splitting an initial call that exists across an initial set of nodes into first and second calls across first and second disjoint subsets of the initial set, each node comprising a computer workstation in a computer network and including means responsive to messages from other computers in said network to join or leave a call, and each node maintaining a list of calls in which that node is participating, an entry in the list for a call including the identities of all the other nodes in that call, the method comprising the steps of: producing at one node in said initial set a list of said first subset of nodes to be included in said first call, whereby said second call is to be between nodes in the initial set for but in said first subset; said one node sending a message to each node in said first subset of nodes including instructions to leave said initial call and join said first call; and each node upon receipt of said message performing the necessary actions to leave said initial call and join said first call.
Claim 3
Dependent Claim
37 words
A method of splitting a call as claimed in claim 1, wherein a node cannot be remotely compelled to leave a call, but wherein nodes are responsive to requests from other nodes to perform such an action.
Claim 4
Dependent Claim
66 words
A method of splitting a call as claimed in claim 1, wherein each call has a name, and no node may participate in two calls having the same name, the method further comprising the steps of producing at said one node a name for said first call, and including the name for said first call in the messages sent to each node of said first subset.
Claim 5
Dependent Claim
34 words
A method of splitting a call as claimed in claim 3, further comprising the step of including the name of the initial call in the messages sent to each node in said first subset.
Claim 6
Dependent Claim
37 words
A method of splitting a call as claimed in claim 3, wherein a node cannot be remotely compelled to leave a call, but wherein nodes are responsive to requests from other nodes to perform such an action.
Claim 7
Dependent Claim
37 words
A method of splitting a call as claimed in claim 4, wherein a node cannot be remotely compelled to leave a call, but wherein nodes are responsive to requests from other nodes to perform such an action.
Claim 8
Independent Claim
53 words
A method of splitting a call as claimed in any preceding claim, wherein as each node of said first subset receives said message from said one node, it sends back a confirmation message to said one node, which then forwards the message to the other nodes that have so far joined said subset.
Claim 9
Dependent Claim
37 words
A method of splitting a call as claimed in claim 7, wherein a node cannot be remotely compelled to leave a call, but wherein nodes are responsive to requests from other nodes to perform such an action.
Claim 10
Independent Claim
181 words
A method of merging first and second calls that exist across first and second initial sets of nodes into a single call across a superset of said first and second initial sets, each node comprising a computer workstation in a computer network and including means responsive to messages from other computers in said network to join or leave a call, and each node maintaining a list of calls in which that node is participating, an entry in the list for a call including the identities of all the other nodes in that call, the method comprising the steps of: one node sending a message to each node in said first initial set of nodes including instructions to leave said first call and join said single call; said one node sending a message to each node in said second initial set of nodes including instructions to leave said second call and join said single call; and each node upon receipt of said message performing the necessary actions to leave the first or second initial call as appropriate and join the single call.
Claim 11
Independent Claim
181 words
A method of merging first and second calls that exist across first and second initial sets of nodes into a single call across a superset of said first and second initial sets, each node comprising a computer workstation in a computer network and including means responsive to messages from other computers in said network to join or leave a call, and each node maintaining a list of calls in which that node is participating, an entry in the list for a call including the identities of all the other nodes in that call, the method comprising the steps of: one node sending a message to each node in said first initial set of nodes including instructions to leave said first call and join said single call; said one node sending a message to each node in said second initial set of nodes including instructions to leave said second call and join said single call; and each node upon receipt of said message performing the necessary actions to leave the first or second initial call as appropriate and join the single call.
Claim 12
Dependent Claim
68 words
A method of merging a call as claimed in claim 9, wherein each call has a name, and no node may participate in two calls having the same name, said method further comprising the steps of producing at said one node a name for said single call, and including the name for said single call in the messages sent to each node in said first and second sets.
Claim 13
Dependent Claim
49 words
A method of merging a call as claimed in claim 9 further comprising the initial step of selecting said one node, and if the selected node is not already included in both the first and second calls, adding said one node to the first or second call as appropriate.
Claim 14
Dependent Claim
49 words
A method of merging a call as claimed in claim 11 further comprising the initial step of selecting said one node, and if the selected node is not already included in both the first and second calls, adding said one node to the first or second call as appropriate.
Claim 15
Dependent Claim
52 words
A method of merging a call as claimed in claim 10 further comprising the step of including the name of the first call in the message sent to each node in said first set, and the name of the second call in the message sent to each node in said second set.
Claim 16
Dependent Claim
49 words
A method of merging a call as claimed in claim 10 further comprising the initial step of selecting said one node, and if the selected node is not already included in both the first and second calls, adding said one node to the first or second call as appropriate.
Claim 17
Dependent Claim
49 words
A method of merging a call as claimed in claim 14 further comprising the initial step of selecting said one node, and if the selected node is not already included in both the first and second calls, adding said one node to the first or second call as appropriate.
Claim 18
Dependent Claim
49 words
A method of merging a call as claimed in claim 13 further comprising the initial step of selecting said one node, and if the selected node is not already included in both the first and second calls, adding said one node to the first or second call as appropriate.
Claim 19
Independent Claim
43 words
A method of merging a call as claimed in any of claims 9, 10, 13 or 16, wherein a node cannot be remotely compelled to leave a call, but wherein nodes are responsive to requests from other nodes to perform such an action.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-02-12 | 1999-08-14 | 2000-02-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-02-12 | 2003-08-14 | 2004-02-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-02-12 | 2007-08-14 | 2008-02-13 | $7700.00 | Window Closed / Lapsed |