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

ATM-UBR switches respond to congestion by dropping cells when their buffers become full. TCP connections running over UBR experience low throughput and high unfairness. For 100% TCP throughput each switch needs buffers equal to the sum of the window sizes of all the TCP connections. Intelligent drop policies can improve the performance of TCP over UBR with limited buffers. The UBR+ service proposes enhancements to UBR for intelligent drop. Early Packet Discard improves throughput but does not attempt to improve fairness. Selective packet drop based on per-connection buffer occupancy improves fairness. The Fair Buffer Allocation scheme further improves both throughput and fairness.

UBR+: Improving Performance of TCP over ATM-UBR service

Bobby Vandalore, Shivkumar Kalyanaraman, Raj Jain, Rohit Goyal, Sonia Fahmy The Ohio State University, Department of CIS Columbus, OH 43210-1277 Phone: 614-688-4482, Fax: 614-292-2911 Email: fvandalor, shivkuma, jain, goyal, fahmyg@cis.ohio-state.edu Seong-Cheol Kim Principal Engineer, Network Research Group, Communication Systems R&D Center Samsung Electronics Co. Ltd., Chung-Ang Newspaper Bldg. 8-2, Karak-Dong, Songpa-Ku, Seoul, Korea 138-160 Email: kimsc@metro.telecom.samsung.co.kr Abstract

/pdf/performance-of-bursty-world-wide-web-www-sources-over-abr-4zohprr9dt.pdf

Performance of Bursty World Wide Web (WWW) Sources over ABR.

The next-generation mobile devices include smart watches, wristbands, wearables (e.g., Google Glass), etc. In the future such devices will constitute a large fraction of the total devices available in the market [1]. Latest studies confirm that location-based services are the most requested feature by developers with a market share of 13B in 2013 and have expected exponential growth [2]. Future location-based applications/services will use the data generated by the new mobile devices for providing enhanced user experience. This paper presents a vision of such next-generation location-based services, which we call LBS 2.0. We present the challenges and opportunities that LBS 2.0 will pose for mobile data management.

Enabling Location-Based Services 2.0: Challenges and Opportunities

Virtual Private Networks (VPNs) have become the solution of choice for site-to-site enterprise networking needs. VPNs allow geographically spread-out locations to communicate in a secure and reliable fashion. Service providers have recognized that with increase in the number of VPNs and their size, simple meshed architectures that connect customer sites with peak bandwidth reservations are not scalable solutions, The current growth in size and complexity of customer networks can be sustained only if efficient solutions are evolved to design and provision VPNs. 
In this thesis we design, implement and evaluate new architectures to provision IP VPNs. Any solution that is deployable features minimal and inexpensive upgrades to existing hardware and software of the core networks. Thus the main theme of our solutions is the approach of leveraging the existing core network infrastructure and building new intelligence at the network edge, hence the term “Edge-based”. 
There are important limitations in existing architectures with reference to point-to-multipoint QoS for VPN-like applications: (a) they have either concentrated on point-to-point models or have relied on complex signaling-based mechanisms in the core network; (b) they rely on precise specification of customer traffic to provide bounds on QoS metrics whereas such information is hard to come by in reality. 
In this thesis we propose new models to provision point-to-multipoint QoS that overcome these limitations. We propose edge-based solutions that are easily deployed and managed. We outline mechanisms to learn customer traffic characteristics exploiting existing SNMP measurement infrastructure and examine the proposals with real data from a large IP VPN service provider. In addition we outline an analytical framework resulting in simple admission control conditions that facilitate decoupling computation of QoS assurances from instantaneous traffic characteristics. We are able to provide bounds on QoS metrics independent of the nature of customer traffic information given just a topology and routing scheme with appropriate edge-based admission control components. 
In summary, this thesis provides a new edge-based architecture for efficient provisioning of a-priori point-to-multipoint QoS and the tools required for deployment with existing Internet Service Provider (ISP) infrastructure.

Edge-based point-to-multipoint quality of service guarantees in private networks

Existing Internet protocols rely on cooperative behavior of end users. We present a control-theoretic algorithm to counteract uncooperative users which change their congestion control schemes to gain larger bandwidth. This algorithm rectifies uncooperative users; that is, forces them to comply with their fair share, by adjusting the prices fed back to them. It is to be implemented at the edge of the network (e.g. by ISPs), and can be used with any congestion notification policy deployed by the network. Our design achieves a separation of time-scales between the network congestion feedback loop and the price-adjustment loop, thus recovering the fair allocation of bandwidth upon a fast transient phase.

/pdf/a-two-time-scale-design-for-detection-and-rectification-of-v6qgyrd4rh.pdf

Shivkumar Kalyanaraman

Papers

UBR+: Improving Performance of TCP over ATM-UBR service

Performance of Bursty World Wide Web (WWW) Sources over ABR.

Enabling Location-Based Services 2.0: Challenges and Opportunities

Edge-based point-to-multipoint quality of service guarantees in private networks

A Two-Time Scale Design for Detection and Rectification of Uncooperative Network Flows