%0 Conference Proceedings
%T A Multi-constraint Resource Search Algorithm for P2P-SIP Conference Services
%+ National Formosa University
%+ WuFeng University, Chiayi, Taiwan
%+ National Chung-Cheng University
%+ Chunghwa Telecom [Taipei]
%+ Nanhua University
%A Su, Hui-Kai
%A Hsiao, Wen-Hsu
%A Pan, Jian-Ting
%A Liao, Chen-Hung
%A Chen, Kim-Joan
%A Wu, Chien-Min
%Z Part 9: ATIMCN
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th International Conference on Network and Parallel Computing (NPC)
%C Gwangju, South Korea
%Y James J. Park
%Y Albert Zomaya
%Y Sang-Soo Yeo
%Y Sartaj Sahni
%I Springer
%3 Network and Parallel Computing
%V LNCS-7513
%P 360-372
%8 2012-09-06
%D 2012
%R 10.1007/978-3-642-35606-3_42
%K Peer-to-Peer
%K Session Initiation Protocol
%K Resource Search Algorithm
%Z Computer Science [cs]Conference papers
%X Peer-to-peer conference is an interactive multi-users conferencing application that improves the issues of concentrated loading, single-point failure and expensive infrastructure cost for the traditional centralized conference model, according to the conference resource shared by each other. The benefit of non-centralized system can be achieved by using P2P-SIP. However, unlike the traditional centralized architecture, the conference resource is provided by each peer user. How to search the heterogeneous resource efficiently is a key point in the dynamic and distributed environment. Thus, we proposed a multi-constraint resource search algorithm for P2P-SIP conferencing services. In the full distributed environment, users can search a usable resource to reduce the call-setup time and save the conferencing cost according to the conferencing scale and the quality requirements.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01551334/document
%2 https://inria.hal.science/hal-01551334/file/978-3-642-35606-3_42_Chapter.pdf
%L hal-01551334
%U https://inria.hal.science/hal-01551334
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-7513