Abstract
Techniques are described herein for dynamically adjusting a transmit sequence based on a coefficient collision table. A fast forwarding routing mechanism may search a routing table when traffic enters the data plane, and fill the output buffer of a corresponding interface. Furthermore, if the data plane detects large amounts of short packets destined for the mesh, compression into one packet can be achieved if they belong to a common parent.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Jiang, Caijun; Zhang, Xiaopu; Wang, Zhanwu; and Zhu, Dapeng, "FAST FORWARDING ROUTING MECHANISM BASED ON NETWORK TOPOLOGY FOR WIRELESS SENSOR NETWORK", Technical Disclosure Commons, (March 20, 2020)
https://www.tdcommons.org/dpubs_series/3037