Patents by Inventor Randal Latta Dunn

Randal Latta Dunn has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7580517
    Abstract: A duplicate point code routing node is capable of routing messages to nodes having the same point code but being located in different national networks. The duplicate point code routing node associates a group code with received messages and uses the group code to route the messages to the appropriate national network. The group code may be determined based on the link or linkset from which a message is received or from the message itself.
    Type: Grant
    Filed: March 8, 2002
    Date of Patent: August 25, 2009
    Assignee: Tekelec
    Inventors: Seetharaman Khadri, Peter Joseph Marsico, Randal Latta Dunn, Jr., Thomas Matthew McCann, Mark Edward Kanode
  • Patent number: 7386112
    Abstract: An originating node is configured for generating a route management signaling message having a signaling link selection (SLS) value that is selected by the originating node based on an affected destination value. The affected destination value, distinct from a destination point code (DPC) that specifies a destination node for the route management signaling message, identifies an affected signaling node that is affected by the route management signaling message. Hence, route management signaling messages related to the affected signaling node are routed along the same signaling path, ensuring that all the related route management signaling messages remain in sequence. Further, different signaling path can be established for respective affected signaling nodes, providing load sharing of route management signaling messages relative to the respective affected signaling nodes.
    Type: Grant
    Filed: July 8, 2003
    Date of Patent: June 10, 2008
    Assignee: Cisco Technology, Inc.
    Inventors: Paul Aloysius Schmidt, Uwe Sellentin, Randal Latta Dunn
  • Patent number: 7058724
    Abstract: A signaling network node is configured for generating a routing decision based on selectively masking a point code field from a received SS7 signaling message. The received SS7 signaling message includes a header that includes a point code field having a prescribed bit length. The signaling network node searches its routing table to determine the presence of a matching full-length point code of the prescribed bit length that specifies a prescribed route for the received signaling message. If there is no matching full-length point code, the signaling network node generates a reduced point code by applying a user-selectable mask to the point code. The signaling network node then searches its routing table, based on the reduced point code, for a matching reduced-length point code that specifies a corresponding summary route. If desired different masks may be used until a matching reduced-length point code is located.
    Type: Grant
    Filed: November 2, 2001
    Date of Patent: June 6, 2006
    Assignee: Cisco Technology, Inc.
    Inventors: Amitava Das, Randal Latta Dunn, Paul Aloysius Schmidt, Uwe Sellentin
  • Patent number: 6839423
    Abstract: A multiple point code routing node is configured to recognize multiple point codes as true point codes. The multiple point code routing node originates, terminates, and processes messages having any of its any of its true point codes. As a result, the multiple point code routing node can replace two or more signal transfer points in a conventional telecommunications network without requiring reconfiguration of other nodes in the telecommunications network. Multiple point code routing node may also recognize multiple adjacent point codes or secondary adjacent point codes of a mated multiple point code routing node. Because the multiple point code routing node can associate multiple point codes with its mate, the number of logical or physical signaling links between adjacent multiple point code routing nodes can be increased.
    Type: Grant
    Filed: August 11, 2003
    Date of Patent: January 4, 2005
    Assignee: Tekelec
    Inventors: Seetharaman Khadri, Randal Latta Dunn, Jr.
  • Publication number: 20040032943
    Abstract: A multiple point code routing node is configured to recognize multiple point codes as true point codes. The multiple point code routing node originates, terminates, and processes messages having any of its any of its true point codes. As a result, the multiple point code routing node can replace two or more signal transfer points in a conventional telecommunications network without requiring reconfiguration of other nodes in the telecommunications network. Multiple point code routing node may also recognize multiple adjacent point codes or secondary adjacent point codes of a mated multiple point code routing node. Because the multiple point code routing node can associate multiple point codes with its mate, the number of logical or physical signaling links between adjacent multiple point code routing nodes can be increased.
    Type: Application
    Filed: August 11, 2003
    Publication date: February 19, 2004
    Applicant: Tekelec
    Inventors: Seetharaman Khadri, Randal Latta Dunn
  • Patent number: 6639981
    Abstract: A routing node for translating and re-directing Signaling System 7 (SS7) messages associated with ported subscribers in a communications network is disclosed. Re-direction or re-routing of signaling message packets is accomplished without the need for explicit local number portability (LNP) type triggers or queries, and as such the routing node of the present invention is considered to implement a triggerless LNP routing solution. Upon entering the routing node, SS7 ISDN User Part (ISUP) type signaling messages that require LNP translation service are encapsulated in an SS7 Signaling Connection Control Part (SCCP) message packet and internally routed within the switch to an LNP translation subsystem. The LNP translation subsystem can be integrated within the routing node or a portion of the LNP translation subsystem can be located on an external database server platform. LNP translation involves the lookup of a called party address in an LNP database, and the return of a Location Routing Number (LRN).
    Type: Grant
    Filed: February 14, 2000
    Date of Patent: October 28, 2003
    Assignee: Tekelec
    Inventors: Randal Latta Dunn, Jr., David Paul Cox, Venkataramaiah Ravishankar, Colleen McGinnis Collard
  • Patent number: 6606379
    Abstract: A multiple point code routing node is configured to recognize multiple point codes as true point codes. The multiple point code routing node originates, terminates, and processes messages having any of its any of its true point codes. As a result, the multiple point code routing node can replace two or more signal transfer points in a conventional telecommunications network without requiring reconfiguration of other nodes in the telecommunications network. Multiple point code routing node may also recognize multiple adjacent point codes or secondary adjacent point codes of a mated multiple point code routing node. Because the multiple point code routing node can associate multiple point codes with its mate, the number of logical or physical signaling links between adjacent multiple point code routing nodes can be increased.
    Type: Grant
    Filed: September 28, 2001
    Date of Patent: August 12, 2003
    Assignee: Tekelec
    Inventors: Seetharaman Khadri, Randal Latta Dunn, Jr.
  • Publication number: 20030031307
    Abstract: A multiple point code routing node is configured to recognize multiple point codes as true point codes. The multiple point code routing node originates, terminates, and processes messages having any of its any of its true point codes. As a result, the multiple point code routing node can replace two or more signal transfer points in a conventional telecommunications network without requiring reconfiguration of other nodes in the telecommunications network. Multiple point code routing node may also recognize multiple adjacent point codes or secondary adjacent point codes of a mated multiple point code routing node. Because the multiple point code routing node can associate multiple point codes with its mate, the number of logical or physical signaling links between adjacent multiple point code routing nodes can be increased.
    Type: Application
    Filed: September 28, 2001
    Publication date: February 13, 2003
    Inventors: Seetharaman Khadri, Randal Latta Dunn
  • Publication number: 20020196779
    Abstract: A duplicate point code routing node is capable of routing messages to nodes having the same point code but being located in different national networks. The duplicate point code routing node associates a group code with received messages and uses the group code to route the messages to the appropriate national network. The group code may be determined based on the link or linkset from which a message is received or from the message itself.
    Type: Application
    Filed: March 8, 2002
    Publication date: December 26, 2002
    Inventors: Seetharaman Khadri, Peter Joseph Marsico, Randal Latta Dunn, Thomas Matthew McCann, Mark Edward Kanode