公开(公告)号：US09515916B2

公开(公告)日：2016-12-06

申请号：US12909595

申请日：2010-10-21

申请人： Zhunian Zhang ,  Steven V. Luong ,  Manish Bhardwaj ,  Stefano Previdi

发明人： Zhunian Zhang ,  Steven V. Luong ,  Manish Bhardwaj ,  Stefano Previdi

IPC分类号： G06F15/16 ,  H04L12/721 ,  H04L12/715 ,  H04L29/08 ,  H04L12/18 ,  H04L12/14 ,  G06F15/173

CPC分类号： H04L45/12 ,  G06F15/16 ,  G06F15/173 ,  H04L12/1489 ,  H04L12/18 ,  H04L12/1877 ,  H04L45/04 ,  H04L67/2814

摘要： In one embodiment, a first network device may receive a request for an identifier of at least one target to service a client. The first network device may obtain an identifier of each of two or more targets. The first network device may then determine whether to redirect the request. The first network device may redirect the request to a second network device according to a result of the determining step, where the first network device is in a first autonomous system and the second network device is in a second autonomous system.

摘要翻译： 在一个实施例中，第一网络设备可以接收对至少一个目标的标识符的请求以服务客户端。 第一网络设备可以获得两个或更多个目标中的每一个的标识符。 然后，第一网络设备可以确定是否重定向该请求。 第一网络设备可以根据确定步骤的结果将请求重定向到第二网络设备，其中第一网络设备在第一自治系统中，而第二网络设备处于第二自治系统中。

公开(公告)号：US07467226B2

公开(公告)日：2008-12-16

申请号：US10959707

申请日：2004-10-05

申请人： Steven V. Luong ,  Heidi H. Ou ,  Gerald Redwine ,  James L. Ng ,  Kevin M. Eckhardt ,  Scott R. Sturgess ,  Steven Moore

发明人： Steven V. Luong ,  Heidi H. Ou ,  Gerald Redwine ,  James L. Ng ,  Kevin M. Eckhardt ,  Scott R. Sturgess ,  Steven Moore

IPC分类号： H04L12/56

CPC分类号： H04L45/02 ,  H04L45/32

摘要： 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.

摘要翻译： 公开了用于将链路状态分组或分组数据单元（LSP）从第一节点扩展到另一个LSP接收节点的方法和装置，其中LSP以与从第一节点发出的各种路径的相对成本相关的顺序淹没 。 也就是说，第一个节点首先发送自己的LSP，因为第一个节点相对于自身没有成本。 然后，第一节点发送与先前已经将其LSP扩充到第一节点的多个其他LSP发送节点相关联的其他LSP，并且这些另外的LSP由第一节点以与其相关的顺序发送到另一个LSP接收节点 与从先到先发送其他LSP到第一节点的其他LSP发送节点的第一节点到每个其他LSP发送节点的路径相关的相对成本。

公开(公告)号：US07742431B2

公开(公告)日：2010-06-22

申请号：US11023292

申请日：2004-12-22

申请人： Sandy Ng ,  Gargi Nalawade ,  Steven V. Luong

发明人： Sandy Ng ,  Gargi Nalawade ,  Steven V. Luong

IPC分类号： H04L12/28

CPC分类号： H04L45/02

摘要： 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.

摘要翻译： 在诸如内部网关协议（IGP）的链路状态协议中，链路状态通告或链路状态分组（LSA / LSP）仅被发送到对它们表示兴趣的网络节点，而不是总是淹没它们。

公开(公告)号：US07453811B1

公开(公告)日：2008-11-18

申请号：US10821354

申请日：2004-04-08

申请人： Steven V. Luong ,  Heidi H. Ou ,  Rena W. Yang ,  Xiang Zheng

发明人： Steven V. Luong ,  Heidi H. Ou ,  Rena W. Yang ,  Xiang Zheng

IPC分类号： G01R31/08

CPC分类号： H04L63/08 ,  H04L45/02

摘要： 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.

