检索结果-内蒙古大学图书馆

13th IEEE international Workshop on FTDCS 2011, the 8th international conference on ATC 2011, the 8th international conference on UIC 2011 and the 13th IEEE international conference on HPCC 2011

作者： Abouelela, Mohamed El-Darieby, Mohamed Software Systems Engineering Department University of Regina Regina SK Canada

ISBN: (纸本)9780769545387

Most grid applications require the processing of large amounts of data stored at different locations across the network which makes optical grid infrastructures optimal for such applications. the increase in intensity of data- and communications of these applications calls for new mechanisms and theories on how to optimally allocate optical grid resources. Typical Divisible Load theory (DLT) makes optimal allocation of computational resources. In this paper, we introduce network Aware Divisible Load Algorithm (NADLA) that extends DLT to optimally allocate both the computational and networking resources of an optical grid. We assume a data- and communications-intensive application where data is stored at different sites across the optical grid and can be divided into independent subsets to be processed in parallel at different sites. the algorithm defines an optimal data transfer schedule that defines when to transfer what data subsets to which sites across the optical grid in order to minimize the overall application completion time. It consists of two phases. In the first phase, NADLA provide load distribution that minimizes application completion time taking into account network connectivity and computational and networking resources availability. Site connectivity is estimated by considering the bandwidth and the expected free time of all the links connecting this site to other sites. In the second phase, a simple greedy algorithm is used to allocate computational and networking resources. Extensive Simulations are conducted to examine the performance of the proposed algorithm for different application types and sizes, and different optical grid topologies. Simulation results show the advantages of the proposed algorithm over the traditional DLT approach for the category of applications considered. © 2011 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Repair Mechanism for Decentralized Erasure Code based Storage Systems

A Decentralized Repair Mechanism for Decentralized Erasure C...

引用

Int Joint conference of 10th IEEE Int Conf on Trust, Security and Privacy in computing and Communications (TrustCom) / 8th IEEE Int Conf on Embedded Software and Systems (ICESS) / 6th Int Conf on Frontier of Computer Science and Technology (FCST)

作者： Lin, Hsiao-Ying Tzeng, Wen-Guey Lin, Bao-Shuh Natl Chiao Tung Univ Intelligent Informat & Commun Res Ctr Hsinchu Taiwan Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9780769546001

Erasure code based distributed storage systems provide data robustness by storing encoded-fragments over servers. To maintain data robustness, a repair mechanism recovers a storage system from server failures by repairing encoded-fragments. For decentralized erasure code based storage systems, we propose a decentralized repair mechanism. Our mechanism has the following features. Firstly, an encoded-fragment is replenished by a combination of a number u of encoded-fragments that are randomly chosen. Secondly, the number u depends on the number of the available encoded-fragments and is independent of the pattern of missing encoded-fragments. thirdly, multiple encoded-fragments are simultaneously replenished in parallel. We measure the communication cost in terms of the number u of required network connections for replenishing an encoded-fragment. We then conducted a numerical analysis by using traces of real systems. We find that our requirement on u is smaller than that from existing methods. Both theoretical and numerical results show that our decentralized repair mechanism outperforms existing ones in terms of the communication cost under the same consideration of efficiency cost for storage.

关键词： decentralized erasure codes regenerating codes network coding distributed storage

来源：评论

学校读者我要写书评

暂无评论

Energy efficient and robust multicast routing for large scale sensor networks

Energy efficient and robust multicast routing for large scal...

引用

2011 ifip 9th international conference on Embedded and Ubiquitous computing, EUC 2011

作者： Won, Myounggyu Stoleru, Radu Department of Computer Science and Engineering Texas A and M University United States

ISBN: (纸本)9780769545523

In this paper we present RE2MR, an energy efficient and robust multicast routing protocol suitable for large scale real-world WSN deployments. RE2MR, a hybrid multicast protocol, builds on the strengths of existing topologybased, hierarchical and geographic multicast solutions, and addresses their limitations. RE2MR establishes a network topology in which multicast member nodes are connected to the root node via near-optimal multicast routing paths. RE2MR discovers deployment area irregularities (e.g., holes) that affect the optimality of multicast routing and considers them when recomputing the near-optimal solution. RE2MR incurs little computational overhead on forwarding nodes, a negligible communication overhead and ensures reliable multicast packet delivery. We implement RE2MR in TinyOS and evaluate it extensively using TOSSIM. RE2MR reduces the energy consumption by up to 57% and the end-to-end delay by up to 8%, when compared with state of art solutions. © 2011 IEEE.

关键词： network topology

来源：评论

学校读者我要写书评

暂无评论

Towards a universal sketch for origin-destination network measurements

Towards a universal sketch for origin-destination network me...

引用

8th ifip international conference on network and parallel computing, NPC 2011

