, a log of the rate estimation
used by the choke algorithm, and a log of important events (end game
mode, seed state).
You can freely use this instrumentation as long as you acknowledge its
source.
Do not hesitate to contact me if you have any question.
Regards,
Arnaud Legout.
--
Arnaud Legout
Hi,
your question is representative of the widespread belief there is about
P2P.
Until recently all researches/products/interest were on P2P localization.
P2P localization is fun, a nice problem to work on, and it may have many
applications, but
you can always do better with a client server
documentation and the related publications at the
same link.
Do not hesitate to contact us if you have any question. In particular,
we would be delighted to support
the use of this client for projects related to our interests.
Regards,
Arnaud Legout.
--
Arnaud Legout, Ph.D.
INRIA Sophia
mailing list
p2p-hackers@lists.zooko.com
http://lists.zooko.com/mailman/listinfo/p2p-hackers
___
p2p-hackers mailing list
p2p-hackers@lists.zooko.com
http://lists.zooko.com/mailman/listinfo/p2p-hackers
--
Arnaud Legout, Ph.D.
INRIA Sophia
.
--
Arnaud Legout, Ph.D.
INRIA Sophia Antipolis - Planète Phone : 00.33.4.92.38.78.15
2004 route des lucioles - BP 93 Fax : 00.33.4.92.38.79.78
06902 Sophia Antipolis CEDEX E-mail: arnaud.leg...@inria.fr
FRANCEWeb :
http://www-sop.inria.fr/planete
.
___
p2prg mailing list
p2...@irtf.org
http://www.irtf.org/mailman/listinfo/p2prg
--
Arnaud Legout, Ph.D.
INRIA Sophia Antipolis - Planète Phone : 00.33.4.92.38.78.15
2004 route des lucioles - BP
Song Haibin wrote:
On the other hand, P2P systems not adopting the tit-for-tat approach
(e.g. the eDonkey network) should not be damaged by locality-based
It is not clear to me. Peer selection (tit-for-tat like choking algo in
BT) is not the only one factor of efficiency, there is also
Hi,
zooko wrote:
However the rate of CFPs has climbed, and recently I've started to
wonder if the ratio of CFPs to actual conversation might deter
conversation, new subscribers, etc. I wouldn't want that. Oh! I
have an idea, how about if I set up a separate list named p2p-hackers-
is extremely efficient,
it is, to the best of our knowledge, the first large scale controlled
experiments
that show and quantify this efficiency.
-we have interesting results on the distribution of the peers per AS for
a very large number of real torrents and ASes.
Stevens Le Blond, Arnaud Legout
,
information on every electronic information exchange with me is
retained for a period of six months.
___
p2p-hackers mailing list
p2p-hackers@lists.zooko.com
http://lists.zooko.com/mailman/listinfo/p2p-hackers
--
Arnaud Legout, Ph.D.
INRIA
you can get the paper from this URL
www-inst.eecs.berkeley.edu/~ee290t/sp04/lectures/rdr_paper40.pdf
On 25/02/2010 09:57, Marc Manthey wrote:
Am 25.02.2010 um 09:48 schrieb Arnaud Legout:
There is a nice paper that describes what are the issues with multicast,
it is ten years old, but still
(PPTX), as the PDF version
will not render the animations and the animated slides will look cluttered.
Of course, comments are highly welcomed.
Regards,
Arnaud Legout.
___
p2p-hackers mailing list
p2p-hackers@lists.zooko.com
http://lists.zooko.com
Hi,
I would like to point you to a recent work we made that we believe
might be of interest to the BitTorrent/P2P community.
In this work that was presented at IMC'11, we show what we believe
to be a significant privacy issue for most P2P protocols.
-We show that leveraging on Skype, we can
reuse anything as long as you give credit and don't make
money out of it.
You can get the latest version of the slides at this link:
http://cel.archives-ouvertes.fr/cel-00544132/en/
Comments are welcome.
Regards,
Arnaud.
On 07/12/2010 14:57, Arnaud Legout wrote:
Hi,
I have given a course
14 matches
Mail list logo
