[Nrg-l] PhD Defense: Hany Morcos (Fri 7/25 @ 1PM)

Azer Bestavros best at cs.bu.edu
Sun Jul 20 22:44:22 EDT 2008


Computer Science Department
Boston University

Date: Friday July 25, 2008
Time: 1:00PM
Place: Room MCS 135, 111 Cummington Street

Service Provisioning in Mobile Networks 
Through Coordinated Distributed Resource Management

Hany Morcos


The pervasiveness of personal computing platforms offers an
unprecedented opportunity to deploy large-scale services that are
distributed over wide physical spaces. Two major challenges face the
deployment of such services: the often resource-limited nature of these
platforms, and the necessity of preserving the autonomy of the owner of
these devices. The latter of these challenges precludes using
centralized control and both preclude supporting critical services that
are subject to strict performance guarantees. To that end, this thesis
advances a number of new distributed resource management techniques that
are shown to be effective in such settings, focusing on two application
domains: distributed Field Monitoring Applications (FMAs), and Message
Delivery Applications (MDAs).

For FMAs, this thesis presents two approaches that are well-suited to
the fairly limited storage and power resources of autonomously mobile
FMA sensor nodes.  The first approach relies on amorphous placement of
sensory data through the use of novel storage management and sample
diffusion techniques. The second approach relies on an
information-theoretic framework to optimize local resource management
decisions. Both approaches are proactive in that they aim to provide
nodes with a view of the monitored field that reflects the
characteristics of queries over that field, enabling them to handle more
queries locally, and thus reduce communication overheads. 

For FMAs and MDAs, this thesis recognizes node mobility as a resource to
be leveraged and managed, and in that respect proposes novel mobility
coordination techniques appropriate in both FMA and MDA contexts.
Assuming that node mobility is governed by a spatio-temporal schedule
featuring some slack, this thesis presents novel algorithms of various
computational complexities to orchestrate the use of this slack to
improve the performance of supported applications.

The findings in this thesis, which are supported by analysis and
extensive model-based and trace-based simulations, highlight the
importance of two general design principles for distributed systems.
First, a-priori knowledge (e.g., about the target phenomena of FMAs
and/or the workload of either FMAs or DMAs) could be used effectively
for local resource management.  Second, judicious coordination of the
slack in node mobility could lead to significant performance gains for
distributed applications deployed over resource-impoverished


PhD Thesis Examination Committee:

- Azer Bestavros
- Ibrahim Matta
- Mark Crovella
- John Byers
- Rich West 
- Steve Homer (Committee Chair)

More information about the Nrg-l mailing list