Changes between Version 40 and Version 41 of gsoc

Mar 10, 2009 5:23:17 PM (11 years ago)


  • gsoc

    v40 v41  
    52 = Application template =
    53  1. What idea would you like to work on? Please work out a general description. Also include a more detailed explanation, with the project broken down in different parts (if possible, include a timeline).
    54  1. Tell us about yourself. Who are you, what do you study, other information about yourself.
    55  1. Why did you choose I2P? What's your motivation, and why this specific idea?
    56  1. Do you intend to work full time on the project, or do you have other obligations? If possible, give us a timeline.
    57  1. Are there any additional reasons we should pick you to work on I2P?
    60 = Requirements and hints =
    61  * Students are (in most cases) expected to use the Monotone revision control system.
    62  * Make yourself available: working on the GSoc will be a lot of work, keep this in mind.
    63  * Be sure to get to know the developers beforehand, since you will be working with them for over 2 months (and hopefully longer, as you can always continue to contribute to the project).
    64  * Related to the above: communicate often with the developers (specifically: your mentor). Ask questions if you don't understand something, say what your great new idea is and how you are implementing it ...
    65  * Be motivated! If you like the idea you're applying for and would love to code on it, your experience will be much more enjoyable.
    68 = Ideas =
    70 The following ideas are only a few suggestions by developers and enthousiasts. Other ideas are possible, and even encouraged. I2P is an overlay network, which basically allows any online application to be adapted to I2P. This, as well as the option to develop a new feature for the overlay network, allows a whole range of ideas.
    72 == Distributed wiki on I2P (either porting or from scratch) ==
    73 Websites on I2P are often shortlived, which causes information to get lost. Over the course of the years, there have been multiple wikis on i2p, but only one has been online for a considerable time: ugha.i2p . To remove the risk of losing valuable data, a distributed wiki would be extremely useful. It should be possible to host the wiki both on I2P websites (eepsites) as on regular ones (to allow people without I2P to contribute as well).
    74 === Required skills ===
    75  * Programming knowledge, both desktop programming and web programming (for a wiki frontend)
    76 === Dependencies ===
    77  * Distributed data storage on I2P (optional -- if such a wiki is built on a distributed data storage system)
    78  * Distributed version control systems (optional -- if such a wiki is built on top of a distributed version control system)
    79 === Inspiration ===
    80  *
    83 == Distributed data storage on I2P ==
    84 Providing files from an eepsite can be slow (a 20 kBps download can turn into a 2 kBps download or simply stop if too many visitors are interested), the eepsite can go offline for a while, and uploading files may take a lot of resources from the host. To remove these problems, a distributed data storage system could be built on top of I2P. Such a system could, amongst other things, be used to facilitate I2P upgrades inside of the network.
    85 === Required skills ===
    86  * Java
    87 === Notes ===
    88  * Inital work has been done on both Dijjer and Yafan.
    89  * Either Dijjer (which also needs improvements like SHA instead of MD5) or Yafan can be used for a data storage system.
    92 == IPv6 support for I2P ==
    93 Currently I2P only supports IPv4 TCP and UDP. Adding IPv6 support would involve adding a new field in the NTCP/SSU routerInfo entries and possibly adding some restricted route functionality to support communication of IPv4-only peers with IPv6-only peers.
    94 === Required skills ===
    95  * Java
    96 === Notes ===
    97  * Some initial work has already been done in the i2p.i2p.ipv6 monotone branch.
    100 == Distributed Domain Name System (DNS) ==
    101 The current DNS system (which goes by the name SusiDNS) is extremely simple. The routing through the network causes extra latency, so a traditional DNS system would not be possible/slow down I2P. This is why the current system uses a textfile on the local computer, containing the destinations of eepsites. Updates are retrieved by getting the textfiles from 'trusted' eepsites. As an alternative, there is a system using base32 hostnames, like in Tor.
    102 The idea for this task would be that the DNS system needs to turn into a distributed, easily updatable system.
    103 === Required skills ===
    104  * Java
    105  * Understanding of DNS
    107 == Revive Kademlia DHT ==
    108 Peers in I2P currently 'discover' each other through a floodfill system (several high-traffic routers inform the other routers of each other). This system is not as scalable as a DHT system, and it's also less secure (because of the reliance on a limited number of nodes). Changing this system or replacing it, will be an interesting and challenging task.
    109 === Required skills ===
    110  * Java
    111  * Good knowledge of networking protocols, network routing ...
    112  * Willingness to learn about different types of Distributed Hash Tables and research how well they would fit into the I2P network
    113 === Notes ===
    114  * There is already a Kademlia implementation in I2P that used to work, but it was abandoned for a floodfill implementation due to the Kademlia system not working efficiently enough.
    117 == I2P seeding for applications (so central reseed locations are no longer required) ==
    118 A lot of I2P applications use their own reseed implementation (pointing to specific 'reseed nodes' to get information about other nodes using the application). Reseed functionality in the I2P network itself could avoid reinventing the wheel in the future.
    119 === Required skills ===
    120  * Java
    123 == Improving the Message Priority System and looking into QoS ==
    124 === Required skills ===
    125  * Java
     52= Links =
     53 * [wiki:gsoc/ideas]