Send Devl mailing list submissions to
devl at freenetproject.org
To subscribe or unsubscribe via the World Wide Web, visit
http://www.uprizer.com/mailman/listinfo/devl
or, via email, send a message with subject or body 'help' to
devl-request at freenetproject.org
You can reach the person managing the list at
devl-admin at freenetproject.org
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Devl digest..."
Today's Topics:
1. Re: Proposal: algorithm for forgetting documents in datastore (Theodore
Hong)
2. Re: Proposal: algorithm for forgetting documents in datastore (Theodore
Hong)
3. Re: Proposal: algorithm for forgetting documents in datastore (Theodore
Hong)
4. Re: Proposal: algorithm for forgetting documents in datastore (L.
Antonides)
5. Re: Proposal: algorithm for forgetting documents in datastore (Scott G.
Miller)
6. RE: Proposal: algorithm for forgetting documents in datastore (Neil
Barsema)
7. Re: Proposal: algorithm for forgetting documents in datastore (Oskar
Sandberg)
8. [Freenet-dev] RE (Sofi129)
--__--__--
Message: 1
From: Theodore Hong <[email protected]>
Subject: Re: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
To: devl at freenetproject.org
Date: Mon, 29 Jan 2001 12:03:21 +0000 (GMT)
Reply-To: devl at freenetproject.org
Peter Todd <retep2 at home.com> wrote:
> On Sun, 28 Jan 2001, you wrote:
> > > Continuous or discrete file sizes (ie only powers of 2, or any size).
> >
> > Definitely only powers of 2. Not only good for defeating traffic analysis,
> > but it will make it a lot easier to analyze & simulate caching/forgetting
> > algorithms.
>
> What exactly does a powers of 2 file size mean? IE is the file size
> specified as a power of two, so you can only have 2,4, 8, 16, 32, 64
> etc. or do you mean powers of two added together? (ie 64 + 32, 128 +
> 64 etc.)
>
> The former seems to imply a file size limit of about 2^23 or 2^24,
> any higher and the wastage gets to be astronomical.
well, the latter is the same as no constraint at all...
theo
--__--__--
Message: 2
From: Theodore Hong <[email protected]>
Subject: Re: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
To: devl at freenetproject.org
Date: Mon, 29 Jan 2001 12:04:56 +0000 (GMT)
Reply-To: devl at freenetproject.org
Tavin Cole <tavin at mailandnews.com> wrote:
> On Mon, Jan 29, 2001 at 02:04:40AM +0100, Oskar Sandberg wrote:
> > > Okay, this makes sense, thanks. However, it seems very difficult to
> > > account for the importance of popularity when you look at things this
> > > way. Our phase space should include popularity as well as bytesize
> > > and time. E[Ti]*sizei = k assumes every file is equally popular.
> >
> > Yeah, I meant that all along. Ie, k is not constant but a function of
> > the number of requests that is shared by all i. Sorry.
>
> That still assumes each file is equally popular.
That's exactly why Oskar doesn't like this algorithm. =)
theo
--__--__--
Message: 3
From: Theodore Hong <[email protected]>
Subject: Re: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
To: devl at freenetproject.org
Date: Mon, 29 Jan 2001 12:08:06 +0000 (GMT)
Reply-To: devl at freenetproject.org
"L. Antonides" <lantonides at cistron-office.nl> wrote:
> I've got one question. If people insert files without breaking them isn't
> it possible to guess what kind of file it is, therefore giving up on
> security? I'm having problems with forcing people to split up files so I
> was thinking if it isn't possible to give a file a fake size?
That's why all files are encrypted before inserting. Padding will also
help make all files look alike.
theo
--__--__--
Message: 4
Date: Mon, 29 Jan 2001 14:19:03 +0100
From: "L. Antonides" <[email protected]>
To: devl at freenetproject.org
Subject: Re: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
Reply-To: devl at freenetproject.org
On Mon, Jan 29, 2001 at 12:08:06 +0000, Theodore Hong wrote:
> "L. Antonides" <lantonides at cistron-office.nl> wrote:
> > I've got one question. If people insert files without breaking them isn't
> > it possible to guess what kind of file it is, therefore giving up on
> > security? I'm having problems with forcing people to split up files so I
> > was thinking if it isn't possible to give a file a fake size?
>
> That's why all files are encrypted before inserting. Padding will also
> help make all files look alike.
>
I was just wondering if this is really enough. Imagine that i put 1 file of
600mb in freenet. It will be possible
to find out that this file is 600mb. Maybe you can't see what kind of file it
is but if yoy see that it is 600 mb
you are pretty sure it's not a .txt file. So i guess it will make decryption
harder if a file is split into at least two
files without fixed sizes. This makes it harder to guess how large the file is
and thus making decryption harder. Or am I way off?
--
--
Lodewijk Antonides | Cistron Telecom
lantonides at cistron.nl | www.cistron-telecom.nl
--__--__--
Message: 5
Date: Mon, 29 Jan 2001 09:26:27 -0500
To: devl at freenetproject.org
Subject: Re: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
From: "Scott G. Miller" <[email protected]>
Reply-To: devl at freenetproject.org
--sdtB3X0nJg68CQEu
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable
>=20
> I've got one question. If people insert files without breaking them isn't=
it possible to guess what kind=20
> of file it is, therefore giving up on security? I'm having problems with =
forcing people to split up files=20
> so I was thinking if it isn't possible to give a file a fake size?
Not any better than an educated guess. A 10-15mb file might be an MP3, a
70mb file is probably a video or software, etc.
--sdtB3X0nJg68CQEu
Content-Type: application/pgp-signature
Content-Disposition: inline
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.4 (GNU/Linux)
Comment: For info see http://www.gnupg.org
iD8DBQE6dX2Tr9IW4v3mHtQRArdmAJ9gCxXKRDvHJsacP+PQUFKOYI2fUgCbBAvz
x8qJNo0E37HvUeb3ntKYHqM=
=JMG2
-----END PGP SIGNATURE-----
--sdtB3X0nJg68CQEu--
--__--__--
Message: 6
From: "Neil Barsema" <[email protected]>
To: <devl at freenetproject.org>
Subject: RE: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
Date: Mon, 29 Jan 2001 15:53:45 +0100
Reply-To: devl at freenetproject.org
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Hi All,
Up until now the only factors in determining what files to drop from
the datastore have been size and popularity.
An other factor that would be nice to take into account is
scarceness. Now this is the exact oposite of popularity so it is a
bit tricky.
But it would be nice as it would put to rest all those people who
think Freenet loses their files too quickly.
The aproach I suggest is to reward a file for being close to the
network percieved keyspace(s) of the node.
So when a reference is instrumental in a routing decision i.e is the
closest to a requested reference. It is promoted in the way that was
suggested at the beginning of this thread. (change places with the
file above it). For actual hits we just stick to the current
mechanism.
Just thought I'd complicate the discusion a bit ;-)
Neil
-----BEGIN PGP SIGNATURE-----
Version: PGPfreeware 6.5.8 for non-commercial use <http://www.pgp.com>
iQA/AwUBOnV16pFMYYlPEhpIEQK2lwCgxznNb1IrqPpKyTPOdkdoo2qF/mYAnAz8
8VmnRNauLANSqznSXFQ4Wpf4
=p9sA
-----END PGP SIGNATURE-----
--__--__--
Message: 7
Date: Mon, 29 Jan 2001 19:58:44 +0100
From: Oskar Sandberg <[email protected]>
To: devl at freenetproject.org
Subject: Re: [freenet-devl] Proposal: algorithm for forgetting documents in
datastore
Reply-To: devl at freenetproject.org
On Mon, Jan 29, 2001 at 03:53:45PM +0100, Neil Barsema wrote:
<>
> So when a reference is instrumental in a routing decision i.e is the
> closest to a requested reference. It is promoted in the way that was
> suggested at the beginning of this thread. (change places with the
> file above it). For actual hits we just stick to the current
> mechanism.
Promoting references is not the same as promoting data though...
--
'DeCSS would be fine. Where is it?'
'Here,' Montag touched his head.
'Ah,' Granger smiled and nodded.
Oskar Sandberg
md98-osa at nada.kth.se
--__--__--
Message: 8
From: "Sofi129" <[email protected]>
To: <Freenet-dev at lists.sourceforge.net>
Date: Mon, 29 Jan 2001 21:57:47 +0200
Subject: [freenet-devl] [Freenet-dev] RE
Reply-To: devl at freenetproject.org
This is a multi-part message in MIME format.
------=_NextPart_000_0012_01C08A3E.840CA300
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
help, whatever I do I keep on getting a "page not found" error
am using 3.06 and Java installed correctly
txs
Sofi
------=_NextPart_000_0012_01C08A3E.840CA300
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=3DContent-Type content=3D"text/html; =
charset=3Diso-8859-1">
<META content=3D"MSHTML 5.50.4134.100" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2>help, whatever I do I keep on getting a =
"page not=20
found" error</FONT></DIV>
<DIV><FONT face=3DArial size=3D2>am using 3.06 and Java installed=20
correctly</FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>txs</FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>Sofi</FONT></DIV></BODY></HTML>
------=_NextPart_000_0012_01C08A3E.840CA300--
_______________________________________________
Freenet-dev mailing list
Freenet-dev at lists.sourceforge.net
http://lists.sourceforge.net/lists/listinfo/freenet-dev
--__--__--
_______________________________________________
Devl mailing list
Devl at freenetproject.org
http://www.uprizer.com/mailman/listinfo/devl
End of Devl Digest
