检索结果-内蒙古大学图书馆

New SRLG-diverse path selection algorithm in survivable GMPLS networks

Journal of Systems engineering and Electronics 2009年第2期20卷 412-419页

作者： Wang Yan Zheng Junhui Zeng Jiazhi Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China Coll. of Computer Science and Technology Southwest Univ. for Nationalities Chengdu 610041 P. R. China

In conventional shared risk link group （SRLG）-diverse path selection （CSPS） algorithm in survivable GMPLS networks, SRLG is taken into account when selecting the backup paths, while the primary path selection method is the sarne as the algorithms without SRLG constraint. A problem of CSPS algorithm is that, after a primary path is selected, the success probability to select an SRLG-diverse backup path for it is low. If SRLG is taken into account when computing the primary path, then the probability to successfully select an SRLG-diverse backup path will be much increased. Based on this idea, an active SRLG-diverse path selection （ASPS） algorithm is proposed. To actively avoid selecting those SRLG links, when computing the primary path, a link that share risk with more links is assigned a larger link cost. To improve the resource utilization ratio, it is permitted that the bandwidth resources are shared among backup paths. What is more, differentiated reliability （DiR） requirements of different customers are considered in ASPS algorithm. The simulation results show that, compared with CSPS algorithm, ASPS algorithm not only increases successful protection probability but also improves resource utilization ratio.

关键词： generaliged multiprotocol label switching shared risk link group path selection survivability

来源：评论

学校读者我要写书评

暂无评论

Integrated dynamic shared protection algorithm for GMPLS networks

引用

Journal of Systems engineering and Electronics 2008年第6期19卷 1264-1271页

作者： Wang Yan Zeng Jiazhi Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China

The path protection approach is widely investigated as a survivability solution for GMPLS networks, which has the advantage of efficient capacity utilization. However, there is a problem of the path protection approach that searching a disjoint backup path for a primary path is often unsuccessful. In order to resolve this problem, an integrated dynamic shared protection （IDSP） algorithm is proposed. The main idea of the proposed algorithm is that the path protection approach is first used to establish a backup path for the primary path; if the establishment is unsuccessful, then the primary path is dynamically divided into segments whose hop count are not fixed but not more than the limitation calculated by the equations introduced. In this proposal, backup bandwidth sharing is allowed to improve the capacity utilization ratio, which makes the link cost function quite different from previous ones. Simulation experiments are presented to demonstrate the efficiency of the proposed method compared with previous methods. Numerical results show that IDSP can not only achieve low protection failure probability but can also gain a better tradeoff between the protection overbuild and the average recovery time.

关键词： generalized multi-protocol label switching protection hop count primary path backup path

来源：评论

学校读者我要写书评

暂无评论

Scheduling algorithm based on critical tasks in heterogeneous environments

引用

Journal of Systems engineering and Electronics 2008年第2期19卷 398-404,F0003页

作者： Lan Zhou Sun Shixin Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China

Heterogeneous computing is one effective method of high performance computing with many advantages. Task scheduling is a critical issue in heterogeneous environments as well as in homogeneous environments. A number of task scheduling algorithms for homogeneous environments have been proposed, whereas, a few for heterogeneous environments can be found in the literature. A novel task scheduling algorithm for heterogeneous environments, called the heterogeneous critical task （HCT） scheduling algorithm is presented. By means of the directed acyclic graph and the gantt graph, the HCT algorithm defines the critical task and the idle time slot. After determining the critical tasks of a given task, the HCT algorithm tentatively duplicates the critical tasks onto the processor that has the given task in the idle time slot, to reduce the start time of the given task. To compare the performance of the HCT algorithm with several recently proposed algorithms, a large set of randomly generated applications and the Gaussian elimination application are randomly generated. The experimental result has shown that the HCT algorithm outperforms the other algorithm.

关键词： list scheduling task duplication task graphs heterogeneous environment parallel processing.

来源：评论

学校读者我要写书评

暂无评论

