Cost and network delay are two important requirements of multicastrouting,and they effect each *** to the cost importance,users were divided into three *** of users haven't clear requirements of the cost and netw...
详细信息
Cost and network delay are two important requirements of multicastrouting,and they effect each *** to the cost importance,users were divided into three *** of users haven't clear requirements of the cost and network delay,so we introduce the belong function of fuzzy logic into multicastrouting *** the membership function,fuzzy multicast routing algorithm transforms cost and network delay into *** is the only parameter when select the multicast *** had shown that costs can be reduced by adjusting the belong function.
Layered video is a video-compression technique to encode video data in multiple layers. It typically consists of a base layer and some additional layers that provide enhanced video quality. The multicasting operation ...
详细信息
Layered video is a video-compression technique to encode video data in multiple layers. It typically consists of a base layer and some additional layers that provide enhanced video quality. The multicasting operation of layered video consists of many receivers dynamically joining and leaving different multicast sessions of different layers depending on their network condition. A layered video multicasting system needs to satisfy: (i) bounded end-to-end delay from the video source to each receiver;(ii) minimum total cost;and (iii) minimum delay jitter between the various video streams received by each receiver. The problem of computing such data distribution paths is NP-complete. This paper presents a new heuristic algorithm, called layered-video multicast super-tree routingalgorithm, with O(Rn-2) time complexity and O(R-2) message complexity, where n is the number of nodes in the network and R is the receiver group size. Our investigation shows that the multicast data paths computed,by our algorithm can always satisfy the delay constraint with reasonably low total cost. (C) 2002 Elsevier Science B.V. All rights reserved.
An efficient delay-constrained multicast routing algorithm computing low cost delay-constrained multicast trees with small algorithm complexity is proposed in this paper. The proposed algorithm can be used to compare ...
详细信息
An efficient delay-constrained multicast routing algorithm computing low cost delay-constrained multicast trees with small algorithm complexity is proposed in this paper. The proposed algorithm can be used to compare cost performances of the existing or future multicast routing algorithms that provide quality of service (QoS) guarantees, especially in multicastrouting simulation environments which simulate relatively large networks and consider realistic network conditions. The proposed algorithm is also useful for routing real-time multicast data in high-speed networks if adequate global information is available to the source.
We present a cost minimized multicast routing algorithm, referred to as the Constrained multicast Tree with Virtual Destination (CMTVD), that can be used for heterogeneous applications in ATM netwroks. In routing mult...
详细信息
ISBN:
(纸本)0819426660
We present a cost minimized multicast routing algorithm, referred to as the Constrained multicast Tree with Virtual Destination (CMTVD), that can be used for heterogeneous applications in ATM netwroks. In routing multipoint information flows over ATM VP/VC networks, the algorithm generates near optimal multicast tree T(s, {M}) based on the delay requirements of services, link costs and path overlapping effects for resource saving and QoS satisfying purposes. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree(MCST) connecting all the destination nodes, virtual destination nodes and the source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. On the other hand for the delay in-sensitive service, the cost optimized multicast route is the MCST connecting all the multicast group with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm uses the virtual destination node concept in order to find the multicast route that maximizes the overlapping effects of the path between multiple destinations, thus minimizes the number of links and switches used in the multicast communications. The cost performance of CMTVD algorithm is evaluated through computer simulation on random graphs.
multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A significant performance improvement can be achieved by sup...
详细信息
multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A significant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose an asynchronous tree-based multicasting (ATBM) technique for multistage interconnection networks (MINs). The deadlock issues in tree-based multicasting in MINs are analyzed first to examine the main causes of deadlocks. An ATBM framework is developed in which deadlocks are prevented by serializing the initiations of tree operations that have a potential to create deadlocks. These tree operations are identified through a grouping algorithm. The ATBM approach is not only simple to implement but also provides good communication performance using minimal overheads in terms of additional hardware requirements and synchronization delay. Using the ATBM framework, algorithms are developed for both unidirectional and bidirectional multistage interconnection networks. The performances of the proposed algorithms are evaluated through simulation experiments. The results indicate that the proposed hardware-based ATBM scheme reduces the communication latency when compared to the software multicasting approach proposed earlier.
暂无评论