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

1. 发明授权

US08437267B2 System and method for recovery of packets in overlay networks 有权
标题翻译：覆盖网络中数据包恢复的系统和方法
公开(公告)号：US08437267B2
公开(公告)日：2013-05-07
申请号：US12644796
申请日：2009-12-22
申请人： Yair Amir , Jonathan Stanton , John William Lane , John Lane Schultz
发明人： Yair Amir , Jonathan Stanton , John William Lane , John Lane Schultz
IPC分类号： G08C15/00 , G06C25/02
CPC分类号： H04L49/557 , H04L45/04 , H04L45/64 , H04L67/104
摘要： The present invention relates to a packet recovery method for packets communicated between sender and receiver nodes of an overlay network that runs over an underlying IP network. The present invention executes a packet recovery process at a receiver node upon satisfaction of a packet recovery condition that is associated with meeting a deadline driven criteria for a transmitted packet. The packet recovery process associates N number of scheduled times with N requests for retransmission of the transmitted packet. At least one of the N scheduled times includes a receiver waiting time. At each N scheduled time, a request for retransmission of the transmitted packet is transmitted to a source node. A packet retransmission process at the sender node is executed upon the first receipt of a request for retransmission of the transmitted packet. In one embodiment, the packet retransmission process retransmits the transmitted packet to the receiver node at M number of scheduled times, where the N and M are non-zero positive integers and at least one of the N or M number of scheduled times is greater than one.
摘要翻译：本发明涉及一种在覆盖网络的发送方和接收方节点之间通过下行IP网络运行的数据包的数据包恢复方法。本发明在满足与满足发送分组的最后期限驱动标准相关联的分组恢复条件的情况下，在接收机节点处执行分组恢复处理。分组恢复过程将N个调度时间与N个请求重传发送的分组相关联。 N个预定时间中的至少一个包括接收机等待时间。在每个N个调度时间，将发送的分组的重传请求发送到源节点。在首次接收到所发送的分组的重传请求时，执行发送方节点处的分组重传过程。在一个实施例中，分组重传过程以M个调度时间将发送的分组重传到接收机节点，其中N和M是非零正整数，并且N或M个预定时间中的至少一个大于一。

2. 发明申请

US20100165830A1 SYSTEM AND METHOD FOR RECOVERY OF PACKETS IN OVERLAY NETWORKS 有权
标题翻译：用于在覆盖网络中恢复分组的系统和方法
公开(公告)号：US20100165830A1
公开(公告)日：2010-07-01
申请号：US12644796
申请日：2009-12-22
申请人： Yair Amir , Jonathan Stanton , John William Lane , John Lane Schultz
发明人： Yair Amir , Jonathan Stanton , John William Lane , John Lane Schultz
IPC分类号： H04J1/16 , H04L12/56
CPC分类号： H04L49/557 , H04L45/04 , H04L45/64 , H04L67/104
摘要： The present invention relates to a packet recovery method for packets communicated between sender and receiver nodes of an overlay network that runs over an underlying IP network. The present invention executes a packet recovery process at a receiver node upon satisfaction of a packet recovery condition that is associated with meeting a deadline driven criteria for a transmitted packet. The packet recovery process associates N number of scheduled times with N requests for retransmission of the transmitted packet. At least one of the N scheduled times includes a receiver waiting time. At each N scheduled time, a request for retransmission of the transmitted packet is transmitted to a source node. A packet retransmission process at the sender node is executed upon the first receipt of a request for retransmission of the transmitted packet. In one embodiment, the packet retransmission process retransmits the transmitted packet to the receiver node at M number of scheduled times, where the N and M are non-zero positive integers and at least one of the N or M number of scheduled times is greater than one. In another embodiment, the packet retransmission process uses an erasure coding function, with integer parameter k greater than 1 and less than M, to generate M encoded blocks such that any k out of M encoded blocks are sufficient to recreate the transmitted packet at the receiver node and transmits the M encoded blocks to the receiver node at M scheduled times, where the N and M are non-zero positive integers and M is greater than 2. The M scheduled times are relative to the first receipt of the request for retransmission of the transmitted packet and at least one of the M scheduled times includes a sender waiting time.
摘要翻译：本发明涉及一种在覆盖网络的发送方和接收方节点之间通过下行IP网络运行的数据包的数据包恢复方法。本发明在满足与满足发送分组的最后期限驱动标准相关联的分组恢复条件的情况下，在接收机节点处执行分组恢复处理。分组恢复过程将N个调度时间与N个请求重传发送的分组相关联。 N个预定时间中的至少一个包括接收机等待时间。在每个N个调度时间，将发送的分组的重传请求发送到源节点。在首次接收到所发送的分组的重传请求时，执行发送方节点处的分组重传过程。在一个实施例中，分组重传过程以M个调度时间将发送的分组重传到接收机节点，其中N和M是非零正整数，并且N或M个预定时间中的至少一个大于一。在另一个实施例中，分组重传过程使用具有大于1且小于M的整数参数k的擦除编码功能来生成M个编码块，使得M个编码块中的任何k个足以在接收器处重新发送所发送的分组节点，并以M个调度时间将M个编码块发送到接收机节点，其中N和M是非零正整数，M大于2.M个调度时间相对于第一次接收到重传请求发送的分组和M个调度时间中的至少一个包括发送者等待时间。