摘要翻译： 公开了用于处理在计算机网络内的处理节点之间发送的链路状态分组（LSP）的方法和装置。 在第一节点处，接收由第二节点发送的LSP。 所接收的LSP指定关于第二节点的连接信息。 然后确定是否满足两个条件之一：接收到的LSP是更新的LSP，即使它看起来较旧，相应的存储的LSP认证失败，或者接收到的LSP失败认证，并且它看起来更新。 如果确定满足这些条件之一以及清除标准，则对由第一节点维护的LSP信息执行更新过程，其中最初从相应的LSP发送的LSP信息 第二个节点。

公开(公告)号：US09069761B2

公开(公告)日：2015-06-30

申请号：US13480647

申请日：2012-05-25

申请人： Steven V. Luong ,  Manish Bhardwaj

发明人： Steven V. Luong ,  Manish Bhardwaj

IPC分类号： G06F15/173 ,  G06F17/30 ,  H04L29/08 ,  H04L29/06

CPC分类号： G06F17/30 ,  G06F17/30628 ,  H04L67/10 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/327 ,  H04L69/24

摘要： In one embodiment, a node in a computer network joins a global ring associated with a distributed hash table (DHT), and maintains a DHT routing table and DHT database for the global ring. In addition, the node may determine a particular service class for which the node is configured, and may join a particular service-based sub-ring according to the particular service class, where all nodes of the particular service-based sub-ring are within the global ring. As such, a service-based DHT routing table and service-based DHT database may be maintained for the particular service-based sub-ring, such that DHT operations identified by the particular service class are routed to the particular service-based sub-ring (e.g., by a portal node).

摘要翻译： 在一个实施例中，计算机网络中的节点加入与分布式哈希表（DHT）相关联的全局环，并且维护用于全局环的DHT路由表和DHT数据库。 另外，节点可以确定节点被配置的特定服务类别，并且可以根据特定服务类加入特定的基于服务的子环，其中特定的基于服务的子环的所有节点都在其中 全球戒指 因此，可以为特定的基于服务的子环维护基于服务的DHT路由表和基于服务的DHT数据库，使得由特定服务类标识的DHT操作被路由到特定的基于服务的子环 （例如，由门户节点）。

公开(公告)号：US08072907B2

公开(公告)日：2011-12-06

申请号：US11116474

申请日：2005-04-28

申请人： Steven V. Luong ,  Rena Whei-Ming Yang ,  Heidi Ou

发明人： Steven V. Luong ,  Rena Whei-Ming Yang ,  Heidi Ou

IPC分类号： H04L12/28 ,  H04L12/56 ,  H04J3/24

CPC分类号： H04L45/12 ,  H04L45/02

摘要： 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.

摘要翻译： 提供了一种用于通过网络发送分组以传送网络拓扑的方法，系统，装置和机器可读介质。 该方法包括产生具有第一标识符的至少一个链路状态协议数据单元（LSP）的步骤，直到由分配给网络设备的序列达到由第一标识符表示的最大序列号。 该方法还包括修改第一标识符以产生第二标识符的步骤。 该方法还包括产生具有第二标识符的至少一个LSP以及序列号小于或等于序列中的最大序列号的步骤。 用于通过网络发送分组以传送网络拓扑的系统包括用于执行上述方法步骤的装置。

公开(公告)号：US07805537B2

公开(公告)日：2010-09-28

申请号：US12332713

申请日：2008-12-11

申请人： Steven V. Luong ,  Heidi H. Ou ,  Gerald Redwine ,  James L. Ng ,  Kevin M. Eckhardt ,  Scott R. Sturgess ,  Steven Moore

发明人： Steven V. Luong ,  Heidi H. Ou ,  Gerald Redwine ,  James L. Ng ,  Kevin M. Eckhardt ,  Scott R. Sturgess ,  Steven Moore

IPC分类号： H04L12/56

CPC分类号： H04L45/02 ,  H04L45/32

摘要： 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.

