Abstract
The connection optimisation problem for two types of multipoint videoconferences is formulated. The first type is called a selectable media conference. In this type each conferee can choose to receive a particular video composition. In the second type, called a common media conference, only one composite video is generated for all conferees in this type of conference. Algorithms that use a combination of look-up table and online processing are designed for computation of the optimal paths for connecting the conference sites. The blocking probabilities for these two types of videoconference in fully connected networks are derived and compared. The sensitivity of network throughput to conference-size distribution is also studied.
| Original language | English |
|---|---|
| Pages (from-to) | 133-140 |
| Number of pages | 8 |
| Journal | IEE Proceedings: Communications |
| Volume | 143 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 18 Jun 1996 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
User-Defined Keywords
- Connection-path optimisation
- Multipoint videoconferencing
- selectable media conference
- video composition
- common media conference
- look-up table
- online processing
- optimal paths
- blocking probabilities
- fully connected networks
- sensitivity
- network throughput
- conference-size distribution
Fingerprint
Dive into the research topics of 'Connection optimisation for two types of videoconference'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver