Verify in www.ieee.org

                  “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

                 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

                 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

                 Traditional trust management schemes developed for wired and wireless ad-hoc networks are not well suited for sensor networks due to their higher consumption of resources such as memory and power. In this work, we propose a new lightweight Group-based Trust Management Scheme (GTMS) for wireless sensor networks which employs clustering. Our approach reduces the cost of trust evaluation. Also, theoretical as well as simulation results show that our scheme demands less memory, energy and communication overheads as compared to the current state-of-the-art trust management schemes and it is more suitable for large-scale sensor networks. Furthermore, GTMS also enables us to detect
and prevent malicious, selfish and faulty nodes

System Requirement Specification:-
DOMAIN     : TRANSACTION ON NETWORKING
SOFTWARE : Operating System:Windows XP, Platform: DOTNET, Back end: SQL SERVER
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

                  The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a sinle source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.

System Requirement Specification:-
DOMAIN     : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: windows xp, Platform: JAVA, Method: EPD,RCBS,RPS
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZRAM: 512 MB,HDD: 80 GB

                 In recent years, the exponential growth of Internet users with increased bandwidth requirements has led to the emergence of the next generation of IP routers. Distributed architecture is one of the promising trends providing petabit routers with a large switching capacity and high-speed interfaces. Distributed routers are designed with an optical switch fabric interconnecting line and control cards. Computing and memory resources are available on both control and line cards to perform routing and forwarding tasks. This new hardware architecture is not efficiently utilized by the traditional software models where a single control crd is responsible for all routing and management operations. The routing table manager plays an extremely critical role by managing routing information and in particular, a forwarding information table. This article presents a distributed architecture set up around a distributed and scalable routing table manager. This architecture also comes provides improvements in robustness and resiliency. The proposed architecture is based on a sharing mechanism between control and line cards and is able to meet the scalability requirements for route computations, notifications, and advertisements. A comparative scalability evaluation is made between distributed and centralized architectures in terms of required memory and computing resources.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: Windows XP, Platform:DOTNET
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

              Each node maintains in its cache table the information necessary for cache updates. A link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner.v We show that the algorithm out performs DSR with path caches and with Link-Max Life, an adaptive timeout mechanism for link caches.

System Requirement Specification:-
DOMAIN     :   TRANSACTION ON NETWORKING
SOFTWARE : Operating System:Windows XP, Platform: DOTNET
HARDWARE : Processor:Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

              In the distributed denial of service (DDos) attack, attacker requests the target IP Address to the DNS server. Then he takes over many computers that have vulnerabilities in advance. Hosts that are taken over called zombie hosts (a machine which can�t protect itself from unauthorized access, like the remote system may not have firewall).
By employing many zombie hosts, attacker can send vast amount of data packet to the target host. It makes huge traffic in the host network. If the network traffic increased, the speed of the data transmission will be very less.
           There is a technique to reduce the influence of the DoS attack without disturbing the demand of the regular users by allocating the information, when DoS attack occurs, to the filtering rules. To overcome this DoS attack in network, we are implementing Filtering technique based on DNS query response and creating a Hashed value table using the IP address of source and destination machines. Firewall is employed for DoS countermeasure. By limiting packet rate at which it passes to inner network, it can protect inner network from flooding.

System Requirement Specification:-
DOMAIN     : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: windows xp Platform: JAVA,DB: SQL Server
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ,RAM: 512 MB,HDD: 80 GB

           This project concentrates on pricing network service dynamically based on the level of service, usage and congestion allows the network resources to be used more effectively. We integrate the proposed Service dependent pricing scheme with dynamic pricing and service negotiation environment. This increases network resource utilization and avoid high call blocking rate. Users are able to maintain stable expenditure, and allowing user to migrate between services classes in response to price increase further stabilizes the individual service prices.

System Requirement Specification:-
DOMAIN      : TRANSACTION ON NETWORKING
SOFTWARE : Operating System:Windows XP , Platform: DOTNET, Protocol: :UDP                   
                   Back End :SQLSERVER
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

                  Current research trend towards mobile computing emphasizes the need for distribution of data among various clients in wireless environment. Sharing the data in J2ME opens the data to be accessible for all MIDLETs present on the device, hence creating a number of vulnerabilities to the confidential information that is intended to be shared with specific MIDLETs, e.g. a malicious MIDLET can delete, copy or move the Shared Record Store, in J2ME based application. This project aims at overcoming record store sharing problem through the concept of Multi- Agent System by providing a shared storage with explicit access to authenticated & authorized MIDLETs. With this mechanism data can be shared among specific MIDLETs. The implementation uses the SAGE-Lite framework as a solution to our proposed work.

