Trees are arguably one of the most important data structures widely used in information theory and computing science. Different numbers of intermediate nodes in wireless broadcast trees may exert great impacts on the ...Trees are arguably one of the most important data structures widely used in information theory and computing science. Different numbers of intermediate nodes in wireless broadcast trees may exert great impacts on the energy consumption of individual nodes, which are typically equipped with a limited power supply in a wireless sensor network; this limitation may eventually determine how long the given wireless sensor network can last. Thus, obtaining a deep understanding of the mathematical nature of wireless broadcast trees is of great importance. In this paper, we give new proof of Cayley＇s well-known theorem for counting labeled trees. A distinct feature of this proof is that we purely use combinatorial structures instead of constructing a bijection between two kinds of labeled trees, which is in contrast to all existing proofs. Another contribution of this work is the presentation of a new theorem on trees based on the number of intermediate nodes in the tree. To the best of our knowledge,this work is the first to present a tree enumeration theorem based on the number of intermediate nodes in the tree.展开更多
传统的网络使用基于最短路径的单一路径路由,无法有效地利用网络的全部带宽。软件定义网络(Software Defined Networking,SDN)采用中心化的控制平面能方便地实现对路由的精确控制。针对SDN网络下的多路径路由问题,提出了基于多路广播树...传统的网络使用基于最短路径的单一路径路由,无法有效地利用网络的全部带宽。软件定义网络(Software Defined Networking,SDN)采用中心化的控制平面能方便地实现对路由的精确控制。针对SDN网络下的多路径路由问题,提出了基于多路广播树的路由存储结构及相应的多路径选择算法。该算法根据各路径的可用带宽和时延进行概率分配,优先选择可用带宽大和时延小的路径。实验结果表明,该算法能快速地进行路由,并有效地减小传输时延和增大吞吐率。展开更多
基金supported in part by the National Natural Science Foundation of China (No. 61472200)Beijing Municipal Science & Technology Commission (No. Z161100000416004)
文摘Trees are arguably one of the most important data structures widely used in information theory and computing science. Different numbers of intermediate nodes in wireless broadcast trees may exert great impacts on the energy consumption of individual nodes, which are typically equipped with a limited power supply in a wireless sensor network; this limitation may eventually determine how long the given wireless sensor network can last. Thus, obtaining a deep understanding of the mathematical nature of wireless broadcast trees is of great importance. In this paper, we give new proof of Cayley＇s well-known theorem for counting labeled trees. A distinct feature of this proof is that we purely use combinatorial structures instead of constructing a bijection between two kinds of labeled trees, which is in contrast to all existing proofs. Another contribution of this work is the presentation of a new theorem on trees based on the number of intermediate nodes in the tree. To the best of our knowledge,this work is the first to present a tree enumeration theorem based on the number of intermediate nodes in the tree.
文摘传统的网络使用基于最短路径的单一路径路由,无法有效地利用网络的全部带宽。软件定义网络(Software Defined Networking,SDN)采用中心化的控制平面能方便地实现对路由的精确控制。针对SDN网络下的多路径路由问题,提出了基于多路广播树的路由存储结构及相应的多路径选择算法。该算法根据各路径的可用带宽和时延进行概率分配,优先选择可用带宽大和时延小的路径。实验结果表明,该算法能快速地进行路由,并有效地减小传输时延和增大吞吐率。
