About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of High Speed Networks
Paper
Tree computation for reserved bandwidth traffic
Abstract
With the deployment of broadband integrated services networks, multipoint applications are likely to be developed on digital networks. Many, if not all, of these applications will benefit from network support for quality of service requirements, which can be readily provided if the network supports reserved bandwidth multipoint communication channels. In this paper, we discuss the different kinds of applications that may require support for bandwidth reservation, and discuss how a multipoint communication channel can be found for multi point applications. For several applications, finding a multi point communication channel is a NP-hard problem, and we will present heuristics to solve it under different circumstances. We study these heuristics by means of simulations and attempt to provide theoretical bounds on their performance. © 1994 IOS Press. (Biomedical Division).