On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces.
Attila KorösiAndrás GulyásZalán HeszbergerJózsef BíróGábor RétváriPublished in: IEEE/ACM Trans. Netw. (2020)
Keyphrases
- tight bounds
- memory requirements
- upper bound
- destination node
- routing table
- computational complexity
- worst case
- memory space
- memory usage
- routing problem
- computational speed
- storage requirements
- computational cost
- computational power
- lower bound
- neural network
- optimal control
- asymptotically optimal
- routing algorithm
- routing protocol
- wireless sensor networks
- routing decisions
- frequency hopping