Frontiers of Optoelectronics, 2010, 3 (2): 198, 网络出版: 2012-09-20  

Characteristics analysis of parasitic storage

Characteristics analysis of parasitic storage
作者单位
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.
参考文献

[1] Chen J C, He P, Ge X Z. Dynamics analysis method of cellular automata for complex networking storage system. Journal of Software, 2008, 19(10): 2517-2526

[2] Chen J C. The potential of storage parasitized on the Internet. Communications of the CCF, 2008, 4(11): 59-62 (in Chinese)

[3] Barabasi A L, Freeh V W, Jeong H, Brockman J B. Parasitic computing. Nature, 2001, 412(6850): 894-897

[4] Zalewski M. Silence on the Wire: A Field Guide to Passive Reconnaissance and Indirect Attacks. San Francisco: No Starch Press, 2005

[5] Gill J, Burge L, Li J. Floating parasitic data storage. In: Proceedings of the International Conference on Internet Computing. Bogart: CSREA Press, 2004, 960-965

[6] Rosenfeld K, Sencar H T, Memon N. Volleystore: a parasitic storage framework. In: Proceedings of the IEEE Workshop on Information Assurance and Security. Los Alamitos: IEEE, 2007, 67-75

[7] Wang Y X, Jiang B L, Wang C Y. Probability Theory, Stochastic Processes and Mathematical Statistics. Beijing: Beijing University of Posts and Telecommunications Press, 2008 (in Chinese)

[8] Bolch G, Greiner S, de Meer H, Trivedi K S. Queuing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications. New York: John Wiley and Sons, 1998

[9] Lin C. Computer Networks and Computer Systems Performance Evaluation. Beijing: Tsinghua University Press, 2001 (in Chinese)

[10] Melander B, Bjorkman M, Gunningberg P. A new end-to-end probing and analysis method for estimating bandwidth bottlenecks. In: Proceedings of the IEEE Global Telecommunications Conference. Piscataway: IEEE, 2000, 1: 415-420

[11] Barford P, Crovella M. Generating representative web workloads for network and server performance evaluation. ACM SIGMETRICS Performance Evaluation Review, 1998, 26(1): 151-160

Jincai CHEN, Jiang ZHOU, Gongye ZHOU. Characteristics analysis of parasitic storage[J]. Frontiers of Optoelectronics, 2010, 3(2): 198. Jincai CHEN, Jiang ZHOU, Gongye ZHOU. Characteristics analysis of parasitic storage[J]. Frontiers of Optoelectronics, 2010, 3(2): 198.

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!