|
|
|
Characteristics analysis of parasitic storage |
| Jincai CHEN,Jiang ZHOU,Gongye ZHOU, |
| College of Computer
Science and Technology, Wuhan National Laboratory for Optoelectronics,
Huazhong University of Science and Technology, Wuhan 430074, China; |
|
|
|
|
Abstract It has been approved that the message checking services of Internet protocols possess the capacity of parasitic computing for some non-deterministic polynomial (NP)-complete problems. Inspired by this thought, we wonder how to dig storage capacity over the Internet by means of the message processing mechanism of protocols without extra cost. As data packets may travel over the network for a period of time and return to the source site circularly, a large capacity and dynamic parasitic storage could be created by establishing the mechanism to guarantee a certain amount of data packets being sent and received repeatedly among network nodes. However, parasitic storage may affect the network to some extent and vary itself with the fluctuation of the network. To analyze the interaction between them, an analysis model has been constructed. With this model, we have explored the parasitic storage impacts on network and the characteristics of parasitic storage over complex network in the sense of probability.
|
|
Issue Date: 05 June 2010
|
|
|
Chen J C, He P, Ge X Z. Dynamics analysis method of cellularautomata for complex networking storage system. Journal of Software, 2008, 19(10): 2517―2526
doi: 10.3724/SP.J.1001.2008.02517
|
|
Chen J C. The potential of storage parasitized on the Internet. Communications of the CCF, 2008, 4(11): 59―62 (in Chinese)
|
|
Barabasi A L, Freeh V W, Jeong H, Brockman J B. Parasitic computing. Nature, 2001, 412(6850): 894―897
doi: 10.1038/35091039
|
|
Zalewski M. Silence on the Wire: A Field Guide to Passive Reconnaissanceand Indirect Attacks. San Francisco: No Starch Press, 2005
|
|
Gill J, Burge L, Li J. Floating parasitic data storage. In: Proceedings of the International Conference on Internet Computing. Bogart: CSREAPress, 2004, 960―965
|
|
Rosenfeld K, Sencar H T, Memon N. Volleystore: a parasiticstorage framework. In: Proceedings of theIEEE Workshop on Information Assurance and Security. Los Alamitos: IEEE, 2007, 67―75
|
|
Wang Y X, Jiang B L, Wang C Y. Probability Theory, Stochastic Processesand Mathematical Statistics. Beijing: Beijing University of Posts and TelecommunicationsPress, 2008 (in Chinese)
|
|
Bolch G, Greiner S, de Meer H, Trivedi K S. Queuing Networks and Markov Chains: Modeling and PerformanceEvaluation with Computer Science Applications. New York: John Wiley and Sons, 1998
|
|
Lin C. Computer Networks and Computer Systems Performance Evaluation. Beijing: Tsinghua University Press, 2001 (in Chinese)
|
|
Melander B, Bjorkman M, Gunningberg P. A new end-to-end probingand analysis method for estimating bandwidth bottlenecks. In: Proceedings of the IEEE Global TelecommunicationsConference. Piscataway: IEEE, 2000, 1: 415―420
|
|
Barford P, Crovella M. Generatingrepresentative web workloads for network and server performance evaluation. ACM SIGMETRICS Performance Evaluation Review, 1998, 26(1): 151―160
doi: 10.1145/277858.277897
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
