-
[show abstract]
[hide abstract]
ABSTRACT: The Counting Bloom Filter (CBF) is a kind of space-efficient data structure that extends a Bloom filter so as to allow approximate
multiplicity queries on a dynamic multi-set. This paper evaluates the performance of multiplicity queries of three simple
CBF schemes-the Naïve Counting Bloom Filter (NCBF), the Space-Code Bloom Filter (SCBF) and the d-left Counting Bloom Filter
(dlCBF)—using metrics of space complexity and counting error under both uniform and zipfian multiplicity distributions. We
compare their counting error under same space complexity, and their space complexity when similar counting errors are achieved
respectively. Our results show that dlCBF is the best while SCBF is the worst in terms of both space-efficiency and accuracy.
Furthermore, the performance gap between dlCBF and the others has a trend of being enlarged with the increment of space occupation
or counting accuracy.
Journal of Electronics (China) 04/2012; 26(3):332-340.
-
SCIENCE CHINA Information Sciences. 01/2012; 55:407-418.
-
SCIENCE CHINA Information Sciences. 01/2012; 55:689-700.
-
SCIENCE CHINA Information Sciences. 01/2011; 54:334-347.
-
[show abstract]
[hide abstract]
ABSTRACT: Time efficiency of key establishment and update is one of the major problems contributory key managements strive to address.
To achieve better time efficiency in key establishment, we propose a Location-based Huffman (L-Huffman) scheme. First, users
are separated into several small groups to minimize communication cost when they are distributed over large networks. Second,
both user’s computation difference and message transmission delay are taken into consideration when Huffman coding is employed
to forming the optimal key tree. Third, the combined weights in Huffman tree are located in a higher place of the key tree
to reduce the variance of the average key generation time and minimize the longest key generation time. Simulations demonstrate
that L-Huffman has much better performance in wide area networks and is a little better in local area network than Huffman
scheme.
Journal of Electronics (China) 01/2009; 26(2):237-243.
-
[show abstract]
[hide abstract]
ABSTRACT: PIM-SM (Protocol Independent Multicast-Sparse Mode) is a main multicast routing protocol in the IPv6 (Internet Protocol version
6). It can use either a shared tree or a shortest path tree to deliver data packets, consequently the multicast IP lookup
engine requires, in some cases, two searches to get a correct lookup result according to its multicast forwarding rule, and
it may result in a new requirement of doubling the lookup speed of the lookup engine. The ordinary method to satisfy this
requirement in TCAM (Ternary Content Addressable Memory) based lookup engines is to exploit parallelism among multiple TCAMs.
However, traditional parallel methods always induce more resources and higher design difficulty. We propose in this paper
a novel approach to solve this problem. By arranging multicast forwarding table in class sequence in TCAM and making full
use of the intrinsic characteristic of the TCAM, our approach can get the right lookup result with just one search and a single
TCAM, while keeping the hardware of lookup engine unchanged. Experimental results have shown that the approach make it possible
to satisfy forwarding IPv6 multicast packets at the full link rate of 20 Gb/s with just one TCAM with the current TCAM chip.
Journal of Electronics (China) 01/2009; 26(2):214-221.
-
[show abstract]
[hide abstract]
ABSTRACT: Time efficiency in key establishment and rekeying is one of the major problems contributory key management schemes strive to address. Some schemes have been put forward to improve time efficiencies of key establishment and key update, yet they did not consider the scenario where users have varying costs and capabilities. Although conference key tree based on Huffman coding has been proposed to obtain minimum average cost on key establishment considering users' differences, it did not give the efficient key updating algorithm. We propose a Huffman-based join-exit-tree (HJET) scheme to minimizing the average key establishment time and reducing the key rekeying time for join/departure events. HJET scheme separates users into subgroups according to users' locations, designs the key tree of each subgroup using Huffman coding, and lets the combined weights locate in a higher place of the Huffman tree to minimize the key establishment time. To reduce the key rekeying cost, join tree and exit tree are adopted and served as the temporary buffers for joining and leaving users. Performance analysis and simulation results demonstrate that HJET is efficient in key establishment and update, and achieves the asymptotic time cost of O(1) for join event and nearly O(1)for leave events when group dynamics are known a priori.
Computers & Security. 01/2009;
-
[show abstract]
[hide abstract]
ABSTRACT: Time efficiency in key establishment and update is one of the major problems contributory key managements strive to improve. In this paper, we present a contributory group key management based on weighted-join-exit-tree and named as WJT to get better time efficiency in key update. Built upon tree-based group key management, WJT has three improvements, the first is the join algorithm to inserting the new user at the root of the join tree, the second is the exit tree structure organized as a weighted tree according to userspsila leaving time, and the last is the tree balancing algorithm to minimize the main tree height. Theoretical analysis shows that the asymptotic average join time and leave time of WJT are reduced to O(1) from previous O(log(log n)), where n is the group size. Simulations and comparisons with existing key managements demonstrate that WJT is efficient in group key establishment and update.
Military Communications Conference, 2008. MILCOM 2008. IEEE; 12/2008
-
[show abstract]
[hide abstract]
ABSTRACT: Time efficiency in key establishment and rekeying is one of the major problems contributory key managements strive to address. Most schemes which have been put forward improved time efficiency of contributory key management, but they did not consider the scenario where users have varying costs and capabilities. Although conference key tree based on Huffman coding has been proposed to obtain minimum total cost on key establishment considering users computation differences, it did not take communication cost into account. We propose a location-based Huffman (L-Huffman) scheme to minimize the longest key generation time, which is the dominative factor of the group key establishment time. L-Huffman scheme separates users into subgroups according to users' locations and lets the combined users locate in a higher place of the key tree in each subgroup. Simulations demonstrate that L-Huffman has much better performance than Huffman in wide-area networks and is slightly better in local-area networks.
Wireless Communications and Mobile Computing Conference, 2008. IWCMC '08. International; 09/2008
-
10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, 25-27 Sept. 2008, Dalian, China; 01/2008
-
Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008; 01/2008
-
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November - 4 December 2008; 01/2008
-
[show abstract]
[hide abstract]
ABSTRACT: With the demand of providing data security and integrity, IPSec is implemented in hardware of router to accelerate processing speed. After analyzing advantages and disadvantages of two traditional security architectures, look-aside architecture and flowthrough architecture, we propose parallel security processing architecture to achieve better time efficiency. This parallel security architecture adopts mechanism of processing IP packets and IPSec packets simultaneously, which optimizes the processing flow and improves the processing efficiency. The design of parallel security architecture is based on universal architecture of broadband, thus requires minimal change of hardware architecture when implemented in broadband router. Testing results based on SRI 880s routers demonstrate that the proposed parallel security architecture is efficient and satisfies the security need of broadband networks.
Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on; 10/2007
-
[show abstract]
[hide abstract]
ABSTRACT: The ever increasing line speed and the continuous growing demands of various functions support(for example QoS, multicast and security) have interact- tively made it harder for forwarding engines to process packets at line speed, and this will increasingly make the forwarding engines call for additional buffers to accommodate the burst transmission and decrease the packet loss rate. In this paper, a high-speed pipeline designed for TCAM-based forwarding engines is presented, and its buffer analysis model is also given, then, the buffer requirement of the forwarding engine is analyzed under two conditions: the forwarding rate is not less than and less than the input rate. Our analysis results and experiments both show that, the proposed forwarding pipeline is of high performance, and just one pipeline can easily deal with the data transfer rate of 30 Gb/s or even higher; the pipelined forwarding engine only need to buffer a several packets, then the loss rate will be an acceptable value or even zero, further increasing the buffer size will have little effect on reducing the loss rate.
Advanced Information Networking and Applications, 2007. AINA '07. 21st International Conference on; 06/2007
-
[show abstract]
[hide abstract]
ABSTRACT: Recent advances in broadband technology have caused forwarding engines to handle packets with over 10 gigabit per second.
In this paper, we present a high-speed forwarding pipeline which can finish all of the routing and forwarding tasks in the
way of pipelining. We also establish the analysis model of the pipeline with which one can evaluate some key performance parameters
of the forwarding engine such as forwarding rate and forwarding delay. We find that the pipeline is of good scalability and
can forward unicast packets up to the speed of 40Gbit/s.
Journal of Electronics (China) 02/2007; 24(2):157-162.
-
[show abstract]
[hide abstract]
ABSTRACT: We present a scheme using dual lookups to replicate multicast packet with no loss occurring for large IP routers with as many as 128×128 output ports. We are motivated by the fact that the length of multicast destination identifier (MDI) attached to each multicast packet is inadequate to specify exactly the subset of the output ports for the ever increasing number of multicast connections to be supported. We first present our switch fabric suitable for packet-based switches in large routers, and then give the proposed scheme charactered as dual lookups and three-stage replications. Experiment results obtained by using a real terabit router called SR1880-T which has adopted the scheme are given to verify the scheme.
Wireless, Mobile and Multimedia Networks, 2006 IET International Conference on; 12/2006
-
Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), 4-7 December 2006, Taipei, Taiwan; 01/2006
-
Information and Communications Security, 8th International Conference, ICICS 2006, Raleigh, NC, USA, December 4-7, 2006, Proceedings; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: This work attempts to provide a systematical view of the intersection of artificial life (A-Life) and artificial intelligence (AI), focusing on the highlight of this emerging field: adaptive behavior system and adaptive autonomous agent. First of all, A-Life and AI are delineated, and the AI roots of A-Life and A-Life roots of AI are discussed. Based upon the discussions, adaptive behavior system and adaptive autonomous agent are introduced as the intersection of A-Life and AI. Finally useful guidelines of the methodology for this emerging field are proposed.
Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on; 06/2004
-
[show abstract]
[hide abstract]
ABSTRACT: Processing toward variable-length IP packets brings burden to high speed network node control, caching, management, etc. A popular solution uses a method similar to ATM segmentation and reassembly (SAR) in the non-ATM network node. In this paper, it is pointed out that the low-bandwidth usage of this method is not suitable for high speed network node realization. To reduce the redundant data rate (RDR) and improve packet switching rate, a new fixed-size processing method, merge and separate plus SAR (MAS+), in high speed network node is presented. In this new method, the packets larger than the fixed size are segmented. And, the computer simulations of RDR improvement and latency analysis of the new solution are also given in this paper.
Communication Technology Proceedings, 2003. ICCT 2003. International Conference on; 05/2003