作者： Zhao, Haiquan Chuck Hua, Nan Lall, Ashwin Li, Ping Wang, Jia Xu, Jun Jim Georgia Tech China Denison University China Cornell University China AT and T Research China

ISBN: (纸本)9783642244025

Despite its importance in today’s Internet, network measurement was not an integral part of the original Internet architecture, i.e., there was (and still is) little native support for many essential measurement tasks. Targeting the inadequacy of counting/accounting capabilities of existing routers, many data streaming and sketching techniques have been proposed to estimate the important statistics of traffic going through a network link. Most of these techniques are, however, developed to track one specific statistic and/or answer a specific type of query. Since there are a large number of such statistics and queries of interest, it is very difficult, if not impossible, for network vendors and operators to implement and deploy data streaming/sketching solutions for all of them, due to router resource (memory, CPU, bus bandwidth, etc.) constraints. In this paper, we propose a general-purpose solution that can not only answer a wide range of queries, but also be able to answer types of queries that were not known a priori. In particular, we introduce the use of the Conditional Random Sampling (CRS) sketch data structure for succinctly capturing network traffic data between a set of nodes in the network. this sketch is the first step towards a "universal" sketch data structure in the sense that it is not tied to measurement of a single quantity. We show that the CRS sketch can compute unbiased estimates for any linear summary statistic in the intersection of a pair of traffic streams, e.g., traffic and flow matrix information, flow counts, and entropy. We present detailed experiments, using data collected at a tier-1 ISP, that show that our sketch is capable of estimating this wide range of statistics with fairly high accuracy. © ifip international Federation for Information Processing 2011.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Phoenix: A weight-based network coordinate system using matrix factorization

引用

IEEE Transactions on network and Service Management 2011年第4期8卷 334-347页

作者： Chen, Yang Wang, Xiao Shi, Cong Lua, Eng Keong Fu, Xiaoming Deng, Beixing Li, Xing Institute of Computer Science Georg-August-University of Goettingen Germany Department of Computer Science and Engineering University of Washington United States College of Computing Georgia Institute of Technology United States College of Engineering Carnegie Mellon University United States Department of Electronic Engineering Tsinghua University China

network coordinate (NC) systems provide a lightweight and scalable way for predicting the distances, i.e., round-trip latencies among Internet hosts. Most existing NC systems embed hosts into a low dimensional Euclidean space. Unfortunately, the persistent occurrence of Triangle Inequality Violation (TIV) on the Internet largely limits the distance prediction accuracy of those NC systems. Some alternative systems aim at handling the persistent TIV, however, they only achieve comparable prediction accuracy with Euclidean distance based NC systems. In this paper, we propose an NC system, so-called Phoenix, which is based on the matrix factorization model. Phoenix introduces a weight to each reference NC and trusts the NCs with higher weight values more than the others. the weight-based mechanism can substantially reduce the impact of the error propagation. Using the representative aggregate data sets and the newly measured dynamic data set collected from the Internet, our simulations show that Phoenix achieves significantly higher prediction accuracy than other NC systems. We also show that Phoenix quickly converges to steady state, performs well under host churn, handles the drift of the NCs successfully by using regularization, and is robust against measurement anomalies. Phoenix achieves a scalable yet accurate end-to-end distances monitoring. In addition, we study how well an NC system can characterize the TIV property on the Internet by introducing two new quantitative metrics, so-called RERPL and AERPL. We show that Phoenix is able to characterize TIV better than other existing NC systems. © 2011 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

parallel Training of Artificial Neural networks Using Multithreaded and Multicore CPUs

Parallel Training of Artificial Neural Networks Using Multit...

引用

10th international conference on Adaptive and Natural computing Algorithms

作者： Schuessler, Olena Loyola, Diego German Aerosp Ctr Inst Remote Sensing D-82234 Wessling Germany

ISBN: (纸本)9783642202810

this paper reports on methods for the parallelization of artificial neural networks algorithms using multithreaded and multicore CPUs in order to speed up the training process. the developed algorithms were implemented in two common parallel programming paradigms and their performances are assessed using four datasets with diverse amounts of patterns and with different neural network architectures. All results show a significant increase in computation speed. which is reduced nearly linear with the number of cores for problems with very large training datasets.

关键词： Neural network training multithreading and multicore Pthreads and OpenMP parallelization

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor network Data Description and Encoding in Heterogeneous Building Systems

Wireless Sensor Network Data Description and Encoding in Het...

引用

7th IEEE international conference on Distributed computing in Sensor Systems (DCOSS)

作者： Conway, Chris Barnes, Matthew Univ Edinburgh Sch Informat Ctr Speckled Comp Edinburgh EH8 9AB Midlothian Scotland

ISBN: (纸本)9781457705137

