检索结果-南通市图书馆

Exact Algorithm to Solve the Minimum Cost Multi-Constrained multicast routing Problem

Journal of Computer and Communications 2016年第14期4卷 57-79页

作者： Miklos Molnar IUT Department of Computer Science University of Montpellier LIRMM Montpellier France

The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.

关键词： multicast routing Quality of Service Multi-Constrained Steiner Problem Hierarchy Partial Minimum Spanning Hierarchy Branch and Bound

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Distributed multicast routing algorithm with dynamic performance in multimedia networks

引用

Engineering Sciences 2009年第3期7卷 28-34页

作者： Zhu Baoping Zhang Kun School of Computer Science and technology Nanjing University of Science ＆ Technology Nanjing 210094 China

The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.

关键词： multicast routing distributed algorithm dynamic performance delay and delay variation-bounded multimedia networks

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

QOS-BASED multicast routing OPTIMIZATION ALGORITHMS FOR INTERNET

引用

Journal of Electronics(China) 2006年第2期23卷 249-254页

作者： Sun Baolin Li Layuan School of Computer Science and Technology Wuhan Univ. ofTech. Wuhan 430063 China Dept of Mathematics and Physics Wuhan Univ. of Sci. and Eng. Wuhan 430073 China

Most of the multimedia applications require strict Quality-of-Service (QoS) guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS multicast routing algorithms based on Genetic Algorithm (QMRGA). Simulation results demonstrate that the algorithm is capable of discovering a set of QoS-based near optimized, non-dominated multicast routes within a few iterations, even for the networks environment with uncertain parameters.

关键词： Quality-of-Service (QoS) multicast routing Intemet Genetic algorithm Uncertain parameters

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Solving the Problem of the Link Optimizing and Delayconstrained multicast routing Based on GA

Solving the Problem of the Link Optimizing and Delayconstrai...

引用

第25届中国控制会议

作者： Yue Chengjun,Jing Yuanwei College of Information Science and Engineering, Northeastern University, shenyang 110004 College of Information and Science,Liaoning University,shenyang,110036

＜正＞In this paper, we investigate the problem of multicast routing in IP network with the link cost and delay-constrained. For the limitation of OSPF（Open Short Path First） net protocol, the unbalance use of link often results in the congestion in the larger scale network. Our contribution is that we consider the multicast routing problem taking into consideration the congestion due to the unbalance use of link, and we present a improved genetic algorithm to solving the problem of the multicast routing. The genetic algorithm begins from a least-delay tree, then iteratively replaces expensive tree links with cheaper links during the crossover, and gets final multicast tree satisfied delay constraint. Through extensive simulation experiments,we result show that the proposed genetic algorithm can perform better in terms of delay an running time, and construct optimal delay-constrained multicast tree efficiently.

关键词： multicast routing delay constraint link optimizing

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A free search algorithm with double populations for QoS multicast routing

A free search algorithm with double populations for QoS mult...

引用

2011年中国智能自动化学术会议

作者：孔笋陈增强 Department of Automation Nankai University

In this paper,we introduce a modified free search(FS) algorithm to solve QoS multicast routing *** on basic FS,the algorithm introduces an auxiliary population to retain the suboptimal solutions searched in order to keep the algorithm from falling into local *** addition,the algorithm is improved by variable neighbor space and preserving excellent members. Considering the operation mode of FS algorithm,we adopt path-based method to construct multicast trees and transform tree optimization problem into function optimization *** performance and efficiency of the proposed algorithm are evaluated in comparison with other common *** results of the experiments show that the new algorithm has the better comprehensive performance.

关键词： QoS multicast routing free search algorithm double populations

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Hybrid Scatter Search Algorithm for QoS multicast routing Problem

A Hybrid Scatter Search Algorithm for QoS Multicast Routing ...

引用

第30届中国控制与决策会议

作者： Shi chunxin Zhang xiaoxia Chen hongyang Yang jiao Wangpeng Weiyu College of Software Engineering University of Science and Technology Liaoning

Quality of service（QoS） multicast routing is non-linear combinatorial optimization problem. It tries to search a multicast routing tree with minimal cost that can meet constraints such as bandwidth, delay, and delay jitter. This paper presents a hybrid scatter search algorithm（ACO＆SS） to solve QoS multicast routing problem. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ACO with scatter search（SS）. Moreover, the hybrid algorithm considers both solution diversification and solution quality. The method has both the advantages of ant colony optimization, the ability to find the higher performance solutions, and that of scatter search, the ability to explore different parts of the solution space and to find better solutions. Finally, the simulation results show that the ACO＆SS algorithm performs well in terms of solution quality.

