Multicast routing in wireless mesh networks minimum cost trees or shortest path trees?.

There exist two fundamental approaches to multicast routing: shortest path trees (SPTs) and minimum cost trees (MCTs). The SPT algorithms minimize the distance (or cost) from the sender to each receiver, whereas the MCT algorithms minimize the overall cost of the multicast tree. Due to the very larg...

詳細記述

書誌詳細

出版年:	IEEE Communications magazine 45, 11 (2007).
第一著者:	Nguyen, Uyen Trang
その他の著者:	Jin Xu
フォーマット:	論文
言語:	English
主題:	Internet. End-to-end delay. Minimum cost trees. Multicast routing. Packet delivery ratio. Perfrormance metrics. Shortest path trees. Simulation-based performance comparison. Traffic impacts. Wireless mesh networks.