Sciweavers

100 search results - page 1 / 20
» Least Cost Multicast Spanning Tree Algorithm for Local Compu...
Sort
View
ICCNMC
2005
Springer
13 years 10 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
LION
2009
Springer
145views Optimization» more  LION 2009»
13 years 11 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ECR
2002
165views more  ECR 2002»
13 years 4 months ago
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Many new multimedia applications involve dynamic multiple participants, have stringent endto-end delay requirement and consume large amount of network resources. In this paper, we...
Zhengying Wang, Bingxin Shi, Ling Zou
AINA
2007
IEEE
13 years 11 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 3 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu