THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

What will 5G be? What it will not be is an incremental advance on 4G. The previous four generations of cellular technology have each been a major paradigm shift that has broken backward compatibility. Indeed, 5G will need to be a paradigm shift that includes very high carrier frequencies with massive bandwidths, extreme base station and device densities, and unprecedented numbers of antennas. However, unlike the previous four generations, it will also be highly integrative: tying any new 5G air interface and spectrum together with LTE and WiFi to provide universal high-rate coverage and a seamless user experience. To support this, the core network will also have to reach unprecedented levels of flexibility and intelligence, spectrum regulation will need to be rethought and improved, and energy and cost efficiencies will become even more critical considerations. This paper discusses all of these topics, identifying key challenges for future research and preliminary 5G standardization activities, while providing a comprehensive overview of the current literature, and in particular of the papers appearing in this special issue.

What Will 5G Be

Recommender systems have developed in parallel with the web. They were initially based on demographic, content-based and collaborative filtering. Currently, these systems are incorporating social information. In the future, they will use implicit, local and personal information from the Internet of things. This article provides an overview of recommender systems as well as collaborative filtering methods and algorithms; it also explains their evolution, provides an original classification for these systems, identifies areas of future implementation and develops certain areas selected for past, present or future importance.

http://romisatriawahono.net/lecture/rm/survey/information%20retrieval/Bobadilla%20-%20Recommender%20Systems%20-%202013.pdf

Recommender systems survey

Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today's state-of-the-art TCP protocol falls short. We present measurements of a 6000 server production cluster and reveal impairments that lead to high application latencies, rooted in TCP's demands on the limited buffer space available in data center switches. For example, bandwidth hungry "background" flows build up queues at the switches, and thus impact the performance of latency sensitive "foreground" traffic.To address these problems, we propose DCTCP, a TCP-like protocol for data center networks. DCTCP leverages Explicit Congestion Notification (ECN) in the network to provide multi-bit feedback to the end hosts. We evaluate DCTCP at 1 and 10Gbps speeds using commodity, shallow buffered switches. We find DCTCP delivers the same or better throughput than TCP, while using 90% less buffer space. Unlike TCP, DCTCP also provides high burst tolerance and low latency for short flows. In handling workloads derived from operational measurements, we found DCTCP enables the applications to handle 10X the current background traffic, without impacting foreground traffic. Further, a 10X increase in foreground traffic does not cause any timeouts, thus largely eliminating incast problems.

/pdf/data-center-tcp-dctcp-4d3pj8xdal.pdf

Data center TCP (DCTCP)

This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistencies. The second is adaptive beaconing: extending the Trickle algorithm to routing control traffic reduces route repair latency and sends fewer beacons.We evaluate datapath validation and adaptive beaconing in CTP Noe, a sensor network tree collection protocol. We use 12 different testbeds ranging in size from 20--310 nodes, comprising seven platforms, and six different link layers, on both interference-free and interference-prone channels. In all cases, CTP Noe delivers > 90% of packets. Many experiments achieve 99.9%. Compared to standard beaconing, CTP Noe sends 73% fewer beacons while reducing topology repair latency by 99.8%. Finally, when using low-power link layers, CTP Noe has duty cycles of 3% while supporting aggregate loads of 30 packets/minute.

/pdf/collection-tree-protocol-selhhlblmq.pdf

Collection tree protocol