关键词： multicast routing Scatter search Quality of service

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

HMR—New Framework for Hierarchical multicast routing Algorithm and Protocol

HMR—New Framework for Hierarchical Multicast Routing Algori...

引用

1998 International Conference on Communication Technology

作者： Meilin Shi XiangYong Shangguang Wu Department of Computer Science and Technology Tsinghua University

＜正＞Group Communication provides communication support for CSCW（Computer Supported Cooperative Work） *** routing is one of the key techniques in the subject of group *** paper proposed a new framework for multicast routing algorithm and protocol,hierarchical multicast routing（HMR）. The whole computer network is divided into hierarchical areas to compact the network topology and group membership information in order to provide *** the compacting of network topology information,a very nice result may be achieved for the calculation of shortest-path multicast delivery tree.

关键词： multicast routing group communication CSCW computer network

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A multicast routing Protocol with Controllable QoS Constraints in Clustering Ad Hoc Networks

A Multicast Routing Protocol with Controllable QoS Constrain...

引用

2009中国控制与决策会议

作者： Yuan Ping~1,Zhang Haidong~2,Wang Yuchen~2 1.School of Urban Railway Transportation,Shanghai University of Engineering Science,Shanghai 201620,China 2.College of Information Science and Engineering,Northeastern University,Shenyang 110004,China

＜正＞To satisfy the user requirements for continuous and real-time multimedia information,the concept of Quality of Service（QoS） has emerged as a main issue in mobile ad-hoc *** routing is to find a route according to the QoS requirements of the users. The provision of QoS guarantees is of utmost importance for the development of the multicast *** this paper,we propose an efficient multicast routing protocol（MQCAP） based on clustering with QoS constraints,such as delay,bandwidth and delay *** constraints are controllable to different nodes,while a node joins to the multicast *** the proposed MQCAP scheme,each intra cluster node only maintains its cluster’s routing information,and each bridge node maintains not only its cluster information but also the summary information of other *** performance measures of MQCAP are evaluated using *** order to evaluate and validate the performance of MQCAP better,we simulate MQCAP and other related routing protocols using *** studies show that MQCAP can maximize the lifetime of QoS multicast routing for mobile ad hoc networks.

关键词： QoS multicast routing clustering

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

QoS ConstraintsBased multicast routing Algorithm Using CACO

QoS ConstraintsBased Multicast Routing Algorithm Using CACO

引用

2012年计算机应用与系统建模国际会议

作者： Yang Hao Xian Zhengzheng Yang Lei College of Computer Science and Engineering University of Electronic Science and Technology of China College of Computer Science and Technology Guang Dong University of Finance

QoS (Quality of Service) constraintsased multicast routing is one of major issues in distributed multimedia on the network. An improved algorithm based CACO (Chaos Ant Colony Optimization) is proposed in this paper for solving some routing problems such as the convergence speed, packet loss rate and bandwidth, etc. The algorithm utilizes the pheromone positive feedback effect to guide chaos search. The advantage of this scheme is that chaos initialization is adopted to improve individual quality and chaos perturbation is utilized to avoid the search being trapped in local optimum, meanwhile improve the packet delivery ratio and reduce the end-to-end delay. The experimental results show that the efficiency of the algorithm.

关键词： QoS QoS constraints multicast routing ACO CACO MANET

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Performance Comparison of Genetic Algorithm and Particle Swarm Optimization on QoS multicast routing Problem

Performance Comparison of Genetic Algorithm and Particle Swa...

引用

2006年国际电子、工程及科学领域的分布式计算和应用学术研讨会

作者： Jie Qin,Jing Liu,Wenbo Xu School of Information Technology,Southern Yangtze University No.1800,Lihudadao Road,Wuxi 214122,Jiangsu,China

QoS multicast routing in networks is a very important research issues in the areas of networks and distributed *** is also a challenging and hard problem for the next generation Internet a high-performance networks. Because of its NP-completeness,many heuristics such as Genetic Algorithms are employed solve the *** paper proposes an Improved PSO(IPSO) and present how to solve QoS multicast routing problem by *** proposed algorithm converts the QoS multicast routing problem into an integer-programming *** test IPSO-base routing algorithm on a network *** performance comparison,we also test Particle Swarm Optimization(PSO) algorithm and *** experiment results show the availability and efficiency of IPSO on the problem and its superiority to PSO and GA.

关键词： multicast routing QoS routing optimization Particle swarm optimization algorithms PSO

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：