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.
Termination detection in distributed systems has been a popular problem of study. It involves determining whether a computation running on multiple nodes has ceased all its activities. A large number of termination detection algorithms have been proposed with different computational models and methodologies. Here, termination detection is being investigated in the context of link-failure model which...
Because all the nodes are multi-cast, the minimum spanning tree is the best, therefore, it is expected by the niche tree dynamic greed multicast routing algorithms produce more of the performance with a reasonable level. As for the greedy algorithm and the text of the characters tree dynamic greedy algorithm are made detailed emulation, Simulations result indicates that the results of the algorithm...
Many multimedia communication applications require a source to transmit messages to multiple destinations subject to delay and delay-variation constraints. To support delay constrained multicast communications, computer networks have to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. On the other hand, if the same message fails to arrive at each destination...
Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu search...
Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu Search...
Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, and to improve the system support for such applications, we investigate graph algorithms that construct low-latency overlay networks for application-layer multicast. In particular, we focus on reducing the diameter and the pair-wise...
The application level multicast overlay network (ON) is composed by the hosts based on the physics unicast links between them. The initial ON is a completely connectivity network, which make the multicast tree construction and routing is lower efficiency. For improving the ON routing performance, the ON links should be selected. Based on a new presented ON link selection model with reliability and...
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.