网络光盘库的应用性能研究
|
摘要
数字化信息的爆炸性增长使得人们需要对海量数据进行可靠的存储与有效的利用。网络光盘库作为层次化海量存储中的一种准在线存储设备,在科研、生产等广泛领域中具有非常重要的应用价值,提高其应用性能是改善超大容量存储仪器实际应用的关键。
本文在深入研究网络光盘库基本模型的基础上,对影响网络光盘库应用性能的因素进行深入的研究分析,探索提高传输性能的途径和方法,为网络光盘库的实际应用提供了坚实的理论和实验基础。论文主要内容包括:
首先,研究了网络光盘库的用户访问请求到达的特点,建立了具有不同优先权的用户排队模型。在深入研究用户访问行为之间逻辑联系的基础上,构建了具有时效性和重复性的“主动限制多访问模型”,为提高网络光盘库的应用性能提供了新的模型基础。
其次,论文分析了网络光盘库的Cache与磁盘中的Cache区别,为网络光盘库建立了在不同的访问负载条件下的Cache替换算法。研究表明,通过建立有效的负载处理机制,可以减少对光盘库的操作次数,提高网络光盘库存取速度,从而改善海量存储系统性能。
第三,论文针对网络光盘库的实际应用环境,利用线性神经网络方法对网络光盘库的应用性能进行了分析;结合网络光盘库的应用特点,建立了网络光盘库的对等系统模型。分析表明,通过建立对等系统模型,网络光盘库不仅能够降低系统的响应时间,还可以提高系统的吞吐量,有效降低系统的访问负载。
最后,论文在上述研究的基础上,利用附网存储的模块化方法,设计并实现了网络光盘库的软硬件模块结构,并在此基础上,结合本文的研究内容对网络光盘库的实际性能进行了实验评测。测试结果表明:在实际的应用中,采用新处理机制的网络光盘库有很高的应用性能。这种通过对用户访问行为进行有效处理的机制,为超大容量数据存储仪器的网络化应用提供了一种新的方案,使网络光盘库具有高性能、高可用性、可扩展、易管理等特点。
The explosive increase of digital information demands a reliable storage and effective utilization for mass data. As a partial online storage facility in the hierarchical mass storage, Network Attached Optical Jukebox has a very important application value in scientific research, production and many other fields. The key of improving the application of super-big capacity storage instruments is to enhance its application performance.
In this thesis, based on the advanced research on the basic model of Network Attached Optical Jukebox, the factors that influence the application performance of Network Attached Optical Jukebox were analyzed, and the approaches and methods for improving the transfer performance were probed. All of them provided a solid academic and experimental foundation for the application of Network Attached Optical Jukebox. The main contents of the thesis include:
Firstly, the characteristics of the arrival of user’s accessing requests of the Network Attached Optical Jukebox were investigated. Based on it, a queuing model with different priorities was constructed, and the key factors including the priorities of each class were analyzed and calculated. Based on the research on the logical relationship between the user’s accessing behaviors, an“Active Restricted Multi-Accessing Model”with time-effectiveness and repetitiveness was built, so that a new model foundation for the improvement of the Network Attached Optical Jukebox application was provided.
Secondly, the difference between the Caches in the Network Attached Optical Jukebox and in the magnetic disk was analyzed in the thesis. Based on the“Active Restricted Multi-Accessing Model”, the Cache substitution algorithm under the different accessing load conditions was derived for the Network Attached Optical Jukebox. The research work showed that, the operation times to the Network Attached Optical Jukebox can be reduced by the effective load processing mechanism, so that the access capability can be improved, and the performance of the mass storage system was enhanced.
Thirdly, aiming at the real application environment of the Network Attached Optical Jukebox, its application capacity was evaluated by the linear neural network algorithm. Based on the research on the Peer-to-Peer System, combining the application characteristics of the Network Attached Optical Jukebox, the Peer-to-Peer System model of the Network Attached Optical Jukebox was created. It showed that, by the Peer-to-Peer model, the Network Attached Optical Jukebox could not only reduce the system responding time, but also enhance the system throughout. Thereby the system accessing load quantity was reduced.
Finally, based on the above research work, the software and hardware module structure was designed and implemented by the Network Attached Storage, and the application performance of the Network Attached Optical Jukebox was evaluated via experiments. The testing results showed that, the Network Attached Optical Jukebox with the new processing mechanism had a high application performance in practical use. The mechanism which effectively dealt with the user’s accessing behaviors provided a new plan for the networking application of the super-big capacity storage instruments, and made the Network Attached Optical Jukebox with the characteristics of high capacity, high usability, extendibility, and easy to manage.
本文在深入研究网络光盘库基本模型的基础上,对影响网络光盘库应用性能的因素进行深入的研究分析,探索提高传输性能的途径和方法,为网络光盘库的实际应用提供了坚实的理论和实验基础。论文主要内容包括:
首先,研究了网络光盘库的用户访问请求到达的特点,建立了具有不同优先权的用户排队模型。在深入研究用户访问行为之间逻辑联系的基础上,构建了具有时效性和重复性的“主动限制多访问模型”,为提高网络光盘库的应用性能提供了新的模型基础。
其次,论文分析了网络光盘库的Cache与磁盘中的Cache区别,为网络光盘库建立了在不同的访问负载条件下的Cache替换算法。研究表明,通过建立有效的负载处理机制,可以减少对光盘库的操作次数,提高网络光盘库存取速度,从而改善海量存储系统性能。
第三,论文针对网络光盘库的实际应用环境,利用线性神经网络方法对网络光盘库的应用性能进行了分析;结合网络光盘库的应用特点,建立了网络光盘库的对等系统模型。分析表明,通过建立对等系统模型,网络光盘库不仅能够降低系统的响应时间,还可以提高系统的吞吐量,有效降低系统的访问负载。
最后,论文在上述研究的基础上,利用附网存储的模块化方法,设计并实现了网络光盘库的软硬件模块结构,并在此基础上,结合本文的研究内容对网络光盘库的实际性能进行了实验评测。测试结果表明:在实际的应用中,采用新处理机制的网络光盘库有很高的应用性能。这种通过对用户访问行为进行有效处理的机制,为超大容量数据存储仪器的网络化应用提供了一种新的方案,使网络光盘库具有高性能、高可用性、可扩展、易管理等特点。
The explosive increase of digital information demands a reliable storage and effective utilization for mass data. As a partial online storage facility in the hierarchical mass storage, Network Attached Optical Jukebox has a very important application value in scientific research, production and many other fields. The key of improving the application of super-big capacity storage instruments is to enhance its application performance.
In this thesis, based on the advanced research on the basic model of Network Attached Optical Jukebox, the factors that influence the application performance of Network Attached Optical Jukebox were analyzed, and the approaches and methods for improving the transfer performance were probed. All of them provided a solid academic and experimental foundation for the application of Network Attached Optical Jukebox. The main contents of the thesis include:
Firstly, the characteristics of the arrival of user’s accessing requests of the Network Attached Optical Jukebox were investigated. Based on it, a queuing model with different priorities was constructed, and the key factors including the priorities of each class were analyzed and calculated. Based on the research on the logical relationship between the user’s accessing behaviors, an“Active Restricted Multi-Accessing Model”with time-effectiveness and repetitiveness was built, so that a new model foundation for the improvement of the Network Attached Optical Jukebox application was provided.
Secondly, the difference between the Caches in the Network Attached Optical Jukebox and in the magnetic disk was analyzed in the thesis. Based on the“Active Restricted Multi-Accessing Model”, the Cache substitution algorithm under the different accessing load conditions was derived for the Network Attached Optical Jukebox. The research work showed that, the operation times to the Network Attached Optical Jukebox can be reduced by the effective load processing mechanism, so that the access capability can be improved, and the performance of the mass storage system was enhanced.
Thirdly, aiming at the real application environment of the Network Attached Optical Jukebox, its application capacity was evaluated by the linear neural network algorithm. Based on the research on the Peer-to-Peer System, combining the application characteristics of the Network Attached Optical Jukebox, the Peer-to-Peer System model of the Network Attached Optical Jukebox was created. It showed that, by the Peer-to-Peer model, the Network Attached Optical Jukebox could not only reduce the system responding time, but also enhance the system throughout. Thereby the system accessing load quantity was reduced.
Finally, based on the above research work, the software and hardware module structure was designed and implemented by the Network Attached Storage, and the application performance of the Network Attached Optical Jukebox was evaluated via experiments. The testing results showed that, the Network Attached Optical Jukebox with the new processing mechanism had a high application performance in practical use. The mechanism which effectively dealt with the user’s accessing behaviors provided a new plan for the networking application of the super-big capacity storage instruments, and made the Network Attached Optical Jukebox with the characteristics of high capacity, high usability, extendibility, and easy to manage.
引文
[1] 谢长生. 数字时代信息存储技术的发展. 计算机世界, (34): 4-5, 2001.
[2] J. Tárraga Giménez. Teraserver: A Scalable Terabyte Continuous Media Server. [Ph.D. dissertation]. July 2001.
[3] Marc Farley 著. SAN 存储局域网(孙功星, 蒋文保, 范勇等译). 北京: 机械工业出版社, 2001.
[4] 张江陵, 冯丹著. 海量信息存储. 北京:科学出版社, 2003.
[5] School of Information Management and Systems. How Much Information? 2003. University of California at Berkeley, 2003.
[6] http://www.businessweek.com/ap/financialnews/D8NM9BDG0.htm.
[7] Jeanne Behnke, Alla Lake. Eosdis: Archive and distribution systems in 2000. 17th IEEE Symposium on Mass Storage Systems, April 2000.
[8] Johnson, Theodore. Analytical performance model of robotic storage libraries. Performance Evaluation, 1996.
[9] Andrew Hanushevsky, Marcia Nowark. Pursuit of a Scalable High Performance Multi-Petabyte Database, 16th IEEE Symposium on Mass Storage Systems, 1999.
[10] Kai Hwang. Advanced Computer Architecture Parallelism Scalability Programmability. McGraw-Hill Companies, Inc., 1993.
[11] 陈国良, 吴俊敏等. 并行计算机体系结构. 北京: 高等教育出版社, 2002.
[12] Tikekar, Rahul V., et al. Generalized storage model for tertiary storage based systems, Proceedings of the International Database Engineering & Applications Symposium, 1997, 161-170.
[13] Moinzadeh, Kamran, et al. Archiving model for a hierarchical information storage environment, European Journal of Operational Research, 2000, 123(1): 206-225.
[14] Myllymaki, Jussi, et al. Relational joins for data on tertiary storage, Proceedings - International Conference on Data Engineering, 1997, 159-168.
[15] Mookerjee, Vijay S., Policies for data archival in hierarchical storage management, European Journal of Operational Research. 2002, 138(2): 413-435.
[16] Aekyung Moon, Kyungho On, et al. Performance of dynamic load balanced join algorithms in shared disk parallel database systems, Proceedings. 7th IEEE Workshop on Future Trends of Distributed Computing Systems, 1999.
[17] Shoshani, A. Sim, A. Bernardo, et al. Coordinating simultaneous caching of file bundles from tertiary, Scientific and Statistical Database Management, 2000. Proceedings. 12th International Conference on, 2000.
[18] X. Shen, W. Liao, et al. A novel application development environment for large-scale scientific computations, Proceedings of the 14th international conference on Supercomputing. 2000.
[19] 徐端颐. 光盘存储系统设计原理. 北京:国防工业出版社, 2000.
[20] Furumiya, et al. Optical disk recording system of 25GB capacity. Proceedings of SPIE - The International Society for Optical Engineering 2002, 4342: 186-193.
[21] 清华大学光盘国家工程研究中心专家组. 蓝光光盘技术及进展. 记录媒体技术, 2003, 1: 37-39.
[22] John Woelbern, Achieving One Terabyte per Cartridge by breaking the tape area density barrier, http://www.thic.org/Agenda_0110.html, Oct. 2001.
[23] Lugar, J., Hierarchical storage management: leveraging new capabilities, IT Professional, 2001, 3(2): 53–55.
[24] Pentakalos, O.I. Menasce, et al. Analytical performance modeling of hierarchical mass storage systems, Computers, IEEE Transactions on, 1997, 46(10): 1103-1118.
[25] Athena Vakali, Evimaria Terzi. Multimedia data storage and representation issues on tertiary storage subsystems: an overview. ACM SIGOPS Operating Systems Review. 2001, 35(2): 61–77.
[26] Prabhakar, Sunil, Agrawal, et al. Scheduling tertiary I/O in database applications, Conference on Database and Expert Systems Applications - DEXA, 1997, 722-727.
[27] Aekyung Moon, Kyungho On, Haengrae Cho, Performance of dynamic load balanced join algorithms in shared disk parallel database systems, Distributed Computing Systems, Proceedings. 7th IEEE Workshop on Future Trends of, 1999, 176-181.
[28] Ford, D.A., Dismountable media management in tertiary storage systems. IEEE Transactions on Knowledge and Data Engineering, 1997, 9(2): 350-351.
[29] Ogawa, S. Kamimura, K. Kato, T. Uehara, T., Performance analysis of hierarchical storage management systems for video retrieval system, Consumer Electronics, ICCE. International Conference on, 2001: 328–329.
[30] Hahn, Ulrich; Dilling, et al. Improved adaptive replacement algorithm for disk caches in HSM systems, Digest of Papers - IEEE Symposium on Mass Storage Systems, 1999: 128-140.
[31] Segarra, Juan, Placement of storage capacity in distributed video servers, IEEE International Conference on Communications. 2002, 4: 2537-2541.
[32] Vakali, Athena, et al. Hierarchical data placement for navigational multimedia applications. Data and Knowledge Engineering. 2003, 44(1): 49-80.
[33] Escobar-Molano, M.L. Lanfeng, et al. Improved data layouts for fault tolerant multimedia systems, Multimedia and Expo, IEEE International Conference on, 2000, 3: 1429-1432.
[34] Carretero, Jesus, A hierarchical disk scheduler for multimedia systems, Future Generation Computer Systems, 2003, 19(1): 23-35.
[35] Chen, Peter M., Reliability hierarchies, Proceedings of the Workshop on Hot Topics in Operating Systems, 1999: 168-173.
[36] Ueno, Masahiro, Disaster-tolerant widely distributed file system using optical disk libraries, Japanese Journal of Applied Physics, 1999: 1795-1805.
[37] Maria Eva Lijding, Sape J. Mullender, Pierre G. Jansen, Implementing and Evaluating Jukebox Schedulers Using JukeTools. 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003: 92-96.
[38] ChanHo Moon, Hyunchul Kang, Heuristic algorithms for I/O scheduling for efficient retrieval of large objects from tertiary storage, Database Conference, 2001. ADC 2001. Proceedings. 12th Australasian, 2001: 145-152.
[39] D. A. Patterson, G. A. Garth, R. H. Katz, A Case for Redundant Arrays of Inexpensive Disks (RAID), Proceedings of the ACM SIGMOD Conference on Management of Data. 1988: 109-116.
[40] Shenze Chen, D. Towsley, A performance evaluation of RAID architectures, IEEE Transactions on Computers, 1996, 45(10): 1116-1130.
[41] L. Golubchik, R.R. Muntz, et al. Design of fault-tolerant large-scale VOD servers: With emphasis on high-performance and low-cost, IEEE Transactions on Parallel and Distributed Systems, 2001, 12(4): 363-386.
[42] Chervenak, Ann L., Challenges for tertiary storage in multimedia servers, Parallel Computing, 1998, 24(1): 157-176.
[43] Ford, Daniel A., Morris, et al. Redundant arrays of independent libraries (RAIL): the StarFish tertiary storage system, Parallel Computing, 1998, 24(1): 45-64.
[44] Makoto Takayanagi, Hidetoshi Tatemichi, et al. Redundant Optical Storage System Using DVD-RAM Library. 16th IEEE Symposium on Mass Storage Systems, 1999: 80-87.
[45] J. Tárraga, R.D. Hersch, Parallel file striping on optical jukebox servers, Proc. 2002 IEEE International Conference on Multimedia and Expo, 2002, 2: 73-176.
[46] Suzuki, Hideharu, Performance analysis of a storage hierarchy for video servers, Systems and Computers in Japan, 1997, 28(7): 11-20.
[47] Shiao-Li Tsao, A low cost optical storage server for near video-on-demand systems, Broadcasting, IEEE Transactions on, 2001, 47(1): 56–65.
[48] Ren-Hung Hwang, Pin-Hao Chi. Fast Optimal Video Placement Algorithms for Hierarchical Video-On-Demand Systems. IEEE Transactions on Broadcasting, 2001, 47(4): 357-366.
[49] R. H. Hwang, Y. C. Sun. Optimal video placement for hierarchical video-on-demand systems, IEEE Trans. Broadcasting, 1998, 44: 392-401.
[50] 陈玉鹏. 超大容量可换介质存储系统性能模型及应用的研究. [博士学位论文]. 北京: 清华大学精密仪器与机械学系, 2003.
[51] 徐敏. 用于数字电影制作系统的光盘阵列塔的设计研究. [博士学位论文]. 北京: 清华大学精密仪器与机械学系, 1999.
[52] Sung Bae Jun, Won Suk Lee. Video allocation methods in a multi-level server for large-scale VOD services, Consumer Electronics, IEEE Transactions on, 1998, 44(4): 1309-1318.
[53] Dave Anderson. Task Force on Network Storage Architecture: Network Attached Storage is Inevitable. IEEE System Sciences. Proceedings of the thirtieth Hwaii International Conference on. 1997, 1.
[54] Barry Phillips. Have Storage Area Networks Have Come of Age. IEEE Computer. 1998, 31(7).
[55] Ma, Gang, Khaleel, Adnan,et al. Narasimha, Performance evaluation of storage systems based on network-attached disks, IEEE Transactions on Parallel and Distributed Systems, 2000, 11 (9): 956-968.
[56] Riedel, E. Faloutsos, C. Gibson, et al. Active disks for large-scale data processing, Computer, 2001, 34(6): 68-74.
[57] IBM Corporation, International Technical Support Organization, Dept., IP Storage Networking: IBM NAS & iSCSI Solutions, First Edition, June 2001.
[58] 林闯. 计算机网络和计算机系统的性能评价. 北京:清华大学出版社, 2001.
[59] 何宁. 网络光盘库在海量存储系统中的应用研究. [D]. 北京: 清华大学精密仪器与机械学系, 2004.
[60] R. Pendse, R. Bhagavathula, Performance of LRU block replacement algorithm with pre-fetching, Proceedings of Midwest Symposium on Circuits and Systems, 9-12 Aug 1998, Page(s): 86 -89.
[61] R. Bhagavathula, P. Chittoor, R. Pendse, Pipeline LRU block replacement algorithm, Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems, 2000, Volume: 1, Page(s): 404-407.
[62] J. Van den Berg, D. T oswley, Properties of the miss ratio for a 2-level storage model with LRU or FIFO replacement strategy and independent references, IEEE Transactions on Computers, Apr 1993, Volume: 42 Issue: 4, Page(s): 508-512.
[63] Elizabeth J.O'Neil, Patrick E.O'Neil, Gerhard Weikum. The LRU-K Page Replacement Algorithm For Database Disk Buffering. ACM SIGMOD'93 Washington, DC, USA: pp207-306, 1993.
[64] Theodore Johnson, Dennis Shasha. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. Proceedings of the 20th VLDB Conference, Santiago, Chile: pp439-450, 1994.
[65] John T. Robinson, Murthy V. Devarakonda. Data Cache Management Using Frequency-Based Replacement. ACM: pp134-142, 1990.
[66] Donghee Leet, Jongmoo Choit, Jong-Hun Kim, etc. On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies. ACM SIGMETRICS'99 5/99 Atlanta. Georgia, USA: pp134-143, 1999.
[67] Donghee Leet, Jongmoo Choit, Jong-Hun Kim, etc. LRFU a spectrum of policies that subsumes the least recently used and least frequently used policies. New York, Wiley, 2001.
[68] Yannis Smaragdakis, Scott Kaplan, Paul Wilson. The EELRU adaptive replacement algorithm. Performance Evaluation 53 (2003): 93-123, Elsevier, 2002.
[69] Song Jiang, Xiaodong Zhang. LIRS: An Efficient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance. ACM SIGMETRICS Conference, 2002.
[70] Nimrod Megiddo and Dharmendra S. Modha. ARC: A Self-Tuning, Lowoverhead Replacement Cache. USENIX File & Storage Technologies Conference (FAST), March 31, San Francisco, CA, 2003.
[71] Yuanyuan Zhou, Zhifeng Chen, and Kai Li. Second-Level Buffer Cache Management. IEEE Transactions on Parallel and Distributed Systems, VOL.15, NO.6: pp505-519, June 2004.
[72] Sokolinsky L.B. LFU-K: An Effective Buffer Management Replacement Algorithm, Database Systems for Advances Applications, 9th International Conference, DASFAA 2004, Jeju Island, Korea, March 17-19, 2004, Proceedings. Lecture Notes in Computer Science. Volume. 2973. Springer: pp670-681, 2004.
[73] Humayun Khalidb, M.S. Obaidat. KORA: A New Cache Replacement Scheme. Computers and Electrical Engineering 26: pp187-206, Elsevier, 2000.
[74] G. K. Zipf, The Psychobiology of Language, Houghton-Mifflin, Boston, 1935.
[75] G. K. Zipf, Human Behavior and the Principle of Least Effort, Reading, Mass.: Addison-Wesley, 1949.
[76] 孙荣恒, 李建平. 排队论基础. 北京: 科学出版社, 2002.
[77] 盛友招. 排队论及其在计算机通信中的应用 . 北京: 北京邮电大学出版社, 1998.
[78] 徐光辉. 随机服务系统(第二版). 北京: 科学出版社, 1988.
[79] 苏兆龙. 排队论基础. 成都: 成都科技大学出版社, 1998.
[80] Beauchamp C. 使用 Brocade 光纤交换机建立 SAN 存储区域网. 清华开放网络存储实验室, 清华诚志科技发展有限公司译. 北京: 机械工业出版社, 2002.
[81] Simitci H. Storage network performance analysis. IN: Wiley Publishing, Inc., 2003
[82] 孙照炎. 基于生物免疫机制的附网存储关键技术研究. [博士学位论文]. 北京: 清华大学精密仪器与机械学系, 2004.
[83] 吴敬莲. 模块化网络存储设备的设计研究. [硕士学位论文]. 北京: 清华大学精密仪器与机械学系, 2002.
[84] Holland J H. Adaption in natural and artificial systems [M]. Ann Arbor MI, University of Michigan Press, 1975.
[85] Michalewicz, Z. Genetic algorithms + data structures = evolution programs [M]. Berlin: Springer-Verlag, 1994.
[86] Nils J. Nilsson. Artificial intelligence: A new synthesis. San Fransisco: Morgan Kaufmann, 1999.
[87] Simon Haykin. Neural Network: A Comprehensive Foundation [M]. NJ: Prentice Hall, Upper Saddle River, 1999.
[88] David MacKay. Information Theory, Inference, and Learning Algorithms, London: Cambridge University Press, 2003.
[89] 袁曾任. 人工神经元网络及其应用. 北京: 清华大学出版社, 1999.
[90] Javadpour Roya, Knapp Gerald M. A fuzzy neural network approach to machine condition monitoring. Computers and Industrial Engineering, 2003, 45(2):323-330.
[91] Lin Faa.Jeng, Wai Rong Jong. Robust recurrent fuzzy neural network control for linear synchronous motor drive system. Neurocomputing, 2003(1):365-390.
[92] Nabeshima K,Suzudo T,Ohno T,Kudo K.Nuclear reactor monitoring with the combination of neural network and expert system. Mathematics and Computers in Simulation, 2002, 60(3-5):233-244.
[93] Wu Min, She Jin Hua, Nakano Michio. An expert control system using neural networks for the electrolytic process in zinc hydrometallurgy[J]. Engineering Applications of Artificial Intelligence, 2001, 14(5):589-598.
[94] Lee Malrey. Evolution of behaviors in autonomous robot using artificial neural network and genetic algorithm. Information Sciences, 2003, 155(1-2):43-60.
[95] Shapiro Amold F.The merging of neural networks, fuzzy logic and genetic algorithms. Insurance: Mathematics and Economics, 2002, 31(1):115-131.
[96] 杨建刚. 人工神经网络实用教程. 杭州: 浙江大学出版社. 2002 年 3 月.
[97] 罗杰文. Peer-to-Peer 综述. 中科院计算技术研究所. 2005 年 11 月.
[98] 张联峰, 刘乃安, 钱秀槟, 张玉清. 对等网技术综述. 计算机工程与应用. 2003年 12 月.
[99] TianWang. http://e.pku.edu.cn/.
[100] Google. http://www.google.com/.
[101] Global Grid Forum. http://www.gridforum.org/.
[102] Napster. http://www.Napster.com/.
[103] Gnutella. http://www.gnutella.com/.
[104] Kubiatowicz J, Bindel D, Eaton P, Chen Y, Geels D, Gummadi R, Rhea S, Weimer W, Wells C, Weatherspoon H, Zhao B. OceanStore: An architecture for globalscale persistent storage. ACM SIGPLAN Notices, 2000, 35(11):190-201.
[105] Zhao BY, Kubiatowicz J, Joseph AD. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report, UCB//CSD- 01-1141, Berkeley Computer Science Division, University of California, 2001.
[106] Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I. Wide-Area cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001). Banff: Chateau Lake Louise, 2001.
[107] Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference. 2001.
[108] Druschel P, Rowstron A. PAST: A large-scale persistent peer-to-peer storage utility. In: Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems VIII. 2001.
[109] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). 2001.
[110] Ratnasamy S, Francis P, Handley M, Karp R, Padhye J, Shenker S. Grass-Roots content distribution: RAID meets the Web. 2001. http://www.aciri.org/sylvia/.
[111] Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM Symposium on Communication, Architecture, and Protocols. ACM SIGCOMM, 2001: 161-172.
[112] Bolosky WJ, Douceur JR, Ely D, Theimer M. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: Measurement and Modeling of Computer Systems. 2000. 34-43.
[113] Bolosky WJ, Corbin S, Goebel D, Douceur J R. Single instance storage in Windows 2000. http://research.microsoft.com/farsite/ WSS2000.pdf.
[114] Waldman M, Rubin AD, Cranor LF. Publius: A robust, tamper-evident, censorship- resistant, web publishing system. In: Proceedings of the 9th USENIX Security Symposium. 2000.
[115] Clarke I, Sandberg O, Wiley B, Hong T. Freenet: A distributed anonymous information storage and retrieval system. In: ICSI Workshop on Design Issues in Anonymity and Unobservability. 2000.
[116] Yang B, Garcia-Molina H. Efficient search in peer-to-peer networks. In: Proceedings of the International Conference on Distributed Computing Systems (ICDCS), 2002.
[117] Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. Technical Report, CS Department, Duke University, 2002. http://issg.cs.duke.edu/search/.
[118] Prinkey MT. An efficient scheme for query processing on peer-to-peer networks. http://aeolusres.homestead.com/files/index.html.
[119] 王庆波, 代亚非, 田敬, 赵通, 李晓明. 基于特征信息定位的 P2P 网络模型: Barnet. 软件学报. 2003, 14(8).
[120] 童时中. 模块化原理设计方法及应用. 北京:中国标准出版社, 2000.
[121] 阎会峰, 徐问之. PCI 总线高速接口卡设计技术. 计算机应用, 2001, 21(6): 86-87.
[122] 蒋昌龙. 柔性并行高速数据记录系统的研究与实现. [博士学位论文]. 北京:清华大学精密仪器与机械学系, 2003.
[123] 陈莉君. 深入分析 Linux 内核源代码. 北京: 人民邮电出版社, 2002.
[124] 孙垚, 孙新亚, 古吟东. 一种基于 Intel x86 平台和 Linux 操作系统的数据采集器. 自动化仪表, 2003, 24(5): 38-41.
[125] http://www.veritest.com/benchmarks/netbench/default.asp.
[2] J. Tárraga Giménez. Teraserver: A Scalable Terabyte Continuous Media Server. [Ph.D. dissertation]. July 2001.
[3] Marc Farley 著. SAN 存储局域网(孙功星, 蒋文保, 范勇等译). 北京: 机械工业出版社, 2001.
[4] 张江陵, 冯丹著. 海量信息存储. 北京:科学出版社, 2003.
[5] School of Information Management and Systems. How Much Information? 2003. University of California at Berkeley, 2003.
[6] http://www.businessweek.com/ap/financialnews/D8NM9BDG0.htm.
[7] Jeanne Behnke, Alla Lake. Eosdis: Archive and distribution systems in 2000. 17th IEEE Symposium on Mass Storage Systems, April 2000.
[8] Johnson, Theodore. Analytical performance model of robotic storage libraries. Performance Evaluation, 1996.
[9] Andrew Hanushevsky, Marcia Nowark. Pursuit of a Scalable High Performance Multi-Petabyte Database, 16th IEEE Symposium on Mass Storage Systems, 1999.
[10] Kai Hwang. Advanced Computer Architecture Parallelism Scalability Programmability. McGraw-Hill Companies, Inc., 1993.
[11] 陈国良, 吴俊敏等. 并行计算机体系结构. 北京: 高等教育出版社, 2002.
[12] Tikekar, Rahul V., et al. Generalized storage model for tertiary storage based systems, Proceedings of the International Database Engineering & Applications Symposium, 1997, 161-170.
[13] Moinzadeh, Kamran, et al. Archiving model for a hierarchical information storage environment, European Journal of Operational Research, 2000, 123(1): 206-225.
[14] Myllymaki, Jussi, et al. Relational joins for data on tertiary storage, Proceedings - International Conference on Data Engineering, 1997, 159-168.
[15] Mookerjee, Vijay S., Policies for data archival in hierarchical storage management, European Journal of Operational Research. 2002, 138(2): 413-435.
[16] Aekyung Moon, Kyungho On, et al. Performance of dynamic load balanced join algorithms in shared disk parallel database systems, Proceedings. 7th IEEE Workshop on Future Trends of Distributed Computing Systems, 1999.
[17] Shoshani, A. Sim, A. Bernardo, et al. Coordinating simultaneous caching of file bundles from tertiary, Scientific and Statistical Database Management, 2000. Proceedings. 12th International Conference on, 2000.
[18] X. Shen, W. Liao, et al. A novel application development environment for large-scale scientific computations, Proceedings of the 14th international conference on Supercomputing. 2000.
[19] 徐端颐. 光盘存储系统设计原理. 北京:国防工业出版社, 2000.
[20] Furumiya, et al. Optical disk recording system of 25GB capacity. Proceedings of SPIE - The International Society for Optical Engineering 2002, 4342: 186-193.
[21] 清华大学光盘国家工程研究中心专家组. 蓝光光盘技术及进展. 记录媒体技术, 2003, 1: 37-39.
[22] John Woelbern, Achieving One Terabyte per Cartridge by breaking the tape area density barrier, http://www.thic.org/Agenda_0110.html, Oct. 2001.
[23] Lugar, J., Hierarchical storage management: leveraging new capabilities, IT Professional, 2001, 3(2): 53–55.
[24] Pentakalos, O.I. Menasce, et al. Analytical performance modeling of hierarchical mass storage systems, Computers, IEEE Transactions on, 1997, 46(10): 1103-1118.
[25] Athena Vakali, Evimaria Terzi. Multimedia data storage and representation issues on tertiary storage subsystems: an overview. ACM SIGOPS Operating Systems Review. 2001, 35(2): 61–77.
[26] Prabhakar, Sunil, Agrawal, et al. Scheduling tertiary I/O in database applications, Conference on Database and Expert Systems Applications - DEXA, 1997, 722-727.
[27] Aekyung Moon, Kyungho On, Haengrae Cho, Performance of dynamic load balanced join algorithms in shared disk parallel database systems, Distributed Computing Systems, Proceedings. 7th IEEE Workshop on Future Trends of, 1999, 176-181.
[28] Ford, D.A., Dismountable media management in tertiary storage systems. IEEE Transactions on Knowledge and Data Engineering, 1997, 9(2): 350-351.
[29] Ogawa, S. Kamimura, K. Kato, T. Uehara, T., Performance analysis of hierarchical storage management systems for video retrieval system, Consumer Electronics, ICCE. International Conference on, 2001: 328–329.
[30] Hahn, Ulrich; Dilling, et al. Improved adaptive replacement algorithm for disk caches in HSM systems, Digest of Papers - IEEE Symposium on Mass Storage Systems, 1999: 128-140.
[31] Segarra, Juan, Placement of storage capacity in distributed video servers, IEEE International Conference on Communications. 2002, 4: 2537-2541.
[32] Vakali, Athena, et al. Hierarchical data placement for navigational multimedia applications. Data and Knowledge Engineering. 2003, 44(1): 49-80.
[33] Escobar-Molano, M.L. Lanfeng, et al. Improved data layouts for fault tolerant multimedia systems, Multimedia and Expo, IEEE International Conference on, 2000, 3: 1429-1432.
[34] Carretero, Jesus, A hierarchical disk scheduler for multimedia systems, Future Generation Computer Systems, 2003, 19(1): 23-35.
[35] Chen, Peter M., Reliability hierarchies, Proceedings of the Workshop on Hot Topics in Operating Systems, 1999: 168-173.
[36] Ueno, Masahiro, Disaster-tolerant widely distributed file system using optical disk libraries, Japanese Journal of Applied Physics, 1999: 1795-1805.
[37] Maria Eva Lijding, Sape J. Mullender, Pierre G. Jansen, Implementing and Evaluating Jukebox Schedulers Using JukeTools. 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003: 92-96.
[38] ChanHo Moon, Hyunchul Kang, Heuristic algorithms for I/O scheduling for efficient retrieval of large objects from tertiary storage, Database Conference, 2001. ADC 2001. Proceedings. 12th Australasian, 2001: 145-152.
[39] D. A. Patterson, G. A. Garth, R. H. Katz, A Case for Redundant Arrays of Inexpensive Disks (RAID), Proceedings of the ACM SIGMOD Conference on Management of Data. 1988: 109-116.
[40] Shenze Chen, D. Towsley, A performance evaluation of RAID architectures, IEEE Transactions on Computers, 1996, 45(10): 1116-1130.
[41] L. Golubchik, R.R. Muntz, et al. Design of fault-tolerant large-scale VOD servers: With emphasis on high-performance and low-cost, IEEE Transactions on Parallel and Distributed Systems, 2001, 12(4): 363-386.
[42] Chervenak, Ann L., Challenges for tertiary storage in multimedia servers, Parallel Computing, 1998, 24(1): 157-176.
[43] Ford, Daniel A., Morris, et al. Redundant arrays of independent libraries (RAIL): the StarFish tertiary storage system, Parallel Computing, 1998, 24(1): 45-64.
[44] Makoto Takayanagi, Hidetoshi Tatemichi, et al. Redundant Optical Storage System Using DVD-RAM Library. 16th IEEE Symposium on Mass Storage Systems, 1999: 80-87.
[45] J. Tárraga, R.D. Hersch, Parallel file striping on optical jukebox servers, Proc. 2002 IEEE International Conference on Multimedia and Expo, 2002, 2: 73-176.
[46] Suzuki, Hideharu, Performance analysis of a storage hierarchy for video servers, Systems and Computers in Japan, 1997, 28(7): 11-20.
[47] Shiao-Li Tsao, A low cost optical storage server for near video-on-demand systems, Broadcasting, IEEE Transactions on, 2001, 47(1): 56–65.
[48] Ren-Hung Hwang, Pin-Hao Chi. Fast Optimal Video Placement Algorithms for Hierarchical Video-On-Demand Systems. IEEE Transactions on Broadcasting, 2001, 47(4): 357-366.
[49] R. H. Hwang, Y. C. Sun. Optimal video placement for hierarchical video-on-demand systems, IEEE Trans. Broadcasting, 1998, 44: 392-401.
[50] 陈玉鹏. 超大容量可换介质存储系统性能模型及应用的研究. [博士学位论文]. 北京: 清华大学精密仪器与机械学系, 2003.
[51] 徐敏. 用于数字电影制作系统的光盘阵列塔的设计研究. [博士学位论文]. 北京: 清华大学精密仪器与机械学系, 1999.
[52] Sung Bae Jun, Won Suk Lee. Video allocation methods in a multi-level server for large-scale VOD services, Consumer Electronics, IEEE Transactions on, 1998, 44(4): 1309-1318.
[53] Dave Anderson. Task Force on Network Storage Architecture: Network Attached Storage is Inevitable. IEEE System Sciences. Proceedings of the thirtieth Hwaii International Conference on. 1997, 1.
[54] Barry Phillips. Have Storage Area Networks Have Come of Age. IEEE Computer. 1998, 31(7).
[55] Ma, Gang, Khaleel, Adnan,et al. Narasimha, Performance evaluation of storage systems based on network-attached disks, IEEE Transactions on Parallel and Distributed Systems, 2000, 11 (9): 956-968.
[56] Riedel, E. Faloutsos, C. Gibson, et al. Active disks for large-scale data processing, Computer, 2001, 34(6): 68-74.
[57] IBM Corporation, International Technical Support Organization, Dept., IP Storage Networking: IBM NAS & iSCSI Solutions, First Edition, June 2001.
[58] 林闯. 计算机网络和计算机系统的性能评价. 北京:清华大学出版社, 2001.
[59] 何宁. 网络光盘库在海量存储系统中的应用研究. [D]. 北京: 清华大学精密仪器与机械学系, 2004.
[60] R. Pendse, R. Bhagavathula, Performance of LRU block replacement algorithm with pre-fetching, Proceedings of Midwest Symposium on Circuits and Systems, 9-12 Aug 1998, Page(s): 86 -89.
[61] R. Bhagavathula, P. Chittoor, R. Pendse, Pipeline LRU block replacement algorithm, Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems, 2000, Volume: 1, Page(s): 404-407.
[62] J. Van den Berg, D. T oswley, Properties of the miss ratio for a 2-level storage model with LRU or FIFO replacement strategy and independent references, IEEE Transactions on Computers, Apr 1993, Volume: 42 Issue: 4, Page(s): 508-512.
[63] Elizabeth J.O'Neil, Patrick E.O'Neil, Gerhard Weikum. The LRU-K Page Replacement Algorithm For Database Disk Buffering. ACM SIGMOD'93 Washington, DC, USA: pp207-306, 1993.
[64] Theodore Johnson, Dennis Shasha. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. Proceedings of the 20th VLDB Conference, Santiago, Chile: pp439-450, 1994.
[65] John T. Robinson, Murthy V. Devarakonda. Data Cache Management Using Frequency-Based Replacement. ACM: pp134-142, 1990.
[66] Donghee Leet, Jongmoo Choit, Jong-Hun Kim, etc. On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies. ACM SIGMETRICS'99 5/99 Atlanta. Georgia, USA: pp134-143, 1999.
[67] Donghee Leet, Jongmoo Choit, Jong-Hun Kim, etc. LRFU a spectrum of policies that subsumes the least recently used and least frequently used policies. New York, Wiley, 2001.
[68] Yannis Smaragdakis, Scott Kaplan, Paul Wilson. The EELRU adaptive replacement algorithm. Performance Evaluation 53 (2003): 93-123, Elsevier, 2002.
[69] Song Jiang, Xiaodong Zhang. LIRS: An Efficient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance. ACM SIGMETRICS Conference, 2002.
[70] Nimrod Megiddo and Dharmendra S. Modha. ARC: A Self-Tuning, Lowoverhead Replacement Cache. USENIX File & Storage Technologies Conference (FAST), March 31, San Francisco, CA, 2003.
[71] Yuanyuan Zhou, Zhifeng Chen, and Kai Li. Second-Level Buffer Cache Management. IEEE Transactions on Parallel and Distributed Systems, VOL.15, NO.6: pp505-519, June 2004.
[72] Sokolinsky L.B. LFU-K: An Effective Buffer Management Replacement Algorithm, Database Systems for Advances Applications, 9th International Conference, DASFAA 2004, Jeju Island, Korea, March 17-19, 2004, Proceedings. Lecture Notes in Computer Science. Volume. 2973. Springer: pp670-681, 2004.
[73] Humayun Khalidb, M.S. Obaidat. KORA: A New Cache Replacement Scheme. Computers and Electrical Engineering 26: pp187-206, Elsevier, 2000.
[74] G. K. Zipf, The Psychobiology of Language, Houghton-Mifflin, Boston, 1935.
[75] G. K. Zipf, Human Behavior and the Principle of Least Effort, Reading, Mass.: Addison-Wesley, 1949.
[76] 孙荣恒, 李建平. 排队论基础. 北京: 科学出版社, 2002.
[77] 盛友招. 排队论及其在计算机通信中的应用 . 北京: 北京邮电大学出版社, 1998.
[78] 徐光辉. 随机服务系统(第二版). 北京: 科学出版社, 1988.
[79] 苏兆龙. 排队论基础. 成都: 成都科技大学出版社, 1998.
[80] Beauchamp C. 使用 Brocade 光纤交换机建立 SAN 存储区域网. 清华开放网络存储实验室, 清华诚志科技发展有限公司译. 北京: 机械工业出版社, 2002.
[81] Simitci H. Storage network performance analysis. IN: Wiley Publishing, Inc., 2003
[82] 孙照炎. 基于生物免疫机制的附网存储关键技术研究. [博士学位论文]. 北京: 清华大学精密仪器与机械学系, 2004.
[83] 吴敬莲. 模块化网络存储设备的设计研究. [硕士学位论文]. 北京: 清华大学精密仪器与机械学系, 2002.
[84] Holland J H. Adaption in natural and artificial systems [M]. Ann Arbor MI, University of Michigan Press, 1975.
[85] Michalewicz, Z. Genetic algorithms + data structures = evolution programs [M]. Berlin: Springer-Verlag, 1994.
[86] Nils J. Nilsson. Artificial intelligence: A new synthesis. San Fransisco: Morgan Kaufmann, 1999.
[87] Simon Haykin. Neural Network: A Comprehensive Foundation [M]. NJ: Prentice Hall, Upper Saddle River, 1999.
[88] David MacKay. Information Theory, Inference, and Learning Algorithms, London: Cambridge University Press, 2003.
[89] 袁曾任. 人工神经元网络及其应用. 北京: 清华大学出版社, 1999.
[90] Javadpour Roya, Knapp Gerald M. A fuzzy neural network approach to machine condition monitoring. Computers and Industrial Engineering, 2003, 45(2):323-330.
[91] Lin Faa.Jeng, Wai Rong Jong. Robust recurrent fuzzy neural network control for linear synchronous motor drive system. Neurocomputing, 2003(1):365-390.
[92] Nabeshima K,Suzudo T,Ohno T,Kudo K.Nuclear reactor monitoring with the combination of neural network and expert system. Mathematics and Computers in Simulation, 2002, 60(3-5):233-244.
[93] Wu Min, She Jin Hua, Nakano Michio. An expert control system using neural networks for the electrolytic process in zinc hydrometallurgy[J]. Engineering Applications of Artificial Intelligence, 2001, 14(5):589-598.
[94] Lee Malrey. Evolution of behaviors in autonomous robot using artificial neural network and genetic algorithm. Information Sciences, 2003, 155(1-2):43-60.
[95] Shapiro Amold F.The merging of neural networks, fuzzy logic and genetic algorithms. Insurance: Mathematics and Economics, 2002, 31(1):115-131.
[96] 杨建刚. 人工神经网络实用教程. 杭州: 浙江大学出版社. 2002 年 3 月.
[97] 罗杰文. Peer-to-Peer 综述. 中科院计算技术研究所. 2005 年 11 月.
[98] 张联峰, 刘乃安, 钱秀槟, 张玉清. 对等网技术综述. 计算机工程与应用. 2003年 12 月.
[99] TianWang. http://e.pku.edu.cn/.
[100] Google. http://www.google.com/.
[101] Global Grid Forum. http://www.gridforum.org/.
[102] Napster. http://www.Napster.com/.
[103] Gnutella. http://www.gnutella.com/.
[104] Kubiatowicz J, Bindel D, Eaton P, Chen Y, Geels D, Gummadi R, Rhea S, Weimer W, Wells C, Weatherspoon H, Zhao B. OceanStore: An architecture for globalscale persistent storage. ACM SIGPLAN Notices, 2000, 35(11):190-201.
[105] Zhao BY, Kubiatowicz J, Joseph AD. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report, UCB//CSD- 01-1141, Berkeley Computer Science Division, University of California, 2001.
[106] Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I. Wide-Area cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001). Banff: Chateau Lake Louise, 2001.
[107] Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference. 2001.
[108] Druschel P, Rowstron A. PAST: A large-scale persistent peer-to-peer storage utility. In: Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems VIII. 2001.
[109] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). 2001.
[110] Ratnasamy S, Francis P, Handley M, Karp R, Padhye J, Shenker S. Grass-Roots content distribution: RAID meets the Web. 2001. http://www.aciri.org/sylvia/.
[111] Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM Symposium on Communication, Architecture, and Protocols. ACM SIGCOMM, 2001: 161-172.
[112] Bolosky WJ, Douceur JR, Ely D, Theimer M. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: Measurement and Modeling of Computer Systems. 2000. 34-43.
[113] Bolosky WJ, Corbin S, Goebel D, Douceur J R. Single instance storage in Windows 2000. http://research.microsoft.com/farsite/ WSS2000.pdf.
[114] Waldman M, Rubin AD, Cranor LF. Publius: A robust, tamper-evident, censorship- resistant, web publishing system. In: Proceedings of the 9th USENIX Security Symposium. 2000.
[115] Clarke I, Sandberg O, Wiley B, Hong T. Freenet: A distributed anonymous information storage and retrieval system. In: ICSI Workshop on Design Issues in Anonymity and Unobservability. 2000.
[116] Yang B, Garcia-Molina H. Efficient search in peer-to-peer networks. In: Proceedings of the International Conference on Distributed Computing Systems (ICDCS), 2002.
[117] Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. Technical Report, CS Department, Duke University, 2002. http://issg.cs.duke.edu/search/.
[118] Prinkey MT. An efficient scheme for query processing on peer-to-peer networks. http://aeolusres.homestead.com/files/index.html.
[119] 王庆波, 代亚非, 田敬, 赵通, 李晓明. 基于特征信息定位的 P2P 网络模型: Barnet. 软件学报. 2003, 14(8).
[120] 童时中. 模块化原理设计方法及应用. 北京:中国标准出版社, 2000.
[121] 阎会峰, 徐问之. PCI 总线高速接口卡设计技术. 计算机应用, 2001, 21(6): 86-87.
[122] 蒋昌龙. 柔性并行高速数据记录系统的研究与实现. [博士学位论文]. 北京:清华大学精密仪器与机械学系, 2003.
[123] 陈莉君. 深入分析 Linux 内核源代码. 北京: 人民邮电出版社, 2002.
[124] 孙垚, 孙新亚, 古吟东. 一种基于 Intel x86 平台和 Linux 操作系统的数据采集器. 自动化仪表, 2003, 24(5): 38-41.
[125] http://www.veritest.com/benchmarks/netbench/default.asp.