|This article needs additional citations for verification. (January 2010) (Learn how and when to remove this template message)|
|Stable release||0.11.8.1 (2004-11-27) [±]|
|Preview release||Non [±]|
giFT Internet File Transfer (giFT) is a computer software daemon that allows several file sharing protocols to be used with a simple client having a graphical user interface (GUI). The client dynamically loads plugins implementing the protocols, as they are required.
Clients implementing frontends for the giFT daemon communicate with its process using a lightweight network protocol. This allows the networking protocol code to be completely abstracted from the user interface. The giFT daemon is written using relatively cross-platform C code, which means that it can be compiled for and executed on a big variety of operating systems. There are several giFT GUI front-ends for Microsoft Windows, Apple Macintosh, and Unix-like operating systems.
The name giFT (giFT Internet File Transfer) is a so-called recursive acronym, which means that it refers to itself in the expression for which it stands.
One of the biggest drawbacks of the giFT engine is that it currently lacks Unicode support, which prevents sharing files with Unicode characters in their file names (such as "ø","ä", "å", "é" etc.). Also, giFT lacks many features needed to use the gnutella network effectively.
Available protocols are:
- OpenFT, giFT's own file sharing protocol 
- gnutella (used by FrostWire, Shareaza)
- Ares Galaxy
- Turtle F2F
- Note: OpenFT has previously had its own article, therefore OpenFT redirects here. To see the articles in other languages, just click the previous link and choose from the side menu.
giFT's sibling project is OpenFT, a peer-to-peer file sharing network protocol that has a structure in which nodes are divided into 'search' nodes and 'index' supernodes in addition to common nodes. Since both projects are related very closely, when one says 'OpenFT', one can mean either one of two different things: the OpenFT protocol, or the implementation in the form of a plugin for giFT.
The name "OpenFT" stands for "Open FastTrack". Despite this, the OpenFT protocol is an entirely new protocol design: only a few ideas in the OpenFT protocol are drawn from what little was known about the FastTrack protocol at the time OpenFT was designed.
OpenFT File sharing protocol
Like FastTrack and Napster, OpenFT is a network where nodes submit lists of shared files to other nodes to keep track of which files are available on the network. This reduces the bandwidth consumed from search requests at the price of additional memory and processing power on the nodes that store that information. The transmission of shared lists is not fully recursive: a node will only transmit its list of shared files to a single search node randomly chosen as that node's "parent", and the list of those files will not be further transmitted to other nodes.
OpenFT is also similar to the gnutella network in that search requests are recursively forwarded in between the nodes that keep track of the shared files.
There are three different kinds of nodes on the OpenFT network:
- Most nodes are USER nodes; these don't have any special function.
- These nodes handle search requests; they search the filelists their CHILD nodes (explained below) submit to them. These nodes must have a capable Internet connection and at least 128M RAM. A modern processor is highly recommended as well.
- Nodes with fast connections and lots of memory can be INDEX nodes, which keep lists of available search nodes, collect statistics, and try to maintain the structure of the network.
A node can be both a SEARCH and an INDEX node. USER nodes will pick three SEARCH nodes to be their PARENT nodes. They will submit their shares list to them if the PARENT accepts the USER as its CHILD. By default, SEARCH nodes will be PARENTS for a maximum of 500 CHILD nodes.
||0.19-rc1 (2008-02-03)||KCeasy Source Forge website|
|Poisoned||Mac OS X||GPL||
- MLDonkey - another plugin based multi-network P2P client
- "giFT: Internet File Transfer". 2002-05-11. Retrieved 2010-01-04.
- From the giFT documentation at the giFT homepage
- According to the giFT documentation:
Search nodes handle search requests. They search the filelists their CHILD (common) nodes submitted to them. These nodes must have a capable Internet connection and at least 128M RAM. A modern processor is highly recommended as well.
- According to the giFT documentation:
INDEX nodes keep lists of available search nodes, collect statistics, and try to maintain the structure of the network.
- Scott Rippee (15 Jan 2004) Throw That GUI Out the Door: Console Applications That Shine, OSNews
- Juergen Haas, Appolon, About.com Kubuntu Guide
- Carsten Schnober, Olympian Exchange. File Sharing with Apollon and GiFT, Linux Magazine issue 55, June 2005, pp. 82-83
- Thomas Mennecke (September 5, 2004) Getting Into KCeasy, Slyck.com
- KCEasy Review FileSharingZ.com
- John Borland, Macintosh users join Kazaa network, CNET News, November 19, 2003
- Thomas Mennecke, Poisoned: Bringing FastTrack to the Macintosh Community, November 21, 2003
- Marcus Bergner, FastTrack chapter in his MS Thesis "Improving Performance of Modern Peer-to-peer Services", 10 June 2003, Umeå University, chapter "discusses the FastTrack protocol used by the KaZaA family of file sharing applications. Since the protocol is a well kept secret most discussions will relate to the giFT project, an open source implementation attempting to provide similar capabilities."
- Choon Hoong Ding; Sarana Nutanong; Rajkumar Buyya (2005). "Peer-to-Peer Networks for Content Sharing". In Subramanian, Ramesh; Goodman, Brian D. Peer-to-peer computing: the evolution of a disruptive technology. Idea Group. pp. 58–61. CiteSeerX . ISBN 1-59140-430-4.
- "Introduction to giFT - internet File Transfer". 2007-01-06. Retrieved 2010-01-04.
- Minaxi Gupta, Markus Jakobsson, Andrew Kalafut, and Sid Stamm, Crimeware and Peer-to-Peer Networks, chapter 3 in Markus Jakobsson, Zulfikar Ramzan, Crimeware: understanding new attacks and defenses, Addison-Wesley, 2008, ISBN 0-321-50195-0, pp. 55–76 (discuses malware in the OpenFT and Limewire networks)
- based on: Kalafut, Andrew; Acharya, Abhinav; Gupta, Minaxi (2006). "A study of malware in peerto-peer networks". Proceedings of the 6th ACM SIGCOMM on Internet measurement. MCS'06. CiteSeerX .