### Abstract

The objective of this work is to provide message ordering for mesh networks by constructing multicast trees. Two different graph models can be used to guarantee the message ordering properties. In the first one, a single global tree is built for all the nodes in overlapping groups, while in the second one, single trees are built only for overlapping nodes, and on top of these subtrees separate trees are built for each multicast group. Two problems are investigated to build such trees: finding an optimal root that minimizes the time of the multicast, and determining the routing to minimize both time and traffic. An algorithm to find a root node that minimizes the time is presented. An efficient heuristic routing algorithm which builds a shortest-path tree is also presented. It is shown that this algorithm builds a tree whose traffic has an upper bound of twice as much as that of an optimal multicast tree.

Original language | English (US) |
---|---|

Pages (from-to) | 3-13 |

Number of pages | 11 |

Journal | Computer Systems Science and Engineering |

Volume | 11 |

Issue number | 1 |

State | Published - Jan 1996 |

Externally published | Yes |

### Fingerprint

### Keywords

- Mesh networks
- Message ordering
- Multicast trees

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Hardware and Architecture
- Theoretical Computer Science

### Cite this

*Computer Systems Science and Engineering*,

*11*(1), 3-13.

**Multicast trees to provide message ordering in mesh networks.** / Córdova, Javier; Lee, Yann-Hang.

Research output: Contribution to journal › Article

*Computer Systems Science and Engineering*, vol. 11, no. 1, pp. 3-13.

}

TY - JOUR

T1 - Multicast trees to provide message ordering in mesh networks

AU - Córdova, Javier

AU - Lee, Yann-Hang

PY - 1996/1

Y1 - 1996/1

N2 - The objective of this work is to provide message ordering for mesh networks by constructing multicast trees. Two different graph models can be used to guarantee the message ordering properties. In the first one, a single global tree is built for all the nodes in overlapping groups, while in the second one, single trees are built only for overlapping nodes, and on top of these subtrees separate trees are built for each multicast group. Two problems are investigated to build such trees: finding an optimal root that minimizes the time of the multicast, and determining the routing to minimize both time and traffic. An algorithm to find a root node that minimizes the time is presented. An efficient heuristic routing algorithm which builds a shortest-path tree is also presented. It is shown that this algorithm builds a tree whose traffic has an upper bound of twice as much as that of an optimal multicast tree.

AB - The objective of this work is to provide message ordering for mesh networks by constructing multicast trees. Two different graph models can be used to guarantee the message ordering properties. In the first one, a single global tree is built for all the nodes in overlapping groups, while in the second one, single trees are built only for overlapping nodes, and on top of these subtrees separate trees are built for each multicast group. Two problems are investigated to build such trees: finding an optimal root that minimizes the time of the multicast, and determining the routing to minimize both time and traffic. An algorithm to find a root node that minimizes the time is presented. An efficient heuristic routing algorithm which builds a shortest-path tree is also presented. It is shown that this algorithm builds a tree whose traffic has an upper bound of twice as much as that of an optimal multicast tree.

KW - Mesh networks

KW - Message ordering

KW - Multicast trees

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

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

M3 - Article

AN - SCOPUS:0029754354

VL - 11

SP - 3

EP - 13

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 1

ER -