Steven Trong Luong

7039055, May 2, 2006

Aug 31, 2001

09/944861

Steven V. Luong - San Jose CA, US

Cisco Technology, Inc. - San Jose CA

H04L 12/28
H04J 1/16

370395, 370237, 370468, 709239

A system and method are disclosed for determining when to set up or tear down such a temporary transit path so that temporary transit paths are set up when they are needed and torn down when they are no longer needed. A temporary transit path is set up when the bit rate exceeds a first threshold. The temporary transit path is torn down when the bit rate is less than a second threshold. The temporary transit path is set up or torn down between a source station's router and a next hop router. The temporary transit path is set up within a subnetwork that includes the source station, the next hop router, and an intermediate router that is interconnected by a plurality of permanent transit paths to the source station and the next hop router. In one embodiment, a method for creating a temporary path for data packet transmission in the subnetwork is disclosed. Transmission of the data packets is initiated over the permanent transit paths that are coupled between the source station and the next hop router.

7453811, Nov 18, 2008

Apr 8, 2004

10/821354

Steven V. Luong - San Jose CA, US
Heidi H. Ou - San Jose CA, US
Rena W. Yang - Sunnyvale CA, US
Xiang Zheng - Santa Clara CA, US

Cisco Technology, Inc. - San Jose CA

G01R 31/08

370237, 370351

Disclosed are methods and apparatus for handling Link State Packets (LSPs) sent between processing nodes within a computer network. At a first node, an LSP sent by a second node is received. The received LSP specifies connectivity information regarding the second node. It is then determined whether one of two conditions is met: either the received LSP is an updated LSP even though it appears older and a corresponding stored LSP fails authentication, or the received LSP fails authentication and it appears newer. If it is determined that one of these conditions is met, as well as purging criteria, then updating procedures are then performed on the LSP information that is maintained by the first node, where the LSP information was originally obtained from a corresponding LSP sent by the second node.

7467226, Dec 16, 2008

Oct 5, 2004

10/959707

Steven V. Luong - San Jose CA, US
Heidi H. Ou - San Jose CA, US
Gerald Redwine - Raleigh NC, US
James L. Ng - Mebane NC, US
Kevin M. Eckhardt - Durham NC, US
Scott R. Sturgess - Grimbergen, BE
Steven Moore - Holly Springs NC, US

Cisco Technology, Inc. - San Jose CA

H04L 12/56

709238, 709227, 709239, 370238, 370254

Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node, and these other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.

7656856, Feb 2, 2010

Apr 28, 2005

11/116493

Heidi Ou - Saratoga CA, US
Steven V. Luong - San Jose CA, US
Rena Whei-Ming Yang - Sunnyvale CA, US

Cisco Technology, Inc. - San Jose CA

H04L 12/28

370351, 370216, 370238, 370254, 370256, 709238, 709242

Methods, systems, and apparatuses for transmitting link state packet (LSP) through a network are provided. The method includes dividing the LSP into LSP fragments having respective fragment numbers, transmitting the LSP fragments repetitively through the network, identifying at least one LSP fragment that is updated while the LSP fragments are being transmitted, and retransmitting the identified LSP fragments. The transmitted updated LSP is used for processing the Shortest Path First algorithm to identify accurately the shortest path that can be used to establish communication in the network.

7742431, Jun 22, 2010

Dec 22, 2004

11/023292

Sandy Ng - Milpitas CA, US
Gargi Nalawade - San Jose CA, US
Steven V. Luong - San Jose CA, US

Cisco Technology, Inc. - San Jose CA

H04L 12/28

370254, 370410

In a link state protocol such as an interior gateway protocol (IGP), link state advertisements or link state packets (LSA/LSPs) are sent only to network nodes that have expressed interest in them, rather than always flooding them.

7805537, Sep 28, 2010

Dec 11, 2008

12/332713

Steven V. Luong - San Jose CA, US
Heidi H. Ou - San Jose CA, US
Gerald Redwine - Raleigh NC, US
James L. Ng - Mebane NC, US
Kevin M. Eckhardt - Durham NC, US
Scott R. Sturgess - Grimbergen, BE
Steven Moore - Holly Springs NC, US

Cisco Technology, Inc. - San Jose CA

H04L 12/56

709238, 709227, 709228, 370238

Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node. These other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.

8014318, Sep 6, 2011

Feb 10, 2009

12/368436

Stefano Previdi - Rome, IT
Jining Tian - Cupertino CA, US
Steven Luong - San Jose CA, US
Bruce Davie - Cambridge MA, US
Jan Medved - Pleasanton CA, US

Cisco Technology, Inc. - San Jose CA

H04L 12/28
H04L 12/56

370254, 370389

A node in an overlay network requests a ranked list of other nodes in the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network.

8072907, Dec 6, 2011

Apr 28, 2005

11/116474

Steven V. Luong - San Jose CA, US
Rena Whei-Ming Yang - Sunnyvale CA, US
Heidi Ou - Saratoga CA, US

Cisco Technolgy, Inc. - San Jose CA

H04L 12/28
H04L 12/56
H04J 3/24

370255, 370394, 370474

A method, system, apparatus and machine-readable medium for transmitting a packet through a network to convey network topology is provided. The method includes the step of generating at least one link state protocol data unit (LSP) with a first identifier until reaching a maximum sequence number in a sequence assigned to a network device, represented by the first identifier. The method further includes the step of modifying the first identifier to produce a second identifier. The method also includes the step of generating at least one LSP with the second identifier, and with a sequence number that is less than or equal to the maximum sequence number in the sequence. The system for transmitting a packet through a network, to convey network topology, comprises the means for performing the above-mentioned method steps.