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 stand...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.展开更多
基金supported by the National Key Basic Research Program of China(973Program) under Grant No.2007CB307100the 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.
