Name
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 |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/LCN.1997.631005 | Minneapolis, MN |
Keywords | Field | DocType |
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 | Computer science,Path vector protocol,Enhanced Interior Gateway Routing Protocol,Computer network,Internet protocol suite,Wireless Routing Protocol,Stateless protocol,Distributed computing,Zone Routing Protocol,Routing protocol,Link Control Protocol | Conference |
ISSN | ISBN | Citations |
0742-1303 | 0-8186-8141-1 | 1 |
PageRank | References | Authors |
0.42 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. K. McKinley | 1 | 1397 | 121.87 |
| Huang, Y. | 2 | 13 | 2.96 |