公开(公告)号：US20030236870A1

公开(公告)日：2003-12-25

申请号：US10176044

申请日：2002-06-21

Applicant: International Business Machines Corporation

Inventor： Richard H. Boivie ,  Nancy K. Feldman

IPC: G06F015/173

CPC classification number: H04L41/0886 ,  H04L41/0803 ,  H04L41/12 ,  H04L41/22 ,  H04L45/02 ,  H04L45/04 ,  H04L45/46 ,  H04L45/64 ,  H04W40/00

Abstract: A method (and structure) for automatically configuring a network including a plurality of interconnected computers, includes configuring more than one of the plurality of computers to assume a role as a designated router which determines a current network configuration by determining which computers are currently on-line, using this determined current network configuration to determine a current network topology that defines a neighborhood relationship among the interconnected computers currently on-line, and communicating the current network topology to the network. The method also includes defining a priority criterion and automatically selecting one of the computers according to the priority criterion to serve the role as designated router.

Abstract translation: 用于自动配置包括多个互连计算机的网络的方法（和结构）包括配置多个计算机中的多于一个计算机以承担作为指定路由器的角色，所述路由器确定当前网络配置， 线路，使用该确定的当前网络配置来确定当前网络拓扑，其定义当前在线的互连计算机之间的邻域关系，以及将当前网络拓扑传递到网络。 该方法还包括定义优先级标准，并根据优先级标准自动选择一台计算机，以将该角色用作指定路由器。

公开(公告)号：US20030204623A1

公开(公告)日：2003-10-30

申请号：US10134559

申请日：2002-04-29

Applicant: Harris Corporation

Inventor： Joseph Bibb Cain

IPC: G06F015/173

CPC classification number: H04L45/04 ,  H04L45/00 ,  H04L45/26 ,  H04L45/30 ,  H04L45/302 ,  H04L45/46 ,  H04W40/02 ,  H04W40/246 ,  H04W40/26 ,  H04W40/28 ,  H04W40/32 ,  H04W84/18

Abstract: A method is provided for sending data in a mobile ad-hoc network including a plurality of nodes and a plurality of wireless links connecting the plurality of nodes. The method may include grouping the plurality of nodes into clusters of nodes and designating a cluster leader node for each cluster. Furthermore, a cluster-level route request may be sent from a source node of a source cluster to a cluster leader node of the source cluster. The method may also include determining a cluster-level route between the source cluster and a destination cluster comprising a destination node responsive to the cluster-level route request and using a plurality of the cluster leader nodes. Additionally, data may be transferred from the source node to the destination node using the cluster-level route.

Abstract translation: 提供一种用于在包括连接多个节点的多个节点和多个无线链路的移动自组织网络中发送数据的方法。 该方法可以包括将多个节点分组成节点簇，并为每个簇指定簇首节点。 此外，群集级路由请求可以从源集群的源节点发送到源集群的集群引导节点。 该方法还可以包括：确定源群集与目的地群集之间的群集级路由，其包括响应于群集级路由请求的目的地节点，并且使用多个群集首领节点。 另外，数据可以使用群集级路由从源节点传送到目的地节点。

公开(公告)号：US20020169846A1

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

申请号：US10108109

申请日：2002-03-27

Inventor： Priscilla L. Chen ,  Lance E. Hester ,  Yan Huang

IPC: G06F015/16

CPC classification number: H04W84/20 ,  H04L45/04 ,  H04L45/46 ,  H04W40/10 ,  H04W40/32 ,  Y02D70/326

Abstract: A communication device (111) determines whether to operate as a cluster head in a network of communication devices (100). The device performs a self-assessment regarding its ability to operate as a cluster head based on a formula that assigns weights to factors related to its capabilities and preferably its environment (410, 420, 430). The ability of the device is combined with a random value component in determining whether to operate as a cluster head (440). In the preferred embodiment, upon assumption of cluster head status, the device communicates with neighboring devices to signal its cluster head status, and to invite others to participate in the formation of a cluster.

Abstract translation: 通信设备（111）确定是否作为通信设备（100）的网络中的簇头操作。 该设备基于将权重分配给与其能力和优选其环境相关的因素的公式（410,420,430），对其作为集群头部的操作能力进行自我评估。 在确定是否作为簇头操作（440）时，将装置的能力与随机值分量组合。 在优选实施例中，在假设簇头状态时，设备与相邻设备进行通信，以指示其簇头状态，并邀请其他人参与簇的形成。

公开(公告)号：US20020061010A1

公开(公告)日：2002-05-23

申请号：US10050306

申请日：2002-01-15

