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 […]
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 […]
IMPROVED COLOR BARCODE WITH INTERFERENCE CANCELLATION
we propose a model-based interference cancellation procedure to overcome interference that is computationally inexpensive and provides a significant performance improvement. Specifically, we exploit this spectral diversity to realize a three-fold increase in the data rate by encoding independent data in the C, M, and Y print colorant channels and decoding the data from the complementary […]
Efficiently achieving data staging and caching in a cloud system
In this paper, we study this data staging problem by leveraging the dynamic programming (DP) techniques to optimally migrate, replicate, and cache the shared data items in cloud systems with or without some practical resource constraints in an efficient way while minimizing the monetary cost for transmitting and caching the data items.To this end, we […]
CLEAN-SLATE ROUTING IN SENSOR NETWORKS
Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium access control levels. This paper explores resource depletion attacks at the routing protocol layer, which permanently disable networks by quickly draining nodes’ […]
Towards Privacy-Preserving Location proof Updating System
Today’s location-sensitive service relies on user’s mobile device to determine the current location. This allows malicioususers to access a restricted resource or provide bogus alibis by cheating on their locations. To address this issue, we propose A Privacy -Preserving Location proof Updating System (APPLAUS) in which colocated Bluetooth enabled mobile devices mutually generate location proofs […]
Towards Statistically Strong Source Anonymity for Sensor Networks
In certain applications, the locations of events reported by a sensor network need to remain anonymous. That is , unauthorized observers must be unable to detect the origin of such events by analyzing the network traffic. Known as the source anonymity problem, this problem has emerged as an important topic in the security of wireless […]
Optimal Geographical Forwarding using Relay Selection in Wireless Sensor Networks with Sleep-Wake Cycling Nodes
Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the […]
- « Previous Page
- 1
- …
- 9
- 10
- 11
- 12
- 13
- Next Page »