Abstract

AbstractAmong other potential services envisioned for broadband ISDN networks, multipoint connnection services have drawn much attention from the standards arena as well as research communities. These services include conference calls, video lectures, etc. where more than two endpoint CPEs are involved in communication. In this paper we investigate representative multipoint connection routeing algorithms from a number of viewpoints: computational complexity, call set‐up complexity, dynamic reconfiguration, robustness to node failures and bandwidth efficiency. These algorithms are either known in the literature or a simple generalization of point‐to‐point routeing algorithms. An interesting conclusion of our study is that the use of multiple point‐to‐point connections for multipoint calls is a viable solution in many cases of interest. This solution would eliminate much of the additional call‐handling complexity that may be otherwise introduced by more sophisticated multipoint routeing algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.