Applicant: Nokia Corporation

Inventor： Jyrki Akkanen

IPC: H04L012/28

CPC classification number: H04L45/46 ,  H04L45/04 ,  H04L45/18

Abstract: This invention relates to routing in a communication network. In particular, the invention concerns routing in telecommunication and cellular networks. The idea of the invention is to preprocess the network in order to accelerate the routing process. The preprocessing comprises finding the difficult network portions, and removing trivial network portions from the network topology. As a result of these phases the network is divided into small subnetworks. After the preprocessing predetermined endpoints of a single route are added into the subnetworks for finding the route through the network. After that, traffic in each subnetwork is routed separately. Traffic in the network parts between the subnetworks, or between the endpoints and the subnetworks, may need additional routing.

Abstract translation: 本发明涉及通信网络中的路由。 特别地，本发明涉及电信和蜂窝网络中的路由。 本发明的思想是预处理网络以加速路由过程。 预处理包括找到困难的网络部分，以及从网络拓扑中去除平凡的网络部分。 作为这些阶段的结果，网络被划分成小的子网络。 在单个路由的预处理预定端点被添加到子网中以找到通过网络的路由之后。 之后，每个子网的流量单独路由。 子网之间或端点与子网之间网络部分的通信可能需要额外的路由。

公开(公告)号：US5793765A

公开(公告)日：1998-08-11

申请号：US612905

申请日：1996-03-06

Applicant: Cornelis Boer ,  Johannes Cornelis De Kruif

Inventor： Cornelis Boer ,  Johannes Cornelis De Kruif

IPC: H04L12/56 ,  H04L12/28

CPC classification number: H04L45/46 ,  H04L45/02 ,  H04L45/04 ,  H04L45/42

Abstract: Determining, in a transport network, a link between a source and a destination. The network is partitioned into subnetworks between which sublinks are determined. Each subnetwork has access points which indicate the transport capacity of the subnetwork between the access points. The sublinks, in each case, extend from a first access point to a second access point. In a network having a distributed control, the sublinks are determined successively between the link already determined and a remaining subnetwork. In this arrangement, the remaining subnetwork, in each case, includes an access point already associated with the destination and does not include an access point already associated with the link. Preferably, the access points, in each case, indicate the available capacity of a subnetwork.

Abstract translation: PCT No.PCT / EP94 / 02951 Sec。 371日期1996年3月6日 102（e）1996年3月6日PCT PCT 1994年9月6日PCT公布。 WO95 / 07586 PCT公开号 日期1995年3月16日在传输网络中确定源和目的地之间的链接。 网络被划分为确定了子链接之间的子网络。 每个子网具有指示接入点之间的子网的传输容量的接入点。 在每种情况下，子链接从第一接入点延伸到第二接入点。 在具有分布式控制的网络中，在已经确定的链路和剩余子网之间连续确定子链路。 在这种布置中，在每种情况下，剩余的子网包括已经与目的地相关联的接入点，并且不包括已经与链路相关联的接入点。 优选地，在每种情况下，接入点指示子网的可用容量。

公开(公告)号：US5495479A

公开(公告)日：1996-02-27

申请号：US262089

申请日：1994-06-20

Applicant: Claude Galaand ,  Paolo Scotton

Inventor： Claude Galaand ,  Paolo Scotton

IPC: H04L12/24 ,  H04L12/56 ,  H04L12/44

CPC classification number: H04L45/04 ,  H04L41/0803 ,  H04L45/46 ,  Y04S40/162

Abstract: The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network.Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure: a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.

Abstract translation: 本发明的目的是在骨干节点和子区域节点中执行分组交换网络的自动分解，以加速路由路径搜索，而不会降低路由算法的优化准则，而不会在网络上生成额外的控制消息。 目前，路由算法在从源节点到目的地节点之前计算网络中的所有可用路径，以选择最优路由。 然而，网络很少完全网格化。 它们通常围绕层次结构构建：通过高吞吐量线互连的一组节点用于构建具有高度网格划分的骨干网，然后将本地节点分组到附属于骨干网的地理子区域中。 路由算法可以利用这种特定的网络拓扑，大大降低了路径计算的复杂度。 对于给定的连接，只有有限数量的节点被定义为可用的，并且在其路径计算中由算法考虑。

公开(公告)号：US5450408A

公开(公告)日：1995-09-12

申请号：US769936

申请日：1991-09-30

Applicant: Peter Phaal

Inventor： Peter Phaal

IPC: H04L12/46 ,  H04L12/26 ,  H04L12/715 ,  H04L12/717 ,  H04L12/721 ,  H04L12/751 ,  H04J3/02