Dynamic shared segment protection algorithm with differentiated reliability in GMPLS networks

引用

Journal of Systems engineering and Electronics 2009年第1期20卷 178-184页

作者： Wang Yan Zheng Junhu Zeng Jiazhi Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China Coll. of Computer Science and Technology Southwest Univ. for Nationalities Chengdu 610041 P. R. China.

To improve the resource utilization ratio and shorten the recovery time of the shared path protection with differentiated reliability （SPP-DiR） algorithm, an algorithm called dynamic shared segment protection with differentiated reliability （DSSP-DiR） is proposed for survivable GMPLS networks. In the proposed algorithm, a primary path is dynamically divided into several segments according to the differentiated reliability requirements of the customers. In the SPP-DiR algorithm, the whole primary path should be protected, while in the DSSP- DiR algorithm, only partial segments on the primary path need to be protected, which can reduce more backup bandwidths than that in the SPP-DiR algorithm. Simulation results show that the DSSP-DiR algorithm achieves higher resource utilization ratio, lower protection failure probability, and shorter recovery time than the SPP-DiR algorithm.

关键词： generalized multiprotocal label switching segment protection differentiated reliability resource uti-lization ratio.

来源：评论

学校读者我要写书评

暂无评论

Optimal hardware/software co-synthesis for core-based SoC desi gns

引用

Journal of Systems engineering and Electronics 2006年第2期17卷 402-409页

作者： Zhan Jinyu Xiong Guangze Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P.R. China

A hardware/software co-synthesis method is presented for SoC designs consisting of both hardware IP cores and software components on a graph-theoretic formulation. Given a SoC integrated with a set of functions and a set of performance factors, a core for each function is selected from a set of alternative IP cores and software components, and optimal partitions is found in a way to evenly balance the performance factors and to ultimately reduce the overall cost, size, power consumption and runtime of the core-based SoC. The algorithm formulates IP cores and components into the corresponding mathematical models, presents a graph-theoretic model for finding the optimal partitions of SoC design and transforms SoC hardware/software co-synthesis problem into finding optimal paths in a weighted, directed graph. Overcoming the three main deficiencies of the traditional methods, this method can work automatically, evaluate more performance factors at the same time and meet the particularity of SoC designs. At last, the approach is illustrated that is practical and effective through partitioning a practical system.

关键词： SoC co-synthesis partition IP core software component optimal path.

来源：评论

学校读者我要写书评

暂无评论

Novel algorithm for distributed replicas management based on dynamic programming

引用

Journal of Systems engineering and Electronics 2006年第3期17卷 669-672页

作者： Wang Tao Lu Xianliang Hou Mengshu Coll. of Computer Science and Engineering Univ. of Electronics Science and Technology of China Chengdu 610054 P. R. China

Replicas can improve the data reliability in distributed system. However, the traditional algorithms for replica management are based on the assumption that all replicas have the uniform reliability, which is inaccurate in some actual systems. To address such problem, a novel algorithm is proposed based on dynamic programming to manage the number and distribution of replicas in different nodes. By using Markov model, replicas management is organized as a multi-phase process, and the recursion equations are provided. In this algorithm, the heterogeneity of nodes, the expense for maintaining replicas and the engaged space have been considered. Under these restricted conditions, this algorithm realizes high data reliability in a distributed system. The results of case analysis prove the feasibility of the algorithm.

关键词： distributed replicas Markov dynamic programming.

来源：评论

学校读者我要写书评

暂无评论

Improved method for the feature extraction of laser scanner using genetic clustering

引用

Journal of Systems engineering and Electronics 2008年第2期19卷 280-285页

作者： Yu Jinxia Cai Zixing Duan Zhuohua Coll. of Information ScienCe and Engineering Central South Univ. Changsha 410083 P. R. China Coll. of Computer Science and Technology Henan Polytechnic Univ. Jiaozuo 454003 P. R. China Dept. of Computer Science Shaoguan Univ. Shaoguan 512003 P. R. China

Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.

