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.
This paper studies the problem of constructing application-layer multicast trees for end-system based voice conferences in which voice mixing and replication are performed at end systems. This problem is formulated as a degree-constrained node-weighted Steiner tree problem with a degree-dependent cost associated with each node, which is a generalization of the degree-constrained node-weighted Steiner...
This paper studies the problem of constructing a minimum-cost multicast tree (or Seiner tree) in which each node is associated with a cost that is dependent on the degree of the node on the multicast tree. The cost of a node may depend on its degree on the multicast tree due to a number of reasons. For example, a node may need to perform various processing for sending messages to each of its neighbors...
This paper considers the problem of constructing minimum-delay multicast trees for message dissemination in overlay networks in which nodal delays for processing messages are taken into account in addition to communication delays. The objective is to find a multicast tree to deliver a message from a source to multiple destinations in minimum delay time. This paper introduces a new delay measure called...
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.