ARRANGEMENT FOR TRAVERSING AN IPv4 NETWORK BY IPv6 MOBILE NODES
    11.
    发明申请
    ARRANGEMENT FOR TRAVERSING AN IPv4 NETWORK BY IPv6 MOBILE NODES 审中-公开
    通过IPv6移动节点处理IPv4网络的安排

    公开(公告)号:WO2004107126A2

    公开(公告)日:2004-12-09

    申请号:PCT/US2004/016728

    申请日:2004-05-27

    IPC: G06F

    Abstract: A source IPv6 mobile node is configured for forwarding an IPv6 packet via an IPv4 connection with a destination IPv6 router. The IPv4 packet includes IPv4 source and destination addresses, a UDP source port and UDP destination port, and a synthetic tag address in the IPv6 destination address field. The synthetic tag address, a valid (routable) IPv6 care of address, has an address prefix routed to the IPv6 router. The address prefix specifies a forwarding protocol, the IPv4 destination address for the IPv6 router, and a site-level aggregation identifier. An address suffix for the synthetic tag address specifies the IPv4 source address, the UDP source port and UDP destination port. Hence, the synthetic tag address enables the destination IPv6 router to send an IPv6 reply packet back to the source IPv6 mobile node via the IPv4 network.

    Abstract translation: 源IPv6移动节点被配置为经由与目的地IPv6路由器的IPv4连接来转发IPv6分组。 IPv4分组包括IPv4源地址和目的地址,UDP源端口和UDP目的端口,以及IPv6目的地址字段中的合成标签地址。 合成标签地址(一个有效的(可路由的)IPv6地址保护)具有路由到IPv6路由器的地址前缀。 地址前缀指定转发协议,IPv6路由器的IPv4目的地址和站点级聚合标识符。 合成标签地址的地址后缀指定IPv4源地址,UDP源端口和UDP目的端口。 因此,合成标签地址使目的IPv6路由器能够通过IPv4网络将IPv6应答分组发送回源IPv6移动节点。

    DETERMINING SESSION DURATION FOR DEVICE AUTHENTICATION

    公开(公告)号:WO2022046627A1

    公开(公告)日:2022-03-03

    申请号:PCT/US2021/047137

    申请日:2021-08-23

    Abstract: This disclosure describes techniques for authenticating a user device for a session. For instance, an authentication entity may authenticate a user device using single sign-on authentication and/or multi-factor authentication. The authentication entity may then determine a duration for which the user device is authenticated for the session. For example, the authentication entity may receive information representing a state of an environment of the user device. The authentication entity may then use the information to identify one or more transitions associated with the environment between the session and a previous session. Using the one or more transitions, the authentication entity may determine the duration for the session by increasing or decreasing a previous duration associated with the previous session.

    BIT INDEX EXPLICIT REPLICATION (BIER) FOR EFFICIENT ROUTING THROUGH A DESTINATION ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) IN RESOURCE CONSTRAINED LOW-POWER AND LOSSY NETWORKS (LLNS)
    14.
    发明申请
    BIT INDEX EXPLICIT REPLICATION (BIER) FOR EFFICIENT ROUTING THROUGH A DESTINATION ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) IN RESOURCE CONSTRAINED LOW-POWER AND LOSSY NETWORKS (LLNS) 审中-公开
    通过目标定向的方向图(图形)在资源约束的低功耗和损耗网络(LLNS)中进行有效路由的位置索引显示(BIER)

    公开(公告)号:WO2016081224A1

    公开(公告)日:2016-05-26

    申请号:PCT/US2015/059893

    申请日:2015-11-10

    Abstract: In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG) as used by RPL, the IPv6 Routing Protocol for Low-power and lossy networks (LLNs). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node. Aggregating node bitmaps by OR operation with the bitmaps of their children allows to spare resources in nodes of LLNs; forwarding to the destination can be easily performed via AND operation on bitmaps. Deciding unicast or broadcast forwarding based on the density of interested children saves energy by optimally avoiding awaking of nodes.

    Abstract translation: 在一个实施例中,网络中的第一节点根据由RPL使用的有向无环图(DAG)接收来自第一节点的一个或多个子节点的一个或多个位图,用于低功率和有损网络的IPv6路由协议 (LLN的)。 一个或多个子节点中的每一个与一个或多个位图中的对应唯一位位置相关联。 第一节点在转发表中存储从第一节点的一个或多个子节点接收的一个或多个位图。 第一节点接收消息,该消息包括目的地位图,其通过与一个或多个子节点相关联的位位置处的一个或多个设置位来标识消息的一个或多个目的地。 第一节点基于目的位图和存储在第一节点的转发表中的一个或多个位图将消息转发到所标识的一个或多个目的地。 通过OR操作与其子节点的位图聚合节点位图,可以在LLN节点中节省资源; 可以通过位图上的AND操作轻松地执行到目的地的转发。 基于感兴趣的孩子的密度决定单播或广播转发通过最佳地避免节点的唤醒来节省能量。

    DISTRIBUTED RESCHEDULING OF BOUNDED FLOWS IN A TIME SENSITIVE NETWORK
    15.
    发明申请
    DISTRIBUTED RESCHEDULING OF BOUNDED FLOWS IN A TIME SENSITIVE NETWORK 审中-公开
    在时间敏感网络中分布式流动的循环流

    公开(公告)号:WO2016010758A1

    公开(公告)日:2016-01-21

    申请号:PCT/US2015/039193

    申请日:2015-07-06

    CPC classification number: H04L47/28 H04L47/12 H04L47/125 H04L47/14 H04L47/24

    Abstract: In one embodiment, a device determines that a latency between a receive timeslot of a channel hopping schedule of the device and a transmit timeslot of the channel hopping schedule is greater than a latency threshold for a particular traffic flow to be received during the receive timeslot. The device requests an additional transmit timeslot for the channel hopping schedule from a parent node of the device in the network. The device receives an indication of a newly allocated transmit timeslot for the channel hopping schedule from the parent node. The device maps the receive timeslot to one of the transmit timeslots of the channel hopping schedule, wherein the particular traffic flow is to be forwarded to a second device during the mapped transmit timeslot.

    Abstract translation: 在一个实施例中,设备确定设备的信道跳频调度的接收时隙与信道跳频调度的发送时隙之间的等待时间大于在接收时隙期间接收的特定业务流的等待时间阈值。 该设备从网络中的设备的父节点请求用于信道跳频调度的附加传输时隙。 设备从父节点接收关于信道跳频调度的新分配的发射时隙的指示。 设备将接收时隙映射到信道跳频调度的发送时隙之一,其中在映射的发送时隙期间将特定业务流转发到第二设备。

    DISTRIBUTED MEDIA ACCESS CONTROLLER TRANSMITTING NETWORK CODED CELLS VIA OPTICAL TRANSMITTERS
    16.
    发明申请
    DISTRIBUTED MEDIA ACCESS CONTROLLER TRANSMITTING NETWORK CODED CELLS VIA OPTICAL TRANSMITTERS 审中-公开
    分布式媒体访问控制器通过光传输器发送网络编码电池

    公开(公告)号:WO2015153371A1

    公开(公告)日:2015-10-08

    申请号:PCT/US2015/023118

    申请日:2015-03-27

    Abstract: In one embodiment, a method comprises receiving, by an apparatus, a Media Access Control (MAC) frame destined for a destination device; dividing, by the apparatus, the MAC frame into frame fragments; coding the frame fragments into encoded cells; and causing, by the apparatus, transmission of selected subsets of the encoded cells, as distinct flows of the encoded cells, by respective optical physical layer transmitter devices reachable by the destination device.

    Abstract translation: 在一个实施例中,一种方法包括由设备接收去往目的地设备的媒体接入控制(MAC)帧; 将MAC帧划分成帧分段; 将帧片段编码成编码的细胞; 并且由所述设备通过由所述目的地设备可达的相应光学物理层发射机设备使所编码的小区的所选择的子集作为编码小区的不同流发送。

    EFFICIENT NETWORK PROBING FOR DETERMINISTIC WIRELESS NETWORKS
    17.
    发明申请
    EFFICIENT NETWORK PROBING FOR DETERMINISTIC WIRELESS NETWORKS 审中-公开
    用于确定无线网络的有效网络探测

    公开(公告)号:WO2015009667A1

    公开(公告)日:2015-01-22

    申请号:PCT/US2014/046606

    申请日:2014-07-15

    CPC classification number: H04L43/10 H04L41/0896 H04L43/04 H04L43/06 H04L43/103

    Abstract: In one embodiment, a device (e.g., path computation device) informs a network management device of a plurality of possible probing profiles, where nodes of a computer network receive the plurality of possible probing profiles from the network management device. Based on determining that particular information is desired from one or more particular nodes of the nodes of the computer network, the device may then select one or more particular probing profiles of the plurality of possible probing profiles based on the particular information, and instructs the one or more particular nodes to probe one or more particular destination nodes according to the one or more particular probing profiles.

    Abstract translation: 在一个实施例中,设备(例如,路径计算设备)向网络管理设备通知多个可能的探测简档,其中计算机网络的节点从网络管理设备接收多个可能的探测简档。 基于从计算机网络的节点的一个或多个特定节点确定特定信息,设备然后可以基于特定信息来选择多个可能的探测简档中的一个或多个特定探测简档,并且指示该一个 或更多特定节点以根据所述一个或多个特定探测简档来探测一个或多个特定目的地节点。

    PRIORITIZED ZUEUEING IN A MESH NETWORK BASED ON AGE OF PAYLOAD DATA
    18.
    发明申请
    PRIORITIZED ZUEUEING IN A MESH NETWORK BASED ON AGE OF PAYLOAD DATA 审中-公开
    基于PAYLOAD数据年龄的网状网络中优先选择的ZUEUEING

    公开(公告)号:WO2014126978A2

    公开(公告)日:2014-08-21

    申请号:PCT/US2014/015973

    申请日:2014-02-12

    CPC classification number: H04W72/1242 H04W72/1221 H04W84/18

    Abstract: In one embodiment, a method comprises identifying an age of payload data in a data packet by a wireless network node configured for transmitting the data packet to a multi-hop destination via a wireless mesh network; determining by the wireless network node a schedule for the data packet reaching the multi-hop destination; and the wireless network node prioritizing queuing of the data packet for Collision Sense with Multiple Access and Collision Avoidance (CSMA-CA) based wireless transmission in the wireless mesh network based on the corresponding age, relative to the schedule and respective ages of other data packets awaiting transmission by the wireless network node to the destination, where a higher-aged data packet relative to the schedule is granted have a higher priority than a lower-aged data packet relative to the schedule.

    Abstract translation: 在一个实施例中,一种方法包括:被配置用于经由无线网状网络将数据分组发送到多跳目的地的无线网络节点识别数据分组中的有效载荷数据的年龄; 由所述无线网络节点确定所述数据分组到达所述多跳目的地的调度; 并且所述无线网络节点基于相对于所述时间表和其他数据分组的相应年龄的相应年龄,优先排序所述无线网状网络中的基于多路访问和冲突避免(CSMA-CA)的冲突感测数据分组排队 等待由无线网络节点传送到目的地的位置,其中相对于时间表被更高级别的数据包被授予具有比相对于时间表的低龄数据包更高的优先级。

    SECURE NEIGHBOR DISCOVERY ROUTER FOR DEFENDING HOST NODES FROM ROGUE ROUTERS
    19.
    发明申请
    SECURE NEIGHBOR DISCOVERY ROUTER FOR DEFENDING HOST NODES FROM ROGUE ROUTERS 审中-公开
    安全邻近发现路由器保护主机路由器从ROGUE路由器

    公开(公告)号:WO2008154152A1

    公开(公告)日:2008-12-18

    申请号:PCT/US2008/064830

    申请日:2008-05-27

    Abstract: In one embodiment, a method comprises receiving, by a router in a network, a router advertisement message on a network link of the network; detecting within the router advertisement message, by the router, an advertised address prefix and an identified router having transmitted the router advertisement message within the network; determining, by the router, whether the identified router is authorized to at least one of advertise itself as a router, or advertise the advertised address prefix on the network link; and selecitvely initiating, by the router, a defensive operation against the identified router based on the router determining the identified router is not authorized to advertise itself as a router, or advertise the advertised address prefix on the network link.

    Abstract translation: 在一个实施例中,一种方法包括由网络中的路由器接收网络的网络链路上的路由器通告消息; 在路由器通告消息内检测由路由器发布的地址前缀和已经在网络内发送了路由器通告消息的已识别路由器; 由所述路由器确定所识别的路由器是否被授权至少一个将自身公告为路由器,或者在所述网络链路上通告所通告的地址前缀; 并且通过路由器选择地基于路由器对所识别的路由器进行防御性操作,所述路由器确定所识别的路由器不被授权作为路由器发布自身,或者在网络链路上通告所通告的地址前缀。

    MULTICAST SUPPORT BY MOBILE ROUTERS IN A MOBILE AD HOC NETWORK

    公开(公告)号:WO2008109312A3

    公开(公告)日:2008-09-12

    申请号:PCT/US2008/055205

    申请日:2008-02-28

    Abstract: In one embodiment, a mobile router receives a multicast-supported router advertisement message from an attachment mobile router in a mobile ad hoc network, the multicast-supported router advertisement message specifying an attachment prefix and a multicast-capable identifier. The mobile router attaches to the attachment mobile router in response to the multicast-supported router advertisement message and according to a protocol requiring establishment in the mobile ad hoc network of a tree topology having a single multicast clusterhead, and selects a default attachment address within an address space of the attachment prefix. The mobile router receives a multicast request, from an attached node, for receiving a multicast stream, and the mobile router outputs a neighbor advertisement message with multicast extension, to the attachment router, that specifies that access to the multicast stream is requested via the default attachment address.

Patent Agency Ranking