-
11.发明申请公开(公告)号：US20190014575A1
公开(公告)日：2019-01-10
申请号：US16107759
申请日：2018-08-21
Applicant: Cisco Technology, Inc.
CPC classification number: H04W72/0446 , H04W84/005 , H04W84/22
Abstract: In one embodiment, a method comprises determining a movable network device is moving along a repeatable sequence of access point devices in a deterministic network; and establishing a deterministic track along the repeatable sequence of access point devices, the deterministic track comprising insertion slots allocated for insertion of a data packet, by the movable network device, into the deterministic track via any one of the respective access point devices.
-
12.发明申请公开(公告)号：US20190014030A1
公开(公告)日：2019-01-10
申请号：US15642657
申请日：2017-07-06
Applicant: Cisco Technology, Inc.
IPC: H04L12/751 , H04W24/02
Abstract: In one embodiment, a method comprises: determining access point devices providing network coverage for a mobile network device within a prescribed coverage area of a deterministic network; establishing a deterministic reception tree comprising a root and switching devices associated with the access point devices, the deterministic reception tree enabling any one or more of the switching devices to forward toward the root a data packet, transmitted by the mobile network device at a prescribed transmission time, for deterministic reception by the root at a prescribed reception time regardless of any distance of any of the access point devices from the root; and causing the switching devices to implement the deterministic reception tree enabling the root to deterministically receive the data packet, received by any one or more of the access point devices, at the prescribed reception time.
-
13.发明申请公开(公告)号：US20180254971A1
公开(公告)日：2018-09-06
申请号：US15446705
申请日：2017-03-01
Applicant: Cisco Technology, Inc.
IPC: H04L12/751 , H04L12/947
CPC classification number: H04L45/02 , H04L45/42 , H04L49/251
Abstract: In one embodiment, a method comprises identifying, by a path computation element, essential parent devices from a nonstoring destination oriented directed acyclic graph (DODAG) topology as dominating set members belonging to a dominating set; receiving, by the path computation element, an advertisement message specifying a first dominating set member having reachability to a second dominating set member, the reachability distinct from the nonstoring DODAG topology; and generating, by the path computation element based on the advertisement message, an optimized path for reaching a destination network device in the nonstoring DODAG topology via a selected sequence of dominating set members, the optimized path providing cut-through optimization across the nonstoring DODAG topology.
-
公开(公告)号：US20170289846A1
公开(公告)日：2017-10-05
申请号：US15089711
申请日：2016-04-04
Applicant: Cisco Technology, Inc.
CPC classification number: H04W28/065 , H04B1/713 , H04L25/0218 , H04L29/08018 , H04L41/00 , H04L61/6059 , H04W40/00 , H04W52/0203 , Y02D70/144 , Y02D70/22
Abstract: In one embodiment, a method comprises: a first network device in a deterministic network identifying first and second slots for transmission of a data packet toward a destination device along a deterministic track of the deterministic network, the first slot reserved for the first network device receiving the data packet from a second network device and the second slot reserved for transmission by the first network device of the data packet toward the destination device along the deterministic track; the first network device detecting, in the first slot, an absence of receiving the data packet from the second network device; and the first network device selectively generating and transmitting in the second slot, in response to the absence of receiving the data packet, a management packet along the deterministic track.
-
公开(公告)号：US20210289453A1
公开(公告)日：2021-09-16
申请号：US17324304
申请日：2021-05-19
Applicant: Cisco Technology, Inc.
Inventor： PASCAL THUBERT , ROBERT EDGAR BARTON , JEROME HENRY , ERIC MICHEL LEVY-ABEGNOLI
Abstract: In one embodiment, a method comprises: determining, by a constrained network device in a low power and lossy network (LLN), a self-estimated density value of neighboring LLN devices based on wirelessly receiving an identified number of beacon message transmissions within an identified time interval from neighboring transmitting LLN devices in the LLN; setting, by the constrained network device, a first wireless transmit power value based on the self-estimated density value; and transmitting a beacon message at the first wireless transmit power value, the beacon message specifying the self-estimated density value, a corresponding trust metric for the self-estimated density value, and the first wireless transmit power value used by the constrained network device for transmitting the beacon message.
-
Patent Agency Ranking
公开(公告)号：US20210021520A1
公开(公告)日：2021-01-21
申请号：US16516836
申请日：2019-07-19
Applicant: Cisco Technology, Inc.
Inventor： PATRICK WETTERWALD , ERIC MICHEL LEVY-ABEGNOLI , PASCAL THUBERT
IPC: H04L12/801 , H04L12/863 , H04L12/947 , H04L12/823 , H04L12/26
Abstract: In one embodiment, a method comprises: receiving, by a switching device in a deterministic network, a first data packet associated with an identified flow of data packets, and queuing the first data packet for deterministic transmission at a deterministic transmit instance to a next-hop device in the deterministic network; detecting, by the switching device, reception of a newest data packet associated with the identified flow and before the deterministic transmission of the first data packet; and prioritizing for the identified flow, by the switching device, the newest data packet based on deterministically transmitting, at the deterministic transmit instance, the newest data packet instead of the first data packet.
-
17.发明申请公开(公告)号：US20200336406A1
公开(公告)日：2020-10-22
申请号：US16919793
申请日：2020-07-02
Applicant: Cisco Technology, Inc.
IPC: H04L12/751 , H04L12/717
Abstract: In one embodiment, a method comprises identifying, by a path computation element, essential parent devices from a nonstoring destination oriented directed acyclic graph (DODAG) topology as dominating set members belonging to a dominating set; receiving, by the path computation element, an advertisement message specifying a first dominating set member having reachability to a second dominating set member, the reachability distinct from the nonstoring DODAG topology; and generating, by the path computation element based on the advertisement message, an optimized path for reaching a destination network device in the nonstoring DODAG topology via a selected sequence of dominating set members, the optimized path providing cut-through optimization across the nonstoring DODAG topology.
-
18.发明申请公开(公告)号：US20200186349A1
公开(公告)日：2020-06-11
申请号：US16214318
申请日：2018-12-10
Applicant: Cisco Technology, Inc.
Inventor： PASCAL THUBERT , HUIMIN SHE , PATRICK WETTERWALD , AKRAM ISMAIL SHERIFF , ERIC MICHEL LEVY-ABEGNOLI
IPC: H04L9/32 , H04L29/12 , G06F16/901 , H04L9/30
Abstract: In one embodiment, a method comprises: receiving, by a parent network device providing at least at portion of a directed acyclic graph (DAG) according to a prescribed routing protocol in a low power and lossy network, a destination advertisement object (DAO) message, the DAO message specifying a target Internet Protocol (IP) address claimed by an advertising network device in the DAG and the DAO message further specifying a secure token associated with the target IP address; and selectively issuing a cryptographic challenge to the DAO message to validate whether the advertising network device generated the secure token.
-
公开(公告)号：US20200084135A1
公开(公告)日：2020-03-12
申请号：US16126859
申请日：2018-09-10
Applicant: Cisco Technology, Inc.
IPC: H04L12/751 , H04L12/707 , H04L12/761 , H04L12/703 , H04L12/721 , H04L12/933 , H04L12/46
Abstract: In one embodiment, a method comprises generating a switched link layer topology from a source device to a destination device, the switched link layer topology comprising a first sequence of switching devices, a second sequence of switching devices, and one or more bridging links between the first and second sequences of switching devices; generating first and second chains of resilient link layer segments for respective first and second multi-hop link layer connections based on generating a sequence of link layer loops overlying the switched link layer topology, and setting for each of the first and second multi-hop link layer connections a corresponding set of connection blocks in each link layer loop; and causing replication of a data packet across the first and second multi-hop link layer connections, enabling a failure in the switched link layer topology to be bypassed based on removing at least one of the connection blocks.
-
公开(公告)号：US20190028575A1
公开(公告)日：2019-01-24
申请号：US15657283
申请日：2017-07-24
Applicant: Cisco Technology, Inc.
IPC: H04L29/06 , H04L12/935 , H04L12/721
Abstract: In one embodiment, a method comprises: a first network device in a deterministic network identifying at least one of first and second deterministic transmit opportunities for transmission of a data packet toward a destination device along a deterministic path of the deterministic network, the first deterministic transmit opportunity reserved for the first network device deterministically receiving the data packet from a second network device and the second deterministic transmit opportunity reserved for deterministic transmission by the first network device of the data packet toward the destination device along the deterministic path; the first network device detecting an absence of receiving the data packet from the second network device according to the first deterministic transmit opportunity; and the first network device selectively generating and deterministically transmitting according to the second deterministic transmit opportunity, in response to the absence of receiving the data packet, a management packet along the deterministic path.
-
-
-
-
-
-
-
-
-
Search Results
48
records
(took 0.015 seconds)
