MULTI SERVER COMMUNICATION IN DISTRIBUTED MANAGEMENT SYSTEM

Abstract: This approach has the potential of both distributing the operation processing load among the proxies and enabling clients to access the service by communicating with nearby proxies rather than a potentially distant centralized server. However, achieving even just serializability for operations executed at these proxies using standard replication approaches requires that a proxy involve either a centralized server or other (possibly distant) proxies on the critical path of each update operation. Our system implements a service with a designated server and an unbounded number of proxies. We generically refer to the server and the proxies as processes. To support the service, a proxy joins the service. In doing so, it is positioned within a tree rooted at the server. All proxies in the subtree rooted at that child are said to disconnect. The child (or, if the child failed, each uppermost surviving proxy in the subtree) can inform its subtree of the disconnection. The subtree can stay put until the disconnection heals, or they might reconnect via the server.

INTERCITY SEARCH QUERY PROCESSING

Abstract: This project presented a novel approach for reducing the spatial query access latency by leveraging results from nearby peers in wireless broadcast environments. Significantly, our scheme allows a mobile client to locally verify whether candidate objects received from peers are indeed part of its own spatial query result set. The experiment results indicate that our method can reduce the access to the wireless broadcast channel by a significant amount, for example, up to 80 percent, in a dense urban area. This is achieved with minimal caching at the peers. By virtue of its P2P architecture, the method exhibits great scalability: the higher the mobile peer density, the more the queries answered by peers. Therefore, the query access latency can be markedly decreased with the increase in clients.

MULTIPLE CHAT SERVER

Abstract: Chat Server is based on multi-tier server architecture to provide high performance on heavy load sites and the ability to expose a rich set of functionality like multi-user chat on standard protocols. The server core is based on the open instant messaging protocol Jabber / XMPP, thus allowing the integration with a wide set of clients and Jabber libraries. Multi Chat Server also introduces new Jabber protocol extensions to allow video conferencing over RTMP, or moderated / censored chat rooms for example. The according graphical user interface is exposed by the Multi Chat Flash-Client, to offer platform independent web integration. The Architecture-Overview slide shows the parts and services belonging to the Multi Chat Server solution. Basically, it consists of the Multi Chat Server core, the Admin-Interface, a separate web server for configuration settings and the Multi Chat database engine.

RETRIEVING FILES USING CONTENT BASED SEARCH Abstract: The current project is divided into four inter-dependent phases.

Phase 1: Deals with designing algorithms for summarizing and indexing text files. In case of multimedia files the meta data files are created manually by the programmers. This phase also involves algorithms for converting .doc and .pdf files to .txt format. In this system the searching is not done at the run time as indexing is done before hand.

Phase 2: In folders would be replaced by a new construct called a library. A library is a virtual folder that intelligently gathers information about files on the system and presents them to the users. The concept of folders ceases to exist. Instead, the users are privileged enough to view similar files together irrespective of their location in the physical memory. This enables retrieval of files based on various parameters. This concept is named as CAROUSEL VIEW after the proposed system with the same name to be launched by the Microsofts Windows Longhorn which is a complete revolution in itself.

Phase 3: Establishes a common peer to peer (P2P) protocol that enables remote querying over other terminals in the network. This module allows this software to be used across the internet and also over various LANs.

Phase 4: In a nutshell, this project aims at creating a system which is highly enhanced over the existing traditional ones and providing a user friendly environment.

BEST EFFORT MULTIMEDIA SERVICES

Abstract: In the wireless systems with time-varying channels, the resource allocation algorithm can exploit channel variation to enhance the system performance. We consider the video streaming service as the representative RT service since it generates massive traffic in comparison with other multimedia services. For the BE services, we consider the required average transmission rate as the QoS requirement, to prevent the long starvation of some users and the excessive delay of their packets. This policy is particularly helpful for the Internet services using the transmission control protocol (TCP).