Location Based Services (LBS) are information services accessible with mobile devices through the mobile network and utilizing the ability to make use of the location of the mobile device. Location-based services offer many opportunities for Business, Social or Informational purpose. Information of users can be misused thereby raising the issues of security both for the personal privacy and national security. Our project deals with the ongoing problems and possible solutions to PRIVACY in LBS which have become a major concern, looking from the end user’s point of view. We proposed an Obfuscation Operators to protect the privacy of users consists in decreasing the accuracy of location information according to their preferences (location obfuscation).The right of individuals to decide how, when, and for which purposes their location information can be released to other parties.

System Requirement Specification:-
DOMAIN : Transactions on Depentable And Secure Computing
SOFTWARE : Operating System: Windows xp, Platform: JAVA, DataBase: MySQL Protocal: UDP
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB

               In recent years, a number of commercial peer-to-peer (P2P) systems for live streaming have been introduced. Here we have zattoo website which have the zattoo server. If a peer wants to get live television means first they have to register here, the request will be sent from peer to server, the service will then initiated. Peer division multiplexing technique used to get the nearest neighbor which are utilizing the same channel. IOB used to get the streams from multi peers to destined peer. The median channel join delay remained less than 2-5 s. It remains advantageous than previous bit-torrent and VOD.

System Requirement Specification:-
DOMAIN : Transactions on Networking
SOFTWARE : Operating System: windows xp, Platform: J2EE, Database : MySQL
Application server : Tomcat 5.0, Protocol : TCP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

             In this paper we present the recognition of human actions under view changes. here we Deploy an automotive visual surveillance system to detect abnormal behavior patterns and recognize the normal ones. If a person enters a room, video of him is captured and stored(both side view and the top view) then it is given to the training module here the video is checked if it is a normal behavior splited image is taken, whenever the action is recognized blob images are saved, and the frame counts are taken . In case, the anomaly is detected the red color will be displayed. The abnormal behavior is achieved by keep tracking the videos and blob frames and checking each frame values.

System Requirement Specification:-
DOMAIN :Transactions on Pattern Analysis and Machine intelligence,
SOFTWARE : Operating System: windows xp, Platform: JAVA, Database : MySQL
Special Tool : Java Media Framework, Protocol : TCP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

                 As the internet services spread all over the world, many kinds and large number of security threats are increasing. We describe a novel fuzzy class- association- rule mining method based on Genetic Network Programming (GNP) for detecting network intrusions. GNP is a evolutionary optimization technique, which uses directed graph structures instead of stings in genetic algorithm or trees in genetic programming. Alert aggregation is an important subtask of intrusion detection. Our main goal is to identify and to cluster different alerts. Meta-alerts can be generated for the clusters that contain all the relevant information whereas the amount of data (i.e., alerts) can be reduced substantially. Meta-alerts may then be the basis for reporting to security experts or for communication within a distributed intrusion detection system. We propose a novel technique for online alert aggregation which is based on a dynamic, probabilistic model of the current attack situation.

System Requirement Specification:-
DOMAIN : ACM TRANSACTIONS ON NETWORKING
SOFTWARE : Operating System: windows xp, Platform: JAVA
Database : My SQL 4.0, Algorithm: Fuzzy Class-Association -Rule Mining Using GNP
HARDWARE : Processor:Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

                     Cloud computing has been envisioned as the next generation architecture of IT enterprise becoming domain in IT organizations, as an elastic, flexible, and variable-cost way to deploy their service platforms using outsourced resources. In this paper, we deploy a computing cluster on the top of a multicloud infrastructure, for solving loosely coupled Many-Task Computing (MTC) applications. By this way, the cluster nodes can be provisioned with resources from different clouds to improve the cost effectiveness of the deployment, or to implement high availability strategies. We prove the viability of this kind of solutions by evaluating the scalability, performance and cost of different configurations of a single cluster, deployed on a multicloud infrastructure spanning a local data centre and other different cloud sites.

System Requirement Specification:-
DOMAIN : Transactions on Parallel and Distributed Systems
SOFTWARE : Operating System: windows xp, Platform: J2EE
Protocol : TCP, Application server : Tomcat 5.0, Database : MySQL
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB, HDD: 80 GB

                     In our project we seek to provide reliable and fast content discovery in peer- to - peer (P2P) video- on –demand (VoD) system to enable user interactivity under peer dynamics. We first identify two sets of characteristics of content discovery in P2P-VoD system i.e., real- time constraints and limited local cache. Considering these two properties we propose a hybrid contend discovery mechanism i.e., SUpeRchunk-based eFficient search Network (SURFNet). An efficient and fast content discovery algorithm is thus critical to P2P-VoD systems, especially in terms of reducing delay after a seek is performed. SURFNet classifies videos into two superchunks and chunks. Here video files are first divided into chunks, and then several chunks are grouped into superchunks. Peers form a structured overlay according to which superchunk they hold. Our analysis results show that SURFNet supports nearly-constant and logarithmic search time for seeking within a video and jumping to a different video, respectively.

System Requirement Specification:-

