Hi Alexander
In your presentation at 6TiSCH, you propose the following data node ID
structure.
* 32 bits YANG ID
- 20 bits for module ID (assigned by IETF)
- 10 bits for data node ID (generated deterministically)
Based on this structure, we can reserve module ID zero for aliases.
If we want to minimize both the network an node resources require by this alias
mechanism, we can map an entire module to this space.
This can be implemented by a single integer resource (e.g. leaf alliassedModule
{ type uint32 } )
This approach require 4 bytes per CoMI server accessed.
If we want a more complex but more flexible aliases mechanism, your proposed
map of (allias, YANG ID) seem the solution.
However, we have to consider that this structure can be as large as 1250 bytes
per CoMI server accessed if limited to 256 aliases.
[cid:[email protected]]
Michel Veillette
System Architecture Director
Trilliant Inc.
Tel: 450-375-0556 ext. 237
[email protected]<mailto:[email protected]>
www.trilliantinc.com<http://www.trilliantinc.com/>
_______________________________________________
6tisch mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/6tisch
