2008
DOI: 10.1016/j.comcom.2008.04.026
|View full text |Cite
|
Sign up to set email alerts
|

Reduced complexity algorithms for cognitive packet network routers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 16 publications
(17 reference statements)
0
4
0
Order By: Relevance
“…The investigation showed RNNs 226-300 times more efficiency in terms of energy performance product as compared to ANNs. Furthermore, authors in [24] introduced a simplified RNN with 2N weights instead of 2N 2 weights for the implementation of smart packet processing.…”
Section: Random Neural Network Distinguished Featuresmentioning
confidence: 99%
“…The investigation showed RNNs 226-300 times more efficiency in terms of energy performance product as compared to ANNs. Furthermore, authors in [24] introduced a simplified RNN with 2N weights instead of 2N 2 weights for the implementation of smart packet processing.…”
Section: Random Neural Network Distinguished Featuresmentioning
confidence: 99%
“…Alternative algorithms to the RNN were also proposed in [47,48] in order to keep the benefits of the RNN while being less complex and less resource demanding, and therefore, more suitable for implementation in hardware. The approximated RNN (aRNN) [48] is not a neural network model, but attempts to approximate properties of the RNN while using only simple arithmetic operators such as addition and subtraction, and bitwise shifts.…”
Section: Hardware Implementation Of Cpnmentioning
confidence: 99%
“…Alternative algorithms to the RNN were also proposed in [47,48] in order to keep the benefits of the RNN while being less complex and less resource demanding, and therefore, more suitable for implementation in hardware. The approximated RNN (aRNN) [48] is not a neural network model, but attempts to approximate properties of the RNN while using only simple arithmetic operators such as addition and subtraction, and bitwise shifts. A sensible routing (SR) policy (also called 1-SR), introduced in [49], bases its routing decisions on the expected QoS of a possible outcome and selects a path with a probability that is inversely proportional to the expected QoS metric of that path.…”
Section: Hardware Implementation Of Cpnmentioning
confidence: 99%
See 1 more Smart Citation