loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE Symposium on Computers and Communications (ISCC'05)
Heuristic Algorithms for Server Allocation in Distributed VoIP Conferencing
Cartagena, Murcia, Spain
June 27-June 30
ISBN: 0-7695-2373-0
ASCII Text
x 
 
R. Venktesha Prasad, H. N. Shankar, H. S. Jamadagni, M. V. Rohith, S. Vijay, "Heuristic Algorithms for Server Allocation in Distributed VoIP Conferencing," Computers and Communications, IEEE Symposium on, pp. 237-242, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISCC.2005.77,
author = {R. Venktesha Prasad and H. N. Shankar and H. S. Jamadagni and M. V. Rohith and S. Vijay},
title = {Heuristic Algorithms for Server Allocation in Distributed VoIP Conferencing},
journal ={Computers and Communications, IEEE Symposium on},
volume = {0},
year = {2005},
issn = {1530-1346},
pages = {237-242},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2005.77},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computers and Communications, IEEE Symposium on
TI - Heuristic Algorithms for Server Allocation in Distributed VoIP Conferencing
SN - 1530-1346
SP237
EP242
A1 - R. Venktesha Prasad,
A1 - H. N. Shankar,
A1 - H. S. Jamadagni,
A1 - M. V. Rohith,
A1 - S. Vijay,
PY - 2005
KW - VoIP Conference
KW - Conference Servers
KW - SIP
KW - Facility Location Problem
KW - Heuristic Algorithms
VL - 0
JA - Computers and Communications, IEEE Symposium on
ER -
 
R. Venktesha Prasad, Technical University of Delft
H. N. Shankar, PES Institute of Technology
H. S. Jamadagni, Indian Institute of Science
M. V. Rohith, PES Institute of Technology
S. Vijay, Esqube Communication Solutions Pvt. Ltd.
To allocate Audio Conference Servers (CS) [1] for virtual conferencing over IP, we leverage Session Initiation Protocol (SIP) for signaling. We address here the problem of facilitating seamless conference amongst participants using CSs. This demands a proper allocation of CSs to clients to maximize the number of participants served and at a reduced cost. Seeking a more realistic approach, we avoid over-simplifying assumptions; hence the problem becomes relatively harder. We present three heuristic algorithms for these NP-hard problems and bring about the effectiveness of their performance.
Index Terms:
VoIP Conference, Conference Servers, SIP, Facility Location Problem, Heuristic Algorithms
Citation:
R. Venktesha Prasad, H. N. Shankar, H. S. Jamadagni, M. V. Rohith, S. Vijay, "Heuristic Algorithms for Server Allocation in Distributed VoIP Conferencing," iscc, pp.237-242, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.