Am Mittwoch, 21. November 2012, 19:22:25 schrieb Juiceman:
This would be an automated system that wouldn't require users emailing
someone to add them to the list.
Do you know the Gnutella UDP Hostcaches? They are a distributed but
serverbased system for getting first connections.
One example:
On Thu, Nov 22, 2012 at 10:54 AM, Matthew Toseland
t...@amphibian.dyndns.org wrote:
On Thursday 22 Nov 2012 00:22:25 Juiceman wrote:
Sent from my wireless phone.
On Nov 21, 2012 6:55 PM, Matthew Toseland t...@amphibian.dyndns.org
wrote:
On Monday 19 Nov 2012 16:09:02 Juiceman wrote:
On Thursday 22 Nov 2012 00:22:25 Juiceman wrote:
Sent from my wireless phone.
On Nov 21, 2012 6:55 PM, Matthew Toseland t...@amphibian.dyndns.org
wrote:
On Monday 19 Nov 2012 16:09:02 Juiceman wrote:
Sent from my wireless phone.
On Nov 19, 2012 10:24 AM, Juiceman juicema...@gmail.com
On Monday 19 Nov 2012 16:09:02 Juiceman wrote:
Sent from my wireless phone.
On Nov 19, 2012 10:24 AM, Juiceman juicema...@gmail.com wrote:
Idea for automated seednode collection:
Could official seednodes pass a list of second tier seednodes that
newbies can try to connect to when
On Monday 19 Nov 2012 17:11:53 Robert Hailey wrote:
On 2012/11/19 (Nov), at 6:42 AM, Matthew Toseland wrote:
I have merged Robert's original patch (compile fixed) for depth-first
announcement onto a branch, opennet-changes.
Yeah! (commence happy dance)
It will need to be tested
Sent from my wireless phone.
On Nov 21, 2012 6:55 PM, Matthew Toseland t...@amphibian.dyndns.org
wrote:
On Monday 19 Nov 2012 16:09:02 Juiceman wrote:
Sent from my wireless phone.
On Nov 19, 2012 10:24 AM, Juiceman juicema...@gmail.com wrote:
Idea for automated seednode collection:
I have merged Robert's original patch (compile fixed) for depth-first
announcement onto a branch, opennet-changes.
It will need to be tested thoroughly:
- Do new nodes announce with new seeds?
- Do new nodes announce with old seeds?
- Do old nodes announce with new seeds?
(Note that Update Over
Idea for automated seednode collection:
Could official seednodes pass a list of second tier seednodes that newbies
can try to connect to when official nodes are overloaded?
Implementation:
When an official seednode accepts a newbie node for announcement it checks
if that node has its be a
Sent from my wireless phone.
On Nov 19, 2012 10:24 AM, Juiceman juicema...@gmail.com wrote:
Idea for automated seednode collection:
Could official seednodes pass a list of second tier seednodes that
newbies can try to connect to when official nodes are overloaded?
Implementation:
When an
On 2012/11/19 (Nov), at 6:42 AM, Matthew Toseland wrote:
I have merged Robert's original patch (compile fixed) for depth-first
announcement onto a branch, opennet-changes.
Yeah! (commence happy dance)
It will need to be tested thoroughly:
- Do new nodes announce with new seeds?
- Do new
On Tuesday 09 November 2010 14:35:16 Ian Clarke wrote:
> On Mon, Nov 8, 2010 at 4:45 PM, Matthew Toseland
> wrote:
>
> > > I am sorry that (at the moment) you cannot see *how* it works, but
> > > you'll just have to accept the fact that *IT DOES*.
> >
> > No, voodoo is not acceptable, in
On Mon, Nov 8, 2010 at 4:45 PM, Matthew Toseland
wrote:
> > I am sorry that (at the moment) you cannot see *how* it works, but
> > you'll just have to accept the fact that *IT DOES*.
>
> No, voodoo is not acceptable, in general.
Its not voodoo just because you haven't yet taken the time to
On Mon, Nov 8, 2010 at 4:45 PM, Matthew Toseland
t...@amphibian.dyndns.orgwrote:
I am sorry that (at the moment) you cannot see *how* it works, but
you'll just have to accept the fact that *IT DOES*.
No, voodoo is not acceptable, in general.
Its not voodoo just because you haven't yet
On Tuesday 09 November 2010 14:35:16 Ian Clarke wrote:
On Mon, Nov 8, 2010 at 4:45 PM, Matthew Toseland
t...@amphibian.dyndns.orgwrote:
I am sorry that (at the moment) you cannot see *how* it works, but
you'll just have to accept the fact that *IT DOES*.
No, voodoo is not
On Monday 08 November 2010 16:19:59 Robert Hailey wrote:
>
> On 2010/11/06 (Nov), at 8:44 AM, Matthew Toseland wrote:
>
> > On Friday 05 November 2010 22:37:48 Robert Hailey wrote:
> >>
> >> A working implementation is visible here:
> >>
> >>
On 2010/11/06 (Nov), at 8:44 AM, Matthew Toseland wrote:
> On Friday 05 November 2010 22:37:48 Robert Hailey wrote:
>>
>> A working implementation is visible here:
>>
>> https://github.com/Osndok/fred-staging/tree/depth-first-announcement
>>
>> With a simulator that shows that:
>> (1) it doesn't
On 2010/11/06 (Nov), at 8:44 AM, Matthew Toseland wrote:On Friday 05 November 2010 22:37:48 Robert Hailey wrote:A working implementation is visible here:https://github.com/Osndok/fred-staging/tree/depth-first-announcementWith a simulator that shows that:(1) it doesn't break announcements,(2) it
On Monday 08 November 2010 16:19:59 Robert Hailey wrote:
On 2010/11/06 (Nov), at 8:44 AM, Matthew Toseland wrote:
On Friday 05 November 2010 22:37:48 Robert Hailey wrote:
A working implementation is visible here:
https://github.com/Osndok/fred-staging/tree/depth-first-announcement
On Friday 05 November 2010 22:37:48 Robert Hailey wrote:
>
> A working implementation is visible here:
>
> https://github.com/Osndok/fred-staging/tree/depth-first-announcement
>
> With a simulator that shows that:
> (1) it doesn't break announcements,
> (2) it seeks the deepest nodes first
Okay, there is much confusion here too.
"Short links" is being used for two different, and opposite, things:
- Announcement (or path folding) cuts consisting of few hops. Lets call this
"few hops".
- Connections to peers with the distance between our location and the peer's
location being small
Okay, there is much confusion here too.
Short links is being used for two different, and opposite, things:
- Announcement (or path folding) cuts consisting of few hops. Lets call this
few hops.
- Connections to peers with the distance between our location and the peer's
location being small
On Friday 05 November 2010 22:37:48 Robert Hailey wrote:
A working implementation is visible here:
https://github.com/Osndok/fred-staging/tree/depth-first-announcement
With a simulator that shows that:
(1) it doesn't break announcements,
(2) it seeks the deepest nodes first (away from
A working implementation is visible here:
https://github.com/Osndok/fred-staging/tree/depth-first-announcement
With a simulator that shows that:
(1) it doesn't break announcements,
(2) it seeks the deepest nodes first (away from the seed node),
(3) it gathers at most
On Friday 05 November 2010 16:01:02 Matthew Toseland wrote:
> On Thursday 04 November 2010 21:12:33 Robert Hailey wrote:
> >
> > On 2010/11/04 (Nov), at 3:06 PM, Ian Clarke wrote:
> >
> > > On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey > > freenetproject.org
> > > > wrote:
> > > As best I can
On Friday 05 November 2010 16:01:02 Matthew Toseland wrote:
> On Thursday 04 November 2010 21:12:33 Robert Hailey wrote:
> > There might be some onion routing magic
> > that could save this, but I doubt it;
>
> Full onion routing is not likely to be feasible on Freenet. We could build
>
On Thursday 04 November 2010 21:12:33 Robert Hailey wrote:
>
> On 2010/11/04 (Nov), at 3:06 PM, Ian Clarke wrote:
>
> > On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey > > wrote:
> > As best I can see, then, there may be major problems with the
> > current announcement and path folding
Okay, this email is very confusing up to the point where I realise what you
mean by "depth first". Normally "depth first" refers to a depth first search,
which is exactly what we do in AnnounceSender, RequestSender etc. We go as deep
as we can before backtracking.
However what you mean appears
On 2010/11/05 (Nov), at 10:37 AM, Matthew Toseland wrote:
> Okay, this email is very confusing up to the point where I realise
> what you mean by "depth first". Normally "depth first" refers to a
> depth first search, which is exactly what we do in AnnounceSender,
> RequestSender etc. We
Okay, this email is very confusing up to the point where I realise what you
mean by depth first. Normally depth first refers to a depth first search,
which is exactly what we do in AnnounceSender, RequestSender etc. We go as deep
as we can before backtracking.
However what you mean appears to
On Thursday 04 November 2010 21:12:33 Robert Hailey wrote:
On 2010/11/04 (Nov), at 3:06 PM, Ian Clarke wrote:
On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey rob...@freenetproject.org
wrote:
As best I can see, then, there may be major problems with the
current announcement and path
On Friday 05 November 2010 16:01:02 Matthew Toseland wrote:
On Thursday 04 November 2010 21:12:33 Robert Hailey wrote:
There might be some onion routing magic
that could save this, but I doubt it;
Full onion routing is not likely to be feasible on Freenet. We could build
something
On Friday 05 November 2010 16:01:02 Matthew Toseland wrote:
On Thursday 04 November 2010 21:12:33 Robert Hailey wrote:
On 2010/11/04 (Nov), at 3:06 PM, Ian Clarke wrote:
On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey rob...@freenetproject.org
wrote:
As best I can see, then,
On 2010/11/05 (Nov), at 10:37 AM, Matthew Toseland wrote:
Okay, this email is very confusing up to the point where I realise
what you mean by depth first. Normally depth first refers to a
depth first search, which is exactly what we do in AnnounceSender,
RequestSender etc. We go as deep
A working implementation is visible here:
https://github.com/Osndok/fred-staging/tree/depth-first-announcement
With a simulator that shows that:
(1) it doesn't break announcements,
(2) it seeks the deepest nodes first (away from the seed node),
(3) it gathers at most
On 2010/11/04 (Nov), at 3:06 PM, Ian Clarke wrote:
> On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey > wrote:
> As best I can see, then, there may be major problems with the
> current announcement and path folding implementations:
> (1) announcements gather at non-destination points (in fact,
On Wednesday 03 November 2010 20:00:48 Robert Hailey wrote:
>
> Example patch attached. Small, but untested!
Could you please explain what it is that you think is going on, and what the
patch will do to fix it?
In theory, announcements are routed to a specific random keyspace location
On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey wrote:
> As best I can see, then, there may be major problems with the current
> announcement and path folding implementations:
> (1) announcements gather at non-destination points (in fact, shallow
> first),
> (2) the RequestSender logic will always
On 2010/11/04 (Nov), at 11:06 AM, Matthew Toseland wrote:
> On Wednesday 03 November 2010 20:00:48 Robert Hailey wrote:
>>
>> Example patch attached. Small, but untested!
>
> Could you please explain what it is that you think is going on, and
> what the patch will do to fix it?
For all this,
On Wednesday 03 November 2010 20:00:48 Robert Hailey wrote:
Example patch attached. Small, but untested!
Could you please explain what it is that you think is going on, and what the
patch will do to fix it?
In theory, announcements are routed to a specific random keyspace location
On 2010/11/04 (Nov), at 11:06 AM, Matthew Toseland wrote:
On Wednesday 03 November 2010 20:00:48 Robert Hailey wrote:
Example patch attached. Small, but untested!
Could you please explain what it is that you think is going on, and
what the patch will do to fix it?
For all this, I
On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey rob...@freenetproject.orgwrote:
As best I can see, then, there may be major problems with the current
announcement and path folding implementations:
(1) announcements gather at non-destination points (in fact, shallow
first),
(2) the
On 2010/11/04 (Nov), at 3:06 PM, Ian Clarke wrote:
On Thu, Nov 4, 2010 at 2:09 PM, Robert Hailey rob...@freenetproject.org
wrote:
As best I can see, then, there may be major problems with the
current announcement and path folding implementations:
(1) announcements gather at non-destination
Example patch attached. Small, but untested!
--
Robert Hailey
-- next part --
A non-text attachment was scrubbed...
Name: depth-first-announce.patch
Type: application/octet-stream
Size: 2057 bytes
Desc: not available
URL:
Example patch attached. Small, but untested!
--
Robert Hailey
depth-first-announce.patch
Description: Binary data
___
Devl mailing list
Devl@freenetproject.org
http://freenetproject.org/cgi-bin/mailman/listinfo/devl
44 matches
Mail list logo