关键词： laser scanner feature extraction weighted fuzzy clustering validation index genetic algorithm.

来源：评论

学校读者我要写书评

暂无评论

Stability analysis of cellular neural networks with time-varying delay

引用

Journal of Systems engineering and Electronics 2009年第2期20卷 266-273页

作者： Wang Xingang1,4, Zhang Dongmei2 & Liu Jun3 1. coll. of Information engineering, Zhejiang Univ. of Technology, Hangzhou 310032, P. R. China 2. coll. of science, Zhejiang Univ. of Technology, Hangzhou 310032, P. R. China 3. coll. of science, Beihua Univ., Jilin 132000, P. R. China 4. School of computer engineering and science, Shanghai Univ., Shanghai 200072, P. R. China Coll. of Information Engineering Zhejiang Univ. of Technology Hangzhou 310032 P. R. China School of Computer Engineering and Science Shanghai Univ. Shanghai 200072 P. R. China Coll. of Science Zhejiang Univ. of Technology Hangzhou 310032 P. R. China Coll. of Science Beihua Univ. Jilin 132000 P. R. China

The global asymptotic stability of cellular neural networks with delays is investigated. Three kinds of time delays have been considered. New delay-dependent stability criteria are proposed and are formulated as the feasibility of some linear matrix inequalities, which can be checked easily by resorting to the recently developed interior-point algorithms. Based on the Finsler Lemma, it is theoretically proved that the proposed stability criteria are less conservative than some existing results.

关键词： cellular neural networks time-varying delay integral inequality

来源：评论

学校读者我要写书评

暂无评论

Medieval engines of siege warfare and modern engineering tools

Medieval engines of siege warfare and modern engineering too...

引用

2003 ASEE Annual Conference and Exposition: Staying in Tune with engineering Education

作者： Goulet, Ron Coll. of Eng. and Computer Science University of Tennessee Chattanooga Department of Mechanical Engineering Coll. of Eng. and Computer Science UT Chattanooga

The coll.ge of engineering and computer science at UT Chattanooga offers second year engineering students a three credit hour lecture course in engineering Dynamics. Seeking to supplement the traditional lecture approach, experiential problem-based learning projects are inserted. EPBL is the outcome of a 'learner centered' classroom process that uses real work problems to motivate students to 'perform' or 'act out' the discovery and application of concepts. By doing so, students develop familiar as well as formal understanding of course content. The EPBL insertions compel students to 'perform' the tasks of analysis, design, prototype construction and proof testing of the gravity powered catapult known as the trebuchet. Individuals complete kinematical and kinetic analysis of planar rigid body motion requiring applications of modern engineering tools including Maple®, Excel® and Visual Basic for Applications®. Team activities include building and proof testing prototypes. The paper describes the development and delivery of the EPBL insertion, results and feedback and instructors' reflections and recommendations for future improvement. Access to this course BlackBoard® website is also provided.

关键词： engineering education

来源：评论

学校读者我要写书评

暂无评论

RKP based secure tracking in wireless sensor networks

引用

Journal of Systems engineering and Electronics 2008年第1期19卷 175-183页

作者： Wang Jiahao Qin Zhiguang Geng Ji Wang Shengkun Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology Chengdu 610054 P.R. China Library Taiyuan Univ. of Technology Taiyuan 030024 P.R. China

To enhancing the wireless sensor network＇s security in target tracking and locating application, this article proposes a tracking cluster based mobile cluster distributed group rekeying protocol （MCDGR）. Based on the given sensitivity, sensors can locate the moving object in the monitored area and form a tracking cluster around it. This tracking cluster can follow the target logically, process data on the target and report to the sink node, and thus achieve the tracking function. We introduce a multi-path reinforcement scheme, q-composition scheme and one-way cryptographic hash function based random key predistribution algorithm （RKP）, which can guarantee a high accuracy and security and a low energy consumption on the same time in large-scale sensor networks.

关键词： sensor network MCDGR RKP sink tracking cluster

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：