DOMAIN : Transaction on Multimedia
SOFTWARE : Operating System: windows xp ,Platform: Dotnet, Database: SQL Server 2005
Special Tool: Ajax and SilverLight3.
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ ,RAM: 2GB , HDD: 80 GB ,

                The main aim of our project is the optimal control of communication networks in the presence of heterogeneous traffic. The flows are distinguished into Elastic and Inelastic flows. Inelastic for modeling high-priority, delay sensitive, and fixed throughput application. Elastic for modeling low-priority, delay tolerant, and throughput greedy applications. The coexistence of such diverse flows creates complex interactions at multiple levels, which prevent the use of earlier design approaches that dominantly assume homogeneous traffic. Here we are uploading both the multimedia files (Inelastic) and the non real time file (Elastic) at the same time to the server and we can see both the files are reaching at the same time without any delay by using load balancing and congestion control algorithms. A unique characteristic of our proposed dynamic routing solution is the novel two-stage queueing architecture it introduces to satisfy the service prioritization requirement.

System Requirement Specification:- DOMAIN : Transaction on Networking
SOFTWARE : Operating System: windows xp, Platform: DOTNET,
Database : SQL Server 2005 , Protocol : TCP
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ, RAM: 2GB, HDD: 80 GB

                 The main objective of our project is Enabling public Auditability and Dynamic Data storage security in cloud computing. Cloud computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and database to the centralized large data centers, where the management of the data and services may not be fully trustworthy. Here we have considered the third party auditor on behalf of the cloud client which eliminates the involvement of the client directly to the server, checks whether the correct person, access the task if it is not a right person the alarm triggers. Extensive security and performance analysis show that the proposed schemes are highly efficient and provably secure.

System Requirement Specification:-
DOMAIN : Transactions on parallel and distributed systems
SOFTWARE : Operating System: windows xp, Platform: DOTNET ,
Database: SQL Server 2005, Protocol: TCP
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ, RAM: 2GB, HDD: 80 GB

                 Traditional access control solutions, based on preliminary identification and authentication of the access requester, are not adequate for the context of open web service systems, where servers generally do not have prior knowledge of the requesters. The research community has acknowledged such a paradigm shift and several investigations have been carried out for new approaches to regulate access control in open dynamic settings. The eXtensible Access Control Markup Language (XACML) has established itself as the emerging technological solution for controlling access in an interoperable and flexible way. Our goal is not the definition of a complete authorization model, but the formal representation of the basic building blocks needed for referring to credentials and reasoning about them, and for supporting abstractions, recursion, and dialog. Credential support requires the possibility of explicitly referring to digital certificates and relevant conditions about them in the policy specifications.

System Requirement Specification:-
DOMAIN : Transactions on parallel and distributed systems
SOFTWARE : Operating System: windows xp, Platform: DOTNET ,
Database: SQL Server 2005, Protocol: TCP
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ, RAM: 2GB, HDD: 80 GB

                 Peer-to-Peer VoIP (voice over IP) networks, exemplified by Skype, are becoming increasingly popular due to their significant cost advantage and richer call forwarding features than traditional public switched telephone networks. One of the most important features of a VoIP network is privacy (for VoIP clients). Unfortunately, most peer-to-peer VoIP networks neither provide personalization nor guarantee a quantifiable privacy level. In this paper we propose novel flow analysis attacks that demonstrate the vulnerabilities of peer-to-peer VoIP networks to privacy attacks. We then address two important challenges in designing privacy-aware VoIP networks: Can we provide personalized privacy guarantees for VoIP clients that allow them to select privacy requirements on a per-call basis? How to design VoIP protocols to support customizable privacy guarantee? This paper proposes practical solutions to address these challenges using a quantifiable k-anonymity metric and a privacy-aware VoIP route setup and route maintenance protocols. We present detailed experimental evaluation that demonstrates the performance and scalability of our protocol, while meeting customizable privacy guarantees.

System Requirement Specification:-
DOMAIN : Transactions on parallel and distributed systems
SOFTWARE : Operating System: windows xp, Platform: DOTNET ,
Database: SQL Server 2005, Protocol: TCP
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ, RAM: 2GB, HDD: 80 GB

                 “X” owns a k-anonymous database and needs to determine whether “X” database, when inserted with a tuple owned by “Y”, is still k-anonymous. Clearly, allowing “X” to directly read the contents of the tuple breaks the privacy of “Y”. In this place,”Y” not get the privay of own information becaue the information of “Y” can be accessed by “X” without the prior knowledge of “Y”. On the other hand, the confidentiality of the database managed by “X” is violated once “Y” has access to the contents of database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting “X” and “Y” knows the contents of the tuple and database respectively. In this paper, we propose two protocols solving this problem, that is suppression-Based & Generalization-Based k-anonymous and Confidential databases using through prototype architecture. And also that two protocols maintain privacy and confidential information in k-anonymous database.

System Requirement Specification:-
DOMAIN : Transactions on parallel and distributed systems
SOFTWARE : Operating System: windows xp, Platform: DOTNET ,
Database: SQL Server 2005, Protocol: TCP
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ, RAM: 2GB, HDD: 80 GB

                 Anonymizing Networks so such as Tor allow users to access Internet Services privately by using a series of routers to hide the client’s IP address from the server. In this Networks, many people misbehaving the popular websites like facebook, orkut, hi5, twitter, etc…through hide the client’s IP address. But, website administrator routinely rely on IP address blocking for disabling Access to misbehaving users, but blocking IP address is not practical if the misbehaviour routes through an anonymizing network. So, we propose the new system to solve this problem using Nymble. Nymble system, in which servers can “blacklist” misbehaving users, thereby blocking users without compromising their anonymity using through the Nymble Manager ,Pseudonym Manager. And this Nymble System accurately finding the Misbehaving users in Anonymizing networks and also maintained the blacklisted users details in server.

System Requirement Specification:- DOMAIN : Transaction on Networking
SOFTWARE : Operating System: windows xp, Platform: DOTNET , Protocol : TCP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB