Cost-efficient Low Latency Communication Infrastructure for Synchrophasor Applications in Smart Grids

With the introduction of distributed renewable energy resources and new loads, such as electric vehicles, the power grid is evolving to become a highly dynamic system, that necessitates continuous and fine-grained observability of its operating conditions. In the context of the medium voltage (MV) grid, this has motivated the deployment of Phasor Measurement Units (PMUs), that offer high precision synchronized grid monitoring, enabling mission-critical applications such as fault detection/location. However, PMU-based applications present stringent delay requirements, raising a significant challenge to the communication infrastructure. In contrast to the high voltage domain, there is no clear vision for the communication and network topologies for the MV grid; a full fledged optical fiber-based communication infrastructure is a costly approach due to the density of PMUs required. In this work, we focus on the support of low-latency PMU-based applications in the MV domain, identifying and addressing the trade-off between communication infrastructure deployment costs and the corresponding performance. We study a large set of real MV grid topologies to get an in-depth understanding of the various key latency factors. Building on the gained insights, we propose three algorithms for the careful placement of high capacity links, targeting a balance between deployment costs and achieved latencies. Extensive simulations demonstrate that the proposed algorithms result in low-latency network topologies while reducing deployment costs by up to 80% in comparison to a ubiquitous deployment of costly high capacity links

Multi-capacity bin packing with dependent items and its application to the packing of brokered workloads in virtualized environments

Providing resource allocation with performance predictability guarantees is increasingly important in cloud platforms, especially for data-intensive applications, in which performance depends greatly on the available rates of data transfer between the various computing/storage hosts underlying the virtualized resources assigned to the application. Existing resource allocation solutions either assume that applications manage their data transfer between their virtualized resources, or that cloud providers manage their internal networking resources. With the increased prevalence of brokerage services in cloud platforms, there is a need for resource allocation solutions that provides predictability guarantees in settings, in which neither application scheduling nor cloud provider resources can be managed/controlled by the broker. This paper addresses this problem, as we define the Network-Constrained Packing (NCP) problem of finding the optimal mapping of brokered resources to applications with guaranteed performance predictability. We prove that NCP is NP-hard, and we define two special instances of the problem, for which exact solutions can be found efficiently. We develop a greedy heuristic to solve the general instance of the NCP problem , and we evaluate its efficiency using simulations on various application workloads, and network models.This work was done while author was at Boston University. It was partially supported by NSF CISE awards #1430145, #1414119, #1239021 and #1012798. (1430145 - NSF CISE; 1414119 - NSF CISE; 1239021 - NSF CISE; 1012798 - NSF CISE

Network-constrained packing of brokered workloads in virtualized environments

Providing resource allocation with performance predictability guarantees is increasingly important in cloud platforms, especially for data-intensive applications, in which performance depends greatly on the available rates of data transfer between the various computing/storage hosts underlying the virtualized resources assigned to the application. Existing resource allocation solutions either assume that applications manage their data transfer between their virtualized resources, or that cloud providers manage their internal networking resources.With the increased prevalence of brokerage services in cloud platforms, there is a need for resource allocation solutions that provides predictability guarantees in settings, in which neither application scheduling nor cloud provider resources can be managed/controlled by the broker. This paper addresses this problem, as we define the Network-Constrained Packing (NCP)problem of finding the optimal mapping of brokered resources to applications with guaranteed performance predictability. We prove that NCP is NP-hard, and we define two special instances of the problem, for which exact solutions can be found efficiently. We develop a greedy heuristic to solve the general instance of the NCP problem, and we evaluate its efficiency using simulations on various application workloads, and network models.This work is supported by NSF CISE CNS Award #1347522, # 1239021, # 1012798

Network-aware heuristics for inter-domain meta-scheduling in Grids

AbstractGrid computing generally involves the aggregation of geographically distributed resources in the context of a particular application. As such resources can exist within different administrative domains, requirements on the communication network must also be taken into account when performing meta-scheduling, migration or monitoring of jobs. Similarly, coordinating efficient interaction between different domains should also be considered when performing such meta-scheduling of jobs. A strategy to perform peer-to-peer-inspired meta-scheduling in Grids is presented. This strategy has three main goals: (1) it takes the network characteristics into account when performing meta-scheduling; (2) communication and query referral between domains is considered, so that efficient meta-scheduling can be performed; and (3) the strategy demonstrates scalability, making it suitable for many scientific applications that require resources on a large scale. Simulation results are presented that demonstrate the usefulness of this approach, and it is compared with other proposals from literature

