← Back to Patent Explorer
US5452287A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of negotiation of protocols, classes, and options in computer and communication networks providing mixed packet, frame, cell, and circuit services

Assignee: Motorola Mobility LLC
•
Filing: 1993-09-20
•
Granted: 1995-09-19
•
Expires: 2013-09-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The network negotiates user protocols, classes, and options between a calling user and a called user using the results to determine an optimal method of user information transport. A strategy for determining the optimal user information transport method from negotiated user protocols, classes and options includes querying the destination edge for destination related PC&O, sending this information back to the source and subsequently proceeding with traditional source to destination call processing.

Inventors

  • 👤 Stephen DiCecco
  • 👤 Steven R. Cook
  • 👤 Anthony J. Risica

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 09:27
CPC Classifications
H; H04; H04L; H04L69/00; H04L69/24

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 160 words
A method for processing calls for a cell relay network, the network connecting a plurality of network users, the network users connected to the network through a plurality of nodes, the network having diverse sets of user protocols, classes, and options (PC&O) where such protocol information about each network user is maintained at the node connecting the network user to the network, the method comprising the steps of: (a) having a call made by a source user attached to a source node, the call being made to a set of destination users attached to a set of destination nodes; (b) at the source node, locating the set of destination nodes; (c) at the source node, conferring with the set of destination nodes to determine the set of PC&O associated with each destination user; (d) combining PC&O from the source node and the set of destination nodes; and (e) determining the protocol used for transport of user information across the network.
Claim 2
Independent Claim 160 words
A method for processing calls for a cell relay network, the network connecting a plurality of network users, the network users connected to the network through a plurality of nodes, the network having diverse sets of user protocols, classes, and options (PC&O) where such protocol information about each network user is maintained at the node connecting the network user to the network, the method comprising the steps of: (a) having a call made by a source user attached to a source node, the call being made to a set of destination users attached to a set of destination nodes; (b) at the source node, locating the set of destination nodes; (c) at the source node, conferring with the set of destination nodes to determine the set of PC&O associated with each destination user; (d) combining PC&O from the source node and the set of destination nodes; and (e) determining the protocol used for transport of user information across the network.
Claim 3
Dependent Claim 19 words
The method of claim 1 where step (a) includes the additional step of the source user requesting a call.
Claim 4
Dependent Claim 20 words
The method of claim 1 where step (a) includes the additional step of calling at a time of day (TOD).
Claim 5
Dependent Claim 27 words
The method of claim 1 where step (b) includes the step of determining a set of addresses identifying the source user and the set of destination users.
Claim 6
Dependent Claim 25 words
The method of claim 4 including the additional step of, for each address in the set, using that address to determine the associated destination node.
Claim 7
Dependent Claim 44 words
The method of claim 5 where step (c) includes the additional step of determining source user PC&O based upon the address of the source user, if such PC&O were not provided to the network by the source user when the attempted call was placed.
Claim 8
Dependent Claim 26 words
The method of claim 6 where step (c) includes the additional step of transmitting the PC&O from the source node to the set of destination nodes.
Claim 9
Dependent Claim 38 words
The method of claim 7 where step (c) includes the additional step of determining destination user PC&O based upon the address of the destination user, if such PC&O cannot be provided to the network by the destination user.
Claim 10
Dependent Claim 26 words
The method of claim 8 where step (d) includes the step of determining whether the source user PC&O and the destination user PC&O can be harmonized.
Claim 11
Dependent Claim 49 words
The method of claim 9 includes the step of consolidating, into a uniform set of user traffic characteristics, the source user PC&O with the destination user PC&O if the source user PC&O and the destination user PC&O are compatible or can be harmonized by use of internal network resources.
Claim 12
Dependent Claim 25 words
The method of claim 8 includes the step of terminating the call if the source user PC&O cannot be harmonized with the destination user PC&O.
Claim 13
Dependent Claim 34 words
The method of claim 10 including the step of determining the optimum set of protocols to be used internally by network to guarantee the user traffic characteristics during the transport of the user data.
Claim 14
Dependent Claim 23 words
The method of claim 12 including the step of allocating network resources to transport user data pursuant to the consolidated user traffic characteristics.
Claim 15
Dependent Claim 22 words
The method of claim 13 including the step of enabling the network to transport user data between source users and destination users.
Claim 16
Independent Claim 334 words
A method for processing calls for a cell relay network, the network connecting a plurality of network users, the network users connected to the network through a plurality of nodes, the network having diverse sets of user protocols, classes and options (PC&O) where PC&O about each network user is maintained at the node connecting the network user to the network, the method comprising the steps of: (a) having a call made by a source user attached to a source node, the call being made to a set of destination users attached to a set of destination nodes; (b) at the Source node locating the set of destination nodes by: (1) determining a set of addresses identifying the source user and the set of destination users and; (2) using that address to determine the associated destination node; (c) at the source node, conferring with the set of destination nodes to determine the set of PC&O associated with each destination user by: (1) determining source user PC&O based upon the address of the source user, if such PC&O were not provided to the network by the source user when the attempted call was placed; (2) transmitting the PC&O from the source node to the set of destination nodes; and (3) determining destination user PC&O based upon the address of the destination user, if such PC&O cannot be provided to the network by the destination user; (d) determining whether the source user PC&O and the destination user PC&O are compatible or can be harmonized; (e) if the source user PC&O and destination user PC&O are compatible or can be harmonized, consolidating PC&O from the source node and the set of destination nodes into an optimum set of uniform traffic characteristics, otherwise terminating the call; (f) determining the PC&O used for transport of user information across the network; (g) allocating network resources to transport user data pursuant to the consolidated user traffic characteristics; and (h) enabling the network to transport user data between source users and destination users.
Claim 17
Independent Claim 334 words
A method for processing calls for a cell relay network, the network connecting a plurality of network users, the network users connected to the network through a plurality of nodes, the network having diverse sets of user protocols, classes and options (PC&O) where PC&O about each network user is maintained at the node connecting the network user to the network, the method comprising the steps of: (a) having a call made by a source user attached to a source node, the call being made to a set of destination users attached to a set of destination nodes; (b) at the Source node locating the set of destination nodes by: (1) determining a set of addresses identifying the source user and the set of destination users and; (2) using that address to determine the associated destination node; (c) at the source node, conferring with the set of destination nodes to determine the set of PC&O associated with each destination user by: (1) determining source user PC&O based upon the address of the source user, if such PC&O were not provided to the network by the source user when the attempted call was placed; (2) transmitting the PC&O from the source node to the set of destination nodes; and (3) determining destination user PC&O based upon the address of the destination user, if such PC&O cannot be provided to the network by the destination user; (d) determining whether the source user PC&O and the destination user PC&O are compatible or can be harmonized; (e) if the source user PC&O and destination user PC&O are compatible or can be harmonized, consolidating PC&O from the source node and the set of destination nodes into an optimum set of uniform traffic characteristics, otherwise terminating the call; (f) determining the PC&O used for transport of user information across the network; (g) allocating network resources to transport user data pursuant to the consolidated user traffic characteristics; and (h) enabling the network to transport user data between source users and destination users.

References Cited (Backward Citations)

US5142528A Cited
US5224098A Cited
US5295139A Cited
US5357625A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-09-18 1999-03-20 1999-09-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-09-18 2003-03-20 2003-09-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-09-18 2007-03-20 2007-09-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag