Home » History » Revision 28
Revision 27 (Greg Burri, 11/26/2008 05:02 PM) → Revision 28/150 (Greg Burri, 11/26/2008 08:22 PM)
h1. Home
* [[Study of bittorent protocol]]
* [[Study of UPNP]]
* [[Protocol]]
h2. Description
A bit brainstormed for the moment ;)
* Core and GUI are independent. They communicate over TCP socket.
** It is possible to launch the core without the GUI. The core does not depend of any kind of graphic library.
** If the GUI crashes then the core remains.
* Designed for LAN usage (full trusted peers and very high speed transfers).
* Efficient (very low cpu usage).
* Distributed download (multi peer downloading and no central server).
** Quicker peer first. The speed of a peer is an average over a period of time say 5 min. A speed of a peer can be unknown. If a downloading is too slow (like three time slower than the best known peer) then it can switch to a quicker free peer.
** Rarest parts first.
** A part can be resumed from any peer.
** Fixed part size (2^24 B = 16 MB) hashed with SHA-1. Used to control the integrity of parts and to identify a file. A file is identified by the concatenation of all the SHA1 of all its parts. If the SHA-1 of a part does not match with the given SHA-1 then it will be re-downloaded entirely.
** Recursive folder downloading.
* There is a general chat.
* Multicast UDP for services discovering (maybe UPNP). Each peer announces periodically he is alive with a multicast message.
* MDI GUI with GTK2HS.
** A panel to view the current peers.
** A window to view the current downloads (leechage) and one for the current uploads (seedage).
** A window for the chat.
** A window for searching.
** Some windows for each file browsing.
** A modal window for the settings.
*** The shared folders.
*** The incoming folders (take the first if enough available space disk otherwise the second and so one..).
*** Bandwidth limitation.
* Using of "Thrift":http://incubator.apache.org/thrift/ for definition of the protocol between two peers and between the Core and the Gui.
* File list with name+size.
* Non blocking search.
* Using of systray (optional).
* Free space management.
* Graphics of the transfer rate over time.