Adaptation of the Kademila Routing for Tactical Networks
DOI:
https://doi.org/10.26636/jtit.2011.1.1136Keywords:
Kademlia, network enabled capabilities, peer-topeer, wireless tactical military networksAbstract
In this paper a modification of the widely used Kademlia peer-to-peer system to tactical networks is proposed. We first take a look at the available systems today to cover the range of possibilities peer-to-peer systems offer. We identify candidates for use in military networks. Then we compare two candidate systems in an environment with highly dynamic participants. The considered environment is focused on the special conditions in tactical networks. Then we give rationale for choosing Kademlia as a suitable system for tactical environments. Since Kademlia is not adapted to military networks, a modification to this system is proposed to adapt it to the special conditions encountered in this environment. We show that optimizations in the routing may lead to faster lookups by measuring the modified algorithm in a simulation of the target environment. We show also that the proposed modification can be used to extend the battery lifetime of mobile peer-to-peer nodes. Our results show that peer-to-peer systems can be used in military networks to increase their robustness. The modifications proposed to Kademlia adapt the system to the special challenges of military tactical networks.
Downloads
References
[1] Dr. Scholl, „Opennap”, 2000 [Online]. Available: http://opennap.sourceforge.net/
View in Google Scholar
[2] „The Gnutella protocol specification v0.4” [Online]. Available: http://www.stanford.edu/class/cs244b/gnutella_protocol_0.4
View in Google Scholar
[3] J. Liang, R. Kumar, and K. Ross, „The kazaa overlay: a measurement study”, in Proc. 19th IEEE Ann. Comput. Commun. Worksh., Bonita Springs, USA, 2004.
View in Google Scholar
[4] T. Klingberg and R. Manfredi, Gnutella 0.6, 2002 [Online]. Available: http://www.rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
View in Google Scholar
[5] S. Guha and N. Daswani, „An experimental study of the skype peer-to-peer VoIP system”, Tech. Rep., Cornell University, Dec. 2005.
View in Google Scholar
[6] B. Yang and H. Garcia-Molina, „Designing a super-peer network”, Tech. Rep. 2002-13, Stanford University, 2002.
View in Google Scholar
[7] M. Steiner, E. W. Biersack, and T. En Najjary, „Actively monitoring peers in KAD”, in 6th Int. Worksh. Peer-to-Peer Sys. IPTPS’07, Bellevue, USA, 2007.
View in Google Scholar
[8] H. J. Kang, E. Chan-Tin, N. Hopper, and Y. Kim, „Why Kad lookup fails”, in Proc. IEEE 9th Int. Conf. Peer-to-Peer Comput. P2P 2009, Seattle, Washington, USA, 2009.
View in Google Scholar
[9] P. Maymounkov and D. Mazières, „Kademlia: a peer-to-peer information system based on the XOR metric”, in Int. Worksh. Peer-to-Peer Sys. IPTPS, LNCS, vol. 2429, Cambridge, MA, USA, 2002, pp. 53-65.
View in Google Scholar
[10] B. Y. Zhao et al., „Tapestry: a resilient global-scale overlay for service deployment”, IEEE J. Select. Areas Commun., vol. 22, no. 1, pp. 41-53, 2004.
View in Google Scholar
[11] I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, „Chord: a scalable peer-to-peer lookup service for internet applications”, in Proc. 1st ACM SIGCOMM, San Francisco, USA, 2001, pp. 149-160.
View in Google Scholar
[12] A. Rowstron and P. Druschel, „Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems”, in Proc. IFIP/ACM Int. Conf. Distrib. Syst. Platforms (Middleware), Heidelberg, Germany, 2001, pp. 329-350.
View in Google Scholar
[13] A. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel, „Scribe: the design of a large-scale event notification infrastructure”, in Proc. 3rd Int. COST264 Worksh. Networked Group Communication NGC’2001, Lecture Notes in Computer Science, J. Crowcroft and M. Hofmann, Eds., vol. 2233. London: Springer, 2001, pp. 30-43.
View in Google Scholar
[14] E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, „How to model an internetwork”, in Proc. IEEE INFOCOM’96, San Francisco, USA, 1996, pp. 594-602.
View in Google Scholar
[15] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, „A scalable content addressable network”, Tech. Rep. TR-00-010, International Computer Science Institute, Berkeley, USA, Oct. 2000.
View in Google Scholar
[16] M. Castro et al., „An evaluation of scalable application-level multicast built using peer-to-peer overlays”, in Proc. IEEE INFOCOM 2003, San Francisco, USA, 2003.
View in Google Scholar
[17] J. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gil, „A performance versus cost framework for evaluating DHT design tradeoffs under churn”, in Proc. IEEE INFOCOM 2005, Miami, USA, 2005, pp. 225-236.
View in Google Scholar
[18] D. Kato and T. Kamiya, „Evaluating DHT implementations in complex environments by network emulator”, in Proc. Int. Worksh. Peer-to-Peer Sys. IPTPS’07, Bellevue, USA, 2007.
View in Google Scholar
[19] M. Steiner, T. En-Najjary, and E. W. Biersack, „Exploiting KAD: possible uses and misuses”, Comput. Commun. Rev., vol. 37, no. 5, pp. 65-70, 2007.
View in Google Scholar
[20] M. Steiner, D. Carra, and E. W. Biersack, „Faster content access in KAD”, in Peer-to-Peer Computing, K. Wehrle, W. Kellerer, S. K. Singhal, and R. Steinmetz, Eds. New York: IEEE Comput. Society, 2008, pp. 195-204.
View in Google Scholar
[21] I. Baumgart, B. Heep, and S. Krause, „OverSim: a flexible overlay network simulation framework”, in Proc. 10th IEEE Glob. Internet Symp. GI’07 in conj. with IEEE INFOCOM 2007, Anchorage, USA, 2007, pp. 79-84.
View in Google Scholar
[22] A. Varga, „OMNeT++ discrete event simulation system”, 2009 [Online]. Available: http://www.omnetpp.org
View in Google Scholar
[23] K. P. Gummadi, S. Saroiu, and S. D. Gribble, „King: estimating latency between arbitrary internet end hosts”, in Proc. 2nd ACM SIGCOMM Internet Measur. Worksh. 2002, Marseille, France, 2002.
View in Google Scholar
[24] Z. Yao, D. Leonard, X. Wang, and D. Loguinov, „Modeling heterogeneous user churn and local resilience of unstructured P2P networks”, in Proc. IEEE Int. Conf. Netw. Prot. ICNP’06, Washington, USA, 2006, pp. 32-41.
View in Google Scholar
[25] R. Brunner, A Performance Evaluation of the Kad-Protocol. Corporate Communications Department Institut Eurécom France, 2006.
View in Google Scholar
[26] K. C. Almeroth and M. H. Ammar, „Multicast group behavior in the internet’s multicast backbone (mbone)”, IEEE Commun. Mag., vol. 35, pp. 224-229, 1997.
View in Google Scholar
[27] D. Stutzbach and R. Rejaie, „Understanding churn in peer-to-peer networks”, in Proc. 6th ACM SIGCOMM Conf. Internet Measur. IMC’06, J. M. Almeida, V. A. F. Almeida, and P. Barford, Eds., Rio de Janeiro, Brazil, 2006, pp. 189-202.
View in Google Scholar
[28] T. Ginzler and M. Amanowicz, „Simulation of the impact of packet errors on the Kademlia peer-to-peer routing”, in RTO Inform. Syst. Technol. Panel Symp. IST-092/RSY-022, NATO, 2010.
View in Google Scholar
[29] M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, „Exploiting network proximity in distributed hash tables”, in Proc. Int. Worksh. Future Direct. Distrib. Comput. FuDiCo, O. Babaoglu, K. Birman, and K. Marzullo, Eds., Bertinoro (Forli), Italy, 2002, pp. 52-55.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2023 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
