We present sTile, a technique for building software systems that distribute large computations onto the cloud while providing guarantees that the cloud nodes cannot learn the computation’s private data. sTile is based on a nature-inspired, theoretical model of self-assembly. While sTile’s computational model is Turing universal, in this paper, we present a prototype implementation that […]
Facilitates systematic detection and resolution of XACML policy anomalies
In this paper, we represent an innovative policy anomaly analysis approach for Web access control policies, focusing on XACML (eXtensible Access Control Markup Language) policy.We introduce a policy based segmentation technique to accurately identify policy anomalies and derive effective anomaly resolutions, along with an intuitive visualization representation of analysis results. We also discuss a proof-of-concept […]
Detecting Distributed Reflection DoS Attacks based on Rank Correlation
DDoS presents a serious threat to the Internet since its inception, where lots of controlled hosts flood the victim site with massive packets. Moreover, in Distributed Reflection DoS (DRDoS), attackers fool innocent servers (reflectors) into flushing packets to the victim. But most of current DRDoS detection mechanisms are associated with specific protocols and cannot be […]
Measuring Time required to compromise a computer system
In this paper three measurement methods – the time between compromises, the time to first compromise and the overall time to compromise .A frequent assumption in the domain of cyber security is that cyber intrusions follow the properties of a Poisson process, i.e., that the number of intrusions are well modeled by a Poisson distribution […]
Cloud oriented Content Delivery Network paradigm within a multi-provider Networked Cloud Environment
In this paper is placed on the introduction, design and assessment of a complete model and framework aiming specifically at the deployment of a Cloud oriented Content Delivery Network paradigm within a multi-provider Networked Cloud Environment. A hierarchical framework is proposed and evaluated towards an efficient and scalable solution of content distribution over a multi-provider […]
TDMA SCHEDULE FOR CONTINUOUS DATA COLLECTION WITH DYNAMIC TRAFFIC PATTERNS
We have presented a TDMA schedule that is suited to continuous data collection with dynamic traffic patterns. In contrast to most existing TDMA schedules designed for a static network traffic pattern, this paper proposes a novel TDMA schedule that is capable of efficiently collecting sensor data for any network traffic pattern and is thus well […]
Optimizing the performance of a class of distributed systems over the Internet
In this paper, we present a mathematical model and an algorithmic solution to the client-server assignment problem. a large number of clients who communicate with each other indirectly via a number of intermediate servers. Optimizing the overall performance of such a system then can be formulated as a client-server assignment problem whose aim is to […]
HIGH UTILIZATION STRATEGIES FOR COMPUTATIONAL ECONOMIES
Utility computing models have long been the focus of academic research, and with the recent success of commercial cloud providers, computation and storage is finally being realized as the fifth utility. Computational economies are often proposed as an efficient means of resource allocation , however adoption has been limited due to a lack of performance […]
Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems
A global snapshot represents a consistent global state of the system. A global state is consistent if and only if all pairs of its constituent local states of processors are consistent, i.e., if the receiving event of message is recorded, the sending event of the same message must also be recorded, and all in-transit messages […]
FUSION-BASED FAULT TOLERANT DATA STRUCTURES HOSTED ON DISTRIBUTED SERVER
In this paper, we present a technique referred to as fusion which combines the best of both these worlds to achieve the space efficiency of coding and the minimal update overhead of replication. Given a set of data structures, we maintain a set of fused backup data structures that can tolerate f crash faults among […]
- « Previous Page
- 1
- …
- 6
- 7
- 8
- 9
- 10
- …
- 12
- Next Page »