Interconnected computer systems where the machines utilize the same resources collectively. Grid computing usually consists of one main computer that distributes information and tasks to a group of networked computers to accomplish a common goal. Grid computing is often used to complete complicated or tedious mathematical or scientific calculations.

            Peer-to-peer (P2P) networks have been emerging as one of the most promising approaches to improve the calability of video-on-demand (VoD) service over Internet. Although a number of architectures and streaming protocols have been proposed in pastyears, there is few work to study the practical performance of P2P-based VoD service especially considering the real user behaviorwhich actually has significant impact on the system scalability. Therefore, in this paper, we first characterize the user behavior byanalyzing a large amount of real traces from a popular VoD system supported by the biggest television station in China, cctv.com.Then, we examine the practical scalability of P2P-based VoD service through extensive trace-driven simulation under a general system framework. The results show that P2P networks scale well in providing VoD service under real user behavior by saving a considerable percentage of server bandwidth. Moreover, it is observed that adopting hard cache at client side achieves much better system scalability than that with soft cache. We also identify the impact of various aspects of user behavior upon system scalability through detailed simulation. We believe that our study will shine insightful light on the understanding of practical scalability of P2P-based VoDservice and be helpful to future system design and optimization.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: windows xp Platform: JAVA/J2EE
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZRAM: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 single 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

                 This project discusses some issues to keep in mind while accessing a stand-alone database from a Java client. Client/server technology allows distributed processing of information, which lets we have more easily deal with large volumes of data and many concurrent users. This project will work with how to create both a server and a client application that can communicate with each other and provide access to a stand-alone database.
This project contain the following Part:
1.Query conversion
2.Result object provider
3.Object Visualizer

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

            The overall goal is to turn the network into a flexible, easily administered tool with which resources can be found by human and computational clients. Providing users an effective and efficient way of computation which minimizes cost, time and its resources.
            The idea that drives this project is thata procedure that makes network based computation more compelling. This allows cooperating devices, services and applications (and theres little distinction between these) to access each other seamlessly, to adapt to a continually changing environment. Distributed object computing is network-centric.
            The Services here we are using are compression service, pattern recognition and JRE utilization and these services are used as a service provider. Using Jini we can invoke any number of services avoiding the disadvantages of RMI concepts. A Jini system is a Java technology-centered, distributed system designed for simplicity, flexibility, and federation.
            MODULES
              o Service Provider
              o Compressing Service
              o Pattern Recognition Service
              o CPU Utilization Fraction
              o Jini Registrar
              o Service Finder

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