CPC classification number: H04L43/00 ,  H04L12/2602 ,  H04L45/02 ,  H04L45/04 ,  H04L45/42 ,  H04L45/46 ,  H04L45/70 ,  H04L43/0847

Abstract: A method is provided for ascertaining topology features of a network comprising a plurality of sub-networks, spanning devices interconnecting the sub-networks, and stations operative to source and/or sink traffic to/from the sub-networks. The traffic is in the form of discrete message packets each including source and destination information. Traffic on each of the sub-networks is monitored by a respective monitoring device and a partial traffic matrix is built up for each sub-network. These partial traffic matrices are then analyzed by a central processing station to determine, for example, the association of stations within the with sub-networks, and the interconnection of sub-networks by spanning devices.

Abstract translation: 提供了一种用于确定网络的拓扑特征的方法，所述网络包括多个子网络，跨越将所述子网络互连的设备，以及用于向/从所述子网络发送和/或接收流量的站。 流量是离散消息包的形式，每个包括源和目的地信息。 每个子网络上的业务由相应的监控设备监控，并为每个子网建立部分业务矩阵。 这些部分业务矩阵然后由中央处理站进行分析，以确定例如子网内的站的关联以及通过跨越设备的子网的互连。

公开(公告)号：US5315580A

公开(公告)日：1994-05-24

申请号：US749580

申请日：1991-08-26

Applicant: Peter Phaal

Inventor： Peter Phaal

IPC: H04L12/26 ,  H04L12/56 ,  H04B17/00

CPC classification number: H04L45/70 ,  H04L43/022 ,  H04L45/02 ,  H04L45/04 ,  H04L45/42 ,  H04L45/46 ,  H04L43/0847 ,  H04L43/16

Abstract: The network monitoring device is provided for monitoring the activity on a network carrying message packets each of which contains source and destination addresses. The monitoring device includes a network interface for sending and receiving message packets carried on the network, and a processor for collecting and processing data from the packets received by the network interface. In order to minimize processor memory requirements for the monitoring device, only randomly selected packets detected by the network interface are processed by the processor of the device. Preferably, the monitoring device is further simplified by providing a central measurement station to analyze data collected from the randomly sampled packets. As a result, the only processing required to be done by the monitoring device is the construction of collected-data packets for transmission to the central measurement station. A network monitoring system can advantageously be provided by using a number of such monitoring devices each associated with a respective logical segment of the network and each forwarding collected-data packets to a central measurement station.

Abstract translation: 提供网络监视设备用于监视携带消息分组的网络上的活动，每个消息分组包含源地址和目的地址。 监控装置包括用于发送和接收在网络上携带的消息分组的网络接口，以及用于从由网络接口​​接收的分组收集和处理数据的处理器。 为了最小化监视设备的处理器内存需求，只有由网络接口​​检测到的随机选择的包才能由设备的处理器处理。 优选地，通过提供中央测量站来分析从随机采样的分组收集的数据，进一步简化了监视设备。 因此，由监视装置进行的唯一处理是构建收集的数据包以便传输到中央测量站。 可以通过使用多个这样的监视设备来有利地提供网络监视系统，每个这样的监视设备与网络的相应逻辑段相关联，并且每个将收集的数据分组转发到中央测量站。

公开(公告)号：US4823111A

公开(公告)日：1989-04-18

申请号：US158915

申请日：1988-02-22

Applicant: Paul F. Tsuchiya ,  W. Worth Kirkman

Inventor： Paul F. Tsuchiya ,  W. Worth Kirkman

IPC: H04L12/56 ,  H04Q9/00 ,  H04Q11/04

CPC classification number: H04L45/04 ,  H04L45/46

Abstract: A hierarchy of landmarks is established for the nodes in the network. Each node is assigned at least one hierarchy level designation and has a corresponding radius. An address is assigned to each of the nodes, the address including components representing landmarks wherein each landmark represented by the address component is within the radius of the landmark represented by the next lower address component. Each node maintains a routing table for routing entries to landmarks within the radii of which a node resides. A source node chooses a path toward the highest level landmark represented by the address components of a destination node until the path reaches a node within the radius of the landmark represented by the next lower level address component. This procedure is repeated for the remaining address components.

Abstract translation: 为网络中的节点建立地标层次。 每个节点被分配至少一个层次级别名称并具有相应的半径。 地址被分配给每个节点，地址包括表示地标的分量，其中由地址分量表示的每个地标在由下一个较低地址分量表示的地标的半径内。 每个节点维护一个路由表，用于将节点路由到节点驻留的半径内的地标。 源节点选择朝向由目的地节点的地址组件表示的最高级地标的路径，直到路径到达由下一个较低级地址组件表示的地标的半径内的节点。 对其余的地址组件重复此过程。

