skip to main content
research-article

Routing in Large-scale Dynamic Networks: A Bloom Filter-based Dual-layer Scheme

Authors Info & Claims
Published:01 October 2020Publication History
Skip Abstract Section

Abstract

The increasing volume of network-connected devices comprising Internet of Things and the variety of heterogeneous network architectures across these devices pose significant challenges to effective deployment and routing. In this article, we consider the adoption of probabilistic data structures to develop a novel Bloom Filter-based dual-layer inter-domain routing scheme. Our designed scheme implements internal and external routing layers in network gateways constructed upon the counting bloom filter and the original bloom filter. We first compare several representative structures in both theory and experimentation. We then propose our novel Bloom Filter-based dual-layer inter-domain routing scheme. In the design of the routing scheme, we consider issues related to the overall space cost and routing loop prevention, as well as present corresponding solutions. We also detail the principal structures and algorithms. Further, we conduct a theoretical analysis of the space efficiency of our proposed scheme compared to traditional routing with respect to the size of data packets and the size of routing tables, as well as in routing loop avoidance. Finally, via extensive performance evaluation, our experimental results demonstrate the effectiveness and efficiency of our proposed scheme.

References

  1. M. Antikainen, T. Aura, and M. Särelä. 2014. Denial-of-service attacks in bloom-filter-based forwarding. IEEE/ACM Trans. Netw. 22, 5 (Oct. 2014), 1463--1476. DOI:https://doi.org/10.1109/TNET.2013.2281614Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Apache Hadoop 2.7.3. [n.d.]. Retrieved from http://hadoop.apache.org/docs/current/api/org/apache/hadoop/util/bloom/package-summary.html.Google ScholarGoogle Scholar
  3. Burton H. Bloom. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 7 (July 1970), 422--426. DOI:https://doi.org/10.1145/362686.362692Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Paul Loh Ruen Chze and Kan Siew Leong. 2014. A secure multi-hop routing for IoT communication. In Proceedings of the IEEE World Forum on Internet of Things (WF-IoT’14).Google ScholarGoogle ScholarCross RefCross Ref
  5. Bin Fan, Dave G. Andersen, Michael Kaminsky, and Michael D. Mitzenmacher. 2014. Cuckoo filter: Practically better than bloom. In Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies.Google ScholarGoogle Scholar
  6. Li Fan, Pei Cao, J. Almeida, and A. Z. Broder. 2000. Summary cache: A scalable wide-area Web cache sharing protocol. IEEE/ACM Trans. Netw. 8, 3 (June 2000), 281--293.Google ScholarGoogle Scholar
  7. N. Feamster and J. Rexford. 2007. Network-wide prediction of BGP routes. IEEE/ACM Trans. Netw. 15, 2 (Apr. 2007), 253--266. DOI:https://doi.org/10.1109/TNET.2007.892876Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Foerster, A. Ludwig, J. Marcinkowski, and S. Schmid. 2018. Loop-free route updates for software-defined networks. IEEE/ACM Trans. Netw. 26, 1 (Feb. 2018), 328--341. DOI:https://doi.org/10.1109/TNET.2017.2778426Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. Gao, J. Nguyen, Y. Wu, W. G. Hatcher, and W. Yu. 2017. A bloom filter-based dual-layer routing scheme in large-scale mobile networks. In Proceedings of the 26th International Conference on Computer Communication and Networks (ICCCN’17). 1--9. DOI:https://doi.org/10.1109/ICCCN.2017.8038405Google ScholarGoogle Scholar
  10. T. G. Griffin, F. B. Shepherd, and G. Wilfong. 2002. The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10, 2 (Apr. 2002), 232--243. DOI:https://doi.org/10.1109/90.993304Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Jiang, Y. Ji, X. Wang, J. Zhu, and Y. Cheng. 2014. Design of a multiple bloom filter for distributed navigation routing. IEEE Trans. Syst. Man Cybernet.: Syst. 44, 2 (Feb. 2014), 254--260. DOI:https://doi.org/10.1109/TSMC.2013.2242884Google ScholarGoogle Scholar
  12. S. Kao, D. Lee, T. Chen, and A. Wu. 2018. Dynamically updatable ternary segmented aging bloom filter for openflow-compliant low-power packet processing. IEEE/ACM Trans. Netw. 26, 2 (Apr. 2018), 1004--1017. DOI:https://doi.org/10.1109/TNET.2018.2813425Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. N. Li, J. Martínez-Ortega, V. H. Díaz, and J. A. S. Fernandez. 2018. Probability prediction-based reliable and efficient opportunistic routing algorithm for VANETs. IEEE/ACM Trans. Netw. 26, 4 (Aug. 2018), 1933--1947. DOI:https://doi.org/10.1109/TNET.2018.2852220Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. H. Lim, K. Lim, N. Lee, and K. Park. 2014. On adding bloom filters to longest prefix matching algorithms. IEEE Trans. Comput. 63, 2 (Feb. 2014), 411--423. DOI:https://doi.org/10.1109/TC.2012.193Google ScholarGoogle Scholar
  15. Jie Lin, Wei Yu, Nan Zhang, Xinyu Yang, Hanlin Zhang, and Wei Zhao. 2017. A survey on Internet of Things: Architecture, enabling technologies, security and privacy, and applications. IEEE Internet Things J. 4, 5 (2017), 1125--1142.Google ScholarGoogle ScholarCross RefCross Ref
  16. W. Liu, W. Qu, J. Gong, and K. Li. 2016. Detection of superpoints using a vector bloom filter. IEEE Trans. Info. Forensics Secur. 11, 3 (Mar. 2016), 514--527. DOI:https://doi.org/10.1109/TIFS.2015.2503269Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Mitzenmacher. 2002. Compressed bloom filters. IEEE/ACM Trans. Netw. 10, 5 (Oct. 2002), 604--612. DOI:https://doi.org/10.1109/TNET.2002.803864Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. H. Mun and H. Lim. 2016. New approach for efficient IP address lookup using a bloom filter in trie-based algorithms. IEEE Trans. Comput. 65, 5 (May 2016), 1558--1565. DOI:https://doi.org/10.1109/TC.2015.2444850Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Keisei Okano and Yoshiaki Kakuda. 2015. An inter-domain routing protocol based on autonomous clustering for heterogeneous mobile ad hoc networks. IEICE Trans. Commun. 98, 9 (2015), 1768--1776.Google ScholarGoogle ScholarCross RefCross Ref
  20. Probabilistic data structures for Guava.[n.d.]. Retrieved from https://github.com/bdupras/guava-probably.Google ScholarGoogle Scholar
  21. B. Rekha and D. V. Ashoka. 2015. SCIDR: A scalable cluster based inter-domain routing protocol for heterogeneous MANET. Int. J. Comput. Appl. 122, 4 (2015).Google ScholarGoogle Scholar
  22. O. Rottenstreich and I. Keslassy. 2015. The bloom paradox: When not to use a bloom filter. IEEE/ACM Trans. Netw. 23, 3 (June 2015), 703--716. DOI:https://doi.org/10.1109/TNET.2014.2306060Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. K. Saravanan, A. Senthilkumar, and P. Chacko. 2014. Modified whirlpool hash based bloom filter for networking and security applications. In Proceedings of the 2nd International Conference on Devices, Circuits and Systems (ICDCS’14). 1--6. DOI:https://doi.org/10.1109/ICDCSyst.2014.6926138Google ScholarGoogle Scholar
  24. K. Sasaki and S. Makido. 2013. Bloom-filter aided two-layered structured overlay for highly-dynamic wireless distributed storage. IEEE Commun. Lett. 17, 4 (Apr. 2013).Google ScholarGoogle ScholarCross RefCross Ref
  25. J. A. Stankovic. 2014. Research directions for the Internet of Things. IEEE Internet Things J. 1, 1 (Feb. 2014), 3--9. DOI:https://doi.org/10.1109/JIOT.2014.2312291Google ScholarGoogle ScholarCross RefCross Ref
  26. J. Tapolcai, J. Bíró, P. Babarczi, A. Gulyás, Z. Heszberger, and D. Trossen. 2015. Optimal false-positive-free bloom filter design for scalable multicast forwarding. IEEE/ACM Trans. Netw. 23, 6 (Dec. 2015), 1832--1845. DOI:https://doi.org/10.1109/TNET.2014.2342155Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. J. Trindade, R. Pereira, and T. Vazao. 2014. Scalability of bloom filter based routing for large-scale mobile networks. In Proceedings of the 7th IFIP Wireless and Mobile Networking Conference (VMNC’14).Google ScholarGoogle Scholar
  28. C. Y. Tseung, K. P. Chow, and X. Zhang. 2017. Extended abstract: Anti-DDoS technique using self-learning bloom filter. In Proceedings of the IEEE International Conference on Intelligence and Security Informatics (ISI’17). 204--204. DOI:https://doi.org/10.1109/ISI.2017.8004917Google ScholarGoogle Scholar
  29. Jean-Philippe Vasseur and Adam Dunkels (Eds.). 2010. Interconnecting Smart Objects with IP. Morgan Kaufmann, Boston. 387--397. DOI:https://doi.org/10.1016/B978-0-12-375165-2.00031-4Google ScholarGoogle Scholar
  30. Joy Na Wang, Joshua Van Hook, and Patricia Deutsch. 2015. Inter-domain routing for military mobile networks. In Proceedings of the IEEE Military Communications Conference (MILCOM’15).Google ScholarGoogle ScholarCross RefCross Ref
  31. Jianjia Wu and Wei Zhao. 2016. Design and realization of WInternet: From Net of Things to Internet of Things. ACM Trans. Cyber-Phys. Syst. 1, 1, Article 2 (Nov. 2016), 12 pages. DOI:https://doi.org/10.1145/2872332Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Y. Wu, W. Yu, D. W. Griffith, and N. Golmie. 2020. Modeling and performance assessment of dynamic rate adaptation for M2M communications. IEEE Trans. Netw. Sci. Eng. 7, 1 (2020), 285--303. DOI:https://doi.org/10.1109/TNSE.2018.2869093Google ScholarGoogle ScholarCross RefCross Ref
  33. H. Xu, W. Yu, D. Griffith, and N. Golmie. 2018. A survey on industrial Internet of Things: A cyber-physical systems perspective. IEEE Access 6 (2018), 78238--78259. DOI:https://doi.org/10.1109/ACCESS.2018.2884906Google ScholarGoogle ScholarCross RefCross Ref
  34. T. Yang, G. Xie, A. X. Liu, Q. Fu, Y. Li, X. Li, and L. Mathy. 2018. Constant IP lookup with FIB explosion. IEEE/ACM Trans. Netw. 26, 4 (Aug. 2018), 1821--1836. DOI:https://doi.org/10.1109/TNET.2018.2853575Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. W. Yu, F. Liang, X. He, W. G. Hatcher, C. Lu, J. Lin, and X. Yang. 2018. A survey on the edge computing for the Internet of Things. IEEE Access 6 (2018), 6900--6919. DOI:https://doi.org/10.1109/ACCESS.2017.2778504Google ScholarGoogle ScholarCross RefCross Ref
  36. W. Yu, H. Xu, J. Nguyen, E. Blasch, A. Hematian, and W. Gao. 2018. Survey of public safety communications: User-side and network-side solutions and future directions. IEEE Access 6 (2018), 70397--70425. DOI:https://doi.org/10.1109/ACCESS.2018.2879760Google ScholarGoogle ScholarCross RefCross Ref
  37. Haibo Zhang, Luming Wan, Yawen Chen, Laurence T. Yang, and Lizhi Peng. 2017. Adaptive message routing and replication in mobile opportunistic networks for connected communities. ACM Trans. Internet Technol. 18, 1, Article 2 (Oct. 2017), 22 pages. DOI:https://doi.org/10.1145/3122984Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Routing in Large-scale Dynamic Networks: A Bloom Filter-based Dual-layer Scheme

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Internet Technology
      ACM Transactions on Internet Technology  Volume 20, Issue 4
      November 2020
      391 pages
      ISSN:1533-5399
      EISSN:1557-6051
      DOI:10.1145/3427795
      • Editor:
      • Ling Liu
      Issue’s Table of Contents

      Copyright © 2020 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 October 2020
      • Accepted: 1 June 2020
      • Revised: 1 February 2020
      • Received: 1 March 2019
      Published in toit Volume 20, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!