公开(公告)号：US6061736A

公开(公告)日：2000-05-09

申请号：US42162

申请日：1998-03-13

申请人： Haim Rochberger ,  G. Paul Koning

发明人： Haim Rochberger ,  G. Paul Koning

IPC分类号： G06F13/38 ,  G06F15/17

CPC分类号： H04L45/12

摘要： The routing paths are determined in a step-by-step nature. A Dijkstra algorithm is used and before labeling a link as a routing path, all possible routing paths which are within a predetermined range are compared. One of the paths in the range are chosen at random to be the routing path.

摘要翻译： 路由路径是逐步确定的。 使用Dijkstra算法，并且在将链路标记为路由路径之前，将比较在预定范围内的所有可能的路由路径。 随机选择范围中的路径之一作为路由路径。

公开(公告)号：US20150094094A1

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

申请号：US14039945

申请日：2013-09-27

申请人： Haim Rochberger ,  Ron Rotstein

发明人： Haim Rochberger ,  Ron Rotstein

IPC分类号： H04W4/02

CPC分类号： G01C21/206 ,  H04W4/02 ,  H04W4/029 ,  H04W4/043

摘要： Disclosed in some examples are methods, systems, and machine readable mediums that provide location based services such as navigation in an indoor space by utilizing a network of specially configured locator nodes (LNs) and the identified line of sight (LOS) relationships between the LNs. The LOS relationships may be automatically learned by the LNs.

摘要翻译： 在一些示例中公开的是提供基于位置的服务的方法，系统和机器可读介质，例如通过利用特定配置的定位器节点（LN）的网络和在LN之间的所识别的视线（LOS）关系在室内空间中的导航 。 LOS关系可以由LN自动学习。

公开(公告)号：US20130337834A1

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

申请号：US13976469

申请日：2012-03-29

申请人： Yaron Alpert ,  Haim Rochberger

发明人： Yaron Alpert ,  Haim Rochberger

IPC分类号： H04W4/02

CPC分类号： H04W4/025 ,  G01S5/0205 ,  G01S19/40 ,  H04W4/20 ,  H04W4/80 ,  H04W64/00 ,  H04W88/02

摘要： Some demonstrative embodiments include devices, systems and/or methods of location estimation of a mobile device. For example, a device may include a location error corrector to provide location data to at least one application executed by the device, the location data indicating an estimated location of the device, which is based on location information from at least one location-information generator; to receive from the application error feedback information indicating an error in the estimated location; to determine a correction based on the error feedback information; and to provide to the application corrected location data based on the correction.

摘要翻译： 一些演示实施例包括移动设备的位置估计的设备，系统和/或方法。 例如，设备可以包括位置错误校正器，以将位置数据提供给由设备执行的至少一个应用，所述位置数据指示设备的估计位置，其基于来自至少一个位置信息生成器的位置信息 ; 从应用程序接收指示估计位置的错误的错误反馈信息; 基于误差反馈信息确定校正; 并且基于校正来向应用程序提供校正的位置数据。

公开(公告)号：US06262984B1

公开(公告)日：2001-07-17

申请号：US09076687

申请日：1998-05-12

申请人： Haim Rochberger

发明人： Haim Rochberger

IPC分类号： H04L1228

CPC分类号： H04L45/02 ,  H04L45/04 ,  H04L2012/562 ,  H04L2012/5621 ,  H04L2012/563 ,  H04L2012/5642 ,  H04Q11/0478

摘要： A method that provides a solution to the problem of overlapping branches in a point to multipoint call. The method is suitable for both Leaf Initiated Joins (LIJ) and existing point to multipoint call. The method has applications when adding a new leaf to an already existing point to multipoint connection and where the ROOT node has a corrupted point to multipoint view of the network. The method includes the overlapping node realizing that it is an overlapping node whereby it continues with the establishment of the downstream path in a conventional manner. The overlapping node then waits for the SETUP/ADD PARTY CONNECT to be received before continuing. Once the CONNECT is received, the overlapping node establishes an end point reference path to the point to multipoint root node over existing branches. The new call segments are established and the overlapping segments are then trimmed from the tree.

摘要翻译： 一种为点到多点呼叫中重叠分支的问题提供解决方案。 该方法适用于叶启动连接（LIJ）和现有的点到多点呼叫。 当将新叶添加到已存在的点对多点连接以及ROOT节点具有网络损坏的点对多点视图时，该方法具有应用。 该方法包括重叠节点，认识到它是重叠节点，由此它以常规方式继续建立下游路径。 然后，重复节点在继续之前等待SETUP / ADD PARTY CONNECT被接收。 一旦接收到CONNECT，重叠节点就建立到现有分支上的点对多点根节点的终点参考路径。 建立新的呼叫段，然后从树中修剪重叠段。

公开(公告)号：US20150065159A1

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

申请号：US13976471

申请日：2012-04-10

申请人： Yaron Alpert ,  Haim Rochberger

发明人： Yaron Alpert ,  Haim Rochberger

IPC分类号： G01S19/07 ,  H04W4/02

