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.
Title
Automating Rendezvous and Proxy Selection
Published
2008-07-11
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2008-84
Type
Text
Extent
17 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
