10 likes | 148 Views
Priority-based Distributed Floor Control Protocol for Collaborative Applications. Cadet Tao-hsiang Chang, Dr. Shankar Banik Department of Mathematics and Computer Science The Citadel, The Military College of South Carolina. Goals of the Protocal. Flow Charts & Psuedo Code.
E N D
Priority-based Distributed Floor Control Protocol for Collaborative Applications Cadet Tao-hsiang Chang, Dr. Shankar BanikDepartment of Mathematics and Computer ScienceThe Citadel, The Military College of South Carolina Goals of the Protocal Flow Charts & Psuedo Code -First In First Out in high priority-First In First Out in low priority-Distributed Floor Control Request Bus Receive Request Packet--if(req_pack.p_used==1){ RQ_1++; if(req_pack.used==1) RQ_0++; }else if(p_msg_to_send==1){ req_pack.p_used=1; DQ_1=RQ_1; RQ_1=0; }else if(req_pack.used==1) RQ_0++;else if(msg_to_send==1){ req_pack.used=1; DQ_0=RQ_0; RQ_0=0; }--Pass Request packet Data Bus Receive Wake Up Packet -- if(wu_pack.used==1); else if(DQ_1!=0) DQ_1--; else if(p_msg_to_send==1){ wu_pack.used=1; p_msg_to_send=0; } else if(RQ_1!=0) RQ_1--;else if(DQ_0!=0) DQ_0--; else if(msg_to_send==1){ wu_pack.used=1; msg_to_send=0; } else if(RQ_0!=0) RQ_0--; -- Pass Wake Up Packet Abstract First In First Out (FIFO) will be maintained if the users have the same priority. Moreover, this coordination should be done without any centralized controller. We propose a priority based distributed floor control protocol for collaborative applications. The Distributed Queue Dual Bus (DQDB) is used as the base of our protocol. We have implemented the protocol using Berkeley Socket Distribution (BSD) Application Programming Interface (API) and tested the protocol on the PlanetLab network. • Computer supported collaborative applications (video-conferencing, online games, distributed database replications) are popular among Internet users. One important issue in these applications is floor control. Some applications require that the priority of a user should be taken into account while assigning the floor. This implies that the user with higher priority will get the floor before the user with lower priority when both the users have requested for the floor. The rule Results & Observation Five node used in the experiment: A: Boston University B: University of Maryland C: Japan Advanced Institute of Science and Technology (JAIST) D: Texas AM University E: National Taiwan University, Department of Information Management Five nodes are used in the experiment. The protocol is tested for different request generation rate at each node with different priority ratio. Average Waiting Time is used as the performance metric. From the results, it is observed that the overall average waiting time increases when the ratio of high priority and low priority floor requests increases. Examples of Protocol Execution Variables in Protocal Implementation