期刊文献+

一种可用于数据采集的接口协议方案

An Interface Protocol Used for Data Acquisition
原文传递
导出
摘要 海量数据的存储和检索是当前Internet运行和管理所面临的关键问题之一。本文分析了国内外对于网络数据存储的一些解决办法及其局限性,由路由查找算法得到启示,针对网络流量数据的特性,提出一种海量数据存储与检索方案。 Storage and Retrieval of Mass Data is the key concern on Internet operation and management at present. The authors analyze the solutions of mass network traffic data used by researchers and the limitations of these solutions. Then they are inspired by the Routing Search Algorithm. After having analyzed the characteristics of network traffic data and presented a new methodology for storage and retrieval of mass network traffic data.
作者 程琳 赵继业
出处 《无锡南洋职业技术学院论丛》 2008年第3期38-41,共4页 Journal of Wuxi South Ocean College
关键词 INTERNET 海量数据 网络流量 存储检索 Internet mass data network traffic storage and retrieval
  • 相关文献

参考文献5

二级参考文献40

  • 1Xu, Ke, Wu, Jian-ping, Wu, Jian. The analysis and design of fast route lookupalgorithms for high performance router. In: Kim, Kiseon, ed. Proceedings of the IEEEInternational Conference on ATM. San Francisco: IEEE Computer Society Press, 2001. 320~325.
  • 2Srinivasan, V. Fast and efficient Internet lookups [Ph.D. Thesis]. WashingtonUniversity, 1999.
  • 3Rekhter, Y., Li, T. An Architecturefor IP Address Allocation with CIDR. RFC 1518, 1993.
  • 4Fuller, V., Li, T., Yu, J., et al. Classless Inter-domain Routing (CIDR): anAddress Assignment and Aggregation Strategy. RFC 1519, 1993.
  • 5Hinden, R., Deering, S. IP Version 6 Addressing Architecture. RFC 2373, 1998.
  • 6Partridge, C. Locality and route caches. In: Claffy, K., Garrett, M., Braun, H.-W.,eds. Proceedings of the NSF workshop on Internet Statistics Measurement and Analysis.Diego, CA: NSF Press, 1996. 32~34.
  • 7Morrison, D.R. PATRICIA--practical algorithm to retrieve information coded inalphanumeric. Journal of the ACM, 1968, 15(4):514~534.
  • 8Sklower, Keith. A tree-based routing table for Berkeley Unix. Technical Report,Berkeley: University of California, 1993.
  • 9Internet routing table statistics. In: Saha, Debanjan, ed. Proceedings of the IEEEINFOCOM. San Francisco: IEEE Computer Society Press, 2001. 1444~1453.http://www.merit.edu/ipma/routing_table.
  • 10Cheung, G., McCanne, S. Optimal routing table design for IP address lookups undermemory constraints. In: Ephremides, A., Tripathi, S., eds. Proceedings of the IEEEINFOCOM. San Francisco: IEEE Computer Society Press, 1999. 1437~1444.

共引文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部