-
1.发明专利
公开(公告)号：CA2866890C
公开(公告)日：2017-06-27
申请号：CA2866890
申请日：2013-03-22
Applicant: CISCO TECH INC
Inventor： HUI JONATHAN W , VASSEUR JEAN-PHILIPPE , HONG WEI
Abstract: In one embodiment, a transmitting device may determine a first data frame to a first destination and a second data frame to a second destination, and may assign subcarriers in a non-overlapping arrangement to the first and second data frames. Once assigned, the transmitting device may augment a transmission physical (PHY) header with a destination and tone map tuple for each of the first and second destinations, and transmits the transmission with the first and second data frames simultaneously on the assigned subcarriers.
-
公开(公告)号：CA2900075A1
公开(公告)日：2014-08-14
申请号：CA2900075
申请日：2014-02-04
Applicant: CISCO TECH INC
Inventor： VASSEUR JEAN-PHILIPPE , MERMOUD GREGORY , DASGUPTA SUKRIT
Abstract: In one embodiment, techniques are shown and described relating to learning machine based detection of abnormal network performance. In particular, in one embodiment, a border router receives a set of network properties x; and network performance metrics M; from a network management server (NMS), and then intercepts x; and M; transmitted from nodes in a computer network of the border router. As such, the border router may then build a regression function F based on x; and Mi, and can detect one or more anomalies in the intercepted x; and M; based on the regression function F. In another embodiment, the NMS, which instructed the border router, receives the detected anomalies from the border router.
-
公开(公告)号：CA2889986A1
公开(公告)日：2014-05-08
申请号：CA2889986
申请日：2013-10-30
Applicant: CISCO TECH INC
Inventor： VASSEUR JEAN-PHILIPPE , HUI JONATHAN W
IPC: H04L45/02
Abstract: In one embodiment, a device determines a set of sources and used destinations for traffic in a computer network, where nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG). The device may then also determine a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node, and instructs the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node.
-
公开(公告)号：CA2866876A1
公开(公告)日：2013-09-26
申请号：CA2866876
申请日：2013-03-22
Applicant: CISCO TECH INC
Inventor： HUI JONATHAN W , VASSEUR JEAN-PHILIPPE
Abstract: In one embodiment, a region anchor node may receive a unicasted route request (RREQ) for a target node. The region anchor node may then flood the RREQ to a region within which it resides. Subsequently, the region anchor node may receive one or more reactive routing route replies (RREPs) returned by the target node within the region. Based on the RREPs, the region anchor node may build one or more region routes from the region anchor node to the target node, and returns the one or more region routes to the originator node to cause the originator node to concatenate the one or more region routes and the unicast route of the original RREQ to form a path from the originator node to the target node.
-
公开(公告)号：CA2856157A1
公开(公告)日：2013-06-27
申请号：CA2856157
申请日：2012-12-20
Applicant: CISCO TECH INC
Inventor： VASSEUR JEAN-PHILIPPE
IPC: H04W40/24 , H04L45/02 , H04L45/122 , H04L45/42
Abstract: In one embodiment, a distributed intelligence agent (DIA) collects local state information from a plurality of minimalistic connected objects (MCOs) in a computer network, the local state information for each MCO comprising a corresponding neighbor list and a selected next-hop for the respective MCO, where one or more of the MCOs are configured to select their next-hop without any self-optimization. The DIA may then analyze a current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology, and (optionally) in light of required service level agreement (SLA), to determine whether to optimize the current routing topology. In response to determining that the current routing topology should be optimized, the DIA may transmit a unicast routing instruction to one or more individual MCOs to instruct those individual MCOs how to optimize the current routing topology, accordingly.
-
Patent Agency Ranking
公开(公告)号：AT554568T
公开(公告)日：2012-05-15
申请号：AT06736187
申请日：2006-02-27
Applicant: CISCO TECH INC
Inventor： VASSEUR JEAN-PHILIPPE , PREVIDI STEFANO
IPC: H04L12/56
Abstract: A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
-
公开(公告)号：CA2569710C
公开(公告)日：2011-02-22
申请号：CA2569710
申请日：2005-05-26
Applicant: CISCO TECH INC
Inventor： VASSEUR JEAN-PHILIPPE , PREVIDI STEFANO , FILSFILS CLARENCE
Abstract: A technique incorporates an efficient means for avoiding micro-loops on a backup path associated with a failed protected link. An intermediate node delays updating a forwarding database (FDB) contained in the intermediate node based on the intermediate node's distance from the failed link (Figure 8). Specifically, intermediate nodes near failed protected link delay updating their FDBs for a longer period of time than nodes farther away from the failed link (880). By updating FDBs in this manner, micro-loops may be avoided on the failed link's backup path as nodes on the backup path that are close to the failed link do not update their FDBs ahead of nodes farther away on the backup path.
-
公开(公告)号：AT468686T
公开(公告)日：2010-06-15
申请号：AT06738161
申请日：2006-03-14
Applicant: CISCO TECH INC
Inventor： PREVIDI STEFANO , VASSEUR JEAN-PHILIPPE
IPC: H04L12/56
Abstract: A technique dynamically triggers an exchange of reachability information between a tail-end (remote) domain target node (e.g., a tail-end node) of a traffic engineering (TE) label switched path (LSP) and a local domain head-end node of the TE-LSP in a computer network. The inter-domain information retrieval technique is illustratively based on triggering a Border Gateway Protocol (BGP) session whereby at least a portion of the reachability, i.e., routing, information of the tail-end node is transmitted to the head-end node of the TE-LSP in accordance with BGP. Specifically, once a TE-LSP is established between the head-end node and the tail-end node, the head-end node triggers the tail-end node, e.g., through extensions to a request/response signaling exchange, to establish the BGP session. Establishment of the BGP session enables transmission of the routing information from the tail-end node to the head-end node. The head-end node uses the routing information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.
-
公开(公告)号：CA2845377C
公开(公告)日：2016-10-11
申请号：CA2845377
申请日：2012-09-12
Applicant: CISCO TECH INC
Inventor： VASSEUR JEAN-PHILIPPE , HUI JONATHAN W
Abstract: In one embodiment, a network device determines a path from itself to a source device in a computer network, where the source device utilizes the path in reverse to reach the network device. Based on determining a reliability of the path in reverse, the network device may dynamically adjust one or more keepalive parameters for keepalive messages sent on the path. Accordingly, the network device may then send keepalive messages on the path based on the dynamically adjusted keepalive parameters.
-
10.发明专利
公开(公告)号：CA2856450C
公开(公告)日：2015-04-21
申请号：CA2856450
申请日：2012-09-27
Applicant: CISCO TECH INC , VASSEUR JEAN-PHILIPPE , HUI JONATHAN W
Inventor： VASSEUR JEAN-PHILIPPE , HUI JONATHAN W
IPC: H04W28/02 , H04L47/265
Abstract: In one embodiment, a device in a shared-media communication network determines a priority of a packet to be queued at the device, and based on the priority determines a length of time the packet is allowed to be queued before being successfully transmitted. After attempting to successfully transmit the queued packet within the shared-media communication network, in response to reaching a threshold amount of the length of time without having successfully transmitted the queued packet, the device may transmit a "shaping" request to one or more reachable neighbors in the shared-media communication network. Specifically, the shaping request is for a temporary reduction in bandwidth utilization by the reachable neighbors for traffic having a comparatively lesser priority than the priority of the packet.
-
-
-
-
-
-
-
-
-
Search Results
106
records
(took 0.025 seconds)
