In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for ...In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：展开更多
Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to p...Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to provide efficient video data location service. By adopting an enhanced events dissemination mechanism-EDRA＋, the accuracy of routing table at peers can be guaranteed. More importantly, in order to enhance the perforlmnce of video data lookup operation without incurring extra overhead, we design a so-called Distributed Index Mapping and Management Mechanism （DIMM） for SDHT. Both analytical modeling and intensive simulation experiments are conducted to demonstrate the effectiveness of SDHT framework. Numerical results show that almost 90% requested video data can be retrieved within one second in SDHT based systems, and SDHT needs only 26% average bandwidth consumption when compared with similar one-hop DHT solutions such as D1HT. This indicates that SDHT framework is an appropriate data lookup solution for time-sensitive network applications such as P2P live streaming.展开更多
For name-based routing/switching in NDN, the key challenges are to manage large-scale forwarding Tables, to lookup long names of variable lengths, and to deal with frequent updates. Hashing associated with proper leng...For name-based routing/switching in NDN, the key challenges are to manage large-scale forwarding Tables, to lookup long names of variable lengths, and to deal with frequent updates. Hashing associated with proper length-detecting is a straightforward yet efficient solution. Binary search strategy can reduce the number of required hash detecting in the worst case. However, to assure the searching path correct in such a schema, either backtrack searching or redundantly storing some prefixes is required, leading to performance or memory issues as a result. In this paper, we make a deep study on the binary search, and propose a novel mechanism to ensure correct searching path without neither additional backtrack costs nor redundant memory consumptions. Along any binary search path, a bloom filter is employed at each branching point to verify whether a said prefix is present, instead of storing that prefix here. By this means, we can gain significantly optimization on memory efficiency, at the cost of bloom checking before each detecting. Our evaluation experiments on both real-world and randomly synthesized data sets demonstrate our superiorities clearly展开更多
Flow-based measurement is a popular method for various network monitoring usages.However, many flow exporting softwares have still low performance to collect all flows.In this paper, we propose a IPFIX-based flow expo...Flow-based measurement is a popular method for various network monitoring usages.However, many flow exporting softwares have still low performance to collect all flows.In this paper, we propose a IPFIX-based flow export engine with an enhanced and extensible data structure, called XFix, on the basis of a GPL tool,-nProbe.In the engine, we use an extensible two-dimensional hash table for flow aggregation, which is able to improve the performance of the metering process as well as support bidirectional flow.Experimental results have shown its efficiency in multi-thread processing activity.展开更多
Anomaly detection has practical significance for finding unusual patterns in time series.However,most existing algorithms may lose some important information in time series presentation and have high time complexity.A...Anomaly detection has practical significance for finding unusual patterns in time series.However,most existing algorithms may lose some important information in time series presentation and have high time complexity.Another problem is that privacy-preserving was not taken into account in these algorithms.In this paper,we propose a new data structure named Interval Hash Table(IHTable)to capture more original information of time series and design a fast anomaly detection algorithm based on Interval Hash Table(ADIHT).The key insight of ADIHT is distributions of normal subsequences are always similar while distributions of anomaly subsequences are different and random by contrast.Furthermore,to make our proposed algorithm fit for anomaly detection under multiple participation,we propose a privacy-preserving anomaly detection scheme named OP-ADIHT based on ADIHT and homomorphic encryption.Compared with existing anomaly detection schemes with privacy-preserving,OP-ADIHT needs less communication cost and calculation cost.Security analysis of different circumstances also shows that OP-ADIHT will not leak the privacy information of participants.Extensive experiments results show that ADIHT can outperform most anomaly detection algorithms and perform close to the best results in terms of AUC-ROC,and ADIHT needs the least time.展开更多
基金Acknowledgements This work was supported by the Hi-Tech Research and Development Program of China under Grant No.2007AA01Z407 the Co-Funding Project of Beijing Municipal education Commission under Grant No.JD100060630+3 种基金 National Foundation Research Project the National Natural Science Foundation Project under Grant No. 61170295 the Project of Aeronautical Science Foundation of China under Caant No.2011ZC51024 and the Fundamental Research Funds for the Central Universities.
文摘In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：
基金Acknowledgements This work was supported by the Key Projects for Science and Technology Development under Caant No. 2009ZX03004-002 the National Natural Science Foundation of China under Gants No. 60833002, No. 60772142+1 种基金 the National Science and Technology Fundamental Project under Grant No. 2008ZX03003-005 the Science ＆ Technology Research Project of Chongqing Education Committee under Crant No. KJ120825.
文摘Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to provide efficient video data location service. By adopting an enhanced events dissemination mechanism-EDRA＋, the accuracy of routing table at peers can be guaranteed. More importantly, in order to enhance the perforlmnce of video data lookup operation without incurring extra overhead, we design a so-called Distributed Index Mapping and Management Mechanism （DIMM） for SDHT. Both analytical modeling and intensive simulation experiments are conducted to demonstrate the effectiveness of SDHT framework. Numerical results show that almost 90% requested video data can be retrieved within one second in SDHT based systems, and SDHT needs only 26% average bandwidth consumption when compared with similar one-hop DHT solutions such as D1HT. This indicates that SDHT framework is an appropriate data lookup solution for time-sensitive network applications such as P2P live streaming.
基金supported by the National Natural Science Foundation of China (Grant No. 61472130 and 61702174)the China Postdoctoral Science Foundation funded project
文摘For name-based routing/switching in NDN, the key challenges are to manage large-scale forwarding Tables, to lookup long names of variable lengths, and to deal with frequent updates. Hashing associated with proper length-detecting is a straightforward yet efficient solution. Binary search strategy can reduce the number of required hash detecting in the worst case. However, to assure the searching path correct in such a schema, either backtrack searching or redundantly storing some prefixes is required, leading to performance or memory issues as a result. In this paper, we make a deep study on the binary search, and propose a novel mechanism to ensure correct searching path without neither additional backtrack costs nor redundant memory consumptions. Along any binary search path, a bloom filter is employed at each branching point to verify whether a said prefix is present, instead of storing that prefix here. By this means, we can gain significantly optimization on memory efficiency, at the cost of bloom checking before each detecting. Our evaluation experiments on both real-world and randomly synthesized data sets demonstrate our superiorities clearly
文摘Flow-based measurement is a popular method for various network monitoring usages.However, many flow exporting softwares have still low performance to collect all flows.In this paper, we propose a IPFIX-based flow export engine with an enhanced and extensible data structure, called XFix, on the basis of a GPL tool,-nProbe.In the engine, we use an extensible two-dimensional hash table for flow aggregation, which is able to improve the performance of the metering process as well as support bidirectional flow.Experimental results have shown its efficiency in multi-thread processing activity.
基金supported by Natural Science Foundation of Guangdong Province,China(Grant No.2020A1515010970)Shenzhen Research Council(Grant No.JCYJ20200109113427092,GJHZ20180928155209705).
文摘Anomaly detection has practical significance for finding unusual patterns in time series.However,most existing algorithms may lose some important information in time series presentation and have high time complexity.Another problem is that privacy-preserving was not taken into account in these algorithms.In this paper,we propose a new data structure named Interval Hash Table(IHTable)to capture more original information of time series and design a fast anomaly detection algorithm based on Interval Hash Table(ADIHT).The key insight of ADIHT is distributions of normal subsequences are always similar while distributions of anomaly subsequences are different and random by contrast.Furthermore,to make our proposed algorithm fit for anomaly detection under multiple participation,we propose a privacy-preserving anomaly detection scheme named OP-ADIHT based on ADIHT and homomorphic encryption.Compared with existing anomaly detection schemes with privacy-preserving,OP-ADIHT needs less communication cost and calculation cost.Security analysis of different circumstances also shows that OP-ADIHT will not leak the privacy information of participants.Extensive experiments results show that ADIHT can outperform most anomaly detection algorithms and perform close to the best results in terms of AUC-ROC,and ADIHT needs the least time.
