Focusing on the problem of high overhead and frequent overflow of counter mode encryption, this paper proposed an efficient scheme to protect data confidentiality and integrity. Based on the locality character of data...
详细信息
Focusing on the problem of high overhead and frequent overflow of counter mode encryption, this paper proposed an efficient scheme to protect data confidentiality and integrity. Based on the locality character of data accessing, the scheme set different counter length for memory area according to different accessing frequency and the counter length can be dynamic adjusted. The analysis and the simulation results indicated that compared with the counter mode encryption, the scheme can decrease memory space overhead and the number of overflow. The proposed scheme can be applied to other schemes of protecting confidentiality and integrity based on counters and can satisfy performance requirement for most applications.
More and more network devices and chips commonly apply multi-core architectures to meet increasingly performance demands. But the lack of efficient program level parallelism and workload allocation in the packet proce...
详细信息
More and more network devices and chips commonly apply multi-core architectures to meet increasingly performance demands. But the lack of efficient program level parallelism and workload allocation in the packet processing system greatly limits the utilization of multi-core architectures. In this paper, we propose a parallel packet processing runtime system and explore an affinity-based packet scheduler with the goal of raising load balancing and decreasing cache miss. We can use the system that handles the allocation of processing tasks to simplify the implementation of new applications. The experiment results show task distributor and scheduler can achieve a better compromise between load balancing and cache affinity in the parallel packet processing system.
Cloud based e-Commerce applications are favored over traditional systems due to their capacity to reduce costs in various aspects like use of resources, low operating costs, eliminate capital costs, low maintenance an...
详细信息
Cloud based e-Commerce applications are favored over traditional systems due to their capacity to reduce costs in various aspects like use of resources, low operating costs, eliminate capital costs, low maintenance and service costs. Its core functionality of optimizing performance and its automatic system recovery is crucial in web applications. Using a cloud platform for web applications increases productivity and decreases the replication of business documents saving businesses money in the current economic climate. A stable system is needed to achieve this and quality measurement is crucial to establish baselines to help predict resources for the future of the business. The proposed quality measurement model is one such designed for Cloud based e-Commerce applications. It aims to create a repository or an errorKnowledge Management System(e-KMS) for known online defects with capacity to add in future defects as they occur when using the applications. By mapping these defects directly to quality factors affected, accurate quality measurement can be achieved.
Inverse Heat Conduction Problem(IHCP) has the characteristics of non-linearity, ill-posedness and heavy computation, because of which, there haven't been any theories or algorithms with broad application scope to ...
详细信息
Inverse Heat Conduction Problem(IHCP) has the characteristics of non-linearity, ill-posedness and heavy computation, because of which, there haven't been any theories or algorithms with broad application scope to solve it yet. In this paper, we use standard Particle Swarm Optimization(PSO) algorithm to solve fine-mesh 2 Dimensions(2D) IHCP. The experimental data shows that the standard PSO algorithm is not suitable for solving fine-mesh 2D IHCP. Considering the particular application fine-mesh 2D IHCP, the paper gives an improved strategy for the standard PSO algorithm. Results show that the improved PSO algorithm has a great improve in global search capability and solution precision.
Due to the lack of end-to-end connectivity between mobile nodes, delay tolerant networks(DTNs) exploit the opportunistic forwarding mechanism. This mechanism requires nodes to forward messages in a cooperative ***, no...
详细信息
Due to the lack of end-to-end connectivity between mobile nodes, delay tolerant networks(DTNs) exploit the opportunistic forwarding mechanism. This mechanism requires nodes to forward messages in a cooperative ***, nodes may exhibit selfish behavior, in particular when they are constrained with respect to the battery energy,computational power, and/or storage space. In this paper, we propose a new secure incentive scheme(called SIS) enhance the cooperation among nodes and thwart the selfish behaviors by rewarding the intermediate nodes for their actively forwarding behavior. Moreover, we implement the scheme by ONE, and we conduct a complete set of simulations to compare its performance in terms of message delivery ratio and average delivery delay metrics. Our analysis provides a comparison of the proposed scheme's performance with Epidemic Routing and SprayAndWait Routing. The Extensive simulation results demonstrate that our SIS scheme can improve the cooperation level among the nodes.
How to draw large scale spatial interaction data clearly and quickly is a challenge in high performance data visualization research and application field. Force-Directed Edge Bundling(FDEB) helps display graph clearly...
详细信息
How to draw large scale spatial interaction data clearly and quickly is a challenge in high performance data visualization research and application field. Force-Directed Edge Bundling(FDEB) helps display graph clearly with significant clutter reduction, but with high time complexity. This paper presents a parallelized FDEB on the GPU(GPUFDEB), which reforms FDEB and achieves a balanced partitioning of data and calculation to suit computation on the GPU. GPU-FDEB addresses the problem of high time complexity and accelerates FDEB by an order of magnitude.
Owing to its great need for mapping an IP address to the corresponding MAC address over an Ethernet topology, Address Resolution Protocol(ARP) has been, and still is, capable of accomplishing this task efficiently. At...
详细信息
Owing to its great need for mapping an IP address to the corresponding MAC address over an Ethernet topology, Address Resolution Protocol(ARP) has been, and still is, capable of accomplishing this task efficiently. At the same time, it suffers from some security shortcomings;because of the malicious hosts have the possibility of poisoning the ARP cache for another host on the same LAN. In this paper, by gratuitous ARP request packets, we propose a solution to the problem of ARP poisoning. Our suggested mechanism which is named a Gratuitous Decision Packet System(GDPS) seeks to achieve two main goals:(1) Detection of suspicious ARP packets, by implementing a real-time analyzing for received ARP packets.(2) The distinction between a legitimate and malicious host through sending a modified request packet of the gratuitous ARP packets. Furthermore, the experiments show that the presented design has the efficiency and accuracy, as well as it does not require any additional software or hardware.
Automatic decomposition is an optimization technique that distributes computation and data onto different processors. The consequence of decomposition directly affects the performance of parallel program. Since every ...
详细信息
Automatic decomposition is an optimization technique that distributes computation and data onto different processors. The consequence of decomposition directly affects the performance of parallel program. Since every computing node has its own memory in distributed memory parallel computers(DMPCs), false dependence does not hinder the parallelism. Affine decomposition is an effective method to represent and derive computation partition and data distribution, and its principle of adding dependence constraint is too strict to gain more parallelism. Some loop nests do not satisfy the affine condition, and are prohibited from parallelism by affine decomposition. However, if only the irregular access is caused by indirect array, loop and array reference can be partitioned at compile time. To tackle above problems of affine decomposition, an improved static decomposition algorithm of DMPCs proposed in this paper. The experimental results show that this algorithm can improve the performance of parallel programs.
Both the Laplace Transform and the Parareal family of algorithms promise to provide completely parallel in time and space computational results. Given a random time dependent partial differential equation it is unclea...
详细信息
Both the Laplace Transform and the Parareal family of algorithms promise to provide completely parallel in time and space computational results. Given a random time dependent partial differential equation it is unclear which algorithm will run faster. We define the algorithms in question, including more specific details than usual. We define interesting parallel environments, some of which do not exist yet. Finally, we demonstrate some computational environments in which one of the algorithms can be expected to be faster than the other algorithm.
Based on Automatic Identification System(AIS) information, the existing vessel track is combined by linking the two adjacent points. The linked track is very different from the real track of the vessel. So a fitting m...
详细信息
Based on Automatic Identification System(AIS) information, the existing vessel track is combined by linking the two adjacent points. The linked track is very different from the real track of the vessel. So a fitting method is needed for restoring the real track vividly. AIS information is processed when the vessel is stand-on and turning by Piecewise Linear Interpolation, Piecewise Cubic Interpolation and Piecewise Cubic Spline Interpolation. The results show that the three tracks are nearly the same when the vessel is stand-on, the track presents by Piecewise Cubic Spline Interpolation is best, which proves that Piecewise Cubic Spline Interpolation is a good method to restore the vessel track in utilizing AIS information.
暂无评论