Sridhar Machiraju and Randy H. Katz

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-04-1345
August 2004

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2004/CSD-04-1345.pdf

Cooperation and competition are opposing forces in Multi-Provider Distributed Systems (MPDSs) such as the Internet routing infrastructure. Often, competitive needs cause providers to keep certain information confidential thereby hindering cooperation and leading to undesirable behavior. For instance, recent work has shown that lack of inter-domain cooperation in performing intra-domain routing changes may cause more congestion. We argue that MPDSs should be designed with mechanisms that enable cooperation without violating confidentiality requirements. We illustrate this design principle by developing such mechanisms to solve well-known problems in the most successful MPDS, inter-domain routing. We also briefly discuss the need for such mechanisms in MPDSs for content distribution and policy-based resource allocation. Our mechanisms leverage secure multi-party computation primitives.

BibTeX citation:

@techreport{Machiraju:CSD-04-1345,
    Author = {Machiraju, Sridhar and Katz, Randy H.},
    Title = {Reconciling Cooperation with Confidentiality in Multi-Provider Distributed Systems},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2004},
    Month = {Aug},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2004/5834.html},
    Number = {UCB/CSD-04-1345},
    Abstract = {Cooperation and competition are opposing forces in Multi-Provider Distributed Systems (MPDSs) such as the Internet routing infrastructure. Often, competitive needs cause providers to keep certain information confidential thereby hindering cooperation and leading to undesirable behavior. For instance, recent work has shown that lack of inter-domain cooperation in performing intra-domain routing changes may cause more congestion. We argue that MPDSs should be designed with mechanisms that enable cooperation without violating confidentiality requirements. We illustrate this design principle by developing such mechanisms to solve well-known problems in the most successful MPDS, inter-domain routing. We also briefly discuss the need for such mechanisms in MPDSs for content distribution and policy-based resource allocation. Our mechanisms leverage secure multi-party computation primitives.}
}

EndNote citation:

%0 Report
%A Machiraju, Sridhar
%A Katz, Randy H.
%T Reconciling Cooperation with Confidentiality in Multi-Provider Distributed Systems
%I EECS Department, University of California, Berkeley
%D 2004
%@ UCB/CSD-04-1345
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2004/5834.html
%F Machiraju:CSD-04-1345