The Theory of Matrices. By F R. Gantmacher. Two volumes, pp. 374 and 276. 1959. (Translated from the Russian by K. A. Hirsch; Chelsea Publishing Company, New York)

/pdf/introduction-to-the-modern-theory-of-dynamical-systems-1eced70mum.pdf

Introduction to the Modern Theory of Dynamical Systems

Described is transmitting contact data for displaying graphical representations of contacts for display to a user, the contacts being contacts of the user within a computer-implemented social networking service, generating a first social circle of the user, the first social circle comprising a first subset of contacts of the user within the social networking service and defining a first distribution for digital content, generating a second social circle of the user, the second social circle comprising a second subset of contacts of the user within the social networking service and defining a second distribution for digital content, and, in response to user input, providing the first social circle and the second social circle for selection by the user to define a distribution of digital content, the distribution comprising at least one of the first distribution and the second distribution.

Social circles in social networks

Content sharing interface for sharing content in social networks

This disclosure relates to network data communication. Some embodiments include initiating a network connection between an original source and an ultimate destination, transmitting a block of data from the original source to the ultimate destination on the network, requesting retransmission of lost blocks from the ultimate destination to the source and retransmitting the lost blocks from source to the ultimate destination. These embodiments further include measuring round-trip time of a retransmit request, the round-trip time measured from a time of transmission of a retransmit request from the ultimate destination to a time of reception at the ultimate destination after retransmission from the original source and setting the round-trip time as a minimum retransmission request time for the network connection, wherein the round-trip time includes latencies of the network connection and in data processes at the original source and at the ultimate destination.

Bulk data transfer

This paper presents a case study of the 10-Gigabit Ethernet (10GbE) adapter from Intel R . Specifically, with appropriate optimizations to the configurations of the 10GbE adapter and TCP, we demonstrate that the 10GbE adapter can perform well in local-area, storage-area, system-area, and wide-area networks. For local-area, storage-area, and system-area networks in support of networks of workstations, network-attached storage, and clusters, respectively, we can achieve over 7-Gb/s end-to-end throughput and 12-µs end-to-end latency between applications running on Linux-based PCs. For the wide-area network in support of grids, we broke the recently-set Internet2 Land Speed Record by 2.5 times by sustaining an end-to-end TCP/IP throughput of 2.38 Gb/s between Sunnyvale, California and Geneva, Switzerland (i.e., 10,037 kilometers) to move over a terabyte of data in less than an hour. Thus, the above results indicate that 10GbE may be a cost-effective solution across a multitude of computing environments.

/pdf/optimizing-10-gigabit-ethernet-for-networks-of-workstations-4eyu3tt943.pdf

Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study

In one embodiment, a method includes receiving a request for a target structured document. In a first response phase, the method includes accessing a data structure comprising an entry for the target structured document and one or more first resources associated with the target structured document, generating a first response portion including a first portion of the target structured document including one or more of the first resources or references for one or more of the first resources, and transmitting the first response portion to the client. The method further includes, in a second response phase, generating a second response portion that includes a second portion of the target structured document including one or more of: one or more second resources, or references for the one or more second resources, associated with the target structured document; and structured document language code, and transmitting the second response portion to the client.

Predictive resource identification and phased delivery of structured documents

The present invention is a delay based model and in fact uses queueing delay as a congestion measure, providing advantages over prior art loss based systems. One advantage is that queueing delay can be more accurately estimated than loss probability. This is because packet losses in networks with large bandwidth-delay product are rare events under TCP Reno and its variants , and because loss samples provide coarser information than queueing delay samples. Indeed, measurements of delay are noisy, just as those of loss probability. Thus, another advantage of the present invention is that each measurement of queueing delay provides multi-bit information while each measurement of packet loss (whether a packet is lost) provides only one bit of information for the filtering of noise. This makes it easier for an equation-based implementation to stabilize a network into a steady state with a target fairness and high utilization.

Method and apparatus for network congestion control

Method includes receiving a request for a web page, identifying one or more resource portions stored in a cache, each resource portion corresponding to a portion of a structured document for use to render the requested web page, determining whether the web page was requested within a predetermined time threshold since a previous request for the web page, if requested within the predetermined time threshold, instructing the requested web page to be rendered using the one or more resource portions stored in the cache and refreshing the one or more resource portions, if not requested within the predetermined time threshold, regenerating the one or more resource portions and instructing the requested web page to be rendered using the regenerated one or more resource portions and cache the regenerated one or more resource portions.

Caching pagelets of structured documents

When heterogeneous congestion control protocols that react to different pricing signals share the same network, the current theory based on utility maximization fails to predict the network behavior. The pricing signals can be different types of signals such as packet loss, queueing delay, etc, or different values of the same type of signal such as different ECN marking values based on the same actual link congestion level. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, suboptimal and unstable. In Tang et al. ("Equilibrium of heterogeneous congestion control: Existence and uniqueness," IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 824-837, Aug. 2007), existence and uniqueness of equilibrium of heterogeneous protocols are investigated. This paper extends the study with two objectives: analyzing the optimality and stability of such networks and designing control schemes to improve those properties. First, we demonstrate the intricate behavior of a heterogeneous network through simulations and present a framework to help understand its equilibrium properties. Second, we propose a simple source-based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns by only updating a linear parameter in the sources' algorithms on a slow timescale. It steers a network to the unique optimal equilibrium. The scheme can be deployed incrementally as the existing protocol needs no change and only new protocols need to adopt the slow timescale adaptation.

/pdf/equilibrium-of-heterogeneous-congestion-control-optimality-1pmqb9b1jm.pdf

Xiaoliang Wei

Papers

Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study

Predictive resource identification and phased delivery of structured documents

Method and apparatus for network congestion control

Caching pagelets of structured documents

Equilibrium of heterogeneous congestion control: optimality and stability