System Requirement Specification:-
DOMAIN     : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: windowsxp; Platform: JAVA, Protocol : TCP /IP, 
                  Back End: Ms-access
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

                 This is a technique to reduce the influence of the DoS attack without disturbing the demand of the regular users by allocating the information, when DoS attack occurs, to the filtering rules.
                 To overcome this DoS attack in network, we are implementing Filtering technique based on DNS query response and creating a Hashed value table using the IP address of source and destination machines. Firewall is employed for DoS countermeasure. By limiting packet rate at which it passes to inner network, it can protect inner network from flooding

System Requirement Specification:-
DOMAIN     : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: windows xp, Platform: JAVA, Back end: :My SQL
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ , RAM: 512 MB,HDD: 80 GB

                In this paper, we address the issue of connecting MANETs to global IPv6 networks while supporting IPv6 mobility. Specifically, we propose a self-organizing, self-addressing, self-routing IPv6-enabled MANET infrastructure, referred to as IPv6-based MANET. The proposed self-organization addressing protocol automatically organizes nodes into tree architecture and configures their global IPv6 addresses. We have implemented a prototype system to demonstrate the feasibility and efficiency of the IPv6-based MANET and the P2P information sharing system. Simulations are also conducted to show the effciency of the proposed routing protocol and the P2P file sharing system

System Requirement Specification:-
DOMAIN     : AD-HOC NETWORK
SOFTWARE : Operating System: Windows xp, Platform:JAVA, Protocol: IPV6,
                  Back end : MS Access
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

                 This paper aims to address of modeling video behavior captured in surveillance video for the applications of online normal behavior recognition and anomaly detection. A novel framework is developed for automatic behavior profiling and online anomaly sampling detection with out any manual labeling of the training data set. The frame work consists of the following key components: 1) A compact and effective behavior representation method is developed based on discrete scene event detection. The similarity between behavior patterns is measured based on modeling each pattern using Dynamic Bayesian Network (DBN). 2) The natural grouping of behavior patterns is discovered through novel spectral clustering algorithm with unsupervised model selection and future selection on the eigenvectors of a normalized affinity matrix. 3) A composite generative behavior model is constructed that is capable of generalizing from a small training set to accommodate variations in unseen normal behavior patterns.4) A runtime accumulative anomaly measure is introduced to detect abnormal behavior, where as normal behavior patterns are recognized when sufficient visual evidence has become available based on onlne Likelihood Ratio Test(LRT) method. This ensures robust and reliable anomaly detection and normal behavior recognition at the shortest possible time. The effectiveness and robustness of our approach is demonstrated through experiments using noisy and sparse data sets collected from both indoor and outdoor surveillances scenarios. In particular, it is shown that a behavior model trained using unlabeled data set is superior to those trained using same but labeled data set in detecting anomaly from an unseen video. The experiments also suggest that our online LRT-based behavior recognition is advantageous over the commonly used maximum Likelihood (ML) method in differentiating ambiguities among different behavior classes observed on line at their advantages and drawbacks

System Requirement Specification:-

DOMAIN        : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: Windows xp, Platform: JAVA, Back end: MySql,
                  Protocol:UDP sp
HARDWARE : Processor:Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

         This project concentrates on pricing network service dynamically based on the level of service, usage and congestion allows the network resources to be used more effectively. We integrate the proposed Service dependent pricing scheme with dynamic pricing and service negotiation environment.   This increases network resource utilization and avoid high call blocking rate. Users are able to maintain stable expenditure, and allowing user to migrate between services classes in responseto price increase further stabilizes the individual service prices.

System Requirement Specification:-
DOMAIN      : NETWORK
SOFTWARE : Operating System: Windows xp , Platform:JAVA, Back end: MySql
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB

                Images account for a significant and growing fraction of Web downloads. The traditional approach to transporting images uses TCP, which provides a generic reliable, in-order byte-stream abstraction, but which is overly restrictive for image data. We analyze the progression of image quality at the receiver with time and show that the in-order delivery abstraction provided by a TCP-based approach prevents the receiver applications from processing and rendering portions of an image when they actually arrive.   &nbsp         &nbsp       The end result is that an image is rendered in bursts interspersed with long idle times rather than smoothly. This paper describes the design, implementation, and evaluation of the Image Transport Protocol (ITP) for image transmission over loss-prone congested or wireless networks. ITP improves user-perceived latency using application level framing (ALF) and out-of-order Application Data Unit (ADU) delivery, achieving significantly better interactive performances measured by the evolution of peak signal-to noise ratio (PSNR) with time at the receiver. ITP runs over UDP, incorporates receiver-driven selective reliability, uses the Congestion Mnager (CM) to adapt to network congestion, and is customizable for specific image formats (e.g., PEG and JPEG2000). ITP enables a variety of new receiver post-processing algorithms such as error concealment that further improve the interactivity and responsiveness of reconstructed images. Performance experiments using our implementation across a variety of loss conditions demonstrate the benefit of ITP in improving the interactivity of image downloads at the receiver.

System Requirement Specification:-
DOMAIN     :NETWORK
SOFTWARE :Operating System: Windows xp, Platform:JAVA
HARDWARE :Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB