CSE561 Graduate Networking -- Final Project Presentations

Time	Presentation title (and a link to the abstract and presentation file)	Presenters
Mon, Dec 06, 9:30am	Security and Resource Allocation for Ubiquitous Wireless Connectivity	Charles Reis and Karthik Gopalratnam
Mon, Dec 06, 9:45am	Diagnosing Network Problems with Standard Tools	Jonas Lindberg and Erika Rice
Mon, Dec 06, 10:00am	Performance Evaluation of VoIP in Different Settings	Shobhit Raj Mathur, Ioannis Giotis, and Tom Christiansen
Mon, Dec 06, 10:15am	Extending Place Lab to 3-D	Alan L. Liu and Tyler Robison
Mon, Dec 06, 10:30am	RandPing: A Randomized Algorithm for IP Mapping	Yuhan Cai and Michelle Jing Liu
Mon, Dec 06, 10:45am	Confidence Weighted Marginal Utility Analyses of Improved Internet Mapping Techniques	Daniel Wyatt and Craig Prince
Mon, Dec 06, 11:00am	UbiConn: Providing a Ubiquitous Connectivity Experience	Katherine Everitt, T. Scott Saponas, and Susumu Harada
Wed, Dec 08, 9:30am	Diagnosing Internet Connectivity Problems	Masaharu Kobashi and Rosalia Tungaraza
Wed, Dec 08, 9:45am	High-Performance Networks for Dataflow Architectures	Andrew Putnam and Pravin Bhat
Wed, Dec 08, 10:00am	The impact of incentives on the efficiency of BitTorrent Peer to Peer Networks	Seth Cooper and Jenny Liu
Wed, Dec 08, 10:15am	Statistical Learning of Routing Policies	Michael Cafarella and Daniel Lowd
Wed, Dec 08, 10:30am	Toward Better Geolocation: Leveraging Route Traces to Improve Internet Distance Estimates	Chandrika Jayant and Ethan Katz-Bassett
Wed, Dec 08, 10:45am	An Evaluation of a Channel Switching MAC Protocol for 802.11	Lillie Kittredge and Ethan Phelps-Goodman
Wed, Dec 08, 11:00am	Simulating Link-Level Structures	Kevin Wampler and Scott Schremmer

Time: Mon, Dec 06, 9:30am
Title: Security and Resource Allocation for Ubiquitous Wireless Connectivity
Authors: Charles Reis and Karthik Gopalratnam
Abstract:
Commodity wireless routers have become widely deployed, providing a new
opportunity to provide inexpensive Internet connectivity in broad areas.
  We present a software architecture to promote sharing connectivity,
using easily upgraded wireless routers and unmodified client devices.
We focus primarily on aspects of security and resource allocation,
addressing several issues unique to our domain, including appropriate
authentication and router queuing mechanisms.  We then evaluate our
queuing mechanism on an experimental wireless testbed to compare against
alternative solutions.  Overall, our design is appropriate for small and
large deployments of modified wireless routers, supporting widespread
growth of wireless connectivity.
Presentation: PDF version



Time: Mon, Dec 06, 9:45am
Title: Diagnosing Network Problems with Standard Tools
Authors: Jonas Lindberg and Erika Rice
Abstract:
It is altogether too common that a user cannot use the network 
they are on to do the tasks they desire. Experts know how to diagnose 
network problems using tools available, but using these tools is hard for 
the non-expert. We have developed a tool that demonstrates the feasibility
of automating the use of existing network tools.
Presentation: PPT version



Time: Mon, Dec 06, 10:00am
Title: Performance Evaluation of VoIP in Different Settings
Authors: Shobhit Raj Mathur, Ioannis Giotis, and Tom Christiansen
Abstract:
The internet is fast evolving into a universal communication network and
it is contemplated that soon it will carry all types of traffic, including
voice and video along with data. Among them, telephony is an application
of great importance, particularly because of the significant revenue it
can generate. Voice over Internet Protocol is a technology that allows
telephone calls to be made over computer networks like the Internet.
There are several implementations of VoIP in the internet today. Many
major telephone companies like AT&T have moved over to VoIP completely. It
is still not clear how the performance varies with different network
conditions, considering that the Internet does not provide QoS guarantees.

In this project we try to answer the following questions:
- How does VoIP work in the Internet today?
- How is VoIP quality measured?
- What are factors which affect the performance of VoIP?
- How does the quality of VoIP depend on these factors? Can we explicitly
  quantify this?
- Can we improve the existing VoIP technology? If so, how?

We ran several hundred experiments over a period of two weeks. Based on
the data obtained, we looked for answers to the above questions. Answering
these questions helped us understand the VoIP technology better and gave
us an insight into how it can be improved in future.
Presentation: PPT version



Time: Mon, Dec 06, 10:15am
Title: Extending Place Lab to 3-D
Authors: Alan L. Liu and Tyler Robison
Abstract:
How would a mobile computer locate itself inside a building? Our work is
based on the Place Lab architecture, which consists of three elements:
radio beacons in the environment, databases that hold information about
beacons, and clients that use this data to estimate their current
location. However, Place Lab is tuned for the outdoors and gives
estimates in two dimensions only. Methods for extending Place Lab to
provide estimates with room and floor precision, and preliminary
results, will be presented.
Presentation: PDF version



Time: Mon, Dec 06, 10:30am
Title: RandPing: A Randomized Algorithm for IP Mapping
Authors: Yuhan Cai and Michelle Jing Liu
Abstract:
Mapping IP addresses to geographic locations is a useful and 
important operation that can benefit a broad range of large-scale 
location-aware applications for both research and industrial organizations. 
In this paper, we develop a computational framework called RandPing that 
automates IP mapping based on a randomized algorithm using network delay 
measurements made from sparsely geographically located probing machines. 
Indeed, there exists previous work that is also based on the knowledge of 
network delay. However, the algorithms they use are deterministic in nature, 
which means that, the Round Trip Time (RTT) between the target host and all 
single probing machines has to be measured. On the other hand, in our 
framework, we group the probing machines into "well-defined" clusters 
according to their geographic locations. A relatively small set of probing 
machines are then chosen non-deterministically (or randomly) from the 
clusters and programmed to ping the query IP address. This process will be 
repeated for a limited number of times, which effectively reduces the time 
spent on pinging and therefore is cost-effective. Moreover, the clustering 
will make the probing machines to distribute geographically not very close 
to each other, which will increase the accuracy of algorithm. We also 
hypothesize that there is no statistically significant difference between 
the accuracies of the deterministic and non-deterministic approaches. 
Furthermore, our claim is strengthened by our experimental results in terms 
of both efficiency and effectiveness.
Presentation: PPT version



Time: Mon, Dec 06, 10:45am
Title: Confidence Weighted Marginal Utility Analyses of Internet Mapping Techniques
Authors: Daniel Wyatt and Craig Prince
Abstract:
Many techniques have been proposed for discerning internet topology, but not
so many of them have been studied for their utility:  the returns in 
information that they provide as their number of measurements increases.  
We propose new utility metrics and reuse existing metrics to analyze the 
marginal utilities of 3 different internet mapping techniques. We present our 
findings and consider how these findings may influence future mapping techniques.
Presentation: PDF version



Time: Mon, Dec 06, 11:00am
Title: UbiConn: Providing a Ubiquitous Connectivity Experience
Authors: Katherine Everitt, T. Scott Saponas, and Susumu Harada
Abstract:
Despite the proliferation of mobile devices, mobile connectivity is
still lacking. Information access is a powerful tool in wired
environments. It is even more important for mobile devices, which have
limited storage capacity and are not ideal for primary information
storage as they have the potential to be lost or broken. The combination
of connectivity and mobility will enable users to access any data from
anywhere. We present a model of multi-channel proactive connectivity
which supports this goal. Our two pronged approach includes a proactive
caching mechanism to support areas of low speed or no coverage, and we
discuss the potential for a multi-channel adapter to prevent unnecessary
dropped connections.
Presentation: PPT version



Time: Wed, Dec 08, 9:30am
Title: Diagnosing Internet Connectivity Problems
Authors: Masaharu Kobashi and Rosalia Tungaraza
Abstract:
Obtaining a file from a web-sever can sometimes prove to be very
difficult or even impossible. There are many problems that could arise
during such a process some of which include network and server
availability, slow response time, congestion within a network link, small
available bandwidth, poor network utilization, client or server
application failure, server-system or client-system setup faults and many
more that have not been listed here.

Given these problems we have constructed a system which responds
to queries of Internet connectivity problems specified by user. This tool
only covers a subset of the problems outlined above. During our talk, we
will present this tool together with what we learned in the process of
designing it.
Presentation: PPT version



Time: Wed, Dec 08, 9:45am
Title: High-Performance Networks for Dataflow Architectures
Authors: Andrew Putnam and Pravin Bhat
Abstract:
	Dataflow microprocessors have emerged as a viable solution
to the near-term demise of traditional superscalar processor
architectures. The performance of these dataflow architectures is
heavily dependent on the network design, hence good network performance
is paramount. The network must also provide fault tolerant,
deadlock-free operation while allowing scaling from one to several
hundred nodes. The unique demands of dataflow processors on network
resources, as well as an increasingly complex physical environment,
make it difficult to determine the optimum network architecture.
        Our research evaluates the network design for the WaveScalar dataflow
architecture, though the same concepts extend to other dataflow
architectures such as Monarch. We evaluate the effects of different
topologies along with various routing and flow control strategies to
find the best performance within the available chip area constraints.
We find the optimal design is a torus topology with adaptive routing
using virtual channels. Along with meeting our goals of fault
tolerance, deadlock-free operation, and scalability, our design
provides a 10% improvement in overall performance with a negligible
increase in area over the baseline WaveScalar design.
Presentation: PPT version



Time: Wed, Dec 08, 10:00am
Title: The impact of incentives on the efficiency of BitTorrent Peer to Peer Networks
Authors: Seth Cooper and Jenny Liu
Abstract:
Peer to peer (P2P) networks have already become a popular
method of distributing resources (commonly files) across the Internet.
An important aspect of P2P networks is that peers must share their own
resources before another peer can access them.  The simplest solution to
this resource-sharing problem is to rely solely on altruistic peers to
share their resources (e.g. Napster).  A recently introduced P2P network
protocol, BitTorrent, provides a built-in incentive for peers to share.
  We evaluate the effectiveness of the BitTorrent incentive by comparing
the efficiency of vanilla BitTorrent networks with BitTorrent networks
where the incentive to share has been removed.  We measure efficiency
from the point of view of the peer/server who is the first to share a
given file, as the number of bytes that peer needs to send, and from the
point of view of peers/clients attempting to access a resource, as the
average time needed to download a file.
Presentation: PPT version



Time: Wed, Dec 08, 10:15am
Title: Statistical Learning of Routing Policies
Authors: Michael Cafarella and Daniel Lowd
Abstract:
Spring et al's research on path inflation uses a huge number of traceroute
probes to deduce facts about ISP policies.  They are able to learn an
ISP's network topology, its individual router policies, and the overall
ISP peering strategy.  However, the authors use only very basic heuristics
to make deductions from the data.  Also, collecting the necessary traceroutes
is a substantial burden.  We propose to use machine learning techniques
to make similar deductions, but from much smaller amounts of data.  Further,
we hope that we will be able to characterize ISPs and their policies more
precisely than before.
Presentation: PPT version



Time: Wed, Dec 08, 10:30am
Title: Toward Better Geolocation: Leveraging Route Traces to Improve Internet Distance Estimates
Authors: Chandrika Jayant and Ethan Katz-Bassett
Abstract:
Many applications would benefit from the ability to determine the
geographical location of relevant Internet hosts.  However, IP addresses do
not relate directly to geolocations, and location information is not
available for most hosts, limiting what applications are currently able to
do.  Researchers have proposed multiple estimation schemes. However, these
approaches have limited accuracy, and most give estimates only over a
discrete location space.  The most promising and accurate continuous-space
technique is Constraint-Based Geolocation (CBG).  CBG measures the delay to
a target from multiple sources with known locations, converts these delays
into estimated distances, then performs multilateration using the estimated
distances.  This multilateration allows CBG to arrive at a location estimate
and a confidence region for the target.  Central to the accuracy of CBG's
geolocation is the quality of the delay to distance conversions.  Each
source trains its conversion equation using measurements to known locations.
We investigate these conversions, both analyzing the procedure and
investigating the accuracy over measurements between PlanetLab hosts.  We
present key limitations of the procedure.  We then introduce modified
approaches that address some of these limitations.  In particular, we
investigate how knowledge of the route taken to a target might be used to
improve distance estimates, and we give five CBG-compatible procedure
variants that use routes.  We analyze the performance of these variants over
the same PlanetLab data.  Finally, we present ideas on future improvements
to CBG.
Presentation: PPT version



Time: Wed, Dec 08, 10:45am
Title: An Evaluation of a Channel Switching MAC Protocol for 802.11
Authors: Lillie Kittredge and Ethan Phelps-Goodman
Abstract:
Slotted Seeded Channel Hopping (SSCH) [Bahl et. al.] is a protocol by
which an IEEE 802.11 ad-hoc wireless network can coordinate the use of
multiple orthogonal channels simultaneously to improve capacity. This
paper extends the original evaluation of Bahl et. at. to two areas that
were not previously well explored. First, we evaluate the
interoperability of nodes running SSCH with nodes running standard
802.11. We demonstrate that with slight modifications to the protocol,
SSCH nodes can utilize the additional bandwidth while coexisting with
non-SSCH nodes. Second, we evaluate the interaction of SSCH and the DSR
ad-hoc routing protocol. We show that SSCH interferes with the routing
mechanisms in DSR, leading to significantly decreased performance. We
discuss the implication of these results for the deployability of SSCH.
Presentation: PPT version



Time: Wed, Dec 08, 11:00am
Title: Simulating Link-Level Structures
Authors: Kevin Wampler and Scott Schremmer
Abstract:
The growth of the interconnections upon which the Internet runs is far
from random, but rather follows primarily economic rules.  Companies
attempt to provide a high quality of service to their customers while at
the same time minimizing their costs.  We examine computer models of
these economic tradeoffs and growth patterns.  We consider how the
structure of an incrementally growing network compares to that of a
network which is planned in advance.  We also look at how various
parameters related to Internet growth and economic decisions alter the
resulting network topology.
Presentation: PPT version