期刊文献+

基于分段散列的服务命名研究 被引量:1

Service naming research based on segmented Hash
原文传递
导出
摘要 针对当前网络IP语义超载,限制了很多网络新功能(如移动性,多宿主等)的使用问题,提出了一种以服务为中心的命名方式,不再将服务与位置绑定。对网络中服务的属性和服务提供商格式定义,通过分段Hash字符串,得到全球唯一的服务标识。结合P2P网络的信息查找方式实现对管理信息的查找,更好地支持了移动性和服务标识的存储与查找。用极值法证明了服务标识位数的合理性,通过数学方法验证了选用的哈希函数满足要求。 For the semantic overload of current network IP limited many new functions of network, such as mobility, multi- hosts, and so on, this paper proposes a service oriented naming method that the service is no longer tied with the location. The format of the network service and the ISP are defined, and a unique identify has been gained by segmented Hash. Combined with the P2P network information lookup method to manage the information search, the mobility and the service indentify are supported for storage and lookup better. The rationality of service identify space was proved by extreme value method and the selected Hash function was verified by the mathematical methods.
出处 《重庆邮电大学学报(自然科学版)》 CSCD 北大核心 2013年第3期364-367,共4页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金 国家重点基础研究发展计划"973"(2012CB315803) 重庆市重点自然科学基金项目(cstc2012jjB40008)~~
关键词 服务名字 唯一性 分段哈希 service name uniqueness segmented Hash
  • 相关文献

参考文献6

  • 1BALAKRISHNAN H,LAKSHMINARAYANAN K,HAT-NASAMY S,et al.A layered naming architecture for theInternet [ J].ACM SIGCOMM Computer CommunicationReview,2004,34(4):343-352.
  • 2ZHANG L,ESTRIN D,BURKE J,et al.Named datanetworking(ndn)project [ EB/OL] .[ 2012-10-30] .ht-tp://ccn-uff.wdfiles.com/local一files/projetos/NDN%20Project% 20Technical% 20Report,pdf.
  • 3KAFLE V P,OTSUKI H,INOUR M.An ID/locator splitarchitecture of future networks[ C]//Innovations for Dig-ital Inclusions,K-IDI 2009.Kaleidoscope:IEEE press,2009:1-8.
  • 4董芳,费新元,肖敏.对等网络Chord分布式查找服务的研究[J].计算机应用,2003,23(11):25-28. 被引量:18
  • 5WAGNER D.A generalized birthday problem[ M].Hei-delberg:Springer-Verlag,2002:288-304.
  • 6STOIGA I,MORRIS R,LIBEN N D,et al.Chord:ascalable peer-to-peer lookup protocol for internet applica-tions [J].IEEE/ACM Transactions,2003,11(1):17-32.

二级参考文献4

  • 1Stoica I, Morris R, Karger D, et al. Chord A Scalable Peer-to-peer Lookup Service for Intemet Applications[ A]. Proceeding d ACMSIC, COMM 2001[C]. San Diego, California, USA, 2001.
  • 2Ramasamy S. Francis P. Handley M, et al. A Scalable Content-Addressable Network[ A] In Proceedings of ACM SIGCOMM 2001[ C]. San Diego, California, USA, 2001.
  • 3Rowstron A, Druschel P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[R]. IFIP/ACM International Conference on Distributed Systems Platforms.Middleware, 2001.
  • 4Zhao BY, Kubiatowicz J, Joseph AD. Tapestry: An Infrastructure for Fauh-tolerant Wide-area Location and Routing[ R]. Technical Report No. UCB/CSD-01-1141, University of California Berkeley.UC Berkeley, Apr. 2001.

共引文献17

同被引文献23

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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