Letter to V.V. Haynes, 04/02/1878

Two page letter from Daniel D. Whedon to V.V. Haynes. Dated March 2, 1878.

Sketch of the Life of William Blanchard Towne

Sketch of the life of William Blanchard Towne.

Discourses Commemorative of Professor Tayler Lewis and Professor Isaac W. Jackson

Discourses

Experiences of a backwoods preacher, or, Facts and incidents culled from thirty years ministerial life / by Joseph H. Hilts.

http://www.archive.org/details/experiencesofab00hiltuoft

India and India missions : including sketches of the gigantic system of hinduism, both in theory and practive : also notices of some of the principal agencies employed in conducting the process of Indian evangalization, etc. etc.

http://books.google.com/books?vid=OCLC05766993

Missions the chief end of the Christian Church; also, the qualifications, duties, and trials, of an Indian Missionary: being the substance of services held on the 7th March, in St. Andrew's Church, Edinburgh, at the ordination of the Rev. Thomas Smith.

http://books.google.com/books?vid=OCLC55772204

Greenland, and other poems / by James Montgomery.

http://www.archive.org/details/greenlandandothe00montuoft

Fine-Grained Layered Multicast

Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large time scales. In this paper, we quantify the costs and benefits of using non-cumulative layering and present a new, scalable multicast congestion control scheme which provides a fine-grained approximation to the behavior of TCP additive increase/multiplicative decrease (AIMD). In contrast to the conventional wisdom, we demonstrate that fine-grained rate adjustment can be achieved with only modest increases in the number of layers and aggregate bandwidth consumption, while using only a small constant number of control messages to perform either additive increase or multiplicative decrease.

The Cache Inference Problem and its Application to Content and Request Routing

In many networked applications, independent caching agents cooperate by servicing each other's miss streams, without revealing the operational details of the caching mechanisms they employ. Inference of such details could be instrumental for many other processes. For example, it could be used for optimized forwarding (or routing) of one's own miss stream (or content) to available proxy caches, or for making cache-aware resource management decisions. In this paper, we introduce the Cache Inference Problem (CIP) as that of inferring the characteristics of a caching agent, given the miss stream of that agent. While CIP is insolvable in its most general form, there are special cases of practical importance in which it is, including when the request stream follows an Independent Reference Model (IRM) with generalized power-law (GPL) demand distribution. To that end, we design two basic "litmus" tests that are able to detect LFU and LRU replacement policies, the effective size of the cache and of the object universe, and the skewness of the GPL demand for objects. Using extensive experiments under synthetic as well as real traces, we show that our methods infer such characteristics accurately and quite efficiently, and that they remain robust even when the IRM/GPL assumptions do not hold, and even when the underlying replacement policies are not "pure" LFU or LRU. We exemplify the value of our inference framework by considering example applications.