A centralized generic protocol for multipoint connections

Author

McKinley, Philip K. ; Huang, Yih

Author_Institution

Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA

fYear

35735

fDate

2-5 Nov1997

Firstpage

357

Lastpage

368

Abstract

A centralized protocol, C-GMC, is proposed for the construction and maintenance of multipoint connections (MCs). The operation of the protocol is independent of the MC topology algorithm, which is rendered a “plug-in” module. The C-GMC protocol is targeted at networks based on link state routing and uses the concept of a per-MC server. The problems of server election and migration are modeled as consensus problems in distributed systems, and an efficient solution is proposed. Results of a simulation study show that the C-GMC protocol is able to efficiently handle worst case workloads generated by multiparty communication sessions with thousands of participants

Keywords

client-server systems; groupware; protocols; teleconferencing; C-GMC; C-GMC protocol; MC topology algorithm; centralized generic protocol; consensus problems; distributed systems; link state routing; multiparty communication sessions; multipoint connections; per-MC server; server election; simulation study; worst case workloads; Application software; Asynchronous transfer mode; Computer science; Computer simulation; Internet; Network servers; Nominations and elections; Routing protocols; Switches; Telecommunication network topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Local Computer Networks, 1997. Proceedings., 22nd Annual Conference on

Conference_Location

Minneapolis, MN

ISSN

0742-1303

Print_ISBN

0-8186-8141-1

Type

conf

DOI

10.1109/LCN.1997.631005

Filename

631005