摘要翻译： 公开了用于将链路状态分组或分组数据单元（LSP）从第一节点扩展到另一个LSP接收节点的方法和装置，其中LSP以与从第一节点发出的各种路径的相对成本相关的顺序淹没 。 也就是说，第一个节点首先发送自己的LSP，因为第一个节点相对于自身没有成本。 第一节点然后发送与之前已经将其LSP扩充到第一节点的多个其他LSP发送节点相关联的其他LSP。 这些其他LSP由第一节点发送到另一个LSP接收节点，其顺序是与先前已经将另一个LSP发送到第一节点的从第一节点到其他LSP发送节点的路径相关联的相对成本相关的顺序 。

公开(公告)号：US07656856B2

公开(公告)日：2010-02-02

申请号：US11116493

申请日：2005-04-28

申请人： Heidi Ou ,  Steven V. Luong ,  Rena Whei-Ming Yang

发明人： Heidi Ou ,  Steven V. Luong ,  Rena Whei-Ming Yang

IPC分类号： H04L12/28

CPC分类号： H04L45/04 ,  H04L45/02 ,  H04L45/12 ,  H04L45/26

摘要： 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.

摘要翻译： 提供了通过网络传输链路状态分组（LSP）的方法，系统和装置。 该方法包括将LSP划分成具有相应片段号的LSP片段，通过网络重复发送LSP片段，识别在发送LSP片段时更新的至少一个LSP片段，以及重传所识别的LSP片段。 发送的更新的LSP用于处理最短路径优先算法，以准确地识别可用于在网络中建立通信的最短路径。

公开(公告)号：US20090092052A1

公开(公告)日：2009-04-09

申请号：US12332713

申请日：2008-12-11

申请人： Steven V. Luong ,  Heidi H. Ou ,  Gerald Redwine ,  James L. Ng ,  Kevin M. Eckhardt ,  Scott R. Sturgess ,  Steven Moore

发明人： Steven V. Luong ,  Heidi H. Ou ,  Gerald Redwine ,  James L. Ng ,  Kevin M. Eckhardt ,  Scott R. Sturgess ,  Steven Moore

IPC分类号： H04L12/26

CPC分类号： H04L45/02 ,  H04L45/32

摘要： 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.

摘要翻译： 公开了用于将链路状态分组或分组数据单元（LSP）从第一节点扩展到另一个LSP接收节点的方法和装置，其中LSP以与从第一节点发出的各种路径的相对成本相关的顺序淹没 。 也就是说，第一个节点首先发送自己的LSP，因为第一个节点相对于自身没有成本。 第一节点然后发送与之前已经将其LSP扩充到第一节点的多个其他LSP发送节点相关联的其他LSP。 这些其他LSP由第一节点发送到另一个LSP接收节点，其顺序是与先前已经将另一个LSP发送到第一节点的从第一节点到其他LSP发送节点的路径相关联的相对成本相关的顺序 。

公开(公告)号：US07039055B1

公开(公告)日：2006-05-02

申请号：US09944861

申请日：2001-08-31

申请人： Steven V. Luong

发明人： Steven V. Luong

IPC分类号： H04L12/28 ,  H04J1/16

CPC分类号： H04Q11/0478 ,  H04L45/10 ,  H04L45/123 ,  H04L45/22 ,  H04L2012/562 ,  H04L2012/5668

摘要： 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. A bit rate of the data packets from the source station to the next hop router is measured after initiating the transmission. Data packets transmission over the permanent transit paths is continued when the measured bit rate is below a first predetermined value. A temporary transit path between the source station and the next hop router is created when the measured bit rate is above the first predetermined value. The data packets are transmitted over the created temporary transit path when the measured bit rate is above the first predetermined value. In a preferred embodiment, the bit rate is measured again after creating the temporary transit path and transmitting the data packets over the created temporary transit path. The created temporary transit path is torn down when the bit rate is below the second predetermined value. Transmission of the data packets is sent over the permanent transit paths from the source station to the next hop routers once the temporary transit path is torn down.