Kai Lei, Meng Yuan. Design and Implementation of DHT Algorithm for NDN[J]. Telecommunications science, 2014, 30(12): 48-54.
DOI:
Kai Lei, Meng Yuan. Design and Implementation of DHT Algorithm for NDN[J]. Telecommunications science, 2014, 30(12): 48-54. DOI: 10.3969/j.issn.1000-0801.2014.12.007.
Design and Implementation of DHT Algorithm for NDN
A novel distributed Hash table(DHT)algorithm under named data networking(NDN)
which was called ndnDHT
was proposed. The algorithm brings the DHT to NDN for the first time. A new binary method using the structure of NDN was designed. By mapping the key space to the space of NDN
the binary method solves the operations such as routing and retransmission. Besides
a dynamic selection method of node identifier distribution was proposed to balance the load of ndnDHT algorithm. Finally
ndnDHT algorithm based on NS-3 and ndnSIM was implemented. The experimental result shows that the ndnDHT algorithm is effective.
关键词
Keywords
references
Zhang L X , Estrin D , Burke J , et al . Named Data Networking (NDN)Project . Tech Rep , 2010
Ion S , Robert M , David K , et al . Chord: a scalable peer-to-peer lookup service for internet applications . Proceedings of ACM SIGCOMM , San Diego, USA , 2001 : 149 ~ 160
Sylvia R , Paul F , Mark H , et al . A scalable content-addressable network . Proceedings of ACM SIGCOMM , San Diego, USA , 2001 : 161 ~ 172
Petar M , David M . Kademlia: a peer-to-peer information system based on the XOR metric . Proceedings of the 1st International Workshop on Peer-to-Peer Systems , Cambridge,USA , 2002 : 53 ~ 65
Luiz A B , Urs H . The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines . San Rafael: Morgan& Claypool Publishers , 2009
Volodymyr V , Kindratenko , Pedro T . Trends in high-performance computing . Computing in Science and Engineering , 13 ( 3 ): 92 ~ 95
Rajkumar B , Chee S Y , Srikumar V , et al . Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility . Future Generation Computer Systems , 25 ( 6 ): 599 ~ 616
Venugopalan R , Emin G S . Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays . Proceedings of the 1th Symposium on Networked Systems Design and Implementation , San Francisco, USA , 2004 : 99 ~ 112
Giuseppe D , Deniz H , Madan J , et al . Dynamo: amazon's highly available key-value store . SOSP,Stevenson , USA , 2007 : 205 ~ 220
The ns-3 network simulator . http://www.nsnam.org/ http://www.nsnam.org/ , 2011
John K , David B , Yan C , et al . OceanStore: an architecture for global-scale persistent Storage . Proceedings of International Conference on Architectural Support for Programming Languages and Operating Systems , Cambridge, USA , 2000 : 190 ~ 201
Antony I T R , Peter D . Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility . Proceedings of the ACM Symposium on Operating SystemsPrinciples , Banff, Canada , 2001 : 188 ~ 201
Van J , Diana K S , James D T , et al . Networking named content . Proceedings of ACM CoNEXT , Rome, Italy , 2009 : 1 ~ 12
Alexander A , Llya M , Zhang L X . ndnSIM: NDN Simulator For NS-3 Project . Tech Rep , 2012
Wang J Z , Eric O , Peng C Y , et al . Implementing instant messaging using named data . Proceedings of AINTEC , Bangkok, Thailand , 2010 : 40 ~ 47