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

1. 发明授权

US09197508B2 Time-based scheduling for tunnels computed by a stateful path computation element 有权
标题翻译：由状态路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US09197508B2
公开(公告)日：2015-11-24
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26 , H04L12/911
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

2. 发明授权

US08855014B2 Distributed stateful path computation element overlay architecture 有权
标题翻译：分布状态路径计算元素覆盖架构
公开(公告)号：US08855014B2
公开(公告)日：2014-10-07
申请号：US13524071
申请日：2012-06-15
申请人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
发明人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
IPC分类号： H04L12/28 , H04L1/00
CPC分类号： H04L45/50 , H04L45/04
摘要： In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device.
摘要翻译：在一个实施例中，计算机网络中的特定设备维护本地拥有的隧道状态表，并且连接分布式散列表（DHT）环。此外，本地拥有的隧道状态表与DHT环的其他设备共享，以建立DHT拥有的隧道状态表。特定设备（和其他设备）根据DHT环确定针对流量工程数据库（TED）的特定部分的链路状态通告（LSA）的所有权。因此，当特定设备（或任何设备）使用本地TED计算隧道的路径时，特定设备可以请求允许沿着所计算的路径使用资源，这些资源在特定LSA的特定LSA中被发布，来自那些特定LSA的所有者由特定设备拥有。

3. 发明授权

US08817591B2 Inter-domain signaling to update remote path computation elements after a call set-up failure 有权
标题翻译：呼叫建立失败后更新远程路径计算元素的域间信令
公开(公告)号：US08817591B2
公开(公告)日：2014-08-26
申请号：US13524168
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L1/00 , H04L12/26
CPC分类号： H04L41/12 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50 , H04L47/724 , H04L47/785 , H04L47/825
摘要： In one embodiment, a router in a non-originating domain receives a signal to establish a tunnel, the signal having an identification (ID) of an originating path computation element (PCE) of an originating domain from where the signal to establish the tunnel originated. In response to determining that establishment of the tunnel fails, the router may signal the failure of the establishment to a local PCE of the non-originating domain, the signaling indicating the ID of the originating PCE to cause the local PCE to provide updated routing information of the non-originating domain to the originating PCE.
摘要翻译：在一个实施例中，非起始域中的路由器接收建立隧道的信号，该信号具有始发域的始发路径计算元件（PCE）的标识（ID），其中建立隧道的信号源自。响应于确定隧道的建立失败，路由器可以将建立的失败信号发送到非始发域的本地PCE，该信令指示发起PCE的ID，以使本地PCE提供更新的路由信息的非始发域到原始PCE。

4. 发明申请

US20130336116A1 CONGESTION-BASED NOTIFICATION DURING FAST REROUTE OPERATIONS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS 有权
标题翻译：紧急路线计算元件环境中快速REROUTE操作下的基于约束的通知
公开(公告)号：US20130336116A1
公开(公告)日：2013-12-19
申请号：US13524135
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
IPC分类号： H04L12/56
CPC分类号： H04L45/125 , H04L45/22 , H04L45/28 , H04L47/11 , H04L47/825
摘要： In one embodiment, once activation of use of a backup tunnel is detected for a primary tunnel, then a level of congestion of the path of the backup tunnel may be determined. In response to the level being greater than a threshold, a head-end node of the primary tunnel is triggered to reroute the primary tunnel (e.g., requesting to a path computation element). Conversely, in response to the level not being greater than the threshold, the backup tunnel is allowed to remain activated.
摘要翻译：在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。相反，响应级别不大于阈值，允许备份隧道保持激活。

5. 发明授权

US08144628B2 Acknowledgement-based rerouting of multicast traffic 有权
标题翻译：基于确认的组播流量重新路由
公开(公告)号：US08144628B2
公开(公告)日：2012-03-27
申请号：US11333843
申请日：2006-01-18
申请人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands , Arjen Boers
发明人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands , Arjen Boers
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/00 , H04L12/185 , H04L12/1877 , H04L45/16
摘要： Various techniques for exchanging control messages in order to gracefully reroute multicast traffic are disclosed. For example, one method involves sending a join message for a multicast group towards a root of a new multicast tree and forwarding multicast traffic, addressed to the multicast group, on a current multicast tree until an acknowledgment corresponding to the join message is received. The new multicast tree can be identified in response to detection of a topology change within the network. Until the acknowledgment is received, multicast traffic that is received via the new multicast tree can be dropped.
摘要翻译：公开了用于交换控制消息以便正确地重新路由组播业务的各种技术。例如，一种方法包括向新的多播树的根发送一个组播组的加入消息，并在当前的多播树上转发寻址到组播组的组播流，直到接收到与加入消息对应的确认。可以响应于网络内的拓扑变化的检测来识别新的多播树。在接收到确认之前，可以删除通过新的多播树接收的组播流量。

