Search results

Jump to navigation Jump to search
Results 1 – 21 of 77
Advanced search

Search in namespaces:

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • {{Short description|Class of algorithms}} ...er networking)|computer networking]] and [[Flood fill|graphics]]. Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] ...
    2 KB (328 words) - 18:11, 26 January 2025
  • [[File:Flooding routing.gif|right|thumb|Flooding algorithm]] [[File:FloodAck.gif|right|thumb|Flooding algorithm with [[Acknowledgement (data networks)|ACK]] messages]] ...
    6 KB (843 words) - 22:56, 28 September 2023
  • ...ting routing tables throughout the network. The main disadvantages of such algorithms are: Examples of proactive algorithms are: ...
    6 KB (830 words) - 07:12, 22 May 2025
  • ...tocol operated by query flooding; newer versions use more efficient search algorithms. Query flooding is simple to implement and is practical for small networks with few request ...
    3 KB (423 words) - 17:47, 3 December 2024
  • ...g may result in problems, because it generates exponential behavior. Smart flooding, on the other hand, recognizes link state packets appropriately. ...emented with [[Open Shortest Path First]] (OSPF) protocol. OSPF's reliable flooding mechanism is implemented by Link State Update and Link State Acknowledgment ...
    4 KB (622 words) - 04:55, 4 March 2023
  • *[[Flooding (computer networking)]] [[Category:Routing algorithms]] ...
    2 KB (278 words) - 14:52, 14 June 2020
  • * [[Flooding algorithm]] ==Algorithms== ...
    7 KB (788 words) - 02:52, 24 September 2024
  • * [[Scheduling algorithms]]: ...= Latency-rate servers: A general model for analysis of traffic scheduling algorithms | journal = [[IEEE/ACM Transactions on Networking]] | volume = 6 | issue = ...
    7 KB (983 words) - 06:30, 27 December 2023
  • ...problem|shortest path]] solution, an approach which is unusual for routing algorithms of this type. ...e of the link failure. TORA's route erasure phase is essentially involving flooding a broadcast clear packet (CLR) throughout the network to erase invalid rout ...
    6 KB (1,031 words) - 12:20, 19 February 2024
  • ...ns and must reconfigure itself around broken paths, using ''self-healing'' algorithms such as [[Shortest Path Bridging]] and [[TRILL]] (Transparent Interconnecti ...
    7 KB (927 words) - 04:18, 23 May 2025
  • ...tacks_through_Modified_NetFPGA_Reference_Router |title=Mitigating HTTP GET Flooding Attacks through Modified NetFPGA Reference Router |date=7 November 2014 |pa ; Algorithms ...
    7 KB (932 words) - 19:04, 29 May 2025
  • ...interface; hence, a different approach is needed in order to optimize the flooding process. Using Hello messages the OLSR protocol at each node discovers 2-h ...ase to be synchronized across the network, OSPF and IS-IS perform topology flooding using a reliable algorithm. Such an algorithm is very difficult to design ...
    11 KB (1,736 words) - 22:37, 16 April 2025
  • ...ich pieces are cleared. A variant called '''boundary fill''' uses the same algorithms but is defined as the area [[Glossary of graph theory#Connectivity|connecte ...93210-6 }}</ref><ref name="82Levoy">{{Cite conference |title=Area Flooding Algorithms |last=Levoy |first=Marc |year=1982 |conference=SIGGRAPH 1981 Two-Dimensiona ...
    23 KB (3,275 words) - 09:04, 8 September 2025
  • ...them to take appropriate actions to mitigate the potential consequences of flooding on human lives, property, and the environment. By accounting for the variou ...ut also aim to estimate the spatial distribution, timing and extent of the flooding. Hydrodynamic models, such as the Hydrologic Engineering Center's River Ana ...
    10 KB (1,374 words) - 04:25, 23 March 2025
  • ...; heavy rainfall higher in the river's [[drainage basin]] can bring severe flooding to settlements. In recent years [[York]], [[Selby]] and villages in between ...ricted Tidal Waters. In: Weintrit, A. and Neumann, T. (Eds.) ''Methods and Algorithms in Navigation: Marine Navigation and Safety of Sea Transportation''. London ...
    16 KB (2,333 words) - 23:23, 18 November 2025
  • Because [[digital signature]] algorithms cannot sign a large amount of data efficiently, most implementations use a ===Hash flooding=== ...
    17 KB (2,496 words) - 14:32, 21 June 2025
  • ....2 documentation | url=https://networkx.org/documentation/stable/reference/algorithms/tree.html | access-date=2021-12-10 | quote=For trees and arborescence, the Several [[pathfinding]] algorithms, including [[Dijkstra's algorithm]] and the [[A* search algorithm]], intern ...
    26 KB (3,930 words) - 19:26, 11 April 2025
  • ...%22ntsc-j%22+-wiki+-console+-consola&pg=PA407 |title=Digital Video and HD: Algorithms and Interfaces |date=January 3, 2003 |publisher=Elsevier |isbn=978008050430 ...>{{cite book |last1=Poynton |first1=Charles |title=Digital video and HDTV: algorithms and interfaces |date=2003 |publisher=Morgan Kaufmann Publishers |isbn=97815 ...
    11 KB (1,592 words) - 14:51, 26 April 2025
  • The FNV hash algorithms and reference FNV [[source code]]<ref name="FNV_prime">{{Cite journal|last1 ...replaced with [[SipHash]] to resist "[[Collision attack#Hash flooding|hash flooding]]" [[denial-of-service attack]]s.<ref>{{Cite web|url=https://www.python.org ...
    15 KB (2,122 words) - 07:00, 23 May 2025
  • ...message delivery on the Internet. This article focuses on unicast routing algorithms. ...routing dominates the Internet. Examples of dynamic-routing protocols and algorithms include [[Routing Information Protocol]] (RIP), [[Open Shortest Path First] ...
    27 KB (3,952 words) - 21:49, 21 October 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)