The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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 location. With the development of Internet, multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order...
Overlay multicast has become an increasingly popular alternative to IP-supported multicast, because of its flexibility and adaptivity. It requires a routing spanning tree on overlay network, using which messages transfer from the source to the destinations. In many multimedia applications, the spanning tree should provide low-delay paths for each member, and consume less network resources at the same...
In this paper, by introducing the knowledge of the fuzzy mathematics, probability theory and gaming theory, a QoS (quality of service) multicast routing scheme with ABC (always best connected) supported is proposed. It uses the interval to describe the user QoS requirement and the edge (link) parameter, introducing the user satisfaction degree, edge evaluation and solution quality comparison. With...
We propose new strategies in core selection methods and core-based tree (CBT) construction based on new methods of computing delay variation. As a result, we propose an algorithm, which guarantees that the delay from the source to any destination does not exceed a real-time constraint. Furthermore, we address the problem of satisfying the delay variation constraint under cost minimization. We present...
Multicast communication is an efficient method of data transmission and distribution among a group, especially when network resources are inadequate and needs to be shared. Fair share of network resources, such as, bandwidth, is desirable in such cases. Although there has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group, construction...
Application-level multicast suffers some disadvantages in terms of high multicast delay, overloading at rendezvous point (RP) and single-point of failure. In this paper, we propose DINCast to optimize application-level shared-tree multicast. The general idea of DINCast is to form a special logical data loop and use this loop instead of the RP as multicast sources. To demonstrate its effectiveness,...
In this paper, a QoS multicast routing scheme with ABC (always best connected) supported is proposed based on the ant algorithm. To deal with the inaccurate network status and the imprecise user QoS requirement, it uses the range to describe them, introduces the edge bandwidth pricing, the edge evaluation and the tree evaluation, and tries to find a QoS multicast tree with the Pareto optimum under...
In this paper, the hybrid bootstrap mechanism for multicast routing in PIM-SM is presented and its performance is evaluated. Since the hybrid bootstrap mechanism consists of distributed and centralized processes, it is called hybrid one. The key for the hybrid method is that the role of a rendezvous point (for short, RP) selection is played in a bootstrap router (BSR), not that a designated router...
For the search of the optimal path and the establishment of the multicast tree which meets QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the paper. In the searching process, two group ants carry out searching separately and alternate information after one search to avoid stagnation. And the optimal one is selected from the two paths combining multi-constrained...
Dynamic Steiner heuristic algorithm with hop constraint such as CMPH attains low cost and high QoS at the same time. Addition of suitable hop constraint does not mean increase of network cost. Estimation on more realistic network is future study.
This paper presents an efficient multicast routing algorithm called DNMA. According to our simulation results, the proposed algorithm outperforms some existing well-known approaches for solving QoS of multicast routing problem in large scale networks.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.