Brainstorming version 10¶

• Core and GUI are independent. They communicate over TCP socket.
  • It's possible to launch the core without the GUI and without X launched under Linux.
  • The core show, if it's possible, an icon in the trayicon with a minimal menu to manage it. The menu will include an entry to stop the core and an entry to launch the GUI.
  • The core does not depend of any kind of graphic library except for the trayicon.
  • If the GUI crashes then the core remains.
  • It's possible to control the core remotely with a password.
• 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, it's computed by the downloader. 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.
    After A period of time without any download from a peer say 30min its speed is reseted to the maximum.
  • Then rarest parts first from the chosen peers. If there is no rarest parts then the choice is randomly.
  • A part can be resumed from any peer which own a complete copy of this part.
  • A file from a user is identified by its name and its folder.
  • 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.
  • The number of concurrent download is around 3 parts simultaneous but not more than 1 per remote peer. The number of concurrent upload is unlimited.
  • Lazy recursive folder downloading.
  • The paths of the files are recreated in the downloading peer.
• There is a general chat. There is no private chat (for this version). The chat uses UDP multicast.
• Multicast UDP for services discovering. Each peer announces periodically (T) 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.
• Tabbed MDI GUI. See GUI for a preview.
  • A panel to view the current peers and their amount of sharing.
  • 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 incomplete ones with 0 peers then the current downloading files and finally the queued files and folders.
    The list can contains both file or folder, when a folder is downloaded its files and folders are retrieved from the peer and will replace the folder in the list (lazy download).
    There is a limit of the number of complete download. 500 for example.
  • A window for the chat.
  • Some windows for each file browsing. The files and folders are seen like a tree (like in the Finder of Mac OS X).
  • Some windows for each file searching.
  • A window for the settings.
    • The shared folders.
    • The incoming folders (take the first if enough available space disk otherwise the second and so one..).
• The files that are currently downloaded have the final size with a name like "movie.mkv.unfinished". The ".unfinished" will be removed when the download is finished. Maybe do the same thing for folder.
• Data serialization and message passing
  • Using of Thrift or Protocol Buffers for definition of the protocol between the peers and between the Core and the GUI.
• File list with name+size.
• Non blocking search, the list is dynamically filled for each peer answer. The search is active on files and folders name.
• Using of systray (optional).
• 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.
  • Creating many tests with special characters in the name of the files or directories
• Debug/Log window like Pidgin one