JOHN ANTHONY HARPER
Pilots at Eichler Dr, Mountain View, CA

7885179, Feb 8, 2011

Mar 29, 2006

11/393166

Stewart Frederick Bryant - Green Park Reading, GB
Ian Michael Charles Shand - Cobham, GB
John Harper - Mountain View CA, US

Cisco Technology, Inc. - San Jose CA

G01R 31/08, G06F 11/00, H04L 12/28, H04L 12/56

370216, 370217, 370389, 370392

A method of constructing a repair path around a non-available component in a data communications network is described. The data communications network has, as components, nodes and links therebetween defining a network topology. The non-available component is a member of a shared risk group of components commonly renderable non-available. The method comprises the step, performed at a repairing node, of identifying as a repair target a neighbour component of the non-available component. The method further comprises the step of constructing a repair network topology omitting the shared risk group. The method further comprises the step of constructing a repair path to the repair target in the repair topology.

7506194, Mar 17, 2009

Mar 24, 2004

10/808040

Chandrashekhar Appanna - Cupertino CA, US
Ruchi Kapoor - Santa Clara CA, US
Barry Friedman - Sunnyvale CA, US
Himanshu Shah - Milpitas CA, US
Gargi Nalawade - Santa Clara CA, US
Shyam Suri - Fremont CA, US
John Harper - Mountain View CA, US

Cisco Technology, Inc. - San Jose CA

G06F 11/00

714 3, 714 23

Methods and apparatus for efficiently enabling routing states to be recovered after a failover or during a software upgrade in a system which supports graceful restart and stateful switchover are disclosed. According to one aspect of the present invention, a method for restarting a network device which has a plurality of routers and is in communication with a first peer being arranged to support graceful restart and a second peer includes performing a graceful restart with respect to the first peer. A peer transparent failover is performed with respect to the second peer. The graceful restart and the peer transparent failover are performed in response to a failure associated with the network device.

7499445, Mar 3, 2009

Mar 18, 2005

11/084387

Stefano B. Previdi - Rome, IT
David D. Ward - Somerset WI, US
Jonathan C. Barth - Collegeville PA, US
John A. Harper - Mountain View CA, US
Ian Michael Charles Shand - Surrey, GB

Cisco Technology, Inc. - San Jose CA

H04L 12/28

370351, 370401, 709218, 709238

A system and method routes data traffic over a unidirectional link of a computer network configured to implement a routing protocol, such as the ISIS routing protocol. To that end, the invention extends the ISIS routing protocol to allow dynamic discovery of neighboring routers (i. e. , neighbors) that are connected via the unidirectional link and subsequent establishment of an adjacency between the neighbors over the link. Adjacency establishment is illustratively effected through the use of novel type/length/value (TLV) encoded formats appended to ISIS Hello packets to convey information between the neighbors.

8509074, Aug 13, 2013

Mar 31, 2009

12/415717

Lawrence G. Roberts - Woodside CA, US
John A. Harper - Mountain View CA, US

Saisei Networks PTE Ltd - Singapore

H04L 12/26

370232, 709233

A system, method and computer program product are provided for controlling the rate of a network flow. In use, a rate of a network flow is monitored. In addition, it is determined whether the rate exceeds a threshold. Further, at least a portion of the network flow is conditionally discarded or marked, based on the determination.

2007028, Dec 13, 2007

Apr 23, 2007

11/739093

JOHN HARPER - Mountain View CA, US

H04L 12/56, H04L 12/18, H04L 12/28

370392000, 370401000

In a communications network comprising a plurality of routers the routers exchange router control information by transmitting and receiving control messages. A method is disclosed for transmitting, receiving, acknowledging, and verifying receipt of the message or messages between at least two routers. A transmitting router maintains a list of unacknowledged messages and periodically retransmits all unacknowledged or incompletely acknowledged messages. A receiving router insures that a received message is not a duplicate and is not out of sequence before transmitting an acknowledgement message. The disclosed method may be compatible with other router control message protocols, providing interoperability.

7707307, Apr 27, 2010

Jan 9, 2003

10/340371

Kevin George Miles - Reading, GB
Ian Michael Charles Shand - Cobham, GB
Stewart Frederick Bryant - Redhill, GB
Stefano Benedetto Previdi - Wavre, BE
John Anthony Harper - Mountain View CA, US
Clarence Filsfils - Brussels, BE

Cisco Technology, Inc. - San Jose CA

G06F 15/173, G01R 31/08

709239, 709242, 709238, 709241, 370238, 370229, 370232, 370235

A method is disclosed for constructing a backup route from a source node around an adjacent component. The source node derives a first set of nodes reachable from it without traversing the adjacent component and a second set of nodes from which a neighbor node of adjacent components is reachable without traversing the adjacent component. The source node then constructs a backup route via an intermediate node in the intersection of the first and second sets.