Optimum connection paths for a class of videoconferences

Yiu Wing LEUNG*, Tak Shing Yum

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

The optimum connection problem for a class of videoconferences in packet-switched networks is studied. The conferees of a particular conference send their images to a chosen node, called the conference center, for processing. The conference center can either send distinct composite video to an individual conferee or multicast the same composite video to all conferees. Depending on how the video is composed, the optimum connection paths form either the minimum conference tree or the minimum conference-multicast tree. Algorithms are designed for finding these trees, and the conference blocking probability in fully connected networks is derived. One to two orders of magnitude reduction of blocking is observed with the use of the optimum connection paths when compared to the strategy which chooses the call-initiating-node as the conference center.

Original languageEnglish
Title of host publicationConference Record - International Conference on Communications
PublisherPubl by IEEE
Pages859-865
Number of pages7
ISBN (Print)0780300068
Publication statusPublished - 1991
EventInternational Conference on Communications - ICC 91 - Denver, CO, USA
Duration: 23 Jun 199126 Jun 1991

Publication series

NameConference Record - International Conference on Communications
Volume2
ISSN (Print)0536-1486

Conference

ConferenceInternational Conference on Communications - ICC 91
CityDenver, CO, USA
Period23/06/9126/06/91

Scopus Subject Areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimum connection paths for a class of videoconferences'. Together they form a unique fingerprint.

Cite this