期刊文献+
共找到461篇文章
< 1 2 24 >
每页显示 20 50 100
Generation of Low-Delay and High-Stability Multicast Tree
1
作者 Deshun Li Zhenchen Wang +5 位作者 Yucong Wei Jiangyuan Yao Yuyin Tan Qiuling Yang Zhengxia Wang Xingcan Cao 《Computers, Materials & Continua》 SCIE EI 2023年第7期561-572,共12页
Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bili... Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bility simultaneously.Given a general network,the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem,without a precise and efficient algorithm.To address these challenges,this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability,degree-constrained,edge-weighted for multicast(T-SDE).A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay(RFD)and probability of stability of terminal to obtain a high performance in multicast.The proposed algorithms greedily select terminals with a large RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree,where the larger RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast.The proposed RFD can be compatible with the original model,which can take advantage of network connectivity during the generation of a multicast tree.This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm.Experimental results show that the proposed algorithm can provide a smaller height,higher stability,and a lower transmission delay of the resulting multicast tree than other solutions.The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission. 展开更多
关键词 Overlay network multicast tree transmission delay probability of stability greedy algorithm
下载PDF
MTS-05 PDM多频代播机核心技术及应用
2
作者 方少青 《电视技术》 2024年第7期144-146,150,共4页
深入探讨MTS-05 PDM 5 kW多频代播机的研发背景、核心技术、应用价值及其对广播技术领域的影响。在中波广播技术面临频率固定性和调频机制局限的挑战背景下,MTS-05 PDM 5 kW多频代播机作为技术创新的产物,通过集成复杂可编程逻辑器件(Co... 深入探讨MTS-05 PDM 5 kW多频代播机的研发背景、核心技术、应用价值及其对广播技术领域的影响。在中波广播技术面临频率固定性和调频机制局限的挑战背景下,MTS-05 PDM 5 kW多频代播机作为技术创新的产物,通过集成复杂可编程逻辑器件(Complex Programmable Logic Device,CPLD)逻辑频率选通技术、直接数字合成(Direct Digital Synthesizer,DDS)高频激励机制和智能多频网络切换技术,实现了多频次高效、安全播出。设备不仅克服了传统发射机的调频烦琐和空间限制问题,还提升了播出质量和安全播出效率,展示了智能化运维与资源优化的典范。 展开更多
关键词 mtS-05 PDM 5 kW多频代播机 高频激励机制 多频网络切换 智能监控管理
下载PDF
Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network
3
作者 刘滨 石峰 +2 位作者 高玉金 计卫星 宋红 《Journal of Southeast University(English Edition)》 EI CAS 2008年第1期33-37,共5页
To solve the load balancing problem in a triplet-based hierarchical interconnection network(THIN) system, a dynamic load balancing (DLB)algorithm--THINDLBA, which adopts multicast tree (MT)technology to improve ... To solve the load balancing problem in a triplet-based hierarchical interconnection network(THIN) system, a dynamic load balancing (DLB)algorithm--THINDLBA, which adopts multicast tree (MT)technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node (HLN)are spread along an MT whose root is the HLN. And the lightly loaded nodes(LLNs) covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others. 展开更多
关键词 triplet-based hierarchical interconnection network dynamic load balancing multicast tree
下载PDF
Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks 被引量:6
4
作者 Cheng Lianzhen Zhang Jun Liu Kai 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2007年第4期353-361,共9页
A new core-based shared tree algorithm, viz core-cluster combination-based shared tree (CCST) algorithm and the weighted version (i.e. w-CCST algorithm) are proposed in order to resolve the channel resources waste... A new core-based shared tree algorithm, viz core-cluster combination-based shared tree (CCST) algorithm and the weighted version (i.e. w-CCST algorithm) are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit (LEO) satellite IP networks. The CCST algorithm includes the dynamic approximate center (DAC) core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm. 展开更多
关键词 satellite IP networks LEO multicast routing shared tree CORE
下载PDF
Cost of Multicast Logical Key Tree Based on Hierarchical Data Processing 被引量:2
5
作者 ZHOU Fucai XU Jian LI Ting 《Wuhan University Journal of Natural Sciences》 CAS 2006年第5期1172-1176,共5页
How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical k... How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical key tree and supply two important metrics to this problem: re-keying cost and key storage cost. The paper gives the basic theory to the hierarchical data processing and the analyzing model to multieast key management based on logical key tree. It has been proved that the 4-ray tree has the best performance in using these metrics. The key management problem is also investigated based on user probability model, and gives two evaluating parameters to re-keying and key storage cost. 展开更多
关键词 multicast logical key tree hierarchical data processing
下载PDF
Dynamic Load Balancing Based on Restricted Multicast Tree in Homogeneous Multiprocessor Systems 被引量:1
6
作者 刘滨 石峰 高玉金 《Journal of Beijing Institute of Technology》 EI CAS 2008年第2期184-188,共5页
To decrease the cost of exchanging load information among processors, a dynamic load-balancing (DLB) algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also propos... To decrease the cost of exchanging load information among processors, a dynamic load-balancing (DLB) algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks. 展开更多
关键词 dynamic load balancing (DLB) multicast tree RULE MESSAGE MULTIPROCESSOR
下载PDF
Constructing Multicast Routing Tree for Inter-cloud Data Transmission:An Approximation Algorithmic Perspective
7
作者 Jun Huang Shihao Li Qiang Duan 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2018年第2期514-522,共9页
Networking plays a crucial role in cloud computing especially in an inter-cloud environment, where data communications among data centers located at different geographical sites form the foundation of inter-cloud fede... Networking plays a crucial role in cloud computing especially in an inter-cloud environment, where data communications among data centers located at different geographical sites form the foundation of inter-cloud federation. Data transmissions required for inter-cloud federation in the complex inter-cloud networking system are often point-to-multi points, which calls for a more effective and efficient multicast routing algorithm in complex networking systems. In this paper, we investigate the multicast routing problem in the inter-cloud context with K constraints where K ≥ 2. Unlike most of existing algorithms that are too complex to be applied in practical scenarios, a novel and fast algorithm for establishing multicast routing tree for interclouds is proposed. The proposed algorithm leverages an entropybased process to aggregate all weights into a comprehensive metric, and then uses it to search a multicast tree(MT) on the basis of the shortest path tree(SPT). We conduct complexity analysis and extensive simulations for the proposed algorithm from the approximation perspective. Both analytical and experimental results demonstrate that the algorithm is more efficient than a representative multi-constrained multicast routing algorithm in terms of both speed and accuracy, and thus we believe that the proposed algorithm is applicable to the inter-cloud environment. 展开更多
关键词 Index Terms--Entropy inter-clouds multicast tree mt rout-ing algorithm shortest path tree (SPT).
下载PDF
ON MULTICAST TREE CONSTRUCTION IN IPV4-IPV6 HYBRID NETWORK
8
作者 Zhang Chao Zhang Yuan Huang Yongfeng Li Xing 《Journal of Electronics(China)》 2010年第3期398-404,共7页
With the IPv4 addresses exhausting and IPv6 emerging, the Peer-to-Peer (P2P) overlay is becoming increasingly heterogeneous and complex: pure IPv4, dual stack and pure IPv6 hosts coexist, and the connectivity limitati... With the IPv4 addresses exhausting and IPv6 emerging, the Peer-to-Peer (P2P) overlay is becoming increasingly heterogeneous and complex: pure IPv4, dual stack and pure IPv6 hosts coexist, and the connectivity limitation between IPv4 and IPv6 hosts requires the overlay protocols to be fit for this hybrid situation. This paper sets out to answer the question of how to construct multicast tree on top of IPv4-IPv6 hybrid network. Our solution is a New Greedy Algorithm (NGA) which eliminates the problem of joining failure in the hybrid network and keeps the efficiency of greedy algorithm in tree construction. Simulation results show that our algorithm has excellent performance, which is very close to the optimal in many cases. 展开更多
关键词 IPV6 Peer-to-Peer (P2P) multicast tree
下载PDF
Secure Multicast Tree Construction Using Bacterial Foraging Optimization (BFO) for MANET
9
作者 Arthi Arumugam Chinnappan Jayakumar 《Circuits and Systems》 2016年第13期4154-4168,共15页
In Mobile Ad-Hoc Networks (MANET), the group communication for multiple senders and receivers threatens the security features. The multicasting is provoked to various security attacks, eavesdropping etc., hence secure... In Mobile Ad-Hoc Networks (MANET), the group communication for multiple senders and receivers threatens the security features. The multicasting is provoked to various security attacks, eavesdropping etc., hence secure multicasting requires imperative significance. The secure multicast tree construction using Bacterial Foraging Optimization (BPO) algorithm is proposed to develop a secure multicast tree construction in MANET. During routing, the proposed algorithm utilizes the public routing proxy to hide identity of the sender and receiver from other nodes for maintaining confidentiality. The public routing proxy is estimated using bacterial foraging optimization algorithm and path reliability is evaluated after the each iteration. Path reliability enhances the security of the network from black hole attacker and DoS attackers compared to traditional approaches for secure multicast tree formation in MANETs. By simulation results, we have shown that the proposed technique offers authentication and confidentiality during secure multicasting which is compared to conventional multicast tree formation algorithms in MANETs. 展开更多
关键词 Bacterial Foraging Public Routing multicast tree E. coli Cell Black Hole DOS
下载PDF
Shared-Tree Selection Method for Aggregated Multicast
10
作者 Yusuke Sekine Taiju Mikoshi and Toyofumi Takenaka 《通讯和计算机(中英文版)》 2013年第4期578-584,共7页
关键词 共享树 组播树 聚合 多播通信 最小尺寸 嫁接方法 仿真实验 STA
下载PDF
Challenges and Opportunities of On-farm Tree Planting as an Alternative Wood Source on Mt. Marsabit, Northern Kenya: Towards Mitigating Climate Change
11
作者 I. H. M. Warui A. A. Aboud +1 位作者 P. Chegge-Mungai J. W. Wamuongo 《Journal of Agricultural Science and Technology》 2011年第4期486-494,共9页
Constraints and probable pathway towards increasing tree density and diversity within farmlands as a means of reducing human dependency on Mt. Marsabit forest for wood are addressed. The forest provides a carbon sink ... Constraints and probable pathway towards increasing tree density and diversity within farmlands as a means of reducing human dependency on Mt. Marsabit forest for wood are addressed. The forest provides a carbon sink to counteract the risks and hazards associated with climate change. A structured questionnaire was administered to a sample of 205 respondents that were selected from a population of 3075 farming households using a systematic random sampling procedure. While majority of the farms (53%) had low tree density (1-10 trees), only 8% of the farms had high density (≥ 20 trees). About 50% and 15% farms had Grevelia robusta and Eucalyptus cammudelensis, which were grown for timber production, respectively. Broad leafed trees, like Croton megalocarpus and Moringa stenoptella had been established in 17% of the farmlands, respectively. With only 20% of the households having a fence around the crop fields, coupled by widely inter-household sharing of crop residues for grazing, tree browsing by livestock was a constraint to tree establishment. The challenges present an opportunity to establish governance structures and processes for communal responsibility and management of tree resources in the farms. A plausible approach entails the Adaptive Collaborative Management (ACM) as a process that facilitates to experiential learning and negotiation for probable actions and policies in management of natural resources. 展开更多
关键词 mt. Marsabit forest density and diversity of on-farm trees climate change tree establishment constraints adaptivecollaborative management.
下载PDF
WDM全光网络中Multicast的寻径与波长分配算法 被引量:4
12
作者 黄传河 陈莘萌 贾小华 《计算机工程与应用》 CSCD 北大核心 2002年第15期153-156,163,共5页
在WDM全光网络中实现实时Multicast功能是计算机网络的应用要求,也是现代计算机网络的重要特征。该文提出了一种在WDM全光网络中实现实时Multicast的算法。该算法以辅助的波长图为基础,将寻径与波长分配统一进行,构造满足延迟约束的、... 在WDM全光网络中实现实时Multicast功能是计算机网络的应用要求,也是现代计算机网络的重要特征。该文提出了一种在WDM全光网络中实现实时Multicast的算法。该算法以辅助的波长图为基础,将寻径与波长分配统一进行,构造满足延迟约束的、具有较低成本的Multicast树,实现Multicast功能。 展开更多
关键词 WDM 全光网络 multicast 寻径 波长分配算法 STEINER树 计算机网络 波长寻径网络
下载PDF
DVBMT问题的一种改进算法 被引量:3
13
作者 杨春德 杨孝田 《计算机应用研究》 CSCD 北大核心 2009年第3期1059-1062,共4页
研究多播端到端时延受限条件下的最优时延抖动问题,目前已经出现了许多启发式算法,如DVMA(delayvariation multicastalgorithm)、DDVCA(delayand delayvariation constraintalgorithm)。DDVCA的时延抖动小于DVMA。Cheng等人也提出了一... 研究多播端到端时延受限条件下的最优时延抖动问题,目前已经出现了许多启发式算法,如DVMA(delayvariation multicastalgorithm)、DDVCA(delayand delayvariation constraintalgorithm)。DDVCA的时延抖动小于DVMA。Cheng等人也提出了一种算法,它的时延抖动小于DDVCA。在此基础上提出了一种有效的多播路由算法。仿真结果表明,该算法的平均时延抖动小于Cheng等人的平均时延抖动。 展开更多
关键词 时延 时延抖动 多播树 时延和时延有界的多播树 弗洛伊德算法
下载PDF
基于延迟和抖动感知的多播服务功能树嵌入算法
14
作者 刘亮 陈翔 +4 位作者 桂晓菁 徐勇军 杜娅荣 侯泽天 段洁 《电子与信息学报》 EI CAS CSCD 北大核心 2024年第1期184-194,共11页
针对软件定义网络/网络功能虚拟化(SDN/NFV)架构中,多播请求流(MRs)需满足严格时延和抖动约束下遍历由多个虚拟网络功能(VNFs)依序组成的服务功能树(SFT)问题。该文提出一种基于最优链路选择函数进行深度优先搜索构建SFT的路由算法。首... 针对软件定义网络/网络功能虚拟化(SDN/NFV)架构中,多播请求流(MRs)需满足严格时延和抖动约束下遍历由多个虚拟网络功能(VNFs)依序组成的服务功能树(SFT)问题。该文提出一种基于最优链路选择函数进行深度优先搜索构建SFT的路由算法。首先,提出网络资源相对成本函数,以保证网络负载自动均衡。其次,联合考虑网络资源、VNF动态放置及多播流延迟和抖动约束,构建SFT动态嵌入问题的整数线性规划模型(ILP)。最后,针对该NP难问题,设计辅助边权图和最优链路选择函数进行路由路径选择,并以最小化资源消耗成本为目标提出具有延迟和抖动感知的SFT嵌入算法(SFT-EA)。仿真结果表明,SFT-EA在吞吐量,流接受率和网络负载均衡方面具有更好的性能。 展开更多
关键词 网络功能虚拟化 服务功能树 多播 延迟和抖动
下载PDF
分层自治的Multicast地址管理和连接控制 被引量:1
15
作者 王箭 张福炎 《软件学报》 EI CSCD 北大核心 1999年第8期891-896,共6页
Multicast动态地址管理和连接控制是多点会话中的重要问题.基于分层自治结构,文章提出了Multicast地址分配管理机制、主从结构连接管理体系和一种简单的多点连接建立算法,简述了它们的工作过程,并通过模拟实验比较了3种地址分配方... Multicast动态地址管理和连接控制是多点会话中的重要问题.基于分层自治结构,文章提出了Multicast地址分配管理机制、主从结构连接管理体系和一种简单的多点连接建立算法,简述了它们的工作过程,并通过模拟实验比较了3种地址分配方式,即集中管理方式、分布方式(由Eleftheri-adis提出)与分层自治方式.分层自治结构与Internet自组织拓扑结构一致,分层自治地址分配机制结合了集中方式和分布方式的优点,具有较高的整体效率,主从结构连接管理体系也具有较高的控制效率,它们都具有较高的鲁棒性、柔韧性和伸缩性. 展开更多
关键词 地址管理 分层自治 multicast地址 INTERNET网
下载PDF
DVBMT问题的改进算法
16
作者 杨春德 邓超 《计算机工程与应用》 CSCD 北大核心 2011年第3期84-86,145,共4页
对E-DVMA所研究的多播端到端时延受限条件下的最优时延抖动问题进行了改进。在不增大时延抖动的基础上,有效地降低了平均时延。仿真结果表明,该算法的平均时延小于E-DVMA的平均时延。
关键词 弗洛伊德算法 平均时延 多播树 时延和时延有界的多播树
下载PDF
软件定义Fat-Tree数据中心网络的多组播树动态切换机制 被引量:3
17
作者 孙龙 冉泳屹 +2 位作者 杨博文 岳阳 杨坚 《小型微型计算机系统》 CSCD 北大核心 2017年第4期761-765,共5页
数据中心网络中单组播树传输往往难以应付网络拥塞和故障,从而导致可靠性和网络资源利用率较低.多组播树动态切换机制虽然能够灵活地对数据传输进行均衡和故障恢复,但在传统网络中难以部署和实现.软件定义网络将控制面和数据面分离,具... 数据中心网络中单组播树传输往往难以应付网络拥塞和故障,从而导致可靠性和网络资源利用率较低.多组播树动态切换机制虽然能够灵活地对数据传输进行均衡和故障恢复,但在传统网络中难以部署和实现.软件定义网络将控制面和数据面分离,具有良好的可控性和可编程性.在支持Open Flow的Fat-Tree数据中心网络中,提出一种基于自适应滤波预测的多组播树动态分级切换算法.该算法首先为每个组播会话建立多个备选组播树,并根据收集的网络链路状态为每个组播树计算优先级值;然后采用自适应滤波算法对优先级值进行预测,并利用预测的优先级值设计组播树的动态分级切换策略和数据分发比例.最后,通过在Mininet平台进行了仿真实验,验证了本文所提算法的可行性和性能. 展开更多
关键词 多树组播 Fat-tree数据中心网络 软件定义网络 分级多树切换 自适应滤波
下载PDF
Fuzzy mathematics and game theory based D2D multicast network construction 被引量:6
18
作者 LI Zhuoming CHEN Xing +3 位作者 ZHANG Yu WANG Peng QIANG Wei LIU Ningqing 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2019年第1期13-21,共9页
Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networ... Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB. 展开更多
关键词 DEVICE to DEVICE (D2D) communication multicast network fuzzy LOGIC GAME theory tree architecture
下载PDF
Ant Colony Optimization for Multi-Objective Multicast Routing 被引量:2
19
作者 Ahmed Y.Hamed Monagi H.Alkinani M.R.Hassan 《Computers, Materials & Continua》 SCIE EI 2020年第6期1159-1173,共15页
In the distributed networks,many applications send information from a source node to multiple destination nodes.To support these applications requirements,the paper presents a multi-objective algorithm based on ant co... In the distributed networks,many applications send information from a source node to multiple destination nodes.To support these applications requirements,the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer network.The proposed algorithm simultaneously optimizes total weight(cost,delay and hop)of the multicast tree.Experimental results prove the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem.Also,it is able to find a better solution with fast convergence speed and high reliability. 展开更多
关键词 Multimedia communication multicast routing multicast tree quality of service ant colony
下载PDF
An Improved Multicast Routing Algorithm 被引量:1
20
作者 蒋廷耀 李庆华 《Journal of Shanghai University(English Edition)》 CAS 2004年第3期317-321,共5页
Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated a... Multicasting is a communication service that allows an application to efficiently transmit copies of data packets to a set of destination nodes. The problem of finding a minimum cost multicast tree can be formulated as a minimum Steiner tree problem in networks, which is NP-completeness. MPH (minimum path cost heuristic) algorithm is a famous solution to this problem. In this paper, we present a novel solution TPMPH (two phase minimum path cost heuristic) to improve the MPH by generating the nodes and the edges of multicast tree separately. The cost of multicast tree generated by the proposed algorithm with the same time as MPH is no more than that of MPH in the worst case. Extensive simulation results show that TPMPH can effectively improve the performance on MPH, and performs better in large-scale networks and wireless networks. 展开更多
关键词 multicast routing Steiner tree problem minimum cost.
下载PDF
上一页 1 2 24 下一页 到第
使用帮助 返回顶部