This paper explores a vision for urban and suburban transportation for cities such as Melbourne, Australia. Termed Personalized Public Transportation, it builds upon recent trends in vehicle sharing, electric vehicles, mobile payments and cloud computing. The goal is to build on the best of the worlds of private and public transportation. Private transportation offers ownership, comfort and convenience, but is higher cost, and subject to externalities (traffic jams, pollution, etc.). Public transportation is efficient, cheaper and has lower energy/carbon footprint, but usually has a last-mile problem (access) and low spatio-temporal coverage in suburbia. We envisage a future model of leasing public transportation via a service similar to cellphone services, where the user pays for convenience and sharing of a network. We describe the key design features inherent to this mobility model. The vehicular platform allows the entire fleet to be operated and managed via a cloud computing service in order to maximise convenience and minimise cost. A mathematical formulation to get a first order approximation of the benefits of Personalized Public Transportation shows that it is a promising approach for Melbourne, Australia - a 5% adoption can lead to a reduction in the overall cost of travel (relative to operating a private car) by over 4%, energy footprint by over 3%, and Carbon footprint by nearly 9%.

Personalized Public Transportation: A Mobility Model and its Application to Melbourne

Asynchronous transfer mode (ATM) networks must define multicast capabilities in order to efficiently support numerous applications, such as video conferencing and distributed applications, in addition to LAN emulation (LANE) and Internet protocol (IP) multicasting. Several problems and issues arise in ATM multicasting, such as signaling, routing, connection admission control, and traffic management problems. IP integrated services over ATM poses further challenges to ATM multicasting. Scalability and simplicity are the two main concerns for ATM multicasting. This paper provides a survey of the current work on multicasting problems in general, and ATM multicasting in particular. A number of proposed schemes is examined, such as the schemes MARS, MCS, SEAM, SMART, RSVP, and various multipoint traffic management and transport-layer schemes. The paper also indicates a number of key open issues that remain unresolved.

A Survey of Protocols and Open Issues in ATM Multipoint Communication

GSC: a generic source-based congestion control algorithm for reliable multicast

TV Whitespaces, recently opened up by the FCC for unlicensed use by wireless devices, are seen as a potential cellular offload solution, especially in dense metros. However, under the new database-driven guidelines, there are typically very few whitespace bands available in such dense metros to a high-powered fixed device, which plays the role of a cellular base station in whitespaces. To address the lack of degrees-of-freedom (DoF) with this traditional architecture of one high-powered serving device, we propose a novel base station design that co-locates and networks together many low-powered devices to act as a multiple-antenna array. Lower-powered whitespace devices have access to more spectral DoF, a property that is unique to whitespaces. In the first part of the paper, we solve an array design problem where we estimate the size of the array required to meet long-term (worst-case) throughput targets. Using extensive simulations, we show that by effectively exploiting both spatial and spectral DoF, the array design outperforms the traditional design in most network conditions. Specifically, the proposed design can support throughputs of the order of a WiMAX cell running applications such as high-definition television. In the second part of the paper, we turn our attention to the operational aspects of such a design. Recognizing that the proposed array can potentially contain hundreds of elements, we propose a dynamic ON-OFF power control algorithm that operates in conjunction with the MaxWeight data scheduling algorithm and responds to the current network state - queues and channels - of the system, thus making the system power-efficient.

On Exploiting degrees-of-freedom in whitespaces

We study the buffering requirements for zero cell loss for TCP/IP over satellite links using the available bit rate (ABR) and unspecified bit rate (UBR) services of asynchronous transfer mode (ATM) networks. For the ABR service, we explore the effect of feedback delay (a factor which depends upon the position of the bottleneck), the switch scheme used, and background variable bit rate (VBR) traffic. It is shown that the buffer requirement for TCP over ABR is independent of the number of TCP sources, but depends on the aforementioned factors. For the UBR service, we show that the buffer requirement is the sum of the TCP receiver window sizes. We substantiate our arguments with simulation results.

https://www.cse.wustl.edu/~jain/talks/ftp/atm_sat2.pdf

Shivkumar Kalyanaraman

Papers

Personalized Public Transportation: A Mobility Model and its Application to Melbourne

A Survey of Protocols and Open Issues in ATM Multipoint Communication

GSC: a generic source-based congestion control algorithm for reliable multicast

On Exploiting degrees-of-freedom in whitespaces

Performance of TCP/IP Using ATM ABR and UBR Services over Satellite Networks