To Manage video Streaming on heterogeneous networks with a video streaming platform on a continuous multimedia service at any time in any location with any computing device. One of the major challenge is particular is how to design a session handoff control scheme. The main aim is to how to produce the seamless services for the user under various conditions.

System Requirement Specification:-
DOMAIN : Mobility management
SOFTWARE : Operating System: Windows xp, Platform: JAVA, Algorithm: ISMA,TOOL: JMF
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB

               Abstract Since the first operational IPTV networks have been deployed, service providers and operators have struggled to make their subscribers happy and satisfied with their services. To keep them as customers in the long term, they have been looking for ways to identify impairments to the perceived quality of experience. It is now well understood that this can only be achieved if the service providers have virtual eyes throughout their networks. In this article we provide an overview of the Real- Time Transport Protocol and its application to IPTV. We describe the monitoring and reporting features offered by RTP, and emphasize how they can be used to enhance subscriber QoE.

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

             Conditional access system (CAS) proposed by Sun et al. has a critical security weakness in its inability to preserve backward secrecy; a former subscriber can still access programs despite his or her change in status. This weakness in Sun et al.s CAS originates because 1) no change is made to a group key after a new member arrives, and 2) updates of group keys are done in an insecure manner. We show how simple protocol changes can fix these weaknesses and thus render Sun et al.s CAS capable of preserving backward secrecy. Index Terms:Access key management, conditional access system, group key distribution, pay-TV.

System Requirement Specification:-
DOMAIN :IEEE TRANSACTIONS ON MULTIMEDIA,
SOFTWARE : Operating System: windows xp, Platform: JAVA
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

                 Abstract�In recent years, both sophistication and damage potential of Internet worms have increased tremendously. To understand their threat, we need to look into their payload for signatures as well as propagation pattern for Internet-scale behavior. An accurate analytical propagation model allows us to comprehensively study how a worm propagates under various conditions, which is often computationally too intensive for simulations. More importantly, it gives us an insight into the impact of each worm/ network parameter on the propagation of the worm. Traditionally, most modeling work in this area concentrates on the relatively simple random-scanning worms. However, modeling the permutation- scanning worms, a class of worms that are fast yet stealthy, has been a challenge to date. This paper proposes a mathematical model that precisely characterizes the propagation patterns of the general permutation-scanning worms. The analytical framework captures the interactions among all infected hosts by a series of interdependent differential equations, which are then integrated into closed-form solutions that together present the overall worm behavior. We use the model to study how each worm/network parameter affects the worm propagation. We also investigate the impact of dynamic network conditions on the correctness of the model. Index Terms�Network security, worm modeling.

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

                     Abstract :Wireless sensor networks (WSNs) continue to evolve as one of the most exciting and challenging research areas. There are many applications of wireless sensor networks that collect and disseminate sensitive and important information. For successful operation of many of the sensor node applications, it is necessary to maintain the privacy and security of the data stored in the sensor nodes and of the transmitted data. The security models and protocols used in the wired and other networks such as ad-hoc networks are not suitable for WSNs due to their severe resource constrictions. Thus there is a lack of an agreeable and most effective way of securing the information. In this paper a unique, dynamic cryptographic algorithm to provide security to the wireless sensor network by securing the individual nodes of the network, has been proposed.

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

The considered Service Overlay Networks (SON) lease bandwidth with Quality of Service (QoS) guarantees from a multitude of Internet Autonomous Systems, through service level agreements (SLA) with Internet Service Providers (ISP). This bandwidth is used to establish SON links and deliver end-toend QoS for real time service connections. The leased bandwidth amount influences both the admitted traffic and network cost, affecting the network profit. This gives the network operator the opportunity to optimize the profit by adapting the network resources to changing traffic and SLA costs conditions. We propose a novel approach that maximizes the network profit based on traffic measurements and SLA cost changes. The approach uses an economic model that integrates the network routing policy with the adaptation of the SON link capacities. While performing the adaptation of leased bandwidth, the connection blocking constraints are also maintained. The proposed adaptive optimization approach is based on a reward maximizing routing policy derived from the Markov Decision Process theory although it can be applied to other routing policies. Analytical models as well as simulation of a measurement based implementation of the proposed models are used to evaluate the performance of the proposed approach.

System Requirement Specification:-

DOMAIN : TRANSACTION ON NETWORKING
SSOFTWARE : Operating System: windows xp ,Platform: Dotnet ,MS SQL
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB ,

                Peer-to-Peer VoIP (voice over IP) networks, exemplified by Skype [5], 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 pri-vacy (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-topeer 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 : NETWORKING
SOFTWARE : Operating System: windows xp, Platform: DOTNET
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

                 The Aim of the project is to search for the Nearest Neighbor Node and superseding it on an uncertain Spatial Database, where each object is described by a Multi Dimensional Probability Function. In a Given query point, an object is considered to Nearest Node if it has a lowest Non Zero Probability with respect to the query point. For example, consider each object to be a cab, and the goal of the Nearest neighbor search is to recommend a cab to the customer to customer whom ever is nearest based on the probability value.

System Requirement Specification:- DOMAIN : NETWORKING
SOFTWARE : Operating System: windows xp, Platform: DOTNET ,MS SQL
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

                 Abstract�This paper presents a packet transmission delay modeling for networks using multiple truncated stop-and-wait (SAW) retransmission processes. The packet transmission delay includes the packet queueing delay (PQD) and the packet reordering delay (PRD). While the first type of delay is commonly known for any SAWprocedure, the latter is only introduced when multiple SAW processes are considered for parallel communications. These processes work independently while sharing the same packet traffic. By modeling the queueing buffer as an M/G/1 model, an analytical formula for the average PQD is provided. In addition, we model the PRD as a first-order Markov chain defined by a transition probability matrix, and derive the average PRD. Analytical formulae are provided considering the general case where error probabilities are different from a transmission to another, such as in automatic repeat request (ARQ) with packet combining, and for arbitrary values of the number of multi-SAW processes and maximum number of ARQ retransmissions.

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