this paper presents initial results and future directions for data description and payload encodings for heterogeneous networks in IP based building intelligence systems. the efficiency of several open standards for sensor data representation are evaluated along with a consideration of the complexity of implementation and suitability for use in development of 6lowPAN based intelligent building systems. A combination of a simplified generic XML schema for data description combined with Google Protobuffer encoding is suggested as the basis for further development of the architecture as this combines simple, platform independent implementation for developers with efficient compression and payload encoding for limited bandwidth 6lowPAN networks.

关键词： Architecture Buildings Encoding Google Protobuffer Internet Internet protocol Payloads Protocols Wireless sensor networks XML XML schema building management systems data description data encoding data handling heterogeneous network intelligent building sy

来源：评论

学校读者我要写书评

暂无评论

UEF: Ubiquity Evaluation Framework

引用

9th ifip international conference on Wired/Wireless Internet Communications (WWIC)

作者： Sousa, Bruno Pentikousis, Kostas Curado, Marilia Univ Coimbra CISUC Polo 2 P-3030290 Coimbra Portugal Huwei Technol European Res Ctr D-10587 Berlin Germany

ISBN: (纸本)9783642215605

Ubiquitous computing (UbiComp) systems rely on heterogeneous technologies to enable the anytime-anywhere communication paradigm. Despite the momentum that UbiComp systems have, most new proposals are typically evaluated through varying sets of criteria, making direct comparisons that are far from straightforward. In this paper, we introduce the Ubiquity Evaluation Framework (UEF) aiming to overcome the limitations of hitherto evaluation mechanisms. UEF is unique, as particular protocols of a UbiComp system can be evaluated without requiring a functional system or involving questionnaries to a group of experts in the field. UEF enables the comparison of protocols intended for the same task in the design phase, by employing objective metrics. the generic applicability of UEF is demonstrated in this paper through a case study comparing UbiComp support in two well-established mobility management protocols, namely Mobile IPv6 (MIPv6) and Host Identity Protocol (HIP).

关键词： Ubiquitous computing Multihoming MIPv6 HIP modeling and performance evaluation

来源：评论

学校读者我要写书评

暂无评论

CREATING A CYBER MOVING TARGET FOR CRITICAL INFRASTRUCTURE APPLICATIONS 5th

CREATING A CYBER MOVING TARGET FOR CRITICAL INFRASTRUCTURE A...

引用

5th Annual ifip Working Group 11.10 international conference on Critical Infrastructure Protection

作者： Okhravi, Hamed Comella, Adam Robinson, Eric Yannalfo, Stephen Michaleas, Peter Haines, Joshua Cyber Systems and Technology Group MIT Lincoln Laboratory Lexington MA United States Rensselaer Polytechnic Institute Troy NY United States Embedded and High Performance Computing Group MIT Lincoln Laboratory Lexington MA United States

ISBN: (纸本)9783642248634

Despite the significant amount of effort that often goes into securing critical infrastructure assets, many systems remain vulnerable to advanced, targeted cyber attacks. this paper describes the design and implementation of the Trusted Dynamic Logical Heterogeneity System (TALENT), a framework for live-migrating critical infrastructure applications across heterogeneous platforms. TALENT permits a running critical application to change its hardware platform and operating system, thus providing cyber survivability through platform diversity. TALENT uses containers (operating-system-level virtualization) and a portable checkpoint compiler to create a virtual execution environment and to migrate a running application across different platforms while preserving the state of the application (execution state, open files and network connections). TALENT is designed to support general applications written in the C programming language. By changing the platform on-the-fly, TALENT creates a cyber moving target and significantly raises the bar for a successful attack against a critical application. Experiments demonstrate that a complete migration can be completed within about one second.

关键词： Cyber moving target platform heterogeneity virtualization

来源：评论

学校读者我要写书评

暂无评论

Empirical Evaluation of HTTP Adaptive Streaming under Vehicular Mobility

引用

10th international ifip TC 6 networking conference

作者： Yao, Jun Kanhere, Salil S. Hossain, Imran Hassan, Mahbub Univ New South Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

ISBN: (纸本)9783642207570

Adaptive streaming is a promising technique for delivering a high-quality video streaming experience. In this technique, the streaming bit-rate is constantly adjusted in accordance to the variations in the underlying network bandwidth conditions. A popular instantiation of this approach is to extend traditional HTTP-based streaming. While several such implementations are widely available, it is unclear how they perform under a typical high-speed vehicular environment, wherein the wireless bandwidth varies significantly and rapidly. In this paper, we seek to provide some insights on this issue through empirical experiments driven by real-world wireless bandwidth traces collected from moving vehicles. Our results suggest that, with appropriate parameter configurations, HTTP adaptive streaming is an effective solution for delivering a high-quality smooth streaming experience even under high-speed vehicular mobility.

关键词： Adaptive streaming HTTP streaming Empirical experiments Vehicular mobility Mobile computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：