3. 发明授权

US08599851B2 System and method that routes flows via multicast flow transport for groups 有权
公开(公告)号：US08599851B2
公开(公告)日：2013-12-03
申请号：US12753459
申请日：2010-04-02
申请人： Yair Amir , Jonathan Stanton , Michal Miskin-Amir , John Lane Schultz
发明人： Yair Amir , Jonathan Stanton , Michal Miskin-Amir , John Lane Schultz
IPC分类号： H04L12/28
CPC分类号： H04L47/24 , H04L12/18 , H04L45/16 , H04L45/38 , H04L45/64 , H04L45/745
摘要： A routing system and method for flows within a network provides multicast flow transport for one or more groups. Transit routers comprising processing units that run overlay processes route one or more flows based on overlay group identifiers. Access nodes issue requests for overlay groups in order to receive flows from the transit routers. The overlay processes utilize a mapping service that maps overlay group identifiers to native multicast group identifiers. A control channel between the access nodes and transit routers is used for communicating access nodes requests, overlay group identifiers, and native multicast group identifiers.

4. 发明授权

US07299219B2 High refresh-rate retrieval of freshly published content using distributed crawling 有权
标题翻译：使用分布式爬行技术高速刷新新鲜出版的内容
公开(公告)号：US07299219B2
公开(公告)日：2007-11-20
申请号：US10257255
申请日：2001-05-08
申请人： Jacob William Green , John Lane Schultz , Yair Amir , Michael Truman Goodrich
发明人： Jacob William Green , John Lane Schultz , Yair Amir , Michael Truman Goodrich
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F2216/03 , Y10S707/99931 , Y10S707/99932
摘要： A system for maximal gathering of fresh information added to a network such as the as the Internet and for processing the gathered fresh information. A link server (2) sends a batch of links to check (3) to a crawler (1B). Crawler (1B) them executes its crawling assignment by filtering the encountered content and extracting only that which is new or changed (4). Crawler (1B) then returns this content (4) to at least one data center and any interested web mining application (5). By using the crawlers (1A-E) to filter the data and only return or notify regarding, the fresh content, less bandwidth is needed to get the information to the web mining application (5).
摘要翻译：用于最大限度地收集添加到诸如因特网的网络并用于处理所收集的新鲜信息的新信息的系统。链接服务器（2）发送一批链接以检查（3）到爬行器（1B）。爬虫（1 B）他们通过过滤遇到的内容并提取只是新的或改变的（4）来执行抓取分配。履历（1 B）然后将此内容（4）返回至少一个数据中心和任何感兴趣的网络挖掘应用程序（5）。通过使用爬虫（1 A-E）过滤数据，仅返回或通知，新鲜内容需要较少的带宽才能将信息提供给Web挖掘应用程序（5）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式