Optimum connection paths for a class of videoconferences

Yiu Wing Leung; Tak Shing Yum

doi:10.1109/ICC.1991.162480

Optimum connection paths for a class of videoconferences

Yiu Wing Leung^*, Tak Shing Yum

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-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 language	English
Title of host publication	IEEE International Conference on Communications, ICC 1991
Publisher	IEEE
Pages	859-865
Number of pages	7
Volume	2
ISBN (Print)	0780300068, 9780780300064
DOIs	https://doi.org/10.1109/ICC.1991.162480
Publication status	Published - 23 Jun 1991
Event	International Conference on Communications - ICC 1991 - Denver, CO, USA Duration: 23 Jun 1991 → 26 Jun 1991

Publication series

Name	IEEE International Conference on Communications
ISSN (Print)	0536-1486

Conference

Conference	International Conference on Communications - ICC 1991
City	Denver, CO, USA
Period	23/06/91 → 26/06/91

Scopus Subject Areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.1991.162480

Cite this

@inproceedings{c96b980c42a54e5bb94b4b84c2fdb863,

title = "Optimum connection paths for a class of videoconferences",

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.",

author = "Leung, {Yiu Wing} and Yum, {Tak Shing}",

year = "1991",

month = jun,

day = "23",

doi = "10.1109/ICC.1991.162480",

language = "English",

isbn = "0780300068",

volume = "2",

series = "IEEE International Conference on Communications",

publisher = "IEEE",

pages = "859--865",

booktitle = "IEEE International Conference on Communications, ICC 1991",

address = "United States",

}

TY - GEN

T1 - Optimum connection paths for a class of videoconferences

AU - Leung, Yiu Wing

AU - Yum, Tak Shing

PY - 1991/6/23

Y1 - 1991/6/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026400668&partnerID=8YFLogxK

U2 - 10.1109/ICC.1991.162480

DO - 10.1109/ICC.1991.162480

M3 - Conference proceeding

AN - SCOPUS:0026400668

SN - 0780300068

SN - 9780780300064

VL - 2

T3 - IEEE International Conference on Communications

SP - 859

EP - 865

BT - IEEE International Conference on Communications, ICC 1991

PB - IEEE

T2 - International Conference on Communications - ICC 1991

Y2 - 23 June 1991 through 26 June 1991

ER -

Optimum connection paths for a class of videoconferences

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this