### Abstract

A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D ^{2}p ^{2}n ^{2} lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.

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

Title of host publication | Proceedings of the Joint Conference on Information Sciences |

Editors | J.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar |

Pages | 319-323 |

Number of pages | 5 |

Volume | 6 |

State | Published - 2002 |

Event | Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States Duration: Mar 8 2002 → Mar 13 2002 |

### Other

Other | Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 |
---|---|

Country | United States |

City | Research Triange Park, NC |

Period | 3/8/02 → 3/13/02 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Proceedings of the Joint Conference on Information Sciences*(Vol. 6, pp. 319-323)

**A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria.** / Chen, Li; Xue, Guoliang; Lee, Byung S.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Joint Conference on Information Sciences.*vol. 6, pp. 319-323, Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002, Research Triange Park, NC, United States, 3/8/02.

}

TY - GEN

T1 - A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria

AU - Chen, Li

AU - Xue, Guoliang

AU - Lee, Byung S.

PY - 2002

Y1 - 2002

N2 - A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D 2p 2n 2 lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.

AB - A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D 2p 2n 2 lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.

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

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

M3 - Conference contribution

AN - SCOPUS:1642287586

SN - 0970789017

SN - 9780970789013

VL - 6

SP - 319

EP - 323

BT - Proceedings of the Joint Conference on Information Sciences

A2 - Caulfield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Caufield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Honavar, V.

ER -