Query flooding

Query flooding

Query flooding is a method to search for a resource on a P2P network. It is simple but scales very poorly and thus is rarely used. Early versions of the Gnutella protocol operated by query flooding; newer versions use more efficient search algorithms.

Operation

A P2P network generally consists of a large number of nodes each connected not to all other nodes, but a small subset of the nodes. If a node wants to find a resource on the network, which may be on a node it does not know about, it could simply broadcast its search query to its immediate neighbours. If the neighbours do not have the resource, it then asks its neighbours to forward the query to their neighbours in turn. This is repeated until the resource is found or all the nodes have been contacted, or perhaps a network-imposed hop limit is reached.

Query flooding is simple to implement and is practical for small networks with few requests. It contacts all reachable nodes in the network and so can precisely determine whether a resource can be found in the network (Freenet, for example, only returns a probabilistic result).

On the other hand, every request may cause every node to be contacted. Each node might generate a small number of queries; however, each such query floods the network. Thus, a larger network would generate far more traffic per node than a smaller one, making it inherently unscalable. Additionally, because a node can flood the network simply by issuing a request for a nonexistent resource, it could be possible to launch a denial of service attack on the network.

Alternatives

[http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html Version 0.6] of the Gnutella protocol mandates "query routing".A [http://gnutella-specs.rakjar.de/index.php/The_Query_Routing_Protocol simplified version] of the [http://www.limewire.com/developer/query_routing/keyword%20routing.htm specification] explains how theideas of [http://aeolusres.homestead.com/files/index.html the original research] are implemented. Other file sharing networks, such as the kad network, use distributed hash tables to index files and for keyword searches. BitTorrent creates individual overlay networks for sharing individual files (or archives). Searches are "performed" by other mechanisms, such as locating torrent files indexed on a web site. A similar mechanism can be use on the Gnutella network with magnet links. For instance Bitzi provides a web interface to search for magnet links.

Earlier P2P networks, such as napster, used a centralized database to locate files. This does not have a scaling problem, but the central server is a single point of failure.

See also

* Flooding algorithm


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Gnutella — Not to be confused with Nutella. Part of a series on File sharing Technologies …   Wikipedia

  • Gnutella2 — Part of a series on File sharing Technologies Peer to peer  …   Wikipedia

  • Shareaza — Original author(s) Michael Stokes …   Wikipedia

  • List of historical Gnutella clients — Many projects have attempted to use the Gnutella network, since its introduction in early 2000. This list enumerates abandoned or discontinued projects. Contents 1 List of discontinued clients 2 Additional information 2.1 Mutella 2 …   Wikipedia

  • Gnutella — Стиль этой статьи неэнциклопедичен или нарушает нормы русского языка. Статью следует исправить согласно стилистическим правилам Википедии. Gnutella полностью децентрализованная файлообменная сеть в рамках Интернета, потомок Napste …   Википедия

  • Gnutella2 — Gnutella2, G2  файлообменный OpenSource P2P протокол, используемый программой Shareaza. Разработан её автором как форк протокола Gnutella; не был положительно оценён участниками gnutella‐форума. Содержание 1 Работа сети 2 Отличие Gnutella2… …   Википедия

  • Анонимные сети — Анонимные сети  компьютерные сети, созданные для достижения анонимности в Интернете и работающие поверх глобальной сети. Специфика таких сетей заключается в том, что разработчики вынуждены идти на компромисс между степенью защиты и лёгкостью …   Википедия

  • Файлообменные сети — Файлообменная сеть – собирательное название сетей для совместного использования файлов. Часто в основе файлообменных сетей лежат одноранговые компьютерные сети, основанные на равноправии участвующих в обмене файлами, то есть каждый участник …   Энциклопедия ньюсмейкеров

  • Joseph Pomeroy Widney — (December 26, 1841 mdash; July 4, 1938) was a polymathic pioneer American physician, medical topographer, scholar educator, clergyman, entrepreneur philanthropist, proto environmentalist, prohibitionist, philosopher of religion, controversial… …   Wikipedia

  • Thunderstorm — Electrical storm redirects here. For other uses, see Electrical storm (disambiguation). A typical thunderstorm A thunderstorm, also known as an electrical storm, a lightning storm, thundershower or simply a storm is a form of weather… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”