Modeling and characterization of urban radio channels for mobile communications

Results of this thesis contribute in modeling and characterization of radio channels for future mobile communications. The results are presented mainly in three parts: a) modeling of propagation mechanisms, b) methodology of developing a propagation model, c) characterization of urban radio channel. One of the main propagation physical phenomena that have an important role in diverting signals to non line of sight scenarios is the diffraction process. This thesis proposes diffraction coefficients that have better agreement with finite difference time domain solution and rigorous diffraction theory than the coefficient commonly used in propagation predictions for mobile communications. The importance of diffuse scattering has also been investigated and showed that this physical process may have a key role in urban propagation, with a particular impact on the delay spread and angular spread of the signal at the receiver. This thesis proposes wideband propagation models for main and perpendicular streets of urban street grids. The propagation models are ray-based and are given in explicit mathematical expressions. Each ray is characterized in terms of its amplitude, delay, and angle of arrival, angle of departure for vertical and horizontal polarizations. Each of these characteristics is given in a closed mathematical form. Having wideband propagation model in explicit expression makes its implementation easy and computation fast. Secondary source modeling approach for perpendicular streets has also been introduced in this thesis. The last part of the thesis deals with characterization of urban radio channels for extracting parameters that help in successful design of mobile communication systems. Knowledge of channel characteristics enables reaching optimum trade off between system performance and complexity. This thesis analyzes measurement results at 2 GHz to extract channel parameters in terms of Rake finger characteristics in order to get information that helps to optimize Rake receiver design for enhanced-IMT2000 systems. Finger life distance has also been investigated for both micro- and small cell scenarios. This part of the thesis also presents orthogonality factor of radio channel for W-CDMA downlink at different bandwidths. Characterization of dispersion metrics in delay and angular domains for microcellular channels is also presented at different base station antenna heights. A measure of (dis-) similarity between multipath components in terms of separation distance in delay and angular domains is introduced by the concept of distance function, which is a step toward in development of algorithm extraction and analysis multipath clustering. In summary, the significant contributions of the thesis are in three parts. 1) Development of new diffraction coefficients and corrections of limitations of existing one for accurate propagation predictions for mobile communications. 2) Development of wideband propagation models for urban street grid. The novelty of the model is the development in explicit mathematical expressions. The developed models can be used to study propagation problem in microcellular urban street grids. 3) Presenting channel parameters that will help in the design of future mobile communication systems (enhanced-IMT2000), like number of active fingers, finger life distance, and orthogonality factors for different bandwidths. In addition, a technique based on multipath separation distance is proposed as a step toward in development of algorithms for extraction and analysis of multipath clusters.reviewe

Real-time detection of grid bulk transfer traffic

The current practice of physical science research has yielded a continuously growing demand for interconnection network bandwidth to support the sharing of large datasets. Academic research networks and internet service providers have provisioned their networks to handle this type of load, which generates prolonged, high-volume traffic between nodes on the network. Maintenance of QoS for all network users demands that the onset of these (Grid bulk) transfers be detected to enable them to be reengineered through resources specifically provisioned to handle this type of traffic. This paper describes a real-time detector that operates at full-line-rate on Gb/s links, operates at high connection rates, and can track the use of ephemeral or non-standard ports

Sensor Search Techniques for Sensing as a Service Architecture for The Internet of Things

The Internet of Things (IoT) is part of the Internet of the future and will comprise billions of intelligent communicating "things" or Internet Connected Objects (ICO) which will have sensing, actuating, and data processing capabilities. Each ICO will have one or more embedded sensors that will capture potentially enormous amounts of data. The sensors and related data streams can be clustered physically or virtually, which raises the challenge of searching and selecting the right sensors for a query in an efficient and effective way. This paper proposes a context-aware sensor search, selection and ranking model, called CASSARAM, to address the challenge of efficiently selecting a subset of relevant sensors out of a large set of sensors with similar functionality and capabilities. CASSARAM takes into account user preferences and considers a broad range of sensor characteristics, such as reliability, accuracy, location, battery life, and many more. The paper highlights the importance of sensor search, selection and ranking for the IoT, identifies important characteristics of both sensors and data capture processes, and discusses how semantic and quantitative reasoning can be combined together. This work also addresses challenges such as efficient distributed sensor search and relational-expression based filtering. CASSARAM testing and performance evaluation results are presented and discussed.Comment: IEEE sensors Journal, 2013. arXiv admin note: text overlap with arXiv:1303.244