Abstract
Because of the best-effort service in Internet, direct routing path of Internet may not always meet the VoIP quality requirements. Thus, many researches proposed Peer-to-Peer VoIP systems such as SIP+P2P system, which uses relay node to relay RTP stream from the source node to the destination node and uses application-layer routing scheme to lookup the best relay nodes. The key of those systems is how to lookup the appropriate relay nodes, which we call relay lookup problem. This paper presents a novel peer relay lookup scheme based on SIP+P2P system. The main ideas are to organize the P2P network using a Cluster overlay and to use topology-aware to optimize relay selection. We introduce the mechanism in detail, and then evaluate this mechanism in NS2 network simulation environment. The results show that our scheme is scalable and can get high relay hit ratio, which confirm the feasibility of a real system. We also make comparison with traditional schemes and the results show that our scheme has good path quality.
Highlights
The current Internet provides a Best-effort service, which cannot guarantee VoIP service qualities on the IP-layer sometimes
We propose a novel peer relay lookup scheme based on cluster participation, which can be used in SIP+P2P system
If there are no proper relay nodes at last, the source node will ask for the near cluster set and make an intersection with the destination node’s near cluster set
Summary
The current Internet provides a Best-effort service, which cannot guarantee VoIP service qualities on the IP-layer sometimes. There are many application-layer routing projects which propose relay lookup scheme, such as MIT’s resilient overlay network (RON) [4,5], Ohio state University’s AS-Aware Peer-Relay Protocol (ASAP) [1], which all are to solve the Internet path failure through one-hop overlay routing. Besides these systems, there is one commercial software which is Skype [3,7,8]. Our measurement metric of path quality reflects the proximity relationship in topology distance, and is easy to realize and suitable for large scale network
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
