专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120300669A1 TOPOLOGY-BASED CONSOLIDATION OF LINK STATE INFORMATION 有权
标题翻译：链接状态信息的基于拓扑的综合
公开(公告)号：US20120300669A1
公开(公告)日：2012-11-29
申请号：US13114071
申请日：2011-05-24
申请人： Eitan Zahavi
发明人： Eitan Zahavi
IPC分类号： H04L12/28
CPC分类号： H04L45/124 , H04L45/245 , H04L49/10 , Y02D50/30
摘要： A method in a network element that forwards packets to destination nodes includes identifying groups of the destination nodes. Respective performance metrics of multiple different candidate network paths, over which the destination nodes in a given group are reachable from the network element, are estimated jointly for all the destination nodes in the given group. A network path is selected from among the candidate network paths based on the estimated performance metrics. The packets addressed to the destination nodes in the given group are forwarded over the selected network path.
摘要翻译：将分组转发到目的地节点的网元中的方法包括识别目的节点的组。对于给定组中的所有目的地节点，可以联合估计多个不同候选网络路径的相应性能度量，通过该多个不同候选网络路径可以从给定组中的目的地节点到达网络元素。基于估计的性能度量，从候选网络路径中选择网络路径。寻址到给定组中的目的节点的数据包将通过所选网络路径转发。

2. 发明授权

US09225628B2 Topology-based consolidation of link state information 有权
标题翻译：基于拓扑的整合链接状态信息
公开(公告)号：US09225628B2
公开(公告)日：2015-12-29
申请号：US13114071
申请日：2011-05-24
申请人： Eitan Zahavi
发明人： Eitan Zahavi
IPC分类号： H04L12/28 , H04L12/721 , H04L12/709 , H04L12/933
CPC分类号： H04L45/124 , H04L45/245 , H04L49/10 , Y02D50/30
摘要： A method in a network element that forwards packets to destination nodes includes identifying groups of the destination nodes. Respective performance metrics of multiple different candidate network paths, over which the destination nodes in a given group are reachable from the network element, are estimated jointly for all the destination nodes in the given group. A network path is selected from among the candidate network paths based on the estimated performance metrics. The packets addressed to the destination nodes in the given group are forwarded over the selected network path.
摘要翻译：将分组转发到目的地节点的网元中的方法包括识别目的节点的组。对于给定组中的所有目的地节点，可以联合估计多个不同候选网络路径的相应性能度量，通过该多个不同候选网络路径可以从给定组中的目的地节点到达网络元素。基于估计的性能度量，从候选网络路径中选择网络路径。寻址到给定组中的目的节点的数据包将通过所选网络路径转发。

3. 发明授权

US08705349B2 Destination-based congestion control 有权
标题翻译：基于目的地的拥塞控制
公开(公告)号：US08705349B2
公开(公告)日：2014-04-22
申请号：US13304654
申请日：2011-11-27
申请人： Noam Bloch , Eitan Zahavi
发明人： Noam Bloch , Eitan Zahavi
IPC分类号： H04L12/26
CPC分类号： H04L47/263 , H04L47/30 , H04L47/35
摘要： A method for communication includes sending communication packets over a network from a first network interface. A notification, which originates from a second network interface and indicates a network congestion encountered by one or more of the packets, is received in the first network interface. A network address of the second network interface is identified based on the notification. A transmission rate of subsequent packets addressed to the network address is regulated responsively to the notification, irrespective of a transport service instance on which the subsequent packets are sent from the first network interface.
摘要翻译：一种用于通信的方法包括：通过网络从第一网络接口发送通信分组。来自第二网络接口并指示一个或多个分组遇到的网络拥塞的通知在第一网络接口中被接收。基于该通知来识别第二网络接口的网络地址。响应于该通知而调用寻址到网络地址的后续分组的传输速率，而不考虑从第一网络接口发送后续分组的传输服务实例。

4. 发明授权

