| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875690 | Theoretical Computer Science | 2018 | 18 Pages |
Abstract
Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver t has not been deleted, with only an additional O(ylogâ¡Î) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet is removed from the network. CompactFTZ uses only O(logâ¡n) bits memory for local fields (such as routing tables) and O(log2â¡n) bits for the routing labels, thus requiring O(log2â¡n) bits overall.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Armando Castañeda, Danny Dolev, Amitabh Trehan,