http://WWW.FINALYEARPROJECTS.NET
http://WWW.FINALYEARPROJECTS.NET

Checking delivery availability...

background-sm
Search
3

Updates found with 'algorithms'

Page  1 1

Updates found with 'algorithms'

JAVA PROJECTS ABSTRACT 2016-2017 COST MINIMIZATION FOR RULE CACHING IN SOFTWARE DEFINED NETWORKING ABSTRACT: Software-defined networking (SDN) is an emerging network paradigm that simplifies network management by decoupling the control plane and data plane, such that switches become simple data forwarding devices and network management is controlled by logically centralized servers. In SDN-enabled networks, network flow is managed by a set of associated rules that are maintained by switches in their local Ternary Content Addressable Memories (TCAMs) which support high-speed parallel lookup on wildcard patterns. Since TCAM is an expensive hardware and extremely power-hungry, each switch has only limited TCAM space and it is inefficient andeven infeasible to maintain all rules at local switches. On the other hand, if we eliminate TCAM occupation by forwarding all packets to the centralized controller for processing, it results in a long delay and heavy processing burden on the controller. In this paper, we strive for the fine balance between rule caching and remote packet processing by formulating a minimum weighted flow provisioning (MWFP) problem with an objective of minimizing the total cost of TCAM occupation and remote packet processing. We propose an efficient offline algorithm if the network traffic is given, otherwise, we propose two online algorithms with guaranteed competitive ratios. Finally, we conduct extensive experiments by simulations using real network traffic traces. The simulation results demonstrate that our proposed algorithms can significantly reduce the total cost of remote controller processing and TCAM occupation, and the solutionsobtained are nearly optimal.Existing System: That switches usually set an expiration time for rules, which defines the maximum rule maintenance time when no packet of associated flow arrives. the first packet experiences the delay of remote processing at the controller, and the rest will be processed by local rules at switches. However, for burst transmission, the corresponding rules cached in switches will be removed between two batches of packets if their interval is greater than the rule expiration time. As a result, remote packet processing would be incurred by the first packet of each batch, leading to a long delay and high processing burden on the controller. A simple method to reduce the overhead of remote processing is to cache rules at switches within the lifetime of network flow, ignoring the rule expiration time. we conduct extensive simulations using real network traffic traces to evaluate the performance of our proposals. The simulation results demonstrate that our proposed algorithms can significantly reduce the total cost of remote controller processing and TCAM occupation, and the solutions obtained are nearly optimal.Disadvantage: In that case, rules can be cached in forwarding table as many as possible. This abstraction saves TCAMs space, but the packet processing speed in switch is a bottleneck. The endpoints rules are pre-computed and cached in authority switches. Once the first packet of a new microflow arrives the switch, the desired rules are reactively installed, from authority switches rather than the controller. In this way, the flow setup time can be significantly reduced.
Send Enquiry
Read More
CLOUD COMPUTING PROJECT ABSTRACT 2016-2017 COST MINIMIZATION FOR RULE CACHING IN SOFTWARE DEFINED NETWORKING ABSTRACT:Software-Defined Networking (SDN) is an emerging network paradigm that simplifies network management by decoupling the control plane and data plane, such that switches become simple data forwarding devices and network management is controlled by logically centralized servers. In SDN-enabled networks, network flow is managed by a set of associated rules that are maintained by switches in their local Ternary Content Addressable Memories (TCAMs) which support high-speed parallel lookup on wildcard patterns. Since TCAM is an expensive hardware and extremely power-hungry, each switch has only limited TCAM space and it is inefficient and even infeasible to maintain all rules at local switches. On the other hand, if we eliminate TCAM occupation by forwarding all packets to the centralized controller for processing, it results in a long delay and heavy processing burden on the controller. In this paper, we strive for the fine balance between rule caching and remote packet processing by formulating a minimum weighted flow provisioning (MWFP) problem with an objective of minimizing the total cost of TCAM occupation and remote packet processing. We propose an efficient offline algorithm if the network traffic is given, otherwise, we propose two online algorithms with guaranteed competitive ratios. Finally, we conduct extensive experiments by simulations using real network traffic traces. The simulation results demonstrate that our proposed algorithms can significantly reduce the total cost of remote controller processing and TCAM occupation, and the solutions obtained are nearly optimal.
Send Enquiry
Read More
ANDROID PROJECT ABSTRACT 2016-2017 PRIVACY-PRESERVING LOCATION SHARING SERVICES FOR SOCIAL NETWORKS ABSTRACT:A common functionality of many location-based social networking applications is a location sharing service that allows a group of friends to share their locations. With a potentially untrusted server, such a location sharing service may threaten the privacy of users. Existing solutions for Privacy-Preserving Location Sharing Services (PPLSS) require a trusted third party that has access to the exact location of all users in the system or rely on expensive algorithms or protocols in terms of computational or communication overhead. Other solutions can only provide approximate query answers. To overcome these limitations, we propose a new encryption notion, called Order-Retrievable Encryption (ORE), for PPLSS for social networking applications. The distinguishing characteristics of our PPLSS are that it (1) allows a group of friends to share their exact locations without the need of any third party or leaking any location information to any server or users outside the group, (2) achieves low computational and communication cost by allowing users to receive the exact location of their friends without requiring any direct communication between users or multiple rounds of communication between a user and a server, (3) provides efficient query processing by designing an index structure for our ORE scheme, (4) supports dynamic location updates, and (5) provides personalized privacy protection within a group of friends by specifying a maximum distance where a user is willing to be located by his/her friends. Experimental results show that the computational and communication cost of our PPLSS is much better than the state-of-the-art solution.
Send Enquiry
Read More
JAVA/DOT NET PROJECTS ABSTRACT 2016-2017 ATTRIBUTE-BASED ACCESS CONTROL WITH CONSTANT SIZE CIPHER-TEXT IN CLOUD COMPUTING : ABSTRACT: With the popularity of cloud computing, there have been increasing concerns about its security and privacy. Since the cloud computing environment is distributed and untrusted, data owners have to encrypt outsourced data to enforce confidentiality. Therefore, how to achieve practicable access control of encrypted data in an untrusted environment is an urgent issue that needs to be solved. Attribute-Based Encryption (ABE) is a promising scheme suitable for access control in cloud storage systems. This paper proposes a hierarchical attribute-based access control scheme with constant-size ciphertext. The scheme is efficient because the length of ciphertext and the number of bilinear pairing evaluations to a constant are fixed. Its computation cost in encryption and decryption algorithms is low. Moreover, the hierarchical authorization structure of our scheme reduces the burden and risk of a single authority scenario. We prove the scheme is of security under the decisional q-Bilinear Exponent assumption. In addition, we implement our scheme and analyse its performance. The analysis results show the proposed scheme is efficient, scalable, and fine-grained in dealing with access control for outsourced data in cloud computing. EXISTING SYSTEM: Though there exist ABE schemes with constant cipher text size and/or constant number of pairing operations in decryption, their access structures are restricted to AND gates or threshold gates which severely limit their practical applications. To overcome this problem, suggested outsourcing decryption in attribute-based encryption. Their verification model suffers from the attack as existed in security model . PROPOSED SYSTEM: A promising approach to address this issue is attribute-based encryption (ABE), first proposed by Sahib and Waters. ABE schemes can be divided into two categories: Cipher text-Policy ABE (CP-ABE) and Key-Policy ABE (KP-ABE), depending on the access policy is embedded into the cipher text or the user’s private key.Proposed a simple method to adapt their RCCA (repayable chosen-cipher text attack) systems to such a setting formalized a security model for capturing the modification in an outsourced ABE system and proposed a concrete construction with verifiable outsourced decryption. We provide formal proofs of the (selective) chosen-plaintext security and the verifiability in the standard model, which is a slight modification of the security model first proposed in for verifiable outsourced ABE. We present an instantiation of our generic construction based on the outsourced ABE system proposed in which is in turn based on Waters CP-ABE scheme. We begin by introducing some basic notations used in the instantiation. SYSTEM SPECIFICATION Hardware Requirements: • System : Pentium IV 2.4 GHz. • Hard Disk : 40 GB. • Floppy Drive : 1.44 Mb. • Monitor : 14’ Colour Monitor. • Mouse : Optical Mouse. • Ram : 512 Mb. Software Requirements: • Operating system : Windows 7 Ultimate. • Coding Language : ASP.Net with C# • Front-End : Visual Studio 2010 Professional. • Data Base : SQL Server 2008. CONCLUSION: Secure sharing of data plays an important role in cloud computing. Attribute-based access control can real size data confidentiality in the un trusted environment of server-end, fine-grained access control and large-scale dynamic authorization which are the difficult problems to solve the traditional access control. This paper proposes a structure of hierarchical attribute authority based on cloud computing which reduces the burden and disperses the risk of the single authority. The proposed scheme adopts CP-ABE with constant-size cipher text that solves the problem of the cipher text size depending linearly on the number of attributes. Our scheme can maintain the size of cipher text and the computation of encryption and decryption at a constant value. Therefore, the scheme can improve the efficiency of the system. We have performed some numerical simulation and the testing results are coincident with the theoretical analysis. In addition, we prove the scheme is of security under the Bilinear Exponent assumption. We also demonstrate an application model in a distributed cloud environment. This shows our scheme has good adaptability and scalability in cloud computing. In further research, we intend to focus on making the CP-ABE algorithm simpler and more efficient along with making it even more suitable for access control in a cloud environment.
Send Enquiry
Read More
Page 1 1