A SOLUTION TO THE THREE DISJOINT PATH PROBLEM ON HONEYCOMB TORI

Author:

YANG XIAOFAN1,MENGSON GRAHAM M.2,ZHANG SHAOMIN3,LIU XIAOPING4

Affiliation:

1. Department of Computer Science, Chongqing University, Chongqing, 430044, China

2. Department of Computer Science, University of Reading, P O Box 225, Whiteknights, Reading, Berkshire, RG6 6AY, UK

3. Department of Computer Science, Shenyang Institute of Technology, Shenyang, China

4. Institute of Multimedia Network and Telecommunication Engineering, Wuhan Technological University of Surveying and Mapping, Wuhan, 430079, China

Abstract

In a previous paper we solved an open problem named as the three disjoint path problem on honeycomb meshes. In this paper we extend the technique used to solve the related problem on honeycomb tori. The result gives the minimum possible length of the longest of any three disjoint paths between two given nodes in a torus. The problem has practical benefits in the fault tolerant aspects of interconnection topologies.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori;Computers & Electrical Engineering;2009-11

2. An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks;Computer Communications;2009-03

3. Embedding even-length cycles in a hexagonal honeycomb mesh;International Journal of Computer Mathematics;2008-02

4. Embedding torus in hexagonal honeycomb torus;IET Computers & Digital Techniques;2008

5. Optimal doublecast path in hexagonal honeycomb mesh;Applied Mathematics and Computation;2006-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3