Projects & Research
Dynamic channel allocation in
wireless ad-hoc networks
This is part of work I did for
Cognet Project at
Calit2. We evaluate the
effectiveness of a dynamic channel allocation scheme for providing
improved network throughput on an ad-hoc network with adaptive learning
capabilities. We observe in some cases this scheme can boost the
performance up to 2 to 3 times compared to a statically channel
allocated network.
Download paper
Download PPT
P2P DNS / ReachMe
DNS is a widely used addressing scheme on the Internet. Despite its
popularity, conventional DNS has many disadvantages. One example is
represented by the many hosts on the Internet which are unable to be
addressed due to several challenges that arise from firewalls, NATs
and dynamically assigned IP addresses. Another disadvantage is
fragmented addressing as a result of the hierarchal design of DNS.
We propose a new peer-to-peer DNS scheme, which will allow any host
to be addressed, regardless of the type of its connectivity, and
thus enable seamless addressing on existing networks. This scheme
will allow traditional DNS clients to leverage underlying
connectivity to reach any node connected to the Internet at any
time. We describe the prototype implementation of this scheme and
its performance in a lab setting. We also analyze the challenges
which may arise from building such networks.
Download
Paper
Download PPT
Sourceforge
website (ReachMe)
Lock Services in Distributed File
Systems
(CSE 221 Operating Systems Study report. Winter 07)
In
this paper we critically analyze
two papers on locking in distributed storage. The first paper is
Distributed Directory Service in th
Farsite File System. The second is The
Chubby Lock Service for loosely-coupled distributed systems.
ppt
Comparison of UPC vs MPI
(CSE 260 Parallel Computing Project. Fall 06)
We conducted an exploration of UPC by
implementing several programs in both MPI and UPC, and comparing their
latency, bandwidth and scalability as well as how easy it was to develop
these programs in MPI and UPC.
Download final presentation
Download final report
Download
Source Code (.rar)
-----Some Older Work -------
FTP +
Abstract -The current FTP (File Transfer Protocol)
protocol can be optimized to provide faster file transfers over a slow
data line. This can be done by porting a compression layer in the FTP
protocol. By the use of compression we can reduce the time taken for
transferring a file using FTP protocol. This new protocol i.e. FTP + will
also provide backward compatibility with the FTP protocol. Testing of this
protocol over dialup line have shown up to 50 % less time requirement
than FTP protocol. Other issues like checksums for huge files and
encryption of the password while negotiating link have also been addressed
in this paper.
Twister Mesh - A secure and reliable multi-hop protocol
Twister Mesh
protocol works
by relaying TCP sockets across the route in an ad-hoc mobile mesh network.
It is independent of the type of lower level protocols such as 802.11b or
802.11g. It has route establishment and optimal path detection mechanisms,
which are discussed in this paper. Twister mesh protocol generates the
routing information only on demand and hence is a very lightweight
protocol. It sends a discovery packet to detect the current network
topology and take a routing decision based on the explorer packet results.
Working just below the TCP layer it adds reliability and security to the
applications running on mesh network. Its uses TCP for data connections
and UDP for control information. This paper is based on the study, which
was done to design Twister Mesh protocol, and also discusses the current
status of this research. It also describes the advantages and
disadvantages in comparison to the other mesh protocols.
Swift - The high performance cluster (Heterogeneous)
A virtual machine based Distributed memory and process
migration middleware.
