Srinivas N Vutukury

7203191, Apr 10, 2007

Oct 10, 2001

09/975556

Srinivas Vutukury - Sunnyvale CA, US

The Regents of the University of California - Oakland CA

H04L 12/28

370389

A method is described for routing network traffic based on distance information to provide multiple paths that need not have equal costs. The routing algorithm MPATH of the present method provide loop-free routing at every instant, without the need of internodal synchronization which spans more than a single hop. Paths are computed using shortest distances and predecessor information in the routing computation. The use of multiple-successors allows for load-balancing within the network. The algorithm is both distributed and scalable to large networks due to its use of only one-hop synchronization. A number of procedures are described by way of example, including path computation, main table updating, neighbor table updating, and a multipath (MPATH) algorithm.

7664876, Feb 16, 2010

Sep 10, 2002

10/241321

Srinivas Vutukury - San Jose CA, US

Adara Networks, Inc. - San Jose CA

G06F 15/173

709240, 709238

A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

8423666, Apr 16, 2013

Dec 22, 2009

12/645442

Srinivas Vutukury - San Jose CA, US

Adara Networks, Inc. - San Jose CA

G06F 15/173
G06F 15/16

709242, 709203, 709240

A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

8433787, Apr 30, 2013

Dec 22, 2009

12/645443

Srinivas Vutukury - San Jose CA, US

Adara Networks, Inc. - San Jose CA

G06F 15/173

709224

A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

20020097726, Jul 25, 2002

Oct 10, 2001

09/975735

Srinivas Vutukury - Sunnyvale CA, US

THE REGENTS OF THE UNIVERSITY OF CALIFORNIA

H04L012/56

370/395310, 370/401000

Methods are described for maintaining a small bounded aggregate state within network routers pertaining to selected architectural families. Small bounded reservations states are utilized wherein the method is fully scalable for use on large networks. The size of the aggregate state and the complexity of the associated refresh mechanism is determined by the parameters of the network, such as size, and classes, which is in contrast to states based on the number of end-user flows. The method can render deterministic bandwidth use within the network wherein real-time multimedia applications may be accorded strict delay and bandwidth guarantees. The invention provides a middle-ground between the stateful Intserv and the stateless SCORE architectures.

20020141346, Oct 3, 2002

Aug 31, 2001

09/945101

Srinivas Vutukury - Sunnyvale CA, US

THE REGENTS OF THE UNIVERSITY OF CALIFORNIA

H04J001/16

370/238000, 370/386000

A practical framework and “near-optimal” routing method which approximates minimum delay routing within a network. A framework for approximating Gallager's minimum-delay routing problem (MDRP) is described with methods for implementing the approximation on real networks subject to frequent topology changes and bursty traffic. The computation of minimum-delay paths is divided into two parts, (1) the establishment of multiple loop-free paths of unequal cost to a destination, (2) allocation of flows to minimize delays using short-term link-cost information. The method provides multi-path routing which overcomes the implementation limitations of optimal routing algorithms, such as oscillatory behavior, and the delays associated with shortest-path routing methods, while avoiding undetected loops.

20030107992, Jun 12, 2003

Oct 29, 2001

10/023448

Srinivas Vutukury - Sunnyvale CA, US

THE REGENTS OF THE UNIVERSITY OF CALIFORNIA

G01R031/08

370/230000, 370/238000

A routing methodology for constructing multiple loop-free routes within a network of nodes executing the methodology. The method is capable of generating shortest-distance routing within the network and is not subject to the counting-to-infinity problem to which conventional distance-vector routing protocols are subject. By way of example the method comprises computing link distances Dto generate routing graph SG. The nodes exchange distance and status information and upon receiving increasing distance information diffusing computations are performed. The information collected is used to maintain routing tables, from which shortest-path routes may be selected according to loop-free invariant (LFI) conditions.

20130311674, Nov 21, 2013

Apr 29, 2013

13/873200

Srinivas Vutukury - San Jose CA, US

H04L 12/721

709241

A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.