检索结果-南通市图书馆

Multiple constraints-based QoS multicast routing: model and algorithms

Journal of Systems Engineering and Electronics 2005年第1期16卷 187-193页

作者： SunBaolin LiLayuan DepartmentofComputerScienceandTechnology WuhanUniversityofTechnologyWuhan430063P.R.China//DepartmentofMathematicsandPhysicsWuhanUnivereityofScienceandEngineeringWuhan430073P.R.China DepartmentofComputerScienceandTechnology WuhanUniversityofTechnologyWuhan430063P.R.China

Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a np-complete.problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.

关键词： multicast routing algorithm multiple constraints QoS routing np-complete.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

ON THE MINIMUM FEASIBLE GRAPH FOR FOUR SETS

引用

Applied Mathematics(A Journal of Chinese Universities) 1995年第4期10卷 457-462页

作者： XUYINFENG FUXIAOBING SchoolofManagement Xi＇anJiaotongUniversityXi＇an710049 InstituteofAppliedMathenmtics AcademiaSinicaBeijing100080

Given a complete.graph with vertex set X and subsets X_1, X_2,..., X_n, the problem of finding a subgraph G with minimum number of edges such that for every i = 1, 2,..., n G contains a spanning tree on X_i, arises in the design of vaccum systems. In general, this problem is np-complete.and it is proved that for n = 2 and 3 this problem is polynomial-time solvable. In this paper, we prove that for n = 4, the problem is also polynomial-time solvable and give a method to construct the corresponding graph.

关键词： Feasible graph spanning tree heuristic np-complete.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Effective Neural Algorithms for Combinatorial Optimization

引用

Systems Science and Systems Engineering 1993年第4期3卷 326-333页

作者： ZENG Anjun SHA Jichang National University of Defence and Technology, Changsha 410073, China

This paper provides an overview on the current status of the researches in the field of neural algorithms for combinatorial optimization and makes some comments on the recent development. Meanwhile,we point out that such optimization networks suffer from some serious problems. At the end of this paper, we present the readers some aspects which need more researches in the future.

关键词： neural networks combinatorial optimization np-complete.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：