Mobile real-time group communication service

Authors:
Zohar Naor;Sajal K. Das
Affiliations:
Department of Mathematics, Physics, and Computer Science, University of Haifa, Israel;Department of Computer Science and Engineering, The University of Texas at Arlington
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 7
Cited 1

LeZi-update: an information-theoretic approach to track mobile users in PCS networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polylogarithmic inapproximability

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Online Facility Location

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Adaptive server selection for large scale interactive online games

NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization

IEEE Transactions on Mobile Computing
Searching for Multiple Mobile Users

IEEE Transactions on Mobile Computing

A scalable framework for mobile real-time group communication services

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

A scalable framework for mobile real-time group communication services is developed in this paper. Examples for possible applications of this framework are mobile social networks, mobile conference calls, mobile instant messaging services, and mobile multi-player on-line games. A key requirement for enabling a real-time group communication service is the tight constraint imposed on the call delivery delay. Since establishing such communication service for a group of independent mobile users under a tight delay constraint is NP-hard, a two-tier architecture is proposed, that can meet the delay constraint imposed by the real-time service requirement for many independent mobile clients in a scalable manner. The time and memory complexity associated with the group services provided by the proposed framework are O(N) for each service, where N is the number of nodes being served, while a distributed scheme requires O(N2) for both time and memory complexity.