会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Optimal fragmentation of multicast packets
    • 组播数据包的最优分割
    • US07792031B2
    • 2010-09-07
    • US12167900
    • 2008-07-03
    • Suresh KrishnanFrederic Rossi
    • Suresh KrishnanFrederic Rossi
    • H04L12/28H04L12/56
    • H04L69/16H04L12/1836H04L69/166
    • Methods, a data source and a router are provided to fragment packets that are to be sent in multicast mode towards a plurality of destinations comprised in a multicast group. Each router along a path leading from the data source towards some of the destinations sends its maximum transmission unit value in an uplink direction. Each router directly connected to the data source calculates a lowest maximum transmission unit based on various maximum transmission unit values received from downstream routers. The data source receives from each of the directly connected routers a maximum transmission unit value, which is certain to be acceptable to all routers and destinations of the multicast group downstream of that directly connected router. The data source selects a lowest one of the received maximum transmission unit values and fragments data contents accordingly.
    • 提供了一种数据源和路由器,用于将要以组播模式发送的分组分段到组播组中包含的多个目的地。 沿着从数据源朝向某些目的地的路径的每个路由器在上行链路方向上发送其最大传输单元值。 直接连接到数据源的每个路由器基于从下游路由器接收的各种最大传输单元值计算最低最大传输单元。 数据源从每个直接连接的路由器接收最大传输单元值,该最大传输单元值对于直接连接的路由器下游的多播组的所有路由器和目的地是可接受的。 数据源选择接收到的最大传输单元值中的最低一个并相应地分段数据内容。
    • 2. 发明申请
    • OPTIMAL FRAGMENTATION OF MULTICAST PACKETS
    • 多媒体分组的最优分割
    • US20100002697A1
    • 2010-01-07
    • US12167900
    • 2008-07-03
    • Suresh KrishnanFrederic Rossi
    • Suresh KrishnanFrederic Rossi
    • H04L12/56
    • H04L69/16H04L12/1836H04L69/166
    • Methods, a data source and a router are provided to fragment packets that are to be sent in multicast mode towards a plurality of destinations comprised in a multicast group. Each router along a path leading from the data source towards some of the destinations sends its maximum transmission unit value in an uplink direction. Each router directly connected to the data source calculates a lowest maximum transmission unit based on various maximum transmission unit values received from downstream routers. The data source receives from each of the directly connected routers a maximum transmission unit value, which is certain to be acceptable to all routers and destinations of the multicast group downstream of that directly connected router. The data source selects a lowest one of the received maximum transmission unit values and fragments data contents accordingly.
    • 提供了一种数据源和路由器,用于将要以组播模式发送的分组分段到组播组中包含的多个目的地。 沿着从数据源朝向某些目的地的路径的每个路由器在上行链路方向上发送其最大传输单元值。 直接连接到数据源的每个路由器基于从下游路由器接收的各种最大传输单元值计算最低最大传输单元。 数据源从每个直接连接的路由器接收最大传输单元值,该最大传输单元值对于直接连接的路由器下游的多播组的所有路由器和目的地是可接受的。 数据源选择接收到的最大传输单元值中的最低一个并相应地分段数据内容。
    • 3. 发明授权
    • Apparatus and method for parallel regular expression matching
    • 并行正则表达式匹配的装置和方法
    • US08990232B2
    • 2015-03-24
    • US13472318
    • 2012-05-15
    • Frederic Rossi
    • Frederic Rossi
    • G06F17/30H04L29/06
    • G06F17/30495G06F9/4498G06F17/30864H04L63/0245H04L69/22
    • A regular expression matching hardware implementation comprises two tightly coupled hardware engines. A regex engine performs state transitions and accepts (as matching) or rejects (as not matching) an input string. The regex engine takes also care of the logic of the operators and deals with the complexity of the state machine. A lookup engine reads characters from an input (e.g., tape, memory, network packets, or the like), and provides them to the regex engine. A preprocessing procedure transforms a regular expression into a regex state transition table and a lookup table, for use by the regex engine and lookup engine, respectively. The two hardware engines are synchronized by a global state machine. The regex engine advances the state machine, and the lookup engine reads it.
    • 正则表达式匹配硬件实现包括两个紧密耦合的硬件引擎。 正则表达式引擎执行状态转换并接受(作为匹配)或拒绝(不匹配)输入字符串。 正则表达式引擎还关心操作员的逻辑,并处理状态机的复杂性。 查找引擎从输入(例如,磁带,存储器,网络分组等)读取字符,并将它们提供给正则表达式引擎。 预处理过程将正则表达式转换为正则表达式状态转换表和查找表,分别由正则表达式引擎和查找引擎使用。 两个硬件引擎由全局状态机同步。 正则表达式引擎推进状态机,查找引擎读取它。
    • 7. 发明申请
    • Maintaning a View of a Cluster's Membership
    • 维护集群成员的视图
    • US20080201403A1
    • 2008-08-21
    • US11576235
    • 2004-09-29
    • Per AnderssonMaria ToeroeMakan PourzandiFrederic RossiAndre Beliveau
    • Per AnderssonMaria ToeroeMakan PourzandiFrederic RossiAndre Beliveau
    • G06F15/16
    • H04L45/04H04L45/02H04L45/025H04L45/46H04W4/08H04W8/186
    • A method for maintaining a current view of a cluster's membership comprising the steps of maintaining a list of member nodes and updating the list when a modification thereto is noticed by a first node by receiving a first update message from the first node in a second node, thereafter, sending a second update message from the second node to a third node to propagate the modification and sending to the first node a first confirm message from the second or the third node. A node member of a cluster capable of maintaining a first list of neighboring nodes, maintaining a second list of neighboring nodes sharing a current view therewith and ensuring that the first list matches the second by exchanging messages with neighboring nodes, wherein each message comprises topology information. Upon confirmation that both lists match, the node being capable of sending a confirmation message toward neighboring nodes.
    • 一种用于维护群集成员的当前视图的方法,包括以下步骤:通过从第一节点的第一节点接收第一更新消息,维护成员节点的列表,并且当第一节点对其进行修改时,更新列表, 此后,将第二更新消息从第二节点发送到第三节点,以传播修改,并向第一节点发送来自第二节点或第三节点的第一确认消息。 能够维护相邻节点的第一列表的集群的节点成员,维护与其共享当前视图的相邻节点的第二列表,并且通过与相邻节点交换消息来确保第一列表与第二列表匹配,其中每个消息包括拓扑信息 。 在确认两个列表匹配时,节点能够向邻近节点发送确认消息。