Karen Michele Cadora

US Patent:

7065197, Jun 20, 2006

Filed:

Oct 23, 2002

Appl. No.:

10/279185

Inventors:

Karen M. Cadora - Boulder CO, US

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

H04M 3/42

US Classification:

37920102, 379 8819, 379 9317

Abstract:

A method for managing communication requests includes receiving tag information from a user of a communication device, and associating the tag with a communication device. The tag information includes criteria for determining whether the tag applies to an incoming communication request and one or more actions to be taken in response to the communication request after determining that the tag applies. The method further includes receiving a request from a caller for a communication session with the communication device, determining whether criteria for the tag have been met by the communication request, and if the criteria for the tag have been met, taking the specified actions in response to the communication request.

US Patent:

20230034314, Feb 2, 2023

Filed:

Dec 10, 2021

Appl. No.:

17/547735

Inventors:

- San Jose CA, US
Thierry Couture - Mont-Royal, CA
Karen Michele Cadora - Boulder CO, US
Jiri Chaloupka - San Jose CA, US
Suresh Basavarajappa - San Jose CA, US

International Classification:

H04L 45/02
H04L 12/46
H04L 12/66
H04L 45/74

Abstract:

Techniques for a head-end node in one or more network autonomous systems to utilize a protocol to instantiate services on tail-end nodes. The head-end node can use a service request mechanism that is enabled by the protocol to request service instantiation on the tail-end node without a network operator having to manually configure the tail-end node, or even having access to the tail-end node. Additionally, the protocol may provide mechanisms to define handling attributes for traffic of the service (e.g., quality of service (QoS) attributes, Maximum Transmission Unit (MTU) settings, etc.), service acknowledgement mechanisms for the head-end node to determine that the service was instantiated on the tail-end node, and so forth. In this way, a head-end node can be used to instantiate a service on a tail-end node without a network operator having to have direct access to the tail-end node to manually configure the tail-end node.

US Patent:

20230009602, Jan 12, 2023

Filed:

Apr 22, 2022

Appl. No.:

17/727428

Inventors:

- San Jose CA, US
Pablo Camarillo Garvia - Madrid, ES
Ahmed Mohamed Ahmed Abdelsalam - L?Aquila, IT
Karen Michele Cadora - Boulder CO, US

International Classification:

H04L 43/12
H04L 45/02

Abstract:

Disclosed are systems, apparatuses, methods, and computer-readable media to measure performance of distinct paths of a network. A method includes determining a collection of hashes of a network based on a network probe event, each hash in the collection of hashes corresponding to a distinct path from a first edge device to a second edge device through the network; transmitting a collection of probes from the first edge device in the network, wherein each probe in the collection of probes is assigned a hash selected from the collection of hashes; receiving probes from the collection of probes at the second edge device; and determining a network performance of each distinct path through the network.

US Patent:

20140269331, Sep 18, 2014

Filed:

Mar 15, 2013

Appl. No.:

13/843536

Inventors:

CISCO TECHNOLOGY, INC. - , US
Karen Cadora - Boulder CO, US

Assignee:

CISCO TECHNOLOGY, INC. - San Jose CA

International Classification:

H04L 12/56

US Classification:

370238

Abstract:

System, method, and computer program product to route data communications based on non-routing criteria, by receiving, by a network element, a data packet, identifying, in a routing table of the network element, a first route for routing the data packet, computing, by an application executing on the network element, a routing score for the first route based on one or more non-routing criteria, computing, by the application, a routing score for a second route for routing the data packet based on the one or more non-routing criteria, and upon determining that the routing score for the second route is less than the routing score of the first route, updating the routing table to cause the network element to route the data packet according to the second route.