the proceedings contain 105 papers. the topics discussed include: authentication of online authorship or article based on hypothesis testing model;the study of hierarchical branch prediction architecture;fast, accurat...
ISBN:
(纸本)9780769544779
the proceedings contain 105 papers. the topics discussed include: authentication of online authorship or article based on hypothesis testing model;the study of hierarchical branch prediction architecture;fast, accurate on-chip data memory performance estimation;domain service acquisition and domain modeling based on feature model;automatic management of cyclic dependency among web services;building regionally spatial appearance model by topological color histogram;a novel video steganography based on non-uniform rectangular partition;analyzing a batch range proof to address a security concern;the analysis of load balance for wireless sensor network using compressive sensing;distributing subsystems across different kernels running simultaneously in a multi-core architecture;research on equal symmetric distributed fault-tolerant architecture and strategy for parallel satellite system;and a self starting block Adams methods for solving stiff ordinary differential equation.
Reputation systems rely on historical information to account for uncertainty about the intention of users to cooperate. In peer-to-peer (P2P) systems, however, accumulating experience tends to be slow due to the high ...
详细信息
ISBN:
(纸本)9781457701498
Reputation systems rely on historical information to account for uncertainty about the intention of users to cooperate. In peer-to-peer (P2P) systems, however, accumulating experience tends to be slow due to the high rates of churn - the continuous process of arrival and departure of peers. the flow of transactions is continuously interrupted by departures, which can significantly affect the convergence of reputation systems. To shed light on this, this paper presents an accurate model for capturing the influence of churn on the process of building reputations. Using our model, system architects can determine the minimal transaction rate that guarantees fast convergence and design their systems accordingly. Unfortunately, the natural transaction rate of users is sometimes too low (e. g., due to physical constraints like network bandwidth, etc.) that many of them are likely to experience significant delays in the process of building reputations for their neighbors. We face this problem by leveraging the inherent trust in social networks. the basic idea is that users ask their social links to transact with strangers and together generate reputation ratings in a short time scale. Our simulation results report reductions of 50% or greater in the convergence time in environments with high churn rates.
Mobile Ad-Hoc Networks (MANETs) rely on the 802.11 ad-hoc mode to establish communication with nearby peers. In practice, this makes MANETs hard to realize. While 802.11-compliant mobile devices implement the ad-hoc m...
详细信息
In this work, by combining coding tools developed in recent literatures on transform domain WZ video coding with some newly developed modules on both encoding and decoding sides, an efficient and practical WZ video co...
详细信息
ISBN:
(纸本)9781450306164
In this work, by combining coding tools developed in recent literatures on transform domain WZ video coding with some newly developed modules on both encoding and decoding sides, an efficient and practical WZ video coding architecture, dubbed as distributed video coding with PArallelized design for Cloud computing (DISPAC), is proposed to better the corresponding rate-distortion (RD) performance. Another unique feature of DISPAC, lies in the parallelizability of the modules used by its WZ decoder which increased the decoding speed largely. Experimental results conducted on an emulated Could computing environment reveal that DISPAC codec can gain up to 3.6 dB in the RD measures and 60.97 times faster in the decoding speed as compared withthe-state-of-art WZ video codec, respectively. Copyright 2011 ACM.
Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric c...
详细信息
ISBN:
(纸本)9781457701498
Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric codes. A lot of effort has been invested in understanding the fundamental achievable trade-offs of storage and bandwidth usage to maintain redundancy in presence of different models of failures, showcasing the efficacy of regenerating codes with respect to traditional erasure coding techniques. For practical usability in open and adversarial environments, as is typical in peer-to-peer systems, we need however not only resilience against erasures, but also from (adversarial) errors. In this paper, we study the resilience of generalized regenerating codes (supporting multi-repairs, using collaboration among newcomers) in the presence of two classes of Byzantine nodes, relatively benign selfish (non-cooperating) nodes, as well as under more active, malicious polluting nodes. We give upper bounds on the resilience capacity of regenerating codes, and show that the advantages of collaborative repair can turn to be detrimental in the presence of Byzantine nodes. We further exhibit that system mechanisms can be combined with regenerating codes to mitigate the effect of rogue nodes.
the growing amount of various kinds of information triggers the need to develop efficient network computing systems, as single machines in many cases are not able to provide effective processing and analysis. One of t...
详细信息
ISBN:
(纸本)9783642219276;9783642219283
the growing amount of various kinds of information triggers the need to develop efficient network computing systems, as single machines in many cases are not able to provide effective processing and analysis. One of the very promising approaches of distributed data analysis is combined classification, which could be relatively easily implemented in distributedcomputing systems. In this paper we address problem of decentralized distributedcomputing system for mentioned above classification method. We focus on the system fairness. the performance metric is defined as a maximum response time, i.e., the computing system should be designed to minimize the response time of each client using the system. We assume that the system is decentralized and each request is sent by the client directly to computing nodes without assistance of a central service. An ILP (Integer Linear Programming) model is formulated and applied to obtain optimal results provided by branch-and-cut algorithm included in the CPLEX solver. Widespread simulations are performed to evaluate properties of the computing system in terms of several parameters describing the system.
the scale of the parallel and distributed systems (PDSs), such as grids and clouds, and the diversity of applications running on them put reliability a high priority performance metric. this paper presents a reputatio...
详细信息
ISBN:
(纸本)9783642246494
the scale of the parallel and distributed systems (PDSs), such as grids and clouds, and the diversity of applications running on them put reliability a high priority performance metric. this paper presents a reputation-based resource allocation strategy for PDSs with a market model. Resource reputation is determined by availability and reliable execution. the market model helps in defining a trust interaction between provider and consumer that leverages dependable computing. We also have explicitly taken into account data staging and its delay when making the decisions. Results demonstrate that our approach significantly increases successful execution, while exploiting diversity in tasks and resources.
this paper presents an approach for developing context-aware intelligent applications for Smart Space-based infrastructure. the goal is to model and process context information using our development tool and Nokia'...
详细信息
Withthe recent deployment of global experimental networking facilities, dozens of computer networks with large numbers of computers have become available for scientific studies. Multiple Replications in Parallel (MRI...
详细信息
ISBN:
(数字)9783642246692
ISBN:
(纸本)9783642246685
Withthe recent deployment of global experimental networking facilities, dozens of computer networks with large numbers of computers have become available for scientific studies. Multiple Replications in Parallel (MRIP) is a distributed scenario of sequential quantitative stochastic simulation which offers significant speedup of simulation if it is executed on multiple computers of a local area network. We report results of running MRIP simulations on PlanetLab, a global overlay network which can currently access more than a thousand computers in forty different countries round the globe. Our simulations were run using Akaroa2, a universal controller of quantitative discrete event simulation designed for automatic launching of MRIP-based experiments. Our experimental results provide strong evidence that global experimental networks, such as PlanetLab, can efficiently be used for quantitative simulation, without compromising speed and efficiency.
In this paper, the software library PARMONC that was developed for the massively parallel simulation by Monte Carlo method on supercomputers is presented. the "core" of the library is a well tested, fast and...
详细信息
ISBN:
(纸本)9783642231773
In this paper, the software library PARMONC that was developed for the massively parallel simulation by Monte Carlo method on supercomputers is presented. the "core" of the library is a well tested, fast and reliable long-period parallel random numbers generator. Routines from the PARMONC can be called in the user-supplied programs written in C, C++ or in FORTRAN without explicit usage of MPI instructions. Routines from the PARMONC automatically calculate sample means of interest and the corresponding computation errors. A computational load is automatically distributed among processors in an optimal way. the routines enable resuming the simulation that was previously performed and automatically take into account its results. the PARMONC is implemented on high-performance clusters of the Siberian Supercomputer Center.
暂无评论