Ltn Global Communications, Inc.

Johns Hopkins University

Ltn Global Inc.

John Lane Schultz

Yair Amir

Jonathan Stanton

Michal Miskin-Amir

Jacob William Green

John William Lane

Michael Truman Goodrich

A packet recovery transmits N requests for retransmission of the transmitted packet to the sender node at N scheduled times upon determining satisfaction of a packet recovery condition associated with a transmitted packet from a sender node at a receiver node. At least one of the N scheduled times includes a receiver waiting time. M retransmissions of the transmitted packet from sender node at M scheduled times is performed upon the first receipt of a request for retransmission of the transmitted packet. At least one of the M scheduled times includes a sender waiting time. N and M are non-zero positive integers, and at least one of N or M is greater than one.

System and method for recovery of packets in overlay networks

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.

System and method that routes flows via multicast flow transport for groups

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.

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 () sends a batch of links to check () to a crawler (B). Crawler (B) them executes its crawling assignment by filtering the encountered content and extracting only that which is new or changed (). Crawler (B) then returns this content () to at least one data center and any interested web mining application (). By using the crawlers (A-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 ().

High refresh-rate retrieval of freshly published content using distributed crawling

A dynamic-content web crawler is disclosed. These New Crawlers (NCs) are located at points between the server and user, and monitor content from said points, for example by proxying the web traffic or sniffing the traffic as it goes by. Web page content is recursively parsed into subcomponents. Sub-components are fingerpinted with a cyclic redundancy check code or other loss-full compression in order to be able to detect recurrence of the sub-component in subsequent pages. Those sub-components which persist in the web traffic, as measured by the frequency NCs () are defined as having substantive content of interest to data-mining applications. Where a substantive content sub-component is added to or removed from a web page, then this change is significant and is sent to a duplication filter () so that if multiple NCs () detect a change in a web page only one announcement of the changed URL will be broadcast to data-mining applications (). The NC () identifies substantive content sub-components which repeatably are part of a page pointed to by a URL. Provision is also made for limiting monitoring to pages having a flag authorizing discovery of the page by a monitor.

Growing community of inventors

Lutherville, MD, United States of America

John Lane Schultz