Search results
Jump to navigation
Jump to search
Page title matches
- ...d using concepts of [[Lyapunov optimization|Lyapunov drift]]. Backpressure routing considers the situation where each job can visit multiple service nodes in '''Backpressure routing''' is an algorithm for dynamically routing traffic over a multi-hop network by using congestion gradients. The algorit ...43 KB (6,480 words) - 08:48, 10 July 2023
- {{Redir|Flood routing|the PCB routing algorithm|Flood router}} ...nse rain in an area upstream of a city will change as it reaches the city. Routing can be used to determine whether the pulse of rain reaches the city as a de ...11 KB (1,541 words) - 18:12, 7 August 2023
- ...ast3=Sanders|first3=P.|last4=Schultes|first4=D.|date=2007-04-27|title=Fast Routing in Road Networks with Transit Nodes|journal=Science|volume=316|issue=5824|p ...<ref>{{Citation|last1=Schultes|first1=Dominik|chapter=Dynamic Highway-Node Routing|pages=66–79|publisher=Springer Berlin Heidelberg|isbn=9783540728443|last2=S ...10 KB (1,515 words) - 20:58, 12 October 2024
- In [[computer science]], the '''minimum routing cost spanning tree''' of a [[weighted graph]] is a [[spanning tree]] minimi The minimum routing cost spanning tree of an unweighted [[interval graph]] can be constructed i ...5 KB (757 words) - 11:33, 6 August 2024
Page text matches
- {{Short description|Routing protocol for wireless sensor networks}} The '''Collection Tree Protocol''' (CTP) is a [[routing protocol]] for [[wireless sensor networks]]. It is used for transferring d ...3 KB (479 words) - 05:38, 20 November 2023
- {{Short description|Network routing metric}} ...lemented in [[RoofNet]]/[[Cisco Meraki|Meraki]] and [[Optimized Link State Routing Protocol|OLSR]] mesh networking protocols, among others. ...2 KB (329 words) - 14:31, 6 December 2024
- ==Channel routing== [[Image:ChannelRouteSolution.svg|350px|right|thumb|Channel routing example]] ...4 KB (545 words) - 16:57, 24 December 2023
- == E-Cube routing == Routing method for a hypercube network is referred to as E-Cube routing. The distance between two nodes in the network can be given by [[Hamming we ...5 KB (817 words) - 06:46, 17 February 2025
- ...n two points is naturally measured with rectilinear distance. Although the routing of a whole net with multiple nodes is better represented by the [[rectiline ...3 KB (380 words) - 01:48, 17 April 2024
- ## A set of routing objects N<sub>''RO''</sub>. # Routing Object ...11 KB (1,736 words) - 09:42, 31 October 2023
- {{Redir|Flood routing|the PCB routing algorithm|Flood router}} ...nse rain in an area upstream of a city will change as it reaches the city. Routing can be used to determine whether the pulse of rain reaches the city as a de ...11 KB (1,541 words) - 18:12, 7 August 2023
- ...[[Jackson network]] article, jobs travel among the nodes following a fixed routing matrix.</ref> is ''P'', the traffic equations are,<ref name="harrison">{{Ci ...2 KB (370 words) - 04:15, 1 October 2023
- ...ast3=Sanders|first3=P.|last4=Schultes|first4=D.|date=2007-04-27|title=Fast Routing in Road Networks with Transit Nodes|journal=Science|volume=316|issue=5824|p ...<ref>{{Citation|last1=Schultes|first1=Dominik|chapter=Dynamic Highway-Node Routing|pages=66–79|publisher=Springer Berlin Heidelberg|isbn=9783540728443|last2=S ...10 KB (1,515 words) - 20:58, 12 October 2024
- ===Fixed routing=== ...5 KB (683 words) - 22:00, 8 May 2024
- In [[computer science]], the '''minimum routing cost spanning tree''' of a [[weighted graph]] is a [[spanning tree]] minimi The minimum routing cost spanning tree of an unweighted [[interval graph]] can be constructed i ...5 KB (757 words) - 11:33, 6 August 2024
- ...ted protection paths in WDM mesh networks," High Performance Switching and Routing, 2003, HPSR. Workshop on , vol., no., pp. 311- 316, 24–27 June 2003 ...possibilities are available. Determining the working path is found by the routing algorithm. We are not limited to any one particular algorithm, but we must ...9 KB (1,360 words) - 05:56, 31 July 2024
- ...i|first=Ramesh|year=1999|title=Survivable Networks: Algorithms for Diverse Routing|contribution=Suurballe's disjoint pair algorithms|pages=86–91|publisher=Spr [[Category:Routing algorithms]] ...9 KB (1,452 words) - 20:58, 12 October 2024
- [[backpressure routing]] algorithm for network stability, also called the ''max-weight algorithm'' ...ads to the drift-plus-penalty algorithm for joint flow control and network routing developed by Neely, Modiano, and Li.<ref name=neely-fairness-infocom05/> ...13 KB (2,097 words) - 09:04, 28 February 2023
- ...he mixed Chinese postman problem often arises in [[Arc routing Problem|arc routing problems]] such as snow ploughing, where some streets are too narrow to tra ...ion of each edge.<ref>{{Cite book |last=Corberán |first=Ángel |title=''Arc Routing: Problems, Methods, and Applications'' |year=2015 |isbn=978-1-61197-366-2}} ...13 KB (2,148 words) - 00:51, 31 May 2024
- ...form}}</ref> They can also be applied to optimal [[Vehicle routing problem|routing problems]], graph problems, [[Integer programming|optimisation]] and others ...8 KB (1,154 words) - 01:14, 17 December 2024
- ...h theory]], '''Yen's algorithm''' computes single-source [[k shortest path routing|''K''-shortest]] loopless paths for a [[Graph (discrete mathematics)|graph] ...can be broken down into two parts: determining the first [[K shortest path routing|k-shortest path]], <math>A^1</math>, and then determining all other ''k''-s ...15 KB (2,515 words) - 20:11, 21 January 2025
- A dynamic routing mechanism for capsule networks was introduced by Hinton and his team in 201 ...th-EM-routing-Capsule-Network/|title=Understanding Matrix capsules with EM Routing (Based on Hinton's Capsule Networks)|website=jhui.github.io|access-date=201 ...28 KB (4,117 words) - 23:23, 5 November 2024
- ...d using concepts of [[Lyapunov optimization|Lyapunov drift]]. Backpressure routing considers the situation where each job can visit multiple service nodes in '''Backpressure routing''' is an algorithm for dynamically routing traffic over a multi-hop network by using congestion gradients. The algorit ...43 KB (6,480 words) - 08:48, 10 July 2023
- === Selfish Routing === ==== Generalized routing problem ==== ...21 KB (3,562 words) - 11:19, 1 January 2025