Home » History » Version 78

Greg Burri, 12/10/2008 02:16 PM

1 1 Greg Burri
h1. Home
3 64 Greg Burri
* [[Development process]]
4 76 Greg Burri
* [[Links]]
5 64 Greg Burri
6 31 Greg Burri
h2. Brainstorming
7 4 Greg Burri
8 21 Greg Burri
* Core and GUI are independent. They communicate over TCP socket.
9 68 Greg Burri
** It's possible to launch the core without the GUI and without X launched under Linux.
** The core show, if its possible, an icon in the trayicon with a minimal menu to manage it.
** The core does not depend of any kind of graphic library except for the trayicon.
12 1 Greg Burri
** If the GUI crashes then the core remains.
13 68 Greg Burri
** It's possible to control the core remotely with a password.
14 22 Greg Burri
* Designed for LAN usage (full trusted peers and very high speed transfers).
15 37 Greg Burri
* Efficient (very low CPU usage).
16 18 Greg Burri
* Distributed download (multi peer downloading and no central server).
17 36 Greg Burri
** Quicker peer first. The speed of a peer is an average over a period of time say 5 min. The speed of an unknown peer is maximum thus it will be take first. If a downloading is too slow (like three time slower than the best known peer) then it can switch to a quicker free peer.
18 65 Greg Burri
After A period of time without any download from a peer say 30min its speed is reseted to the maximum.
19 62 Greg Burri
** Rarest parts first. If there is no rarest parts then the choice is randomly.
20 37 Greg Burri
** A part can be resumed from any peer which own a complete copy.
** A file from a user is identified by its name and its folder.
22 1 Greg Burri
** Fixed part size (2^24 B = 16 MB) hashed with SHA-1. Used to control the integrity of parts and to identify each part. If the SHA-1 of a part does not match the given SHA-1 then it will be re-downloaded entirely.
23 44 Greg Burri
** The number of concurrent download is around 3 parts simultaneous but not more than 1 per peer. The number of concurrent upload is unlimited.
24 43 Greg Burri
** Recursive folder downloading.
** The paths of the files are recreated in the downloading peer.
26 40 Greg Burri
* There is a general chat. There is no private chat. The chat uses UDP multicast (if possible).
27 69 Greg Burri
* Multicast UDP for services discovering (maybe UPNP). Each peer announces periodically (T) he is alive with a multicast message. If we doesn't receive any alive message from a peer while 3*T we consider it dead and we remove it from the list.
28 18 Greg Burri
* MDI GUI with GTK2HS.
29 1 Greg Burri
** A panel to view the current peers and their amount of sharing.
30 67 Greg Burri
** A window to view the current downloads (leechage) and one for the current uploads (seedage). These windows are very similar. The list is ordered, first the complete downloads then the uncomplete ones with 0 peers then the current downloading files and finally the queued files.
31 78 Greg Burri
The list can contains both file or folder, when a folder is downloaded its files and folders are retrived from the peer and will replace the folder int the list (lazy download).
32 40 Greg Burri
** A window for the chat.
33 57 Greg Burri
** Some windows for each file browsing. The files and folders are seen like a tree (like in the Finder of Mac OS X).
34 1 Greg Burri
** Some windows for each file searching. The displayed list is identical to the browsing list.
35 78 Greg Burri
** A window for the settings.
36 18 Greg Burri
*** The shared folders.
37 1 Greg Burri
*** The incoming folders (take the first if enough available space disk otherwise the second and so one..).
38 34 Greg Burri
*** Bandwidth and CPU limitation with a single option (checkbox).
39 42 Greg Burri
* Using of "Thrift": or "Protocol Buffers": for definition of the protocol between two peers and between the Core and the GUI.
40 1 Greg Burri
* File list with name+size.
41 73 Greg Burri
* Non blocking search, the list is dynamically filled for each peer answer. The search is active on files and folders name.
42 1 Greg Burri
* Using of systray (optional).
43 71 Greg Burri
* When you browse the files of someone you will see all its files with non-hashing files too.
** The hashing will be created and sent when you decide to download a specific file.
* Support of UTF-8.
46 66 Greg Burri
** Creating many tests with special characters in the name of the files or directories
** Maybe use of 'Distribution.Simple.Utils.toUTF8'
48 61 Greg Burri
* "Haskell": language
** A polymorphically statically typed, lazy, purely functional language. Very high level modern language.
** Open source.
** Efficient.
** Good GTK-Binding :
53 1 Greg Burri
h3. Secondary ideas
56 72 Greg Burri
* The users can add some comments or tags associated to theirs sharing. These comments or tags are displayed in the list of peers (new column ? tooltip ?).
57 1 Greg Burri
* Parse meta data like ID3tag when searching.
* Free space management.
59 75 Greg Burri
* Preview of video and mp3 files from a peer. Streaming ?
60 77 Greg Burri
* Virtual folder to aggregate some real folders. For example the virtual folder 'Divx' may contains '/mnt/Divx1', '/mnt/Divx2' and '/home/paul/movies'.
61 1 Greg Burri
* Private chat.
62 70 Greg Burri
* Multi languages.
63 1 Greg Burri
* Automatically detect a running game and set the limitation flag.
* Automatically detect CPU/bandwidth usage and set limitation flag.
* Protect some sharing by a password / user rights for shares.
* Statistics window with graphs.
67 60 Greg Burri
h2. Functional
70 74 Greg Burri
* [[Name]]
71 60 Greg Burri
* [[Functional constraints]]
* [[GUI]]
* [[Logo]]
h2. Technical
* [[Study of the BitTorrent protocol]]
* [[Study of UPNP]]
* [[Study of UDP multicast]]
* [[Study of Thrift]]
* [[Study of Protocol Buffer]]
82 63 Greg Burri
* [[Libraries]]
83 60 Greg Burri
* [[Protocols]]
* [[Prototypes]]
* [[Guidelines]]