TY - GEN
T1 - A multicast tree reconstruction method for many-to-many mobile communications with delay constraint
AU - Yamada, Tsuyoshi
AU - Yoshimura, Shoji
AU - Kawano, Keita
AU - Kinoshita, Kazuhiko
AU - Murakami, Koso
PY - 2006/12/1
Y1 - 2006/12/1
N2 - Recently, as the performance of mobile hosts rapidly improves and the bandwidth of wireless access networks grows up, the expectation for mobile multimedia communication services including many-to-many communications such as video-conferencing begins building. Mmulticasting is one of the key technologies to provide such services efficiently. The existing multicast protocol called Core Based Trees (CBT) is suitable for many-to-many communications in wired networks. In mobile networks, however, it has problems that the number of links of the multicast tree may increase and the end-to-end delay may not satisfy the QoS requirement from users due to tree reconstruction after handovers. Thus, we propose to change the core in consideration of the delay from the core to member nodes when a handover occurs and a new path is constructed. As a result, the proposed method decreases both the number of members who do not satisfy the delay constraint and the average number of total links of the multicast tree.
AB - Recently, as the performance of mobile hosts rapidly improves and the bandwidth of wireless access networks grows up, the expectation for mobile multimedia communication services including many-to-many communications such as video-conferencing begins building. Mmulticasting is one of the key technologies to provide such services efficiently. The existing multicast protocol called Core Based Trees (CBT) is suitable for many-to-many communications in wired networks. In mobile networks, however, it has problems that the number of links of the multicast tree may increase and the end-to-end delay may not satisfy the QoS requirement from users due to tree reconstruction after handovers. Thus, we propose to change the core in consideration of the delay from the core to member nodes when a handover occurs and a new path is constructed. As a result, the proposed method decreases both the number of members who do not satisfy the delay constraint and the average number of total links of the multicast tree.
UR - http://www.scopus.com/inward/record.url?scp=46149091983&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46149091983&partnerID=8YFLogxK
U2 - 10.1109/LCN.2006.322153
DO - 10.1109/LCN.2006.322153
M3 - Conference contribution
AN - SCOPUS:46149091983
SN - 1424404185
SN - 9781424404186
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 525
EP - 526
BT - Proceedings - The 31st IEEE Conference on Local Computer Networks, LCN 2006
T2 - 31st Annual IEEE Conference on Local Computer Networks, LCN 2006
Y2 - 14 November 2006 through 16 November 2006
ER -