OLSR-NG: Unterschied zwischen den Versionen
Hannes (Diskussion | Beiträge) (add mind map) |
Hannes (Diskussion | Beiträge) (→Who is working on what?) |
||
Zeile 86: | Zeile 86: | ||
|} | |} | ||
− | [[Bild: | + | [[Bild:Olsr-ng.png|mind map (using freemind) for all the work items]] |
contact mailto:aaron@lo-res.org or Bernd if you are interested in participating! | contact mailto:aaron@lo-res.org or Bernd if you are interested in participating! |
Version vom 17. April 2007, 19:26 Uhr
Inhaltsverzeichnis
sponsor
800px|supported by IPA made possible by a grant from IPA. Thanks we really appreciate your help and your courage to support us!
main links
Main OLSR-NG project blog: http://olsr.funkfeuer.at
Slides from the OLSR-NG kickoff presentation: http://outpost.funkfeuer.at/~aaron/olsr-ng.pdf
We communicate on the olsr-dev mailinglist: https://www.olsr.org/mailman/listinfo/olsr-dev
Goals
- Clean up the code of OLSR (http://www.olsr.org),
- improve the algorithms of OLSR and make it more scalable.
- Furthermore, produce a new RFC for a (potential) new mesh routing protocol which is based on the experiences of OLSR coding (at the moment the most promising candidate for this RFC is B.A.T.M.A.N)
OLSR-NG is a open source project. Meaning everybody is invited to join in and help.
We do have some bounties for the best solutions. If you want to participate, drop us an email: mailto:aaron@lo-res.org and mailto:bernd@firmix.at
One of the main goals is to make OLSR more scalable in practice.
350px|right|Complexity for n=1000 nodes of different data structures in the Dijkstra shortest path (SPF) algorithm.
In the this picture you can see the different complexity graphs for the SPF under the assumption that every node has 10 edges . As you can see, the red line has O(n^2) complexity. This conforms to the current implementation of OLSR from www.olsr.org. OLSR-NG plans to reduce the complexity to the green or even the yellow level. This will allow the mesh network clouds to become larger by a factor ~ 1000 (on the routing layer / layer 3).
Current Status
- olsrd 0.5 was released! Thx everybody a lot!
- UML test server is being worked on. This will allow the B.A.T.M.A.N team to test their protocol and us to test our scalability ideas with 1000nd of olsr instances.
- Ongoing code cleanups
- AVL tree optimizations
UML test server
topo map of first UML instances running in parallel. All instances are connected via one single uml_switch (virtual HW switch)
We have already been running 400 instances and there was still plenty of RAM left. So 500 is a very safe bet. However according to the UML docu we can probably safely assume that we can scale up miuch higher because UML will only take the RAM that each instance actually needs. More reserach on this is still needed however...
More info on the UML server coming soon...
Who is working on what?
Who | What | Status |
---|---|---|
Bernd Petrovitsch, Thomas Lopatic, Hannes Gredler | release 0.5 | DONE |
Hannes Gredler | tcpdump parses olsr packets, | DONE |
Hannes Gredler | SPF improvments | WIP |
Hannes Gredler | reduce malloc thrashing during SPF computation | WIP |
Hannes Gredler | improve post-SPF handling (route table conciliation) | not yet started |
Aaron Kaplan,Bernd Petrovitsch | olsr-ng test server | WIP |
Aaron Kaplan | theory, complexity analysis. Goal: find the best complexity on the algorithmic side. | The basic ideas seem like 90% finished. Will be presented at the TU lecture "Verteilte Systeme" ("Distributed Systems"), 20.4.2007 |
Zethix, Aaron Kaplan | UML cluster setup | WIP, currently we can start around 500+ UML instances. http://www.openvz.org seems also like a promising solution |
mind map (using freemind) for all the work items
contact mailto:aaron@lo-res.org or Bernd if you are interested in participating!
Next Steps
- TU Wien lecture "Verteilte systeme", 20.4.2007 will present our ideas about optimizing complexity. Aaron also wants to adress more students from the TU to participate
- finalize the UML test server
- try out the optimization ideas and document the speedup
Bounties
please take a look at the slides and get in contact with us directly at the moment!
Source code
- CVS repos:
(as user "ipo23" ) export CVS_RSH=ssh cvs -z3 -d:ext:ipo23@olsrd.cvs.sourceforge.net:/cvsroot/olsrd co -P olsrd-current as anonymous user) cvs -d:pserver:anonymous@olsrd.cvs.sourceforge.net:/cvsroot/olsrd login cvs -z3 -d:pserver:anonymous@olsrd.cvs.sourceforge.net:/cvsroot/olsrd co -P olsrd-current
Links
Papers, Theory
- RFC-3626: the "OLSR RFC"
- Workshop at Hipercom Oct 2006
- OLSR-v2 Draft 01 at hipercom
- http://www.adhocsys.org/
AdHocSys is a two-year European project to provide reliable broadband services in rural and mountain regions. This objective will be achieved by means of the creation of a wireless ad hoc broadband network, with special enhancements to reliability and availability. The network consists of one or several gateways connecting to the global Internet and several intermediate nodes which provide multihop connections between the gateways and end users.
misc
- Homepage: http://www.olsr.org/
- NATO C3 Agency (NC3A) Radio Protocols Lab https://elayne.nc3a.nato.int/
- commercial INRIA HIPERCOM spin-off http://www.luceor.com/
- commercial MIT Roofnet spin-off http://www.meraki.net/