Patents by Inventor Tadeusz Drwiega

Tadeusz Drwiega 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: 9191234
    Abstract: An enhanced communication bridge includes a context interface that enables the audio bridge to learn information about the type of Voice encoder, device, network connection, location, type of call (business vs. personal), identity and position of the individual, and other information about the context of the communication session itself as well as the context of each person joining the communication session. This context information is used to determine how quality of experience targets for the communication as a whole, as well as how each individual contribution should be uniquely processed to attempt to meet the quality of experience targets. Business factors may influence the decision as to the type of processing to be implemented on each of the signals provided by the participants. Corrective action may also be implemented by the bridge on the client network devices as well in the embodiment. The bridge may be centralized or distributed. A video bridge may be implemented as well.
    Type: Grant
    Filed: April 9, 2009
    Date of Patent: November 17, 2015
    Assignee: RPX Clearinghouse LLC
    Inventors: Francois Blouin, Leigh Thorpe, Tim Rahrer, Tadeusz Drwiega, Rafi Rabipour
  • Publication number: 20150131652
    Abstract: A method of expediting resource negotiation in a modified Session Initiation Protocol (SIP) reduces the number of messages exchanged for resource negotiation, thereby reducing the latencies involved in session setup. The method entails sending an INVITE message having a modified SIP header containing an indication that the originator's terminal seeks a fast session setup. The INVITE message further contains a list of all codecs available at the originator's terminal and how many each type of media component are required. These codecs can be provided in an order of preference. The answerer selects the codecs for the requested media types from the list of available codecs without engaging in a back-and-forth resource negotiation for the codecs. The result is that the session can be set up with fewer messages which provides quicker session setup than in the prior art.
    Type: Application
    Filed: January 26, 2015
    Publication date: May 14, 2015
    Inventors: Radha TELIKEPALLI, Tadeusz DRWIEGA
  • Patent number: 8948186
    Abstract: A method of expediting resource negotiation in a modified Session Initiation Protocol (SIP) reduces the number of messages exchanged for resource negotiation, thereby reducing the latencies involved in session setup. The method entails sending an INVITE message having a modified SIP header containing an indication that the originator's terminal seeks a fast session setup. The INVITE message further contains a list of all codecs available at the originator's terminal and how many each type of media component are required. These codecs can be provided in an order of preference. The answerer selects the codecs for the requested media types from the list of available codecs without engaging in a back-and-forth resource negotiation for the codecs. The result is that the session can be set up with fewer messages which provides quicker session setup than in the prior art.
    Type: Grant
    Filed: October 18, 2011
    Date of Patent: February 3, 2015
    Assignee: Rockstar Consortium US LP
    Inventors: Radha Telikepalli, Tadeusz Drwiega
  • Publication number: 20150003240
    Abstract: A method of adaptively routing voice packets in an IP network receiving a request for a new call at a voice gateway, determining a destination gateway for the new call, determining an availability of at least one route for routing the new call across the IP network to the destination gateway, and deciding whether to admit the new call into the IP network based on whether a route is available over which voice packets for the new call can be routed. A call admission decision is made based on whether a direct, single-path route or a two-path route is available, where each path is an LSP tunnel whose availability is determined using a token bucket technique. If no route is available, the voice gateway does not admit the call into the IP network.
    Type: Application
    Filed: July 25, 2014
    Publication date: January 1, 2015
    Inventors: Tadeusz DRWIEGA, Xiao Gao LIU
  • Publication number: 20140064273
    Abstract: A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified.
    Type: Application
    Filed: November 12, 2013
    Publication date: March 6, 2014
    Applicant: Rockstar Consortium US LP
    Inventors: Abel Dasylva, Delfin Montuno, Peter Ashwood Smith, Francois Blouin, Tadeusz Drwiega
  • Patent number: 8605628
    Abstract: A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified.
    Type: Grant
    Filed: September 30, 2011
    Date of Patent: December 10, 2013
    Assignee: Rockstar Consortium US LP
    Inventors: Abel Dasylva, Delfin Montuno, Peter Ashwood Smith, Francois Blouin, Tadeusz Drwiega
  • Publication number: 20120089739
    Abstract: A method of expediting resource negotiation in a modified Session Initiation Protocol (SIP) reduces the number of messages exchanged for resource negotiation, thereby reducing the latencies involved in session setup. The method entails sending an INVITE message having a modified SIP header containing an indication that the originator's terminal seeks a fast session setup. The INVITE message further contains a list of all codecs available at the originator's terminal and how many each type of media component are required. These codecs can be provided in an order of preference. The answerer selects the codecs for the requested media types from the list of available codecs without engaging in a back-and-forth resource negotiation for the codecs. The result is that the session can be set up with fewer messages which provides quicker session setup than in the prior art.
    Type: Application
    Filed: October 18, 2011
    Publication date: April 12, 2012
    Inventors: Radha TELIKEPALLI, Tadeusz DRWIEGA
  • Publication number: 20120033552
    Abstract: A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified.
    Type: Application
    Filed: September 30, 2011
    Publication date: February 9, 2012
    Inventors: Abel Dasylva, Delfin Montuno, Peter Ashwood Smith, Francois Blouin, Tadeusz Drwiega
  • Patent number: 8059656
    Abstract: A method of expediting resource negotiation in a modified Session Initiation Protocol (SIP) reduces the number of messages exchanged for resource negotiation, thereby reducing the latencies involved in session setup. The method entails sending an INVITE message having a modified SIP header containing an indication that the originator's terminal seeks a fast session setup. The INVITE message further contains a list of all codecs available at the originator's terminal and how many of each type of media component are required. These codecs can be provided in an order of preference. The answerer (the called party in the case of VoIP) selects the codecs for the requested media types from the list of available codecs without engaging in a back-and-forth resource negotiation for the codecs. The result is that the session can be set up with merely 7 messages of which only 5 messages contribute to session setup, which provides quicker session setup than in the prior art.
    Type: Grant
    Filed: May 12, 2006
    Date of Patent: November 15, 2011
    Inventors: Radha Telikepalli, Tadeusz Drwiega
  • Patent number: 8040906
    Abstract: A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. The level of duplication may be reduced by selecting a larger number of critical nodes on the network.
    Type: Grant
    Filed: June 23, 2009
    Date of Patent: October 18, 2011
    Assignee: Nortel Networks Limited
    Inventors: Abel Dasylva, Delfin Montuno, Peter Ashwood Smith, Francois Blouin, Tadeusz Drwiega
  • Publication number: 20100322244
    Abstract: A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. The level of duplication may be reduced by selecting a larger number of critical nodes on the network.
    Type: Application
    Filed: June 23, 2009
    Publication date: December 23, 2010
    Applicant: Nortel Networks Limited
    Inventors: Abel Dasylva, Delfin Montuno, Peter Ashwood Smith, Francois Blouin, Tadeusz Drwiega
  • Publication number: 20100260074
    Abstract: An enhanced communication bridge includes a context interface that enables the audio bridge to learn information about the type of Voice encoder, device, network connection, location, type of call (business vs. personal), identity and position of the individual, and other information about the context of the communication session itself as well as the context of each person joining the communication session. This context information is used to determine how quality of experience targets for the communication as a whole, as well as how each individual contribution should be uniquely processed to attempt to meet the quality of experience targets. Business factors may influence the decision as to the type of processing to be implemented on each of the signals provided by the participants. Corrective action may also be implemented by the bridge on the client network devices as well in the embodiment. The bridge may be centralized or distributed. A video bridge may be implemented as well.
    Type: Application
    Filed: April 9, 2009
    Publication date: October 14, 2010
    Applicant: Nortel Networks Limited
    Inventors: Francois BLOUIN, Leigh THORPE, Tim RAHRER, Tadeusz DRWIEGA, Rafi RABIPOUR
  • Patent number: 6128708
    Abstract: The method of the present invention provides a procedure for testing shared-memory multi-processor (SMMP) performance by formulating and modifying a given memory contention matrix (MCM), which is generated by collecting traces of memory addresses accessed by so-called subcalls in an SMMPCC. A subcall pair contending for at least one shared memory access address enters a "1" at the respective matrix element. For subcall pairs not sharing any memory address a ".O slashed." is entered.
    Type: Grant
    Filed: December 24, 1997
    Date of Patent: October 3, 2000
    Inventors: Gordon James Fitzpatrick, Tadeusz Drwiega, Sundaram Chinthamani