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.
Many-to-many multicast can be widely used in computer and communication networks supporting various continuous multi-media applications. This paper assumes each user is both a source and a receiver as well as a terminal in many-to-many multicasting. Under this assumption a many-to-many multicast tree appears as a terminal Steiner tree (TeST). This paper uses a heuristic idea of under a fixed TeST...
To reduce influence of node failure and achieve high reliability in communications, research on node protection algorithm is needed. In this paper, we first provide an overview of current research of redundant tree algorithm (RT). Then we propose a new algorithm called single node protection algorithm (SNP) based on previous redundant tree algorithm, which is used to achieve recovery form single node...
The fulfilment of guaranteed multiple criteria based quality of service (QoS) for multimedia applications servicing multiple subscribers is known to be a NP complete problem. Moreover, finding the multicast graph respecting the defined QoS requirements and minimizing network resources is also a NP-complete optimization task. The well-known greedy algorithm Mamcra, proposed in the literature, computes...
In order to solve the scalability problem of QoS routing in large networks, hierarchical networks and hierarchical routing are proposed. There are tow key issues in hierarchical multicast routing (HMR): one is topology aggregation (TA), and the other is multicast tree state aggregation (MTSA). And the latter is discussed deeply in this paper. The main contributions of this paper include: multicast...
The well-known greedy multicast routing algorithm Mamcra, proposed in the literature, computes the set of shortest paths from a source to all destinations, and then reduces this set to an efficient set of multicast routes, without compromising the requested level of QoS. In this paper, we propose a taboo search algorithm, named TabooQMR, that is augmented by some meta-heuristics to improve the multicast...
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.