Abstract: A method, apparatus and computer program product for providing network based flow control is presented. A linear combination of packets to transmit from a transmit queue is determined. The linear combination of packets is transmitted across a network using a sliding window protocol. An acknowledgement (ACK) is generated, wherein a packet is acknowledged when a receiving node receives the linear combination of packets and determines which packet of the linear combination of packets has been newly seen.

Abstract: A method, apparatus and computer program product for providing network based flow control is presented. A linear combination of packets to transmit from a transmit queue is determined. The linear combination of packets is transmitted across a network using a sliding window protocol. An acknowledgement (ACK) is generated, wherein a packet is acknowledged when a receiving node receives the linear combination of packets and determines which packet of the linear combination of packets has been newly seen.

Abstract: A method, apparatus and computer program product for providing network based flow control is presented. A linear combination of packets to transmit from a transmit queue is determined. The linear combination of packets is transmitted across a network using a sliding window protocol. An acknowledgement (ACK) is generated, wherein a packet is acknowledged when a receiving node receives the linear combination of packets and determines which packet of the linear combination of packets has been newly seen.

Abstract: A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.

Abstract: A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.

Abstract: A query for a database is represented as a vector including multiple elements. Each element is a control, and each control has a current setting. The database is queried with the query to produce a current synopsis. The current synopsis is added to a current summary. The current synopsis and the current controls and a current summary including the current synopsis are visualized on a graphical user interface. A new setting for the controls is indicated to produce a new synopsis that when added to the current summary makes a next summary most different than the current summary. The querying, visualizing, and indicating until a termination condition is reached to generate a most interesting summary of the database.

Abstract: Compressed Bloom filters that act as a message as well as a data structure provide smaller false positive rates, reduced bits broadcast and/or reduced computational overhead in distributed Web proxy servers and other distributed networks.

Abstract: A method solves a combinatorial optimization problem including multiple elements and values. An ordering function is applied to an instance of the combinatorial optimization problem to produce an ordering of elements. The ordering of the elements is modified repeatedly to produce a re-ordering of the elements. A placement function is applied to each re-ordering of the elements to obtain solutions of the combinatorial optimization problem, until a termination condition is reached, and a best solution is selected.

Abstract: A system generates a list of near-uniform samples of data sets (e.g., web pages) from among a plurality of host computers. The system performs a random walk so as to generate a set of visited addresses. For each address in the set, a reachability measure is computed. Then, samples are selected from the set, such that the probability of selecting a given address is inversely proportional to the reachability measure for the address. The selected samples form the list of near-uniform samples.

Abstract: Compressed Bloom filters that act as a message as well as a data structure provide smaller false positive rates, reduced bits broadcast and/or reduced computational overhead in distributed Web proxy servers and other distributed networks.

Abstract: Output symbols are generated using input symbols and basis elements. A plurality of basis elements are generated. Each basis element is generated from a predetermined function of associated input symbols associated with the basis element. For each output symbol, a set of associated basis elements associated with the output symbol is determined, and a set of direct associated input symbols directly associated with the output symbol is determined. For each output symbol, the output symbol is generated from a predetermined function of the associated basis elements and the associated input symbols.

Abstract: A method of operating a multiprocessor system having a predefined number of processing units for processing data, includes obtaining load information representing a loading of each of a number of randomly selected ones of the processing units. The number of randomly selected processing units is greater than 1 and substantially less than the predefined number of processing units. A least loaded of the randomly selected processing units is identified from the obtained load information. The data is directed to the identified least loaded randomly selected processing unit for processing.