期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
IP MULTICAST GROUP MANAGEMENT FOR BROADCAST LANS DISTRIBUTION
1
作者 阿姆贾德 《Journal of Shanghai Jiaotong university(Science)》 EI 2001年第2期153-159,共7页
Problems of the current IGMP mechanism were identified, such as unnecessary periodic probing of hosts and leave latency, which wastes bandwidth and cause more traffic and overhead. Alternative mechanism that preserve ... Problems of the current IGMP mechanism were identified, such as unnecessary periodic probing of hosts and leave latency, which wastes bandwidth and cause more traffic and overhead. Alternative mechanism that preserve the IP multicast model but employ join/leave messages to track local group membership for broadcast LANs (shared medium LANs) was proposed in this paper. We describe the implementation requirements of the new mechanism and compare it to existing one, demonstrating that join/leave approach is uniformly superior for the environment of broadcast LANs. 展开更多
关键词 Internet protocol (IP) multicast algorithms IGMP broadcast LAN join/leave/refresh messages query/report messages leave latency
在线阅读 下载PDF
Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network
2
作者 WU Qi-wu CHEN Hao +1 位作者 JIANG Ling-zhi ZHOU Yang 《Optoelectronics Letters》 EI 2020年第6期455-461,共7页
Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. ... Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges. 展开更多
关键词 SERVICE Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network DOMAIN
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部