MULTI-DOMAIN VOIP PEERING DENGAN JARINGAN OVERLAY

Authors

  • Herry Imanta Sitepu Institut Teknologi Harapan Bangsa

DOI:

https://doi.org/10.61769/telematika.v6i1.38

Keywords:

distributed hash table, peer-to-peer, VoIP, multidomain

Abstract

Jaringan VoIP yang terdiri dari multi domain membutuhkan mekanisme peering agar dapat melakukan routing panggilan dari satu domain ke domain yang lain. Kelemahan dari solusi VoIP peering yang digunakan saat ini adalah menggunakan arsitektur  client/server. Dalam jaringan SIP misalnya, DNS server digunakan sebagai penyedia layanan yang melakukan pencarian (lookup) alamat IP proxy server yang menangani domain tertentu. Arsitektur client/server memiliki masalah skalabilitas, selain ituserver dapat menjadi single point of failure. Penelitian ini mengusulkan sebuah solusi VoIP peering dengan menggunakan arsitektur terdistribusi yang menyediakan layanan lookup melalui sebuah jaringan overlay. Aplikasi ini membutuhkan protokol tabel hash terdistribusi (Distributed Hash Table) sebagai lapisan overlay. Penelitian ini mengusulkan
pula UnoHop, algoritma DHT yang efisien dengan kinerja pencarian (lookup) satu hop. Hasil eksperimen memperlihatkan kinerja multi-domain VoIP dengan menggunakan UnoHop dapat beradaptasi dengan event join/leave dalam waktu yang singkat.


Multi-domain VoIP network requires peering to allow call routing from one domain to other domains. The problem with current VoIP peering solution is because it uses client/server architecture. In the SIP network for example, the DNS server is usually used to provide services to lookup domain and locate the switching server in a domain. Client/server architecture is not scalable and the server can become the single point of failure. In this paper we propose a distributed architecture for VoIP peering solution by providing lookup services using overlay network. This particular application requires an efficient Distributed Hash Table (DHT) protocol as the overlay layer. We also present UnoHop, an efficient DHT algorithm with one hop lookup performance. Experiments shows that the performance of multi-domain VoIP using UnoHop is adaptable to the join/leave events with short time.

References

J. Rosenberg, H. Schulzrinne, U. Camarillo, A. Johnson, J. Peterson,

R. Sparks, M. Handley, E. Schooler, "SIP: Session Initiation Protocol",

IETF, June 2002.

Mule, J,” SPEERMINT Requirements for SIP-based Session

Peering”, IETF, October 2009.

Uzelac, A., “SPEERMINT Peering Architecture, IETF, November

Creighton, T., Livingood, J. , “Use of DNS SRV and NAPTR

Records for SPEERMINT”, IETF, September 2009

Uzelac, A., Lee, Y., “VoIP SIP Peering Use Cases”, IETF, January

Falstrom, P., Mealling, M., “The E.164 to Uniform Resource

Identifiers (URI) Dynamic Delegation Discovery System (DDS)

Application (ENUM), IETF, April 2004.

S. Androutsellis-Theotokis, dan D. Spinellis, “A survey of peer-topeer

content distribution technologies”. ACM Computing Surveys

(CSUR) 36: 335–371, 2004.

Vahdat, A., Yocum, K.,Walsh, K., P., Kostic, Mahadevan, D.,

Chase, J. dan Beck D., “Scalability and Accuracy in a Large-Scale

Network Emulator In Proceedings of the 5th ACM/USENIX

Symposium on Operating System

Design and Implementation (OSDI). Boston, MA, 2002

Stoica, I., Morris, R., Karger, D., Kaashoek, F. M. dan

Balakrishnan, H., “Chord: A scalable peer-to-peer lookup service for

internet applications”. In SIGCOMM ’01: Proceedings of the 2001

conference on Applications, technologies, architectures, and protocols

for computer communications, 31. New York, NY, USA: ACM Press,

–160.

P. Maymounkov and D. Maziãres. “Kademlia: A peer-to- peer

information system based on the xor metric”. First International

Workshop, IPTPS 2002 Cambridge, MA, USA, March 7-8, 2002.

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J.

D. Kubiatowicz. “Tapestry: A resilient global-scale overlay for service

deployment”. IEEE Journal on Selected Areas in

Communications,22(1):41–53,2004.

A. Gupta, B. Liskov, and R. Rodrigues. “Efficient routing for

peer-to-peer overlays”. In Proc. First Symposium on Networked

Systems Design and Implementation (NSDI ’04), March 2004.

John F. Buffor, Heather Yu, Eng Keong Luar, “Peer-to-Peer

Networking and Application”, Morgan Kauffman, 2009.

Herry Sitepu, Carmadi Machbub, Armein Z.R. Langi & Suhono H.

Supangkat, “UnoHop: Efficient Distributed Hash Table with O(1)

Lookup Performance”, ITB Journal Vol. 2C No. 1, 2008

Saroiu, S., Goummadi, P. dan Gribble, S., “A Measurement Study

of Peer-to-Peer File Sharing Systemdet”, In Proceedings of Multimedia

Computing and Networking 2002 (MMCN ’02). San Jose, CA, USA.

Dabek, F., “A Distributed Hash Table”. Ph.D. thesis,

Massachusetts Institute of Technology. 2005

Asterisk.org, 2009

Winnick, J. dan Jamin, S., “Inet-3.0: Internet Topology Generator”.

Tech. rep., University of Michigan, 2002.

Li, J., Stribling, J., Morris, R., Kaashoek, M. F. dan Gil, T. M.,

“A performance vs. cost framework for evaluating DHT design

tradeoffs under churn.”, In Proceedings of the 24th Infocom. Miami,

FL, 2005.

Gummadi, K. P., Saroiu, S. dan Gribble, S. D. “King: Estimating

Latency between Arbitrary Internet End Hosts.”, In Proceedings of the

SIGCOMM Internet Measurement Workshop (IMW 2002). Marseille,

France. 2002.

Downloads

Published

2015-05-06

Issue

Vol. 6 No. 1 (2010)

Section

Articles

License

 

You are free to:

  1. Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
  2. Adapt — remix, transform, and build upon the material for any purpose, even commercially.
  3. The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

  1. Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  2. ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
  3. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:

You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.

No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.