Domain: freaknet.org
Stories and comments across the archive that link to freaknet.org.
Comments · 28
-
Re:Truly free ad hoc wifi mesh internet.
I can't think of anything you could do "without consent" but check these out:
-
Re:turn that frown upside down.
That alternative sounds a lot like Netsukuku, in the fact that its essentially a giant mesh network of wireless access points. You can look into it here: http://netsukuku.freaknet.org/ .
Unfortunately, it seems that not much work is being done on it.
-
Cairo residents opening home WiFi to protestors
http://www.nowpublic.com/world/egypt-protests-residents-open-wifi-networks-protestors-2751360.html
I submitted a seperate story on this - before seeing this story.
Any ways - I think this gives greater significance to the WiFi p2p protocols - couple of links I can find in a rush:http://netsukuku.freaknet.org/
http://sourceforge.net/p/widi/home/ -
what else? netsukuku?
maybe that could be interesting... if anyone can put an effort on it
http://en.wikipedia.org/wiki/Netsukuku
http://netsukuku.freaknet.org/?pag=faq -
Re:
There are several mesh networking schemes to do exactly what you are talking about. In remote areas, mesh networking often becomes the only way to get network access. Try Netsukuku http://netsukuku.freaknet.org/ Batman https://www.open-mesh.net/batman [open-mesh.net] Netsukuku has as a project goal to explicitly facilitate creating the equivalent of the internet, with DNS-like name services and the like. As for pringles can antennas, try a bi-quad, a yagi or a waveguide instead, you'll get far superior performance.
-
Re:OT: Your sig
There are several mesh networking schemes to do exactly what you are talking about. In remote areas, mesh networking often becomes the only way to get network access. Try Netsukuku http://netsukuku.freaknet.org/ Batman https://www.open-mesh.net/batman Netsukuku has as a project goal to explicitly facilitate creating the equivalent of the internet, with DNS-like name services and the like. As for pringles can antennas, try a bi-quad, a yagi or a waveguide instead, you'll get far superior performance.
-
Re:ISP-less internet topology
well, there already is software to do isp-less networks... just look at netsukuku or dart...
but the real problem is not that isp would kill those applications... instead, problem is security, since -like some slashdotters already pointed out- you can always rewrite the app, just like someone already did with tor.... -
Corporate Seppuku...
...or cause for netsukuku?
-
Re:Another "Internet"
-
Re:What are the odds
man, what you are looking for is Netsukuku!
it has even much more than what you asked...
it will add to your list:
-anonimity
-no need of dns
-crypted packets
-no need of isp (hell, just check!!)
-traffic can be divided in 2 : that which needs bandwith (p2p for wxample) and that which needs low pings (ssh, games...) -
Re:NETSUKUKU!!!
right. netsukuku is a great project.
here you have the features
feature_list -
NETSUKUKU!!!
you already have one great rebuild from scratch:Netsukuku
just read all the specs.
the only thig it need to be complete is something that permits police to track down malicious hackers. it's too anonimous for now. -
Re:What's the big idea?
Well, there's Emerde, which is a port of portage to Slackware, but will work on other distros.
That said, I strongly suggests *not* to use portage - Mostly because the poor support for binary packages means that a working system can't be reliably upgraded (since an upgraded package will often depend on a library package which also needs to upgraded, but USE flags and the like may prevent compiliation of the dependant package after the library has been installed - leaving an inconsistant system). -
reinventing wheel?
page 4, from the article:
"And we still have a lot to look forward to: the IETF is currently working on mobility and multihoming extensions to IPv6. Mobility means moving from one network to another while keeping the same IP address. So a VoIP call could start on your home network, continue over wireless service and then finish at work. Multihoming means connecting to more than one ISP at the same time, so that when one fails, communication sessions automatically move over to the other."
netsukuku already has these features. -
netsukuku
i think Netsukuku can solve this.
the problem would be still in backbones between america/europe, but at least in the same continent it would help a lot with his load-balancing features... -
Re:Not exactly "Not exactly practical"
There exists a p2p routing protocol designed to be scalable: Netsukuku.
It is just a routing protocol so you can use it on network topology. Obviously the wifi is the simplest solution to connect many nodes, but the bandwidth will be saturated in no time, so the best way to handle this would be a mix of copper and wireless. -
Netsukuku
An old news from kuro5hin here:
Netsukuku the Anarchical Parallel Internet
Freaknet, Netsukuku is a new p2p routing system, which will be utilised to build a worldwide distributed, anonymous and anarchical network, separated from the Internet, without the support of any servers, ISPs or authority controls. In a p2p network every node acts as a router, therefore in order to solve the problem of computing and storing the routes for 2^128 nodes, Netsukuku makes use of a new meta-algorithm, which exploits the chaos to avoid cpu consumption and fractals to keep the map of the whole net constantly under the size of 2Kb. Netsukuku includes also the Abnormal Netsukuku Domain Name Anarchy, a non hierarchical and decentralised system of hostnames management which replaces the DNS. It runs on GNU/Linux.>>
The site of the project is: http://netsukuku.freaknet.org -
Netsukuku
An old news from kuro5hin here:
Netsukuku the Anarchical Parallel Internet
Freaknet, Netsukuku is a new p2p routing system, which will be utilised to build a worldwide distributed, anonymous and anarchical network, separated from the Internet, without the support of any servers, ISPs or authority controls. In a p2p network every node acts as a router, therefore in order to solve the problem of computing and storing the routes for 2^128 nodes, Netsukuku makes use of a new meta-algorithm, which exploits the chaos to avoid cpu consumption and fractals to keep the map of the whole net constantly under the size of 2Kb. Netsukuku includes also the Abnormal Netsukuku Domain Name Anarchy, a non hierarchical and decentralised system of hostnames management which replaces the DNS. It runs on GNU/Linux.>>
The site of the project is: http://netsukuku.freaknet.org -
Netsukuku
An old news from kuro5hin here:
Netsukuku the Anarchical Parallel Internet
Freaknet, Netsukuku is a new p2p routing system, which will be utilised to build a worldwide distributed, anonymous and anarchical network, separated from the Internet, without the support of any servers, ISPs or authority controls. In a p2p network every node acts as a router, therefore in order to solve the problem of computing and storing the routes for 2^128 nodes, Netsukuku makes use of a new meta-algorithm, which exploits the chaos to avoid cpu consumption and fractals to keep the map of the whole net constantly under the size of 2Kb. Netsukuku includes also the Abnormal Netsukuku Domain Name Anarchy, a non hierarchical and decentralised system of hostnames management which replaces the DNS. It runs on GNU/Linux.>>
The site of the project is: http://netsukuku.freaknet.org -
Re:The future of data sharing?
I could even see a future where we could do away with DNS in the long term as we could access webpages or other information through this network of shared temporary file folders.
Another idiotic idea. Why the hell would I want to spend my time LOOKING for the website I want, instead of just plain visiting it? Yes, this WOULD require me to look for the website. Also, security (Login information, et cetera) is practically impossible in such situations.
http://netsukuku.freaknet.org/ -
Netsukuku (Yes, that is a real project)
-
Re:You know its going to suck when...Or maybe they've put the effort in to actually get the two working and compatible?
It can be done. I'm writing this on a slackware system that uses emerde. I can emerge or use gentoo binary packages for programs, and I can use slackware packages. The two fit together perfectly, the programs update the "database" of each packaging system from the other one. Although it would be harder with the more complex rpm and deb, I don't think it's impossible.
-
the herd misunderstands
i'm reading a lot of backlash against standards, and i suspect that most people responding don't understand the first thing about them. the LSB does not a vanilla linux installation make. it's a standard by which, hopefully, one can download a binary and it will "just work", whether you're on a "by hackers for hackers" distro or one that holds your hand. and complying to the standard doesn't necessarily inhibit creativity or progress, as the end-user/sysadmin is the ultimate authority.
example: Slackware, a distribution wholly unlike any of the big names on everyone's lips, chooses a BSD-like init design and manages packages with a relatively simple set of shell scripts. BUT, for the sake of maintaining standards (particularly the Linux File System standard), Slackware has symlinks compatible with a SysV install and includes rpm! was that really so hard? did that inhibit the "simplicity and stability" mantra, or stop Slackware fans from creating a variety of interesting projects? no.
the freedom to experiment exists and is encouraged and adopted within Slackware, while it still maintains standards compliancy. -
HTMLization Re:Translation of "symbol" section:anon coward wrote:
Goes back furthur... The Version 6 Unix Kernal (1976)
( Actually, this is the actual 6th edition malloc code
http://medialab.freaknet.org/~martin/tape/stuff/sy s.v6/and:
> 7th Edition UNIX is NOT Public Domain.
Actually, it is:
http://linux.oreillynet.com/lpt/a/1595/Btw: this stuff is not quite public domain, but it's definitely far from proprietary
Looking at that chunk of malloc code, it is extremely functional. It is a very straightforward and minimal implemetation of first-fit memory allocation from a free pool.
static struct ( size_t m_size, char *m_addr } *chunk;
While(there are more chunks){- if the current chunk is at least as big as we need,{
- take what we need out of the chunk
point the pool pointer to the rest of the chunk
adjust the size indicator.
if we're using the entire chunk,{ move this node to the end of the list.
# (so it doesn't block the search) #
return the pointer
# couldn't find a big enough chunk
return(NULL) # errorIt would be pretty difficult to produce a tight version of this algorithm without a high degree of duplication. I'd say you might as well cut and paste, because about the only changes that I can see making in a tight implementation would be to change the variable names. You'd be lucky to find 4 meaningful permutations of this algorithim, once you tighten up the code for the kernel.
Try to implement the pseudo code above, and see just how far away you end up.
BTW, this is not part of a block of duplicate code.. This is pretty much the entire thing. If that's the best that they can find, then they're SOL.
-
HTMLization Re:Translation of "symbol" section:anon coward wrote:
Goes back furthur... The Version 6 Unix Kernal (1976)
( Actually, this is the actual 6th edition malloc code
http://medialab.freaknet.org/~martin/tape/stuff/sy s.v6/and:
> 7th Edition UNIX is NOT Public Domain.
Actually, it is:
http://linux.oreillynet.com/lpt/a/1595/Btw: this stuff is not quite public domain, but it's definitely far from proprietary
Looking at that chunk of malloc code, it is extremely functional. It is a very straightforward and minimal implemetation of first-fit memory allocation from a free pool.
static struct ( size_t m_size, char *m_addr } *chunk;
While(there are more chunks){- if the current chunk is at least as big as we need,{
- take what we need out of the chunk
point the pool pointer to the rest of the chunk
adjust the size indicator.
if we're using the entire chunk,{ move this node to the end of the list.
# (so it doesn't block the search) #
return the pointer
# couldn't find a big enough chunk
return(NULL) # errorIt would be pretty difficult to produce a tight version of this algorithm without a high degree of duplication. I'd say you might as well cut and paste, because about the only changes that I can see making in a tight implementation would be to change the variable names. You'd be lucky to find 4 meaningful permutations of this algorithim, once you tighten up the code for the kernel.
Try to implement the pseudo code above, and see just how far away you end up.
BTW, this is not part of a block of duplicate code.. This is pretty much the entire thing. If that's the best that they can find, then they're SOL.
-
Interesting
That code is everywhere
alk.
-
Re:they're showing some....
-
This is what we have done with old computer parts
We had built a free computer lab, made of old computers and Linux, all connected via ethernet and to the internet. so we can offer free use of pc & linux programs, emails, internet connectivity, C programming and so on, to all the people here that don't (& can't) have a computer
:) we have now more than 400 users, a nice community of local people, "telnet" people, from many countries (here in Catania, Italy, there are many people coming from other states, basically from Africa, Asia and Ex-Yug. That is, the first italian "hacklab" open to the people. p.s. all this is no-profit. it's a sort of hobby for us :) i think it's easy to create such a "public computer club" for many of us. :) you can see this at www.freaknet.org. Sorry for my bad english language!