公开(公告)号：US09191234B2

公开(公告)日：2015-11-17

申请号：US12420976

申请日：2009-04-09

申请人： Francois Blouin ,  Leigh Thorpe ,  Tim Rahrer ,  Tadeusz Drwiega ,  Rafi Rabipour

发明人： Francois Blouin ,  Leigh Thorpe ,  Tim Rahrer ,  Tadeusz Drwiega ,  Rafi Rabipour

IPC分类号： H04M3/42 ,  H04L12/46 ,  H04L29/06 ,  H04M3/22 ,  H04M7/12

CPC分类号： H04L12/462 ,  H04L65/1093 ,  H04L65/403 ,  H04L65/605 ,  H04M3/2236 ,  H04M7/1205

摘要： 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.

摘要翻译： 增强型通信桥包括上下文接口，使得音频桥可以了解关于语音编码器，设备，网络连接，位置，呼叫类型（业务对个人），个体的身份和位置以及其他信息的信息 关于通信会话本身的上下文以及加入通信会话的每个人的上下文。 该上下文信息用于确定整个通信的体验质量的质量以及如何独立处理每个个体贡献以尝试满足体验质量的目标。 业务因素可能影响对参与者提供的每个信号执行的处理类型的决定。 在实施例中也可以通过客户端网络设备上的桥来实现纠正动作。 桥可以集中或分布。 也可以实现视频桥。

公开(公告)号：US08040906B2

公开(公告)日：2011-10-18

申请号：US12490187

申请日：2009-06-23

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/28

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： 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.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。 可以通过在网络上选择更多的关键节点来减少重复级别。

公开(公告)号：US20120033552A1

公开(公告)日：2012-02-09

申请号：US13250034

申请日：2011-09-30

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/26

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： 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.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。

公开(公告)号：US08605628B2

公开(公告)日：2013-12-10

申请号：US13250034

申请日：2011-09-30

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/28 ,  H04J1/16

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： 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.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。

公开(公告)号：US20100322244A1

公开(公告)日：2010-12-23

申请号：US12490187

申请日：2009-06-23

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/56 ,  H04L12/28

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： 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.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。 可以通过在网络上选择更多的关键节点来减少重复级别。

公开(公告)号：US08948186B2

公开(公告)日：2015-02-03

申请号：US13275896

申请日：2011-10-18

申请人： Radha Telikepalli ,  Tadeusz Drwiega

发明人： Radha Telikepalli ,  Tadeusz Drwiega

IPC分类号： H04L12/28 ,  H04L29/06

CPC分类号： H04L47/722 ,  H04L47/765 ,  H04L65/1006 ,  H04L65/1069 ,  H04L69/24

摘要： 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.

摘要翻译： 在修改的会话发起协议（SIP）中加快资源协商的方法减少了用于资源协商交换的消息的数量，从而减少了会话建立中涉及的延迟。 该方法需要发送具有修改的SIP报头的INVITE消息，其包含发起者的终端寻找快速会话建立的指示。 INVITE消息还包含发起者终端可用的所有编解码器的列表，以及需要多少种类型的媒体组件。 这些编解码器可以按优先顺序提供。 应答者从可用编解码器列表中选择所请求的媒体类型的编解码器，而无需对编解码器进行前后资源协商。 结果是可以通过更少的消息来设置会话，这提供比现有技术更快的会话建立。

公开(公告)号：US08059656B1

公开(公告)日：2011-11-15

申请号：US11432624

申请日：2006-05-12

申请人： Radha Telikepalli ,  Tadeusz Drwiega

发明人： Radha Telikepalli ,  Tadeusz Drwiega

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L47/722 ,  H04L47/765 ,  H04L65/1006 ,  H04L65/1069 ,  H04L69/24

摘要： 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.

摘要翻译： 在修改的会话发起协议（SIP）中加快资源协商的方法减少了用于资源协商交换的消息的数量，从而减少了会话建立中涉及的延迟。 该方法需要发送具有修改的SIP报头的INVITE消息，其包含发起者的终端寻找快速会话建立的指示。 INVITE消息还包含在发起方终端可用的所有编解码器的列表，以及需要多少种类型的媒体组件。 这些编解码器可以按优先顺序提供。 应答者（在VoIP的被叫方）从可用编解码器的列表中选择所请求的媒体类型的编解码器，而不对编解码器进行前后资源协商。 结果是，可以仅使用7个消息来设置会话，其中只有5个消息有助于会话建立，这提供比现有技术更快的会话建立。

公开(公告)号：US6128708A

公开(公告)日：2000-10-03

申请号：US998218

申请日：1997-12-24

申请人： Gordon James Fitzpatrick ,  Tadeusz Drwiega ,  Sundaram Chinthamani

发明人： Gordon James Fitzpatrick ,  Tadeusz Drwiega ,  Sundaram Chinthamani

IPC分类号： G06F11/34 ,  G06F12/00 ,  G06F7/00 ,  G06F15/167

CPC分类号： G06F11/3447 ,  G06F11/3471 ,  G06F2201/86 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99937

摘要： 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.

摘要翻译： 本发明的方法提供了一种通过制定和修改给定的存储器争用矩阵（MCM）来测试共享存储器多处理器（SMMP）性能的过程，该存储器争用矩阵是通过收集由所谓的小区访问的存储器地址的踪迹而产生的 一个SMMPCC。 竞争至少一个共享存储器访问地址的小副对在相应的矩阵元素处进入“1”。 对于不共享任何内存地址的子对，输入“+527”。