6. 发明授权

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.
摘要翻译：覆盖网络中的节点请求覆盖网络中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

7. 发明申请

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.
摘要翻译：覆盖网络中的节点请求覆盖网络的多个区域中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

8. 发明授权

US07573888B2 Multicast routing over unidirectional links 有权
标题翻译：通过单向链路进行组播路由
公开(公告)号：US07573888B2
公开(公告)日：2009-08-11
申请号：US11118533
申请日：2005-04-29
申请人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands
发明人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands
IPC分类号： H04L12/28
CPC分类号： H04L12/1836 , H04L12/5692 , H04L45/00 , H04L45/16
摘要： Various systems and methods are disclosed for performing multicast routing over unidirectional links. For example, one method involves maintaining a multicast adjacency state, which is associated with an interface that is coupled to receive messages from a network device via a unidirectional link. The multicast adjacency state identifies a network address of the network device. The method also involves sending a multicast protocol control message to the network device via a bidirectional path. The destination address of the network multicast protocol control message is the network address in the multicast adjacency state.
摘要翻译：公开了用于通过单向链路执行组播路由的各种系统和方法。例如，一种方法涉及维护多播邻接状态，该状态与被耦合以经由单向链路从网络设备接收消息的接口相关联。组播邻接状态标识网络设备的网络地址。该方法还涉及通过双向路径向网络设备发送组播协议控制消息。网络组播协议控制消息的目的地址是组播邻接状态的网络地址。

9. 发明申请

US20070133530A1 Acknowledgement-based rerouting of multicast traffic 有权
标题翻译：基于确认的组播流量重新路由
公开(公告)号：US20070133530A1
公开(公告)日：2007-06-14
申请号：US11333843
申请日：2006-01-18
申请人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands , Arjen Boers
发明人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands , Arjen Boers
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L12/185 , H04L12/1877 , H04L45/16
摘要： Various techniques for exchanging control messages in order to gracefully reroute multicast traffic are disclosed. For example, one method involves sending a join message for a multicast group towards a root of a new multicast tree and forwarding multicast traffic, addressed to the multicast group, on a current multicast tree until an acknowledgment corresponding to the join message is received. The new multicast tree can be identified in response to detection of a topology change within the network. Until the acknowledgment is received, multicast traffic that,is received via the new multicast tree can be dropped.
摘要翻译：公开了用于交换控制消息以便正确地重新路由组播业务的各种技术。例如，一种方法包括向新的多播树的根发送一个组播组的加入消息，并在当前的多播树上转发寻址到组播组的组播流，直到接收到与加入消息对应的确认。可以响应于网络内的拓扑变化的检测来识别新的多播树。直到接收到确认，可以删除通过新的多播树接收到的多播流量。

10. 发明申请

US20070047469A1 Efficient constrained shortest path first optimization technique 有权
标题翻译：有效约束最短路径优化技术
公开(公告)号：US20070047469A1
公开(公告)日：2007-03-01
申请号：US11210910
申请日：2005-08-24
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/028 , H04L45/28 , H04L45/302 , H04L45/50
摘要： A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.
摘要翻译：一种技术在计算机网络中执行流量工程（TE）标签交换路径（LSP）的有效约束最短路径优先（CSPF）优化。检测到计算机网络中可能产生更为优化的路径（例如，新的或恢复的网络元件或增加的路径资源）的事件触发了新的CSPF技术。一旦新颖的CSPF技术被触发，计算节点（例如，TE-LSP的头端节点或路径计算元件PCE）确定与事件相邻的节点集合，并进一步确定那些相邻节点中的哪一个在TE-LSP（“附属节点”）内。计算节点执行根据最接近的附加节点的CSPF计算，以确定新的计算路径开销是否小于当前路径开销（例如，通过可配置的量），如果是，则触发TE-LSP沿着新途径

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式