The PROXIDOR Service

Tue, 03/03/2009 - 17:19 by Damien Saucez • Categories:


Several applications, such as peer-to-peer (P2P), content
distribution and realtime services rely on selection mechanisms in
order to select the peer or server from which to request the service.
Examples of such services are: file sharing, media streaming and
voice gateways.

Application-layer selection algorithms do not typically take into
account network-layer topology information; either that information
is unavailable to them, or when such information is available (e.g.,
from BGP Looking Glass servers), it does not include sufficient
information about the local topology in the neighbourhood of the
application client(s). Therefore, most applications today make their
selection decisions based on performance measurements (combined with
some amount of random selection) and largely ignore network layer
routing. It has been demonstrated that by keeping the traffic local
(e.g., within the same Autonomous System) both infrastructure
utilization and application performance may be improved.

By enhancing selection algorithms through the use of accurate
network-layer topology, applications may improve performance while
network operators are also able to reduce the utilization of
infrastructure resources by application traffic. At the same time,
exchange of information between the application and the network
should not be allowed to compromise confidentiality for either party.
Detailed routing information owned by the service provider should not
be made publicly available, while detailed information about the
application should also not be made known to the service provider.

This draft introduces a signaling protocol which we call "PROXIDOR".
The PROXIDOR protocol is a request-response protocol in which a
PROXIDOR Client (PxC) issues requests to and receives responses from
a PROXIDOR Server (PxS). The questions of how a PxC discovers a PxS
and how a PxS acquires network-layer topology information are beyond
the scope of this document.

O. Akonjang, A. Feldmann, S. Previdi, B. Davie and D. Saucez
Internet draft, work in progress, March 2009.
Full text
pdf    (32.36 KB)
Cite it
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.