Schedule-based prioritization in contention-based shared-media computer networks

    公开(公告)号:US09602420B2

    公开(公告)日:2017-03-21

    申请号:US13796176

    申请日:2013-03-12

    CPC classification number: H04L47/27 H04L45/24 H04L47/2458 H04L47/28 H04W74/04

    Abstract: In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time.

    Synchronized routing updates for TSCH networks
    73.
    发明授权
    Synchronized routing updates for TSCH networks 有权
    TSCH网络的同步路由更新

    公开(公告)号:US09485157B2

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

    申请号:US14336486

    申请日:2014-07-21

    CPC classification number: H04L43/06 H04J3/16 H04L45/48 H04W40/248

    Abstract: In one embodiment, a network node provides a time slotted channel hopping (TSCH) schedule to one or more child nodes of the network node. The TSCH schedule includes one or more mandatory routing protocol report time slots. The network node receives routing protocol reports from the one or more child nodes according to the TSCH schedule. The network node aggregates the received routing protocol reports into an aggregated routing protocol report. The network node provides the aggregated routing protocol report to a parent of the network node during a time slot that is subsequent to the one or more mandatory time slots for the one or more child nodes.

    Abstract translation: 在一个实施例中,网络节点向网络节点的一个或多个子节点提供时隙信道跳频(TSCH)调度。 TSCH调度包括一个或多个强制路由协议报告时隙。 网络节点根据TSCH调度从一个或多个子节点接收路由协议报告。 网络节点将接收到的路由协议报告聚合成聚合路由协议报告。 网络节点在一个或多个子节点的一个或多个强制时隙之后的时隙中向网络节点的父节点提供聚合的路由协议报告。

    USING BIT INDEX EXPLICIT REPLICATION (BIER) IN LOW-POWER AND LOSSY NETWORKS
    75.
    发明申请
    USING BIT INDEX EXPLICIT REPLICATION (BIER) IN LOW-POWER AND LOSSY NETWORKS 审中-公开
    在低功耗和低成本网络中使用BIT INDEX EXPLICIT REPLICATION(BIER)

    公开(公告)号:US20160142248A1

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

    申请号:US14661458

    申请日:2015-03-18

    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). 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.

    Abstract translation: 在一个实施例中,网络中的第一节点根据有向非循环图(DAG)从第一节点的一个或多个子节点接收一个或多个位图。 一个或多个子节点中的每一个与一个或多个位图中的对应唯一位位置相关联。 第一节点在转发表中存储从第一节点的一个或多个子节点接收的一个或多个位图。 第一节点接收消息,该消息包括目的地位图,其通过与一个或多个子节点相关联的位位置处的一个或多个设置位来标识消息的一个或多个目的地。 第一节点基于目的位图和存储在第一节点的转发表中的一个或多个位图将消息转发到所标识的一个或多个目的地。

    Distributed rescheduling of bounded flows in a time sensitive network
    76.
    发明授权
    Distributed rescheduling of bounded flows in a time sensitive network 有权
    在时间敏感网络中分布式重新排列有界流

    公开(公告)号:US09319332B2

    公开(公告)日:2016-04-19

    申请号:US14334821

    申请日:2014-07-18

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

    DETERMINISTIC CONTROL LOOP SCHEDULING
    77.
    发明申请
    DETERMINISTIC CONTROL LOOP SCHEDULING 有权
    确定控制环调度

    公开(公告)号:US20160020987A1

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

    申请号:US14336051

    申请日:2014-07-21

    CPC classification number: H04L41/0803 H04L41/04

    Abstract: In one embodiment, a scheduling device in a network receives routing metrics regarding a network path between a device controller and a networked device. The scheduling device also receives controller metrics for the device controller. The scheduling device determines time costs associated with the network path and one or more control operations performed by the device controller, based on the routing and controller metrics. The scheduling device generates a communication schedule based on the time costs and instructs the device controller and the networked device to use the communication schedule.

    Abstract translation: 在一个实施例中,网络中的调度设备接收关于设备控制器和联网设备之间的网络路径的路由度量。 调度设备还接收设备控制器的控制器度量。 调度设备基于路由和控制器度量来确定与网络路径相关联的时间成本以及由设备控制器执行的一个或多个控制操作。 调度设备基于时间成本生成通信调度,并指示设备控制器和联网设备使用通信调度。

    PROTECTING ADDRESS RESOLUTION PROTOCOL NEIGHBOR DISCOVERY CACHE AGAINST DENIAL OF SERVICE ATTACKS
    78.
    发明申请
    PROTECTING ADDRESS RESOLUTION PROTOCOL NEIGHBOR DISCOVERY CACHE AGAINST DENIAL OF SERVICE ATTACKS 审中-公开
    保护地址解决协议邻国发现超级服务攻击服务攻击

    公开(公告)号:US20150195304A1

    公开(公告)日:2015-07-09

    申请号:US14666717

    申请日:2015-03-24

    Abstract: In one embodiment, a device (e.g., switch or registry) maintains a binding table for all internet protocol (IP) addresses in a particular subnet associated with the device, and in response to receiving a neighbor solicitation (NS) lookup message from a router for a particular address, determines whether the particular address is within the binding table. When the particular address is not within the binding table, the device causes the router to not store the particular address in a neighbor discovery (ND) cache at the router (e.g., by responding to clear the cache, or ignoring to prevent state from being created). In another embodiment, the ND-requesting router ensures that the particular address is not kept in an ND cache at the router in response to the device indicating that the particular address is not within its binding table (e.g., an explicit response to clear, or absence of instruction to store state).

    Abstract translation: 在一个实施例中,设备(例如,交换机或注册表)维护与设备相关联的特定子网中的所有互联网协议(IP)地址的绑定表,并且响应于从路由器接收到邻居请求(NS)查找消息 对于特定地址,确定特定地址是否在绑定表内。 当特定地址不在绑定表内时,设备会使路由器不将特定地址存储在路由器的邻居发现(ND)缓存中(例如,通过响应清除缓存或忽略以防止状态为 创建)。 在另一个实施例中,ND请求路由器确保特定地址不被保留在路由器处的ND高速缓存中,以响应于设备指示特定地址不在其绑定表内(例如,明确的清除响应或 没有指令存储状态)。

    THROTTLING AND LIMITING THE SCOPE OF NEIGHBOR SOLICITATION (NS) TRAFFIC
    79.
    发明申请
    THROTTLING AND LIMITING THE SCOPE OF NEIGHBOR SOLICITATION (NS) TRAFFIC 有权
    扭转和限制邻里协调(NS)交通的范围

    公开(公告)号:US20140282864A1

    公开(公告)日:2014-09-18

    申请号:US13795993

    申请日:2013-03-12

    CPC classification number: H04L63/1458 H04W12/12

    Abstract: In one embodiment, a switch in a computer network may receive a neighbor solicitation (NS) message for a target node for which no neighbor authentication (NA) reply has been received at the switch. The switch may then determine whether to forward the NS message to only non-constrained links of the switch, or to both non-constrained links and constrained links of the switch. The determining may be configured to intermittently result in forwarding the NS message for the target node to both the non-constrained links and the constrained links. The switch may then forward the NS message according to the determination.

    Abstract translation: 在一个实施例中,计算机网络中的交换机可以接收到在交换机处没有接收到相邻认证(NA)应答的目标节点的邻居请求(NS)消息。 交换机然后可以确定是否将NS消息转发到仅交换机的非受约束的链路,或者转发到非限制链路和交换机的约束链路。 该确定可以被配置为间歇地导致将目标节点的NS消息转发到非约束链路和受约束链路两者。 然后,交换机可以根据确定转发NS消息。

    IPV6/IPV4 RESOLUTION-LESS FORWARDING UP TO A DESTINATION
    80.
    发明申请
    IPV6/IPV4 RESOLUTION-LESS FORWARDING UP TO A DESTINATION 有权
    IPV6 / IPV4解决方案无法前往目的地

    公开(公告)号:US20140269717A1

    公开(公告)日:2014-09-18

    申请号:US13839259

    申请日:2013-03-15

    Abstract: In one embodiment, a switch in a computer network intercepts a packet to a destination target, the packet having a solicited node multicast address of the target as a destination media access control (MAC) address of the packet. As such, the switch may determine whether the solicited node multicast address is a hit or miss within a switch hardware table of the switch, and in response to a hit, re-writes the destination MAC address with a known value of the destination target from the table, and unicasts the packet to the destination target. In one or more additional embodiments, in response to a miss, and in response to a single-switch architecture, the switch drops the packet, while in response to a miss, and in response to a multi-switch architecture, the switch may compute a repository switch for the solicited multicast destination, and unicasts the packet to the computed repository switch.

    Abstract translation: 在一个实施例中,计算机网络中的交换机拦截到目的地目的地的分组,该分组具有目标的请求节点多播地址作为分组的目的地媒体访问控制(MAC)地址。 因此,交换机可以确定被请求的节点多播地址是否是交换机的交换机硬件表中的命中或未命中,并且响应于命中,用目的地目标的已知值重新写入目的地MAC地址 该表,并将数据包单播到目标目标。 在一个或多个附加实施例中,响应于未命中,并且响应于单个交换机架构,交换机在响应于未命中的同时丢弃分组,并且响应于多交换机体系结构,交换机可以计算 用于被请求的组播目的地的存储库交换机,并将该分组单播到计算的存储库交换机。

Patent Agency Ranking