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

                 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

             Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic
results and to show the capability of the proposed algorithm.

System Requirement Specification:-

DOMAIN     :  TRANSACTIONSONPARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE :  Operating System: Windows XP,  Platform: JAVA,     DB: SQL Server                                      
HARDWARE  :   Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

              In third generation WCDMA systems, shared channels allow many users to jointly utilize a single Orthogonal Variable Spreading Factor (OVSF) code. In this paper, we propose a Scheduling Algorithm with Dynamic Priority Assignment (DPA), which is designed for the Downlink-Shared Channel (DSCH) of 3G WCDMA systems and operates within a cross-layer framework. The DPA scheduler has low computational complexity and is able to provide Quos differentiation among traffic flows based on their delay sensitivity. Through the cross-layer framework, DPA takes into account the variations of the wireless channel and exploits processing gain?to improve transmission quality and enable service provisioning when possible. Additionally, by providing a guaranteed rate per traffic flow at each scheduling period, DPA can offer a deterministic delay bound to each connection when transmissions are reliable. Stochastic delay guarantees under transmission power limitations are also provided when the traffic flows are identical. Simulation results show that DPA outperforms Feasible Earliest Due Date (FEDD), a variation of EDD for wireless environments.

System Requirement Specification:-

DOMAIN :TRANSACTION ON NETWORKING SECURITY                                                            
SOFTWARE  :  Operating System: Windows XP  ,Platform: DOTNET ,Algorithm: DPA, OVSFB               
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     :  TRANSACTIONS ON MOBILE COMPUTING                                                    
SOFTWARE    :    Operating System: Windows XP; Platform: DOTNET, Protocol :UDP
HARDWARE    :    Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

               Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

System Requirement Specification:-

DOMAIN          : TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING         
SOFTWARE     : Operating System: Windows XP,  Platform: DOTNET , Back End :SQL  SERVER ,                                    Protocol :UDP    
HARDWARE     :  Processor: Pentium-IV,  Speed: 1.8 GHZ ,    RAM: 512 MB,     HDD: 80 GB

                This paper presents an H-infinity filtering approach to optimize a fuzzy control model used to determine behavior-consistent (BC) information-based control strategies to improve the performance of congested dynamic traffic networks. By adjusting the associated membership function parameters to better respond to nonlinearities and modeling errors, the approach is able to enhance the computational performance of the fuzzy control model. Computational efficiency is an important aspect in this problem context, because the information strategies are required in sub real time to be real-time deployable. Experiments are performed to evaluate the effectiveness of the approach. The results indicate that the optimized fuzzy control model contributes in determining the BC information-based control strategies in significantly less computational time than when the default controller is used. Hence, the proposed H-infinity approach contributes to the development of an efficient and robust information-based control approach.

System Requirement Specification:-

DOMAIN        : TRANSACTION ON INTELLIGENT TRANSPORTATION SYSTEM                              
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

               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 card 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        : TRANSACTION ON IMAGE PROCESSING                                                                        
SOFTWARE        : Operating System: Windows XP, Platform: DOTNET , Protocol:UDP                        
HARDWARE    :  Processor:  Pentium-IV, Speed: 1.8 GHZ , RAM: 512 MB,  HDD: 80 G?

                 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 card 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

    &nbs?;          Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this modal, for example, wildlife tracking sensor networks, Military networks, vehicular ad hoc networks, etc. In This context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent.
                To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts tom reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios.
                 Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spry routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.

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

           Proving ownership rights on outsourced relational databases is a crucial issue in today internet-based application environment and in many content distribution applications. In this paper, we present a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. We formulate the waterma?king of relational databases as a constrained optimization problem, and discuss efficient techniques to solve the optimization problem and to handle the constraints. Our watermarking technique is resilient to watermark synchronization errors because it uses a partitioning approach that does not require marker tuples. Our approach overcomes a major weakness in previously proposed watermarking techniques. Watermark decoding is based on a threshold-based technique characterized by an optimal threshold that minimizes the probability of decoding errors. We implemented a proof of concept implementation of our watermarking technique and showed by experimental results that our technique is resilient to tuple deletion, alteration and insertion attacks.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING                              
SOFTWARE  : Operating System:WindowsXP, Platform:DOTNET,BackEnd :SQL  SERVER, Protocol : UDP HARDWARE :  Processor:  Pentium-IV ,  Speed: 1.8 GHZ , RAM: 512 MB,  HDD: 80 GB

                  The paper proposes an approach to content dissemination that exploits the structural properties of an Extensible Markup Language (XML) document object model in order to provide an efficient dissemination and at the same time assuring content integrity and confidentiality. Our approach is based on the notion of encrypted postorder numbers that support the integrity and confidentiality requirements of XML content as well as facilitate efficient identification, extraction, and distribution of selected content portions. By using such notion, we develop a structure-based routing scheme that prevents information leaks in the XML data dissemination, and assures that content is delivered to users according to the access control policies, that is, policies specifying which users can receive which portions of the contents. Our proposed dissemination approach further enhances such structure-based, policy-based routing by combining it with multicast in order to achieve high efficiency in terms of bandwidth usage and speed of data delivery, thereby enhancing scalability. Our dissemination approach thus represents an efficient and secure mechanism for use in applications such as publish-subscribe systems for XML Documents. The publish-subscribe model restricts the consumer and document source information to the routers to which they register with. Our framework facilitates dissemination of contents with varying degrees of confidentiality and integrity requirements in a mix of trusted and untrusted networks, which is prevalent in current settings across enterprise networks and the Web. Also, it does not require the routers to be aware of any security policy in the sense that the routers do not need to implement any policy related to access control.

System Requirement Specification:-?

DOMAIN        : TRANSACTION ON SYSTEM MAN AND CYBERNETICS                                            
SOFTWARE  :Operating System: Windows XP, Platform: DOTNET, Protocol: UDP                                                    
HARDWARE   :  Processor:  Pentium-IV,  Speed: 1.8 GHZ , RAM: 512 MB,  HDD: 80 GB

                  It Support of DiffServ traffic in a core router.Each output port, streams may be isolated in separate buffers before being scheduled in a frame.The sequence of traffic transmission in a frame starts from higher-priority traffic and goes down to lower-spriority traffic. A frame may have a number of small rounds for each class. Each stream within a class can transmit a number of packets in the frame.Only one packet send per small round.It is used to prevent the starvation of lower priority classes.

System Requirement Specification:-

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

           &nb?p;  Each node maintains in its cache table the information necessary for cache updates.v 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 this paper we analyze three mechanisms for providing Endpoint Admission Control: virtual-queue making, random-early marking and tail drop. For each scheme, we analyze the probing duration necessary to guarantee the required QoS (Quality of Service) and achieve high link utilization. Our main conclusion is that very few probe packets have to be sent when early marking is used (eg: 5KB), whereas tail drop requires a large number of probe packets (eg: 1KB). Very few probe packets have to be sent when virtual queue marking is used, Virtual queue marking strategy is based on virtual queue, router maintain the state of a virtual queue, which correspond to a buffer of size B. Arriving packets are queued in the real queue but a counter which tracks of the content of the virtual queue is incremented by one for each arriving packet.

System Requirement Specification:-

DOMAIN: TRANSACTION ON NETWORKING SECURITY
SOFTWARE: Operating System: Windows XP , Platform: DOTNET
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 classe? 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