کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
448908 | 693611 | 2006 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A multi-constrained multicast QoS routing algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Opposed to the situation that the constrained minimum Steiner tree (CMST) problem has been attracting much attention in quality of service (QoS) routing area, little work has been done on multicast routing subject to multiple additive constraints even though this is required by many emerging applications. In this paper, we propose a heuristic HMCMC to find feasible solutions to this problem. HMCMC has a provably low time complexity, and its basic idea is to construct a multicast tree step-by-step, which is done essentially based on the latest research results on multi-constrained unicast routing. Computer simulations demonstrate that HMCMC can achieve a high success ratio of finding feasible solutions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Communications - Volume 29, Issue 10, 19 June 2006, Pages 1811–1822
Journal: Computer Communications - Volume 29, Issue 10, 19 June 2006, Pages 1811–1822
نویسندگان
Gang Feng,