On directed edge-disjoint spanning trees in product networks, an algorithmic approach

Research output: Contribution to journalArticle

Abstract

In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n1+n2) directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole.

Original languageEnglish
Pages (from-to)79-88
Number of pages10
JournalJournal of Engineering Research
Volume11
Issue number2
Publication statusPublished - 2014

Fingerprint

Communication

Keywords

  • Directed edge-disjoint spanning trees
  • Interconnection networks
  • Product networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{373611e883454c278f73f66e6f6c600b,
title = "On directed edge-disjoint spanning trees in product networks, an algorithmic approach",
abstract = "In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n1+n2) directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole.",
keywords = "Directed edge-disjoint spanning trees, Interconnection networks, Product networks",
author = "Touzene, {A. R.} and K. Day",
year = "2014",
language = "English",
volume = "11",
pages = "79--88",
journal = "Journal of Engineering Research",
issn = "1726-6009",
publisher = "Sultan Qaboos University",
number = "2",

}

TY - JOUR

T1 - On directed edge-disjoint spanning trees in product networks, an algorithmic approach

AU - Touzene, A. R.

AU - Day, K.

PY - 2014

Y1 - 2014

N2 - In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n1+n2) directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole.

AB - In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n1+n2) directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole.

KW - Directed edge-disjoint spanning trees

KW - Interconnection networks

KW - Product networks

UR - http://www.scopus.com/inward/record.url?scp=84923116795&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923116795&partnerID=8YFLogxK

M3 - Article

VL - 11

SP - 79

EP - 88

JO - Journal of Engineering Research

JF - Journal of Engineering Research

SN - 1726-6009

IS - 2

ER -