Premium
Multipoint connection routeing
Author(s) -
Lee Kyoo J.,
Gersht Alexander,
Friedman Anda
Publication year - 1990
Publication title -
international journal of digital and analog communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1047-9627
DOI - 10.1002/dac.4510030213
Subject(s) - computer science , computer network , robustness (evolution) , integrated services digital network , broadband , point (geometry) , distributed computing , point to point , bandwidth (computing) , telecommunications , operations research , engineering , mathematics , biochemistry , chemistry , geometry , gene
Among 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.