公开(公告)号：EP3410778A1

公开(公告)日：2018-12-05

申请号：EP18174978.9

申请日：2018-05-30

Applicant: Robotonchip Oy

Inventor： RAHKALA, Jari ,  LAMMINAHO, Marko

IPC: H04W40/22 ,  H04W40/24 ,  H04L12/733 ,  H04L12/721

CPC classification number: H04L45/18 ,  H04L45/20 ,  H04L45/32 ,  H04L45/74 ,  H04L49/9031 ,  H04W40/22 ,  H04W40/24

Abstract: According to an example aspect of the present invention, there is provided passive routing in a mesh network. One or more media frames from source nodes to target nodes in the mesh network are received (102). Routing information from a received media frame is derived (104), said routing information comprising a source node identifier, a target node identifier, a last node identifier and a frame identifier. The derived routing information is stored (106) into a route ring buffer. A reverse route for the received media frame is determined (108). The received media frame is prevented (110) from being forwarded in the mesh network, when the route ring buffer comprises routing information corresponding to the reverse route.

公开(公告)号：EP3410639A1

公开(公告)日：2018-12-05

申请号：EP18185068.6

申请日：2017-07-18

Applicant: Cisco Technology, Inc.

Inventor： Nainar, Nagendra Kumar ,  Asati, Rajiv ,  Pignataro, Carlos M

IPC: H04L12/24

CPC classification number: H04L45/74 ,  H04L12/4641 ,  H04L41/0659 ,  H04L45/20

Abstract: The disclosure related to a method, comprising receiving, at a service function forwarder (SFF), a first packet comprising a first service function (SF) label. A label forwarding table is then referenced to identify a first link for the first SF label. The packet is then forwarded to a service function cluster (SFC) via the first link.

公开(公告)号：EP2491745B1

公开(公告)日：2018-07-04

申请号：EP09852407.7

申请日：2009-12-18

Applicant: Intel Corporation

Inventor： WONG, Wendy, C. ,  ZHAO, Meiyuan

IPC: H04W40/04 ,  H04W84/18 ,  H04W88/02 ,  H04L12/751 ,  H04L12/733

CPC classification number: H04L45/021 ,  H04L45/02 ,  H04L45/08 ,  H04L45/20

Abstract: In some embodiments, the invention involves information routing in networks, and, more specifically, to defining a framework using swarm intelligence and utilization of the defined framework for routing information in the network, especially for cloud computing applications. In an embodiment, information about available information/services is pushed to network nodes using information packets (ants). Nodes requiring services send query packets (ants) and a node may send a response to a query ant when information is available. Ants may be forwarded throughout the network based on popularity of nodes, freshness of information/requests, routing table information, and requests or interest by consumer nodes captured in information routing table. Other embodiments are described and claimed.

公开(公告)号：EP3314950A1

公开(公告)日：2018-05-02

申请号：EP16732628.9

申请日：2016-06-28

Applicant: Perpetuum Ltd.

Inventor： PEVY, Andrew Paul ,  ALLUM, Michael ,  VINCENT, David Robert

IPC: H04W40/22 ,  H04W40/24 ,  H04W84/18 ,  B61L13/00 ,  B61L15/00

CPC classification number: H04W40/22 ,  B61L15/0027 ,  B61L27/0005 ,  B61L2205/02 ,  H04L45/20 ,  H04W40/244 ,  H04W40/248 ,  H04W84/18 ,  H04W84/20 ,  Y02D70/39

Abstract: A technique comprising: detecting at a first radio node a first signal indicating the number of hops at which a second radio node that transmitted the first signal first detected a second, earlier signal; and deciding whether to transmit said first signal onwards from said first radio node based at least partly on (i) a direction indicator in said first signal, (ii) a comparison of the respective numbers of hops at which said first and second radio nodes first detected said earlier second signal, and (iii) the result of a search at said first radio node for onwards transmission of said first signal by another radio node in the direction indicated by said hop-count number direction indicator.

公开(公告)号：EP3043620B1

公开(公告)日：2018-03-28

申请号：EP13892771.0

申请日：2013-09-02

Applicant: Fujitsu Ltd.

Inventor： OTOMO, Toshiya ,  YAMASHITA, Koichiro ,  SUZUKI, Takahisa ,  YAMAUCHI, Hiromasa

IPC: H04W24/04 ,  H04L12/703 ,  H04L12/24 ,  H04W40/34 ,  H04W4/00

CPC classification number: H04L45/20 ,  H04L41/06 ,  H04L41/0677 ,  H04L45/28 ,  H04W4/70 ,  H04W24/04 ,  H04W40/22 ,  H04W40/34 ,  H04W84/18

Abstract: A communications apparatus (102) transmits a registration request for a reference hop count. Each node (101), when receiving the registration request, obtains and registers as a reference hop count, the hop count of the registration request. Each node (101), when transmitting to the communications apparatus (102), data measured by a sensor, adds the reference hop count to the sensor data. The communications apparatus (102) receives the sensor data transmitted from each node (101), compares the actual hop count of the received sensor data and the reference hop count added to the received sensor data, and determines whether failure has occurred at a given node (101) included in a node group (101s).

公开(公告)号：EP3054635B1

公开(公告)日：2018-03-14

申请号：EP16151709.9

申请日：2016-01-18

Applicant: Cisco Technology, Inc.

Inventor： GARCIA-LUNA-ACEVES, Jose J.

IPC: H04L12/723 ,  H04L12/741 ,  H04L12/773 ,  H04L12/733 ,  H04L29/08 ,  H04L12/725

CPC classification number: H04L45/74 ,  H04L45/20 ,  H04L45/306 ,  H04L45/60 ,  H04L67/2842 ,  H04L67/327

