LISP-PCHORD:An Enhanced Pointer-Based DHT to Support LISP  

LISP协议下基于指针Chord的增强型映射系统设计(英文)

作　　者：张泰 王晟 廖丹 

机构地区：[1]Key Laboratory of Broadband Optical Fiber Transmission and Communication Network of Ministry of Education,University of Electronic Science and Technology of China

出　　处：《China Communications》2013年第7期134-147,共14页中国通信（英文版）

基　　金：supported by the National Key Basic Research Program of China(973Program) under Grant No.2007CB307100;the National Natural Science Foundation of China under Grant No.61001084

摘　　要：Aiming to efficiently support theLocator/Identifier Separation Protocol(LISP),in this paper,we present an enhanced pointerbased DHT mapping system:LISP-PCHORD.The system creates a pointer space to build ontop of standard DHTs.Mappings within thepointer space are(Endpoint Identifiers(EID),pointers) where the pointer is the address ofthe root node(the physical node that stores themappings) of the corresponding(EID,RoutingLocators(RLOCs)) mappings.In addition toenabling architectural qualities such as scalability and reliability,the proposed LISP-PCHORDcan copy with flat EIDs such as self-certifyingEIDs.The performance of the mapping systemplays a key role in LISP;however,DHT-basedapproaches for LISP seldom consider the mismatch problem that heavily damages the system performance in terms of lookup latency.In order to mitigate the mismatch problem andachieve optimal performance,we propose anoptimization design method that seeks an optimal matching relationship between P-nodes(nodes within the pointer space) and the physical nodes on the basis of the given lookuptraffic matrix.In order to find the optimal matching relationship,we provide two solutions:a linear programming method and a geneticalgorithm.Finally,we evaluate the performance of the proposed scheme and compare itwith that of LISP-DHT.Aiming to efficiently support the Locator/Identifier Separation Protocol （LISP）, in this paper, we present an enhanced pointer- based DHT mapping system： LISP- PCHORD. The system creates a pointer space to build on top of standard DHTs. Mappings within the pointer space are （Endpoint Identifiers （EID）, pointers） where the pointer is the address of the root node （the physical node that stores the mappings） of the corresponding （EID, Routing Locators （RLOCs）） mappings. In addition to enabling architectural qualities such as scalability and reliability, the proposed LISP-PCHORD can copy with flat EIDs such as self-certifying EIDs. The performance of the mapping system plays a key role in LISP; however, DHT-based approaches for LISP seldom consider the mismatch problem that heavily damages the system performance in terms of lookup latency. In order to mitigate the mismatch problem and achieve optimal performance, we propose an optimization design method that seeks an op- timal matching relationship between P-nodes （nodes within the pointer space） and the physical nodes on the basis of the given lookup traffic matrix. In order to find the optimal matching relationship, we provide two solutions： a linear programming method and a genetic algorithm. Finally, we evaluate the performance of the proposed scheme and compare it with that of LISP-DHT.

关 键 词：communication network mapping system LISP DHT linear programming genetic algorithm 

分 类 号：TN915.04[电子电信—通信与信息系统]