US08570865B2 Reducing power consumption in a fat-tree network 有权
标题翻译：降低胖树网络中的功耗
公开(公告)号：US08570865B2
公开(公告)日：2013-10-29
申请号：US13026309
申请日：2011-02-14
申请人： Dror Goldenberg , Eitan Zahavi , Ori Rottenstreich
发明人： Dror Goldenberg , Eitan Zahavi , Ori Rottenstreich
IPC分类号： H04J1/16
CPC分类号： H04L5/0058 , H04L12/12 , H04L12/462 , H04L43/0876 , H04L45/22 , Y02D50/20 , Y02D50/30 , Y02D50/40
摘要： A method for communication includes estimating a characteristic of communication traffic to be carried by a fat-tree network. Responsively to the estimated characteristic, a subset of the spine switches in the highest level of the network is selected, according to a predetermined selection order, to be active in carrying the communication traffic. In each of the levels of the spine switches below the highest level, the spine switches to be active are selected based on the selected spine switches in a next-higher level. The network is operated so as to convey the traffic between the leaf switches via the active spine switches, while the spine switches that are not selected remain inactive.
摘要翻译：一种用于通信的方法包括估计由胖树网络承载的通信业务的特性。响应于估计的特性，根据预定的选择顺序选择网络最高级别中的脊线交换机的子集，以在携带通信业务时有效。在脊柱交换机的每个级别低于最高级别时，根据下一级更高级别的选定的脊柱交换机选择要激活的脊柱切换。操作网络，以便通过活动脊柱交换机在叶片交换机之间传送流量，而未选择的脊柱开关保持不活动。

5. 发明授权

US06667918B2 Self-repair of embedded memory arrays 有权
标题翻译：嵌入式存储器阵列的自修复
公开(公告)号：US06667918B2
公开(公告)日：2003-12-23
申请号：US10135361
申请日：2002-05-01
申请人： Yuval Leader , Zvi Shmueli , Boaz Ben-Nun , Yuval Eliyahu , Eitan Zahavi
发明人： Yuval Leader , Zvi Shmueli , Boaz Ben-Nun , Yuval Eliyahu , Eitan Zahavi
IPC分类号： G11C700
CPC分类号： G11C29/72 , G11C2029/0405
摘要： An embedded memory unit includes a memory array having a design size given by an integer n, the array including a matrix of memory cells arranged in n+1 lines, and selection circuitry, coupled to select n of the n+1 lines to which data are to be written and from which the data are to be read. A built-in self-test (BIST) circuit is coupled to test the memory array and to generate a binary pass/fail output. A repair machine is coupled to receive the binary output of the BIST circuit and to drive the selection circuitry to select different sets of n of the lines while driving the BIST circuit to test the memory array, so as to find one of the different sets for which the binary output indicates that the array has passed the self-test.
摘要翻译：嵌入式存储器单元包括具有由整数n给出的设计尺寸的存储器阵列，阵列包括以n + 1行排列的存储器单元的矩阵，以及选择电路，耦合到选择n + 1行的n个数据将被写入并从中读取数据。内置自检（BIST）电路被耦合以测试存储器阵列并产生二进制通过/失败输出。一个修理机被耦合以接收BIST电路的二进制输出并且驱动选择电路在驱动BIST电路以测试存储器阵列时选择不同的n行，以便找到不同的集合二进制输出表示数组已经通过了自检。

6. 发明申请

US20130135999A1 DESTINATION-BASED CONGESTION CONTROL 有权
标题翻译：基于目标的约束控制
公开(公告)号：US20130135999A1
公开(公告)日：2013-05-30
申请号：US13304654
申请日：2011-11-27
申请人： Noam Bloch , Eitan Zahavi
发明人： Noam Bloch , Eitan Zahavi
IPC分类号： H04L12/26
CPC分类号： H04L47/263 , H04L47/30 , H04L47/35
摘要： A method for communication includes sending communication packets over a network from a first network interface. A notification, which originates from a second network interface and indicates a network congestion encountered by one or more of the packets, is received in the first network interface. A network address of the second network interface is identified based on the notification. A transmission rate of subsequent packets addressed to the network address is regulated responsively to the notification, irrespective of a transport service instance on which the subsequent packets are sent from the first network interface.
摘要翻译：一种用于通信的方法包括：通过网络从第一网络接口发送通信分组。来自第二网络接口并指示一个或多个分组遇到的网络拥塞的通知在第一网络接口中被接收。基于该通知来识别第二网络接口的网络地址。响应于该通知而调用寻址到网络地址的后续分组的传输速率，而不考虑从第一网络接口发送后续分组的传输服务实例。

7. 发明申请

US20120207018A1 REDUCING POWER CONSUMPTION IN A FAT-TREE NETWORK 有权
标题翻译：降低FAT-TREE网络中的功耗
公开(公告)号：US20120207018A1
公开(公告)日：2012-08-16
申请号：US13026309
申请日：2011-02-14
申请人： Dror Goldenberg , Eitan Zahavi , Ori Rottenstreich
发明人： Dror Goldenberg , Eitan Zahavi , Ori Rottenstreich
IPC分类号： H04L12/26
CPC分类号： H04L5/0058 , H04L12/12 , H04L12/462 , H04L43/0876 , H04L45/22 , Y02D50/20 , Y02D50/30 , Y02D50/40
摘要： A method for communication includes estimating a characteristic of communication traffic to be carried by a fat-tree network. Responsively to the estimated characteristic, a subset of the spine switches in the highest level of the network is selected, according to a predetermined selection order, to be active in carrying the communication traffic. In each of the levels of the spine switches below the highest level, the spine switches to be active are selected based on the selected spine switches in a next-higher level. The network is operated so as to convey the traffic between the leaf switches via the active spine switches, while the spine switches that are not selected remain inactive.
摘要翻译：一种用于通信的方法包括估计由胖树网络承载的通信业务的特性。响应于估计的特性，根据预定的选择顺序选择网络最高级别中的脊线交换机的子集，以在携带通信业务时有效。在脊柱交换机的每个级别低于最高级别时，根据下一级更高级别的选定的脊柱交换机选择要激活的脊柱切换。操作网络，以便通过活动脊柱交换机在叶片交换机之间传送流量，而未选择的脊柱开关保持不活动。

8. 发明授权

US06577859B1 Cellular phone system with outgoing message selection system 失效
标题翻译：蜂窝电话系统具有传出消息选择系统
公开(公告)号：US06577859B1
公开(公告)日：2003-06-10
申请号：US09327028
申请日：1999-06-07
申请人： Gadi Zahavi , Eitan Zahavi
发明人： Gadi Zahavi , Eitan Zahavi
IPC分类号： H04M1110
CPC分类号： H04W4/12 , H04M1/6505 , H04M1/663 , H04M1/72519 , H04M3/436 , H04M3/487 , H04M3/5322 , H04M3/533 , H04M2203/353 , H04M2203/4581 , H04M2207/18 , H04W76/10
摘要： A system and method which allows a cellular phone user to communicate with a caller when the user is unable to speak aloud. The method comprises the steps of establishing a wireless communication link between a wireless terminal user and a second party and selectively activating at the wireless terminal the transmission of at least one audible message for receipt by the second party, wherein the audible message is responsive to a message transmitted by the second party. The audible message may be selected by the wireless terminal user from a plurality of audible messages, such as a personalized message pre-recorded by the wireless terminal user. According to other embodiments of the invention, the wireless communication link may be initiated by either the second party or by the wireless terminal user. Preferably, the activating step further comprises activating a terminal function key, such as by pressing a key on the wireless terminal's keypad or by selecting a menu item from a display screen of the wireless terminal, corresponding to the transmitted message. In one embodiment, the terminal is configured to have two such keys or menu items positioned on the wireless terminal so as to be selected by the wireless terminal user without removing the terminal from the user's ear.
摘要翻译：一种允许蜂窝电话用户在用户不能大声说话时与呼叫者通信的系统和方法。该方法包括以下步骤：在无线终端用户与第二方之间建立无线通信链路，并且在无线终端选择性地激活至少一个可听消息的传输，以供第二方接收，其中该可听消息响应于由第二方发送的消息。可听消息可以由无线终端用户从诸如由无线终端用户预先记录的个性化消息的多个可听消息中选择。根据本发明的其他实施例，无线通信链路可以由第二方或无线终端用户发起。优选地，激活步骤还包括激活终端功能键，例如通过按下无线终端的小键盘上的键或通过从对应于所发送的消息的无线终端的显示屏幕选择菜单项。在一个实施例中，终端被配置为具有位于无线终端上的两个这样的键或菜单项，以便由无线终端用户选择，而无需从用户的耳朵移除终端。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式