专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08179801B2 Routing-based proximity for communication networks 有权
标题翻译：通信网络基于路由的接近
公开(公告)号：US08179801B2
公开(公告)日：2012-05-15
申请号：US12480941
申请日：2009-06-09
申请人： Stefano Previdi , Jan Medved , Jining Tian , Steven Luong
发明人： Stefano Previdi , Jan Medved , Jining Tian , Steven Luong
IPC分类号： H04L12/56
CPC分类号： H04L45/04 , H04L45/126
摘要： A node in an overlay network requests a ranked list of other nodes in multiple areas of 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.
摘要翻译：覆盖网络中的节点请求覆盖网络的多个区域中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

2. 发明申请

US20100202448A1 ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS 有权
标题翻译：基于路由的通信网络接近
公开(公告)号：US20100202448A1
公开(公告)日：2010-08-12
申请号：US12368436
申请日：2009-02-10
申请人： Stefano Previdi , Jining Tian , Steven Luong , Bruce Davie , Jan Medved
发明人： Stefano Previdi , Jining Tian , Steven Luong , Bruce Davie , Jan Medved
IPC分类号： H04L12/56
CPC分类号： H04W4/02 , H04L45/02 , H04L45/306 , H04L67/1072 , H04L67/18 , H04L67/28
摘要： 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.
摘要翻译：覆盖网络中的节点请求覆盖网络中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

3. 发明授权

US08014318B2 Routing-based proximity for communication networks to routing-based proximity for overlay networks 有权
标题翻译：用于通信网络的基于路由的接近度，用于覆盖网络的基于路由的邻近度
公开(公告)号：US08014318B2
公开(公告)日：2011-09-06
申请号：US12368436
申请日：2009-02-10
申请人： Stefano Previdi , Jining Tian , Steven Luong , Bruce Davie , Jan Medved
发明人： Stefano Previdi , Jining Tian , Steven Luong , Bruce Davie , Jan Medved
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04W4/02 , H04L45/02 , H04L45/306 , H04L67/1072 , H04L67/18 , H04L67/28
摘要： 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.
摘要翻译：覆盖网络中的节点请求覆盖网络中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

4. 发明申请

US20100309789A1 ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS 有权
标题翻译：基于路由的通信网络接近
公开(公告)号：US20100309789A1
公开(公告)日：2010-12-09
申请号：US12480941
申请日：2009-06-09
申请人： Stefano Previdi , Jan Medved , Jining Tian , Steven Luong
发明人： Stefano Previdi , Jan Medved , Jining Tian , Steven Luong
IPC分类号： H04L12/56
CPC分类号： H04L45/04 , H04L45/126
摘要： A node in an overlay network requests a ranked list of other nodes in multiple areas of 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.
摘要翻译：覆盖网络中的节点请求覆盖网络的多个区域中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

5. 发明申请

US20060245429A1 Method and system to restart IS-IS when LSP wraps 有权
标题翻译：当LSP包裹时重新启动IS-IS的方法和系统
公开(公告)号：US20060245429A1
公开(公告)日：2006-11-02
申请号：US11116474
申请日：2005-04-28
申请人： Steven Luong , Rena Yang , Heidi Ou
发明人： Steven Luong , Rena Yang , Heidi Ou
IPC分类号： H04L12/56
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以及序列号小于或等于序列中的最大序列号的步骤。用于通过网络发送分组以传送网络拓扑的系统包括用于执行上述方法步骤的装置。

6. 发明申请

US20060245372A1 Method and system for transmitting LSP fragments 有权
标题翻译：发送LSP片段的方法和系统
公开(公告)号：US20060245372A1
公开(公告)日：2006-11-02
申请号：US11116493
申请日：2005-04-28
申请人： Heidi Ou , Steven Luong , Rena Yang
发明人： Heidi Ou , Steven Luong , Rena Yang
IPC分类号： H04L12/56 , 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用于处理最短路径优先算法，以准确地识别可用于在网络中建立通信的最短路径。

7. 发明申请

US20060133298A1 Selectively sending link state messages in a network link state protocol based on interest of network nodes 有权
标题翻译：基于网络节点的兴趣在网络链路状态协议中选择性地发送链路状态消息
公开(公告)号：US20060133298A1
公开(公告)日：2006-06-22
申请号：US11023292
申请日：2004-12-22
申请人： Sandy Ng , Gargi Nalawade , Steven Luong
发明人： Sandy Ng , Gargi Nalawade , Steven Luong
IPC分类号： H04L12/28 , H04L12/56
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）仅被发送到对它们表示兴趣的网络节点，而不是总是淹没它们。

8. 发明申请

US20060072461A1 Method and apparatus for flooding link state packets to achieve faster convergence 有权
标题翻译：用于洪泛链路状态分组以实现更快收敛的方法和装置
公开(公告)号：US20060072461A1
公开(公告)日：2006-04-06
申请号：US10959707
申请日：2004-10-05
申请人： Steven Luong , Heidi Ou , Gerald Redwine , James Ng , Kevin Eckhardt , Scott Sturgess , Steven Moore
发明人： Steven Luong , Heidi Ou , Gerald Redwine , James Ng , Kevin Eckhardt , Scott 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, 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发送节点的路径相关的相对成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式