An efficient Manhattan‐distance‐constrained disjoint paths algorithm for incomplete mesh network

Finding link/node‐disjoint paths between a pair of nodes is capable of providing Quality of Service and reliable routing which is very critical for mesh‐connected Network‐on‐Chip. State‐of‐art works usually aim at random topologies and multiple constraints. Therefore, it is difficult to optimize their time complexity. In this paper, MDPPIM (Manhattan‐distance‐constrained Disjoint Path Pair Problem in Incomplete Mesh) problem is presented based on Network‐on‐Chip application scenarios. Then, PCDP (Path‐Counting Disjoint Path) algorithm is proposed to solve the MDPPIM problem with low time complexity. Compared with previous disjoint path algorithms, PCDP algorithm does not have to use Dijkstra's algorithm to find a shortest path. It is optimized according to the feature of incomplete mesh such as the regularity of mesh and Manhattan‐distance constraint. Therefore, it is with low time complexity. Numerical results demonstrate the proposed PCDP algorithm's effectiveness and low time complexity.

[1]  David Tipper,et al.  Efficient heuristics for determining node‐disjoint path pairs visiting specified nodes , 2017, Networks.

[2]  Weifa Liang,et al.  Robust routing in wide-area WDM networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[3]  Luís Gouveia,et al.  On the hop-constrained survivable network design problem with reliable edges , 2015, Comput. Oper. Res..

[4]  Cheng-Kuan Lin,et al.  An efficient algorithm to construct disjoint path covers of DCell networks , 2016, Theor. Comput. Sci..

[5]  Stephen W. Keckler,et al.  Regional congestion awareness for load balance in networks-on-chip , 2008, 2008 IEEE 14th International Symposium on High Performance Computer Architecture.

[6]  Koushik Kar,et al.  Routing restorable bandwidth guaranteed connections using maximum 2-route flows , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Luca Benini,et al.  A multi-path routing strategy with guaranteed in-order packet delivery and fault-tolerance for networks on chip , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[8]  Atakan Dogan,et al.  Improving Real-Time Data Dissemination Performance by Multi Path Data Scheduling in Data Grids , 2015, Comput. Informatics.

[9]  Yue Wu,et al.  QoS‐aware indiscriminate volume storage cloud , 2017, Concurr. Comput. Pract. Exp..

[10]  Ke Xiong,et al.  Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing , 2009 .

[11]  Yuchun Guo,et al.  Link‐disjoint paths for reliable QoS routing , 2003, Int. J. Commun. Syst..

[12]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[13]  Dajin Wang,et al.  A Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh , 2003, IEEE Trans. Computers.

[14]  Lionel M. Ni,et al.  Fault-tolerant wormhole routing in meshes without virtual channels , 1996, IEEE Transactions on Parallel and Distributed Systems.

[15]  T. V. Lakshman,et al.  Restorable dynamic quality of service routing , 2002 .

[16]  Arunabha Sen,et al.  Survivability of lightwave networks - path lengths in WDM protection scheme , 2001, J. High Speed Networks.

[17]  Huawei Li,et al.  ZoneDefense: A Fault-Tolerant Routing for 2-D Meshes Without Virtual Channels , 2014, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[18]  Radu Marculescu,et al.  Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures , 2003, DATE.

[19]  Teresa Gomes,et al.  Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost , 2011, Telecommunication Systems.

[20]  Xiaohua Jia,et al.  One-to-one disjoint path covers on alternating group graphs , 2015, Theor. Comput. Sci..

[21]  Jie Wu,et al.  A New Fault-Information Model for Adaptive & Minimal Routing in 3-D Meshes , 2008, IEEE Transactions on Reliability.

[22]  Ali Ridha Mahjoub,et al.  Two node-disjoint hop-constrained survivable network design and polyhedra , 2016, Networks.

[23]  Axel Jantsch,et al.  Reliability-Aware Runtime Power Management for Many-Core Systems in the Dark Silicon Era , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[24]  S. Selvakumar,et al.  Dynamic Multi Constraint Multi Path QOS Routing Algorithm (DMCMPRA) , 2008 .

[25]  Carl Ramey,et al.  TILE-Gx100 ManyCore processor: Acceleration interfaces and architecture , 2011, 2011 IEEE Hot Chips 23 Symposium (HCS).

[26]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[27]  José Craveirinha,et al.  An Algorithm for Enumerating SRLG Diverse Path Pairs , 2010 .

[28]  Cheng-Kuan Lin,et al.  Vertex-disjoint paths in DCell networks , 2016, J. Parallel Distributed Comput..

[29]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

[30]  Ramesh Bhandari.  Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[31]  Yuan Xue,et al.  RSD Fault Block Model for Highly Efficient Fault-Tolerant Manhattan Routing Algorithms in 2D Mesh , 2016, Comput. J..

[32]  Zhiyi Yu,et al.  Modified Minimal-Connected-Component fault block model to deal with defective links and nodes for 2D-mesh NoCs , 2011, 2011 9th IEEE International Conference on ASIC.

[33]  Salman Z. Shaikh.  Span-disjoint paths for physical diversity in networks , 1995, Proceedings IEEE Symposium on Computers and Communications.

[34]  Pham Quang Dung,et al.  An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint , 2011, SoICT.