FACTOID # 75: Two-thirds of the world's executions occur in China.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Flooding algorithm
flooding algorithm
flooding algorithm with ack messages

A flooding algorithm is an algorithm for distributing material to every part of a connected network. The name derives from the concept of inundation by a flood. Image File history File links Size of this preview: 600 × 600 pixel Image in higher resolution (700 × 700 pixel, file size: 229 KB, MIME type: image/gif) Flooding algorithm Designer: Florian Lindner software used: msgnet code partially based on Distributed Systems 2006 File links The following pages on the English... Image File history File links Size of this preview: 600 × 600 pixel Image in higher resolution (700 × 700 pixel, file size: 229 KB, MIME type: image/gif) Flooding algorithm Designer: Florian Lindner software used: msgnet code partially based on Distributed Systems 2006 File links The following pages on the English... Image File history File links Size of this preview: 600 × 600 pixel Image in higher resolution (700 × 700 pixel, file size: 425 KB, MIME type: image/gif) Flooding algorithm with ack messages Designer: Florian Lindner software used: msgnet code partially based on Distributed Systems 2006 File links The following pages... Image File history File links Size of this preview: 600 × 600 pixel Image in higher resolution (700 × 700 pixel, file size: 425 KB, MIME type: image/gif) Flooding algorithm with ack messages Designer: Florian Lindner software used: msgnet code partially based on Distributed Systems 2006 File links The following pages... In mathematics, computing, linguistics, and related disciplines, an algorithm is a finite list of well-defined instructions for accomplishing some task that, given an initial state, will terminate in a defined end-state. ... A computer network is an interconnection of a group of computers. ... Flooding in Amphoe Sena, Ayutthaya Province, Thailand. ...


Flooding algorithms are used in systems such as Usenet and peer-to-peer file sharing systems and as part of some routing protocols, including OSPF, DVMRP, and those used in ad-hoc wireless networks. Usenet (USEr NETwork) is a global, decentralized, distributed Internet discussion system that evolved from a general purpose UUCP architecture of the same name. ... A peer-to-peer (or P2P) computer network is a network that relies on the computing power and bandwidth of the participants in the network rather than concentrating it in a relatively few servers. ... The introduction to this article provides insufficient context for those unfamiliar with the subject matter. ... The Open Shortest Path First (OSPF) protocol is a hierarchical interior gateway protocol (IGP) for routing in Internet Protocol, using a link-state in the individual areas that make up the hierarchy. ... The Distance Vector Multicast Routing Protocol (DVMRP) is used to share information between routers and transport Multicast packets among networks. ... A mobile ad-hoc network (MANet) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers (and associated hosts) connected by wireless links – the union of which form an arbitrary topology. ...


There are several variants of flooding algorithm: most work roughly as follows.

  1. Each node acts as both a transmitter and a receiver.
  2. Each node tries to forward every message to every one of its neighbors except the source node.

This results in every message eventually being delivered to all reachable parts of the network.


Real-world flooding algorithms have to be more complex than this, since precautions have to be taken to avoid wasted duplicate deliveries and infinite loops, and to allow messages to eventually expire from the system.


Flooding algorithms are also useful for solving many mathematical problems, including maze problems and many problems in graph theory. For other uses, see Maze (disambiguation). ... A drawing of a graph. ...

Contents

Disadvantages of Flooding

There are several disadvantages with this approach to routing. It is very wasteful in terms of the networks total bandwidth. While a message may only have one destination it has to be sent to every host. This increases the maximum load placed upon the network.


Messages can also become duplicated in the network further increasing the load on the networks bandwidth as well as requiring an increase in processing complexity to disregard duplicate messages.


Advantages of Flooding

The main advantage of flooding is the increased reliability provided by this routing method. Since the message will be sent at least once to every host it is almost guaranteed to reach its destination.


See also

Routing Schemes anycast broadcast multicast unicast Multicast is sometimes also used to refer to a multiplexed broadcast, although that is a very different thing and should not be confused. ... Flood fill, also called seed fill, is a recursive algorithm that determines connected regions in a multi-dimensional array. ...

Examples

  • Ricochet A flooding networking app written in Java

  Results from FactBites:
 
Search Encyclopedia.com (546 words)
flood flood, inundation of land by the rise and overflow of a body of water.
Floods occur most commonly when water from heavy rainfall, from melting ice and snow, or from a combination of these exceeds the carrying capacity of the river system, lake, or ocean into which it runs.
Mississippi -> Attempts at Flood Control The flow of the river is greatest in the spring, when heavy rainfall and melting snow on the tributaries (especially the Missouri and the Ohio) cause the main stream to rise and frequently overflow its banks and levees, inundating vast areas of the plain.
Flooding algorithm - Wikipedia, the free encyclopedia (223 words)
Flooding algorithms are used in systems such as Usenet and peer-to-peer file sharing systems and as part of some routing protocols, including OSPF, DVMRP, and those used in ad-hoc wireless networks.
Real-world flooding algorithms have to be more complex than this, since precautions have to be taken to avoid wasted duplicate deliveries and infinite loops, and to allow messages to eventually expire from the system.
Flooding algorithms are also useful for solving many mathematical problems, including maze problems and many problems in graph theory.
  More results at FactBites »


 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m