Abstract: One embodiment of the present invention provides a system for content exchange in an infonnation-centric network (ICN). During operation, a first node in the ICN receives an interest for a piece of content from a second node. The interest indicates a name of the piece of content and an incoming identifier assigned to the interest by the second node. The system identifies a matching entry in an identifier table stored on the first node that corresponds to the incoming identifier. The matching entry indicates a next-hop neighbor and an outgoing identifier. The system then updates the interest by replacing the incoming identifier with the outgoing identifier, and forwards the updated interest to the next-hop neighbor.

公开(公告)号：EP2314026B1

公开(公告)日：2018-02-14

申请号：EP09784659.6

申请日：2009-07-08

Applicant: Cray UK Limited

Inventor： BEECROFT, Jon ,  TURNER, Edward, James ,  FORD, Anthony, Michael ,  HEWSON, David, Charles

IPC: H04L12/733 ,  H04L12/931 ,  H04L12/935

CPC classification number: H04L49/351 ,  H04L45/20 ,  H04L49/3009

Abstract: The present invention provides a method of limiting the frequency of floods within a data network, the floods arising as a data frame is routed to an unknown destination, the method comprising the steps of: receiving on an ingress port a data frame intended for a destination station and containing a MAC address of that station; checking the destination MAC address with the contents of a MAC table; and thereby determining whether the data frame is to be routed, discarded or flooded to all ports except the ingress port; and respectively routing, discarding or flooding the data frame to all ports except the ingress port. The present invention further provides a method of populating a MAC table within an Ethernet network with entries relating a MAC station address to a port to which it is connected, the method comprising the steps of: receiving on an ingress port a data frame intended for a destination station and containing a MAC address of that station; checking the destination MAC address with the contents of a MAC table; and thereby determining whether the destination MAC address and ingress port are to be written to the MAC table and, if so writing the destination MAC address and ingress port to the MAC table; and flooding the data frame to all ports except the ingress port.

公开(公告)号：EP3100506B1

公开(公告)日：2017-11-29

申请号：EP15701160.2

申请日：2015-01-20

Applicant: Philips Lighting Holding B.V.

Inventor： DENTENEER, Theodorus Jacobus Johannes ,  VAN DER STOK, Petrus Desiderius Victor

IPC: H04W4/00 ,  H04L12/733 ,  H04L29/06 ,  H04L12/841 ,  H04L12/875 ,  H04L12/823 ,  H04L12/931 ,  H04L29/12 ,  H04W84/12

CPC classification number: H04L49/201 ,  H04L45/20 ,  H04L47/286 ,  H04L47/32 ,  H04L47/564 ,  H04L61/6022 ,  H04L65/608 ,  H04W4/80 ,  H04W84/12 ,  Y02D70/00 ,  Y02D70/142 ,  Y02D70/144

Abstract: This invention generally relates to Low-power and Lossy Wireless Networks. The proposed solution takes advantage of the fact that retry mechanism and back-off mechanism are already present in trickle-based algorithms. This way, it is possible to disable the equivalent features present at the MAC level which are the main causes of the large maxima of the fluctuating end-to-end delay. Also, it has been done away with the additional waiting time which comes from the packet waiting in the buffer in the MAC. Therefore, it has been provided a real-time layer with a limited size buffer able to allocate a deadline to a multicast packet and to select packets for transmission or rejection on the basis of the packet deadline. This way, it is kept a tighter hold on the rejection and waiting of the packets.

公开(公告)号：EP3238387A1

公开(公告)日：2017-11-01

申请号：EP14828473.0

申请日：2014-12-23

Applicant: Telefonaktiebolaget LM Ericsson (publ)

Inventor： LAZZERI, Francesco ,  NIJHOF, Jeroen ,  BRUNO, Gianmarco

IPC: H04L12/721

CPC classification number: H04L45/124 ,  H04L45/123 ,  H04L45/20

Abstract: A method of path computation in a segment routing network, the network comprising a set of nodes. The method comprises receiving a request for computation of a path between end nodes in the network, the request including a constraint. The method further comprises determining a segment identifier-optimised path defined by a stack of one or more segment identifiers, wherein the segment identifier-optimised path meets the constraint. The determining of the segment identifier-optimised path comprises analyzing a topology of the network comprising: at least a sub-set of the nodes, links between adjacent nodes indicative of possible paths between the nodes, and virtual links between pairs of nodes indicative of possible paths between the pairs of nodes. The method further comprises outputting at least one segment identifier which defines the determined path.

Abstract translation: 一种在分段路由网络中进行路径计算的方法，该网络包括一组节点。 该方法包括接收（101）用于计算网络中的端节点之间的路径的请求，该请求包括约束。 该方法还包括确定（105,105A）由一个或多个分段标识符的堆栈限定的分段标识符优化的路径，其中分段标识符优化的路径满足约束。 分段标识符优化路径的确定包括分析（106,106A）网络的拓扑结构，该网络拓扑结构包括：至少一个节点子集，指示节点之间可能路径的相邻节点之间的链路以及节点之间的虚拟链路 指示节点对之间的可能路径的节点。 该方法还包括输出（112）定义所确定的路径的至少一个分段标识符。

公开(公告)号：EP3109773A4

公开(公告)日：2017-08-02

申请号：EP15751616

申请日：2015-02-17

Applicant: UNIV KYOTO ,  KOBE DIGITAL LABO INC

Inventor： SHINKUMA RYOICHI ,  YAMAGUCHI KAZUHIRO

IPC: G06F17/30 ,  G06F19/00

CPC classification number: G06F17/30604 ,  G06F17/30587 ,  G06F17/30864 ,  G06F17/30958 ,  H04L45/02 ,  H04L45/20