Techniques for improving the scalability of data center networks

Data centers require highly scalable data and control planes for ensuring good performance of distributed applications. Along the data plane, network throughput and latency directly impact application performance metrics. This has led researchers to propose high bisection bandwidth network topologies based on multi-rooted trees for data center networks. However, such topologies require efficient traffic splitting algorithms to fully utilize all available bandwidth. Along the control plane, the centralized controller for software-defined networks presents new scalability challenges. The logically centralized controller needs to scale according to network demands. Also, since all services are implemented in the centralized controller, it should allow easy integration of different types of network services.^ In this dissertation, we propose techniques to address scalability challenges along the data and control planes of data center networks.^ Along the data plane, we propose a fine-grained trac splitting technique for data center networks organized as multi-rooted trees. Splitting individual flows can provide better load balance but is not preferred because of potential packet reordering that conventional wisdom suggests may negatively interact with TCP congestion control. We demonstrate that, due to symmetry of the network topology, TCP is able to tolerate the induced packet reordering and maintain a single estimate of RTT.^ Along the control plane, we design a scalable distributed SDN control plane architecture. We propose algorithms to evenly distribute the load among the controller nodes of the control plane. The algorithms evenly distribute the load by dynamically configuring the switch to controller node mapping and adding/removing controller nodes in response to changing traffic patterns. ^ Each SDN controller platform may have different performance characteristics. In such cases, it may be desirable to run different services on different controllers to match the controller performance characteristics with service requirements. To address this problem, we propose an architecture, FlowBricks, that allows network operators to compose an SDN control plane with services running on top of heterogeneous controller platforms

Public Bikesharing in North America During a Period of Rapid Expansion: Understanding Business Models, Industry Trends & User Impacts, MTI Report 12-29

Public bikesharing—the shared use of a bicycle fleet—is an innovative transportation strategy that has recently emerged in major cities around the world, including North America. Information technology (IT)-based bikesharing systems typically position bicycles throughout an urban environment, among a network of docking stations, for immediate access. Trips can be one-way, round-trip, or both, depending on the operator. Bikesharing can serve as a first-and-last mile connector to other modes, as well as for both short and long distance destinations. In 2012, 22 IT-based public bikesharing systems were operating in the United States, with a total of 884,442 users and 7,549 bicycles. Four IT-based programs in Canada had a total of 197,419 users and 6,115 bicycles. Two IT-based programs in Mexico had a total of 71,611 users and 3,680 bicycles. (Membership numbers reflect the total number of short- and long-term users.) This study evaluates public bikesharing in North America, reviewing the change in travel behavior exhibited by members of different programs in the context of their business models and operational environment. This Phase II research builds on data collected during our Phase I research conducted in 2012. During the 2012 research (Phase I), researchers conducted 14 expert interviews with industry experts and public officials in the United States and Canada, as well as 19 interviews with the manager and/or key staff of IT-based bikesharing organizations. For more information on the Phase I research, please see the Shaheen et al., 2012 report Public Bikesharing in North America: Early Operator and User Understanding. For this Phase II study, an additional 23 interviews were conducted with IT-based bikesharing organizations in the United States, Canada, and Mexico in Spring 2013. Notable developments during this period include the ongoing expansion of public bikesharing in North America, including the recent launches of multiple large bikesharing programs in the United States (i.e., Citi Bike in New York City, Divvy in Chicago, and Bay Area Bike Share in the San Francisco Bay Area). In addition to expert interviews, the authors conducted two kinds of surveys with bikesharing users. One was the online member survey. This survey was sent to all people for whom the operator had an email address.The population of this survey was mainly annual members of the bikesharing system, and the members took the survey via a URL link sent to them from the operator. The second survey was an on-street survey. This survey was designed for anyone, including casual users (i.e., those who are not members of the system and use it on a short-term basis), to take “on-street” via a smartphone. The member survey was deployed in five cities: Montreal, Toronto, Salt Lake City, Minneapolis-Saint Paul, and Mexico City. The on-street survey was implemented in three cities: Boston, Salt Lake City, and San Antonio

Agent based modeling of energy networks

Attempts to model any present or future power grid face a huge challenge because a power grid is a complex system, with feedback and multi-agent behaviors, integrated by generation, distribution, storage and consumption systems, using various control and automation computing systems to manage electricity flows. Our approach to modeling is to build upon an established model of the low voltage electricity network which is tested and proven, by extending it to a generalized energy model. But, in order to address the crucial issues of energy efficiency, additional processes like energy conversion and storage, and further energy carriers, such as gas, heat, etc., besides the traditional electrical one, must be considered. Therefore a more powerful model, provided with enhanced nodes or conversion points, able to deal with multidimensional flows, is being required. This article addresses the issue of modeling a local multi-carrier energy network. This problem can be considered as an extension of modeling a low voltage distribution network located at some urban or rural geographic area. But instead of using an external power flow analysis package to do the power flow calculations, as used in electric networks, in this work we integrate a multiagent algorithm to perform the task, in a concurrent way to the other simulation tasks, and not only for the electric fluid but also for a number of additional energy carriers. As the model is mainly focused in system operation, generation and load models are not developed

CPA’s Guide to Technology in a PFP Practice

https://egrove.olemiss.edu/aicpa_guides/2697/thumbnail.jp

The Parallelism Motifs of Genomic Data Analysis

Genomic data sets are growing dramatically as the cost of sequencing continues to decline and small sequencing devices become available. Enormous community databases store and share this data with the research community, but some of these genomic data analysis problems require large scale computational platforms to meet both the memory and computational requirements. These applications differ from scientific simulations that dominate the workload on high end parallel systems today and place different requirements on programming support, software libraries, and parallel architectural design. For example, they involve irregular communication patterns such as asynchronous updates to shared data structures. We consider several problems in high performance genomics analysis, including alignment, profiling, clustering, and assembly for both single genomes and metagenomes. We identify some of the common computational patterns or motifs that help inform parallelization strategies and compare our motifs to some of the established lists, arguing that at least two key patterns, sorting and hashing, are missing