Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Automating Rendezvous and Proxy Selection

David Chiyuan Chu and Joseph M. Hellerstein

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2008-84
July 11, 2008

http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-84.pdf

As increasingly diverse networks are interconnected, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We investigate an approach which focuses on replacing custom engineering with automated optimization of protocol specifications. Interestingly, our optimizations, grounded in recursive query optimization, map smoothly to prototypical networking design points of rendezvous selection and proxy placement. Under two distinct networking settings, our prototype system can automatically choose program executions that are as much as three, and usually one order of magnitude better than original source programs.


BibTeX citation:

@techreport{Chu:EECS-2008-84,
    Author = {Chu, David Chiyuan and Hellerstein, Joseph M.},
    Title = {Automating Rendezvous and Proxy Selection},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2008},
    Month = {Jul},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-84.html},
    Number = {UCB/EECS-2008-84},
    Abstract = {As increasingly diverse networks are interconnected, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical.  We investigate an approach which focuses on replacing custom engineering with automated optimization of protocol specifications.  Interestingly, our optimizations, grounded in recursive query optimization, map smoothly
to prototypical networking design points of rendezvous selection and proxy placement.  Under two distinct networking settings, our prototype system can automatically choose program executions that are as much as three, and usually one order of magnitude better than original
source programs.}
}

EndNote citation:

%0 Report
%A Chu, David Chiyuan
%A Hellerstein, Joseph M.
%T Automating Rendezvous and Proxy Selection
%I EECS Department, University of California, Berkeley
%D 2008
%8 July 11
%@ UCB/EECS-2008-84
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-84.html
%F Chu:EECS-2008-84