公开(公告)号：US12132649B2

公开(公告)日：2024-10-29

申请号：US18454202

申请日：2023-08-23

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Igor Gorodetsky ,  Hess M. Hodge ,  Timothy J. Johnson

IPC: G06F13/24 ,  G06F9/50 ,  G06F9/54 ,  G06F12/0862 ,  G06F12/1036 ,  G06F12/1045 ,  G06F13/14 ,  G06F13/16 ,  G06F13/38 ,  G06F13/40 ,  G06F13/42 ,  G06F15/173 ,  H04L1/00 ,  H04L43/0876 ,  H04L43/10 ,  H04L45/00 ,  H04L45/021 ,  H04L45/028 ,  H04L45/12 ,  H04L45/122 ,  H04L45/125 ,  H04L45/16 ,  H04L45/24 ,  H04L45/28 ,  H04L45/42 ,  H04L45/745 ,  H04L45/7453 ,  H04L47/10 ,  H04L47/11 ,  H04L47/12 ,  H04L47/122 ,  H04L47/20 ,  H04L47/22 ,  H04L47/24 ,  H04L47/2441 ,  H04L47/2466 ,  H04L47/2483 ,  H04L47/30 ,  H04L47/32 ,  H04L47/34 ,  H04L47/52 ,  H04L47/62 ,  H04L47/625 ,  H04L47/6275 ,  H04L47/629 ,  H04L47/76 ,  H04L47/762 ,  H04L47/78 ,  H04L47/80 ,  H04L49/00 ,  H04L49/101 ,  H04L49/15 ,  H04L49/90 ,  H04L49/9005 ,  H04L49/9047 ,  H04L67/1097 ,  H04L69/22 ,  H04L69/40 ,  H04L69/28

CPC classification number: H04L45/28 ,  G06F9/505 ,  G06F9/546 ,  G06F12/0862 ,  G06F12/1036 ,  G06F12/1063 ,  G06F13/14 ,  G06F13/16 ,  G06F13/1642 ,  G06F13/1673 ,  G06F13/1689 ,  G06F13/385 ,  G06F13/4022 ,  G06F13/4068 ,  G06F13/4221 ,  G06F15/17331 ,  H04L1/0083 ,  H04L43/0876 ,  H04L43/10 ,  H04L45/021 ,  H04L45/028 ,  H04L45/122 ,  H04L45/123 ,  H04L45/125 ,  H04L45/16 ,  H04L45/20 ,  H04L45/22 ,  H04L45/24 ,  H04L45/38 ,  H04L45/42 ,  H04L45/46 ,  H04L45/566 ,  H04L45/70 ,  H04L45/745 ,  H04L45/7453 ,  H04L47/11 ,  H04L47/12 ,  H04L47/122 ,  H04L47/18 ,  H04L47/20 ,  H04L47/22 ,  H04L47/24 ,  H04L47/2441 ,  H04L47/2466 ,  H04L47/2483 ,  H04L47/30 ,  H04L47/32 ,  H04L47/323 ,  H04L47/34 ,  H04L47/39 ,  H04L47/52 ,  H04L47/621 ,  H04L47/6235 ,  H04L47/626 ,  H04L47/6275 ,  H04L47/629 ,  H04L47/76 ,  H04L47/762 ,  H04L47/781 ,  H04L47/80 ,  H04L49/101 ,  H04L49/15 ,  H04L49/30 ,  H04L49/3009 ,  H04L49/3018 ,  H04L49/3027 ,  H04L49/90 ,  H04L49/9005 ,  H04L49/9021 ,  H04L49/9036 ,  H04L49/9047 ,  H04L67/1097 ,  H04L69/22 ,  H04L69/40 ,  G06F2212/50 ,  G06F2213/0026 ,  G06F2213/3808 ,  H04L69/28

Abstract: A network interface controller (NIC) capable of efficient memory access is provided. The NIC can be equipped with an operation logic block, a signaling logic block, and a tracking logic block. The operation logic block can maintain an operation group associated with packets requesting an operation on a memory segment of a host device of the NIC. The signaling logic block can determine whether a packet associated with the operation group has arrived at or departed from the NIC. Furthermore, the tracking logic block can determine that a request for releasing the memory segment has been issued. The tracking logic block can then determine whether at least one packet associated with the operation group is under processing in the NIC. If no packet associated with the operation group is under processing in the NIC, tracking logic block can notify the host device that the memory segment can be released.