The document appears to be a table listing 20 projects related to networking and distributed systems completed from 2008-2009. Each project listing includes a project code, title, brief description of 1-2 sentences, and the year completed. The projects focus on topics like performance monitoring, clustering algorithms, distributed computing, data protection, resource selection, information dissemination, spam filtering, peer-to-peer networks, genome similarity search, distributed simulation, and object sharing.
The document appears to be a table listing 20 projects related to networking and distributed systems completed from 2008-2009. Each project listing includes a project code, title, brief description of 1-2 sentences, and the year completed. The projects focus on topics like performance monitoring, clustering algorithms, distributed computing, data protection, resource selection, information dissemination, spam filtering, peer-to-peer networks, genome similarity search, distributed simulation, and object sharing.
The document appears to be a table listing 20 projects related to networking and distributed systems completed from 2008-2009. Each project listing includes a project code, title, brief description of 1-2 sentences, and the year completed. The projects focus on topics like performance monitoring, clustering algorithms, distributed computing, data protection, resource selection, information dissemination, spam filtering, peer-to-peer networks, genome similarity search, distributed simulation, and object sharing.
Experts in overseas education & Immigration Services
Vasanth plaza, Varun showroom Building, Benz Circle, VIJAYAWADA Cell: 9848123999
JAVA DOMAIN: IEEE NETWORKING
S.NO PROJECT PROJECT TITLES DESCRIPTION YEAR
CODE 1 VSJNW01 Lightweight Online In this project, a new performance Performance Monitoring and monitoring approach called Tuning with Embedded Gossip Embedded Gossip (EG) is 2009 designed to enable lightweight online performance monitoring and tuning. 2 VSJNW02 Eventual Clusterer: A Modular In this project, a clustering Approach to Designing function, called eventual clusterer 2009 Hierarchical Consensus is designed for constructing and Protocols in MANETs maintaining the two-layer hierarchy. 3 VSJNW03 On the Fly Estimation of the In this project, proposes a Processes that Are Alive in an protocol, plus a second protocol Asynchronous Message- that allows to cope with 2009 Passing System. Heterogeneous communication networks in fault-tolerant- distributed computing. 4 VSJNW04 A Case for Continuous Data In this project, we propose a new Protection at Block Level in disk array architecture that 2009 Disk Array Storages provides Timely Recovery to Any Point-in-time, referred to as TRAP. 5 VSJNW05 Using Data Accessibility for In this project, we present Resource Selection in Large- accessibility-aware resource Scale Distributed Systems selection techniques by which it is 2009 possible to choose nodes that will have efficient data access to remote data sources. 6 VSJNW06 Multipath Dissemination in In this project, we present a Regular Mesh Topologies scalable approach for dissemination that 2009 exploits all the shortest paths between a pair of nodes and improves the QoS
7 VSJNW07 Privacy-Aware Collaborative In this project, a privacy-aware
Spam Filtering framework for collaborative spam filtering, preserving message 2009 transformation technique that is highly resilient against the latest kinds of spam attacks. 8 VSJNW08 Dynamic Search Algorithm in In this project, we propose the Unstructured Peer-to-Peer dynamic search (DS) algorithm, 2009 Networks which is a generalization of flooding and RW. 9 VSJNW09 A Decentralized Method for This paper tackles this problem in Scaling Up Genome Similarity a novel way, which treats 2009 Search Services sequence search requests as content requests to both genome databases and similarity detection methods 10 VSJNW10 An Efficient Adaptive In this project, the aim of DDM is Transmission Control Scheme to reduce and control the volume for Large-Scale Distributed of information exchanged among 2009 Simulation Systems the simulated entities in a large- scale distributed simulation system. 11 VSJNW11 Plexus: A Scalable Peer-to- In this project, Plexus, a peer-to- Peer Protocol Enabling peer search protocol that provides Efficient Subset Search an efficient mechanism for 2009 advertising a bit sequence (pattern), and discovering it using any subset of its 1-bits. 12 VSJNW12 Detecting Malicious Packet In this project, the problem of Losses detecting whether a compromised 2009 router is maliciously manipulating its stream of Packets. 13 VSJNW13 Cooperative Secondary In this project, an approach where Authorization Recycling each application server recycles previously received authorizations 2009 and shares them with other application servers to mask authorization server failures and network delays. 14 VSJNW14 Robust Rate Control for In this project, a novel robust flow Heterogeneous Network control framework for 2009 Access in Multihomed heterogeneous network access by Environments devices with multi-homing capabilities. 15 VSJNW15 Optimizing the Throughput of In this project, we analytically Data-Driven Peer-to-Peer study the scheduling problem in Streaming data-driven streaming system and 2009 model it as a classical min-cost network flow problem. 16 VSJNW16 Quiver: Consistent Object In This project (Quiver), a system Sharing for Edge Services that coordinates service proxies placed at the “edge” of the Internet 2008 to serve distributed clients accessing a service involving mutable objects. 17 VSJNW17 A Model-Based Approach to In this project, we are going to Evaluation of the Efficacy of evaluate the efficacy of FEC FEC Coding in Combating coding. To evaluate it, we are 2008 Network Packet Losses going to transfer data from Source to Destination. 18 VSJNW18 Performance of a Speculative In this project, we introduce a Transmission Scheme for speculative transmission scheme to Scheduling-Latency Reduction significantly reduce the average 2008 control-path latency by allowing cells to proceed without waiting for a grant, under certain conditions 19 VSJNW19 Two Techniques for Fast In this project, we propose two Computation of Constrained techniques that reduce the Shortest Paths discretization errors, reducing the overhead of computing 2008 constrained shortest paths is practically important for the successful design of a high- throughput QoS router. 20 VSJNW20 Designing Less-Structured P2P In this project, we propose a Systems for the Expected High number of illustrative query- Churn related strategies and organizational protocols that, 2008 taking into consideration the expected session times of peers (their lifespan), yield systems with performance.