CPC分类号： G01S19/07 ,  G01S5/021 ,  H04W4/02

摘要： Sonic demonstrative embodiments include devices, systems and/or methods of collaboratively correct location errors. For example, a device may include a collaborative location error corrector to collaboratively correct location errors for at least one group of two or more wireless communication devices, the location error corrector is to receive from at least a first wireless communication device of the group an error report indicating an error in an estimated location of the first wireless communication device, to determine correction information based at least on the error report from the first wireless communication device, and to provide the correction information to at least a second wireless communication device of the group.

摘要翻译： 声音演示实施例包括协调地校正位置错误的装置，系统和/或方法。 例如，设备可以包括协作位置错误校正器，用于协调地校正两个或更多个无线通信设备的至少一个组的位置错误，位置错误校正器将从该组的至少第一无线通信设备接收错误 指示第一无线通信设备的估计位置中的错误的报告，至少基于来自第一无线通信设备的错误报告来确定校正信息，并向所述组的至少第二无线通信设备提供校正信息 。

公开(公告)号：US06483808B1

公开(公告)日：2002-11-19

申请号：US09300883

申请日：1999-04-28

申请人： Haim Rochberger ,  Ilan Kirschenbaum

发明人： Haim Rochberger ,  Ilan Kirschenbaum

IPC分类号： H04L1256

CPC分类号： H04Q11/0478 ,  H04L12/5601 ,  H04L2012/562 ,  H04L2012/5621

摘要： A method of determining the optimum route from a source to a destination node in an ATM network utilizing fuzzy logic processing to determine the optimum route based on a set metrics that may or may not be related to each other. The invention utilizes well known fuzzy logic techniques to perform optimization and calculations based on intuitive rules rather then complex mathematical solutions. The method of the invention can be applied to routing algorithms to determine the optimum route when it is desired to optimize the route based on a large number of metrics, attributes and/or parameters. The fuzzy logic processing is divided into two phases each having its own set of rules that the input data is applied against. Fuzzy logic processing is performed for all candidate routes wherein the route chosen is the one having a maximum link quality.

摘要翻译： 一种利用模糊逻辑处理确定在ATM网络中从源到目的地节点的最佳路由的方法，以便基于可能彼此或可能不相关的集合度量来确定最佳路由。 本发明利用众所周知的模糊逻辑技术，基于直观的规则而不是复杂的数学解决方案进行优化和计算。 当希望基于大量度量，属性和/或参数优化路由时，本发明的方法可以应用于路由算法以确定最佳路由。 模糊逻辑处理被分成两个阶段，每个阶段都有自己的一套规则，即应用输入数据。 对于其中所选择的路由是具有最大链路质量的候选路线，执行模糊逻辑处理。

公开(公告)号：US06480891B1

公开(公告)日：2002-11-12

申请号：US09225246

申请日：1999-01-04

申请人： Arcady Chernyak ,  Haim Rochberger

发明人： Arcady Chernyak ,  Haim Rochberger

IPC分类号： H04L1224

CPC分类号： H04Q11/0478 ,  H04L12/5601 ,  H04L49/255 ,  H04L49/65 ,  H04L2012/5625 ,  H04L2012/5681

摘要： A system for reducing the memory requirements of an ATM device utilizing one or more temporary code uploads to bring needed portions of application code into the memory of the ATM embedded system on a temporary basis. The present invention functions to divide the code necessary for operation of the ATM device into two categories: (1) application code that is seldom used or code used only once and (2) all other application code. The application code that is seldom used or used only once is removed from the memory of the ATM embedded system and placed in a software storage device external to the system. This serves to significantly reduce the memory requirements of the ATM device, by as much as 40% in come cases depending on the size of the application code portions.

摘要翻译： 一种用于减少ATM设备的存储器需求的系统，其利用一个或多个临时代码上传，以将临时的应用代码的所需部分带入ATM嵌入式系统的存储器。 本发明用于将ATM设备的操作所必需的代码划分为两个类别：（1）很少使用的应用代码或仅使用一次的代码和（2）所有其他应用代码。 很少使用或仅使用一次的应用代码从ATM嵌入式系统的存储器中移除并放置在系统外部的软件存储设备中。 这取决于应用代码部分的大小，这大大降低了ATM设备的存储器需求，多达40％的情况。

公开(公告)号：US06289017B1

公开(公告)日：2001-09-11

申请号：US09087783

申请日：1998-05-29

申请人： Sarit Shani ,  Yoram Shamir ,  Miki Kenneth ,  Haim Rochberger

发明人： Sarit Shani ,  Yoram Shamir ,  Miki Kenneth ,  Haim Rochberger

IPC分类号： H01L1256

CPC分类号： H04L12/4608 ,  H04L2012/5617 ,  H04L2012/5619 ,  H04L2012/563 ,  H04Q11/0478 ,  H04Q2213/13103 ,  H04Q2213/13164 ,  H04Q2213/13166 ,  H04Q2213/13167 ,  H04Q2213/13204 ,  H04Q2213/1329 ,  H04Q2213/1336 ,  H04Q2213/1338

摘要： A method of providing redundancy and load sharing among multiple LECSs in an ATM network. The method creates and maintains a plurality of lists on each of the switches. Each list is an ordered set of LECSs that combine to create an active LECS list. The network is divided into a plurality of groups wherein each group is assigned one of the active LECS lists. The order of each active LECS list is unique in that no two groups have the same order of LECS. The first LECS on each list has the highest priority and is always the first choice when a request to join a VLAN is received from one of the connected LECs. If the primary lECS fails or cannot be reached for any reason, the switches utilize the second LECS on the list. Splitting up the network into multiple groups and assigning different lists serves to provide load sharing among the LECS. In the event the currently active LECS fails, the next on the list takes overt thus providing redundancy.

摘要翻译： 一种在ATM网络中的多个LECS之间提供冗余和负载共享的方法。 该方法在每个交换机上创建和维护多个列表。 每个列表都是一组有序的LECS，它们组合起来创建一个活动的LECS列表。 网络被分成多个组，其中每个组被分配了一个活动LECS列表。 每个活动LECS列表的顺序是唯一的，因为没有两个组具有相同的LECS顺序。 每个列表上的第一个LECS具有最高优先级，并且当从一个连接的LEC接收到加入VLAN的请求时，始终是第一选择。 如果主要的LECS出现故障或由于任何原因无法访问，交换机将使用列表中的第二个LECS。 将网络分为多个组并分配不同的列表，用于在LECS之间提供负载共享。 在当前活动的LECS发生故障的情况下，列表中的下一个将接管，从而提供冗余。

公开(公告)号：US06205146B1

公开(公告)日：2001-03-20

申请号：US09086423

申请日：1998-05-28

申请人： Haim Rochberger ,  Sarit Shani ,  Meir Morgenstern ,  David Margulis

发明人： Haim Rochberger ,  Sarit Shani ,  Meir Morgenstern ,  David Margulis

IPC分类号： H04L1228

CPC分类号： H04L45/122 ,  H04L45/10

摘要： A method of determining an efficient route to a well known address that is particularly applicable to networks that do not have the capability of source routing for calculating routes to specific addresses such as ATM networks based on the IISP protocol. The well known address may represent any entity in the network that provides distributed services (e.g., network server applications) that are to be shared among many nodes and applications on the network, such as LECSs. The method of functions to automatically and dynamically register ‘well known’ addresses on the ports of each node that implements the invention. This permits applications on the network to route to the destination in the shortest possible path thus utilizing network resources in an efficient manner. If there is more than one location with the well known address, e.g., a redundant LECSs in the network, or more than one route to the location then the optimum location will be the one routed to. An optimum location can be determined using any suitable criteria to determine the optimum route to a LECS such as distance, hop count, cost function, link sum, link capacity, etc.

摘要翻译： 确定到公知地址的有效路由的方法，其特别适用于不具有基于IISP协议的诸如ATM网络的特定地址的路由的源路由能力的网络。 众所周知的地址可以表示网络中提供分布式服务（例如，网络服务器应用）的任何实体，其将被许多节点和网络上的应用（例如LECS）共享。 在实现本发明的每个节点的端口上自动和动态地注册“公知”地址的功能的方法，这允许网络上的应用以尽可能最短的路径路由到目的地，从而以有效的方式利用网络资源。 如果存在多个具有众所周知的地址的位置，例如，网络中的冗余LECS，或者到该位置的多于一条路由，那么最佳位置将是路由到的最佳位置。可以使用任何适当的 确定到LECS的最佳路由的标准，例如距离，跳数，成本函数，链路和，链路容量等。

公开(公告)号：US20140179366A1

公开(公告)日：2014-06-26

申请号：US13722920

申请日：2012-12-20

申请人： Tirosh Levin ,  Yaron Alpert ,  Chandru Aswani ,  Gil Zukerman ,  Saket Jha ,  Haim Rochberger

发明人： Tirosh Levin ,  Yaron Alpert ,  Chandru Aswani ,  Gil Zukerman ,  Saket Jha ,  Haim Rochberger

IPC分类号： H04W88/06

CPC分类号： H04W88/06 ,  H04J11/00 ,  H04J2011/0096 ,  H04W52/0248 ,  H04W56/00 ,  H04W56/001 ,  Y02D70/1224 ,  Y02D70/1262 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/164 ,  Y02D70/166

摘要： A system and method for the distribution of time signals is available for devices with multiple communication cores. An embodiment may or may not use a centralized manager for the management of time preservation. When a communication core in a multiple communication core device requires timing information, it may request the time information from another communication core or from the centralized manager. The centralized manager, if present, can obtain time information from an external source or from one of the communication cores. The result can be reduced power consumption at a lower cost.

摘要翻译： 用于分配时间信号的系统和方法可用于具有多个通信核心的设备。 一个实施例可以使用也可以不使用集中管理器来管理时间保持。 当多通信核心设备中的通信核心需要定时信息时，可以从另一个通信核心或从集中管理器请求时间信息。 集中管理器（如果存在）可以从外部来源或其中一个通信核心获取时间信息。 结果可以以更低的成本降低功耗。