Graph-based Namespaces and Load Sharing for Efficient Information Dissemination in Disasters

Timely, flexible and accurate information dissemination can make a life-and-death difference in managing disasters. Complex command structures and information organization make such dissemination challenging. Thus, it is vital to have an architecture with appropriate naming frameworks, adaptable to the changing roles of participants, focused on content rather than network addresses. To address this, we propose POISE, a name-based and recipient-based publish/subscribe architecture for efficient content dissemination in disaster management. POISE proposes an information layer, improving on state-of-the-art Information-Centric Networking (ICN) solutions such as Named Data Networking (NDN) in two major ways: 1) support for complex graph-based namespaces, and 2) automatic name-based load-splitting. To capture the complexity and dynamicity of disaster response command chains and information flows, POISE proposes a graph-based naming framework, leveraged in a dissemination protocol which exploits information layer rendezvous points (RPs) that perform name expansions. For improved robustness and scalability, POISE allows load-sharing via multiple RPs each managing a subset of the namespace graph. However, excessive workload on one RP may turn it into a “hot spot”, thus impeding performance and reliability. To eliminate such traffic concentration, we propose an automatic load-splitting mechanism, consisting of a namespace graph partitioning complemented by a seamless, loss-less core migration procedure. Due to the nature of our graph partitioning and its complex objectives, off-the-shelf graph partitioning, e.g., METIS, is inadequate. We propose a hybrid partitioning solution, consisting of an initial and a refinement phase. Our simulation results show that POISE outperforms state-of-the-art solutions, demonstrating its effectiveness in timely delivery and load-sharing.

[1]  Nicola Blefari-Melazzi,et al.  The Benefit of Information Centric Networking for Enabling Communications in Disaster Scenarios , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).

[2]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[3]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[4]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[5]  Ying-Dar Lin,et al.  Extension of RP relocation to PIM-SM multicast routing , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[6]  Jiachen Chen,et al.  Comparison of naming schema in ICN , 2016, 2016 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN).

[7]  Rob H. Bisseling,et al.  Communication balancing in parallel sparse matrix-vector multiplication , 2005 .

[8]  Andrei V. Gurtov,et al.  CIDOR: Content distribution and retrieval in disaster networks for public protection , 2017, 2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[9]  Joel Nishimura,et al.  Restreaming graph partitioning: simple versatile algorithms for advanced balancing , 2013, KDD.

[10]  Bruce Hendrickson,et al.  Partitioning for complex objectives , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[11]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[12]  Luca Foschini,et al.  Balanced Partitions of Trees and Applications , 2012, Algorithmica.

[13]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[14]  Filippo Geraci,et al.  GFS: a Graph-based File System Enhanced with Semantic Features , 2017, ICISDM '17.

[15]  Pekka Nikander,et al.  Developing Information Networking Further: From PSIRP to PURSUIT , 2010, BROADNETS.

[16]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[17]  Arun Venkataramani,et al.  MobilityFirst: a mobility-centric and trustworthy internet architecture , 2014, CCRV.

[18]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[19]  Davide Pesavento,et al.  NFD Developer's Guide , 2014 .

[20]  Alexander Afanasyev,et al.  NDNS: A DNS-Like Name Service for NDN , 2017, 2017 26th International Conference on Computer Communication and Networks (ICCCN).

[21]  George Pavlou,et al.  Name-based replication priorities in disaster cases , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[22]  Roberto Beraldi,et al.  TERA: topic-based event routing for peer-to-peer architectures , 2007, DEBS '07.

[23]  Dennis Shasha,et al.  GraphGrep: A fast and universal method for querying graphs , 2002, Object recognition supported by user interaction for service robots.

[24]  Gabriel Kliot,et al.  Streaming graph partitioning for large distributed graphs , 2012, KDD.

[25]  Laxmikant V. Kale,et al.  Applying graph partitioning methods in measurement-based dynamic load balancing , 2011 .

[26]  Michael J. Donahoo,et al.  Core Migration for Dynamic Multicast Routing , 1995 .

[27]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[28]  Bora Uçar,et al.  Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies , 2004, SIAM J. Sci. Comput..

[29]  Bill Segall,et al.  Content Based Routing with Elvin4 , 2000 .

[30]  George Karypis,et al.  Partitioning Algorithms for Simultaneously Balancing Iterative and Direct Methods , 2004 .

[31]  Carlo Curino,et al.  Schism , 2010, Proc. VLDB Endow..

[32]  K. K. Ramakrishnan,et al.  An information centric approach for communications in disaster situations , 2014, 2014 IEEE 20th International Workshop on Local & Metropolitan Area Networks (LANMAN).

[33]  Yanlei Diao,et al.  Towards an Internet-Scale XML Dissemination Service , 2004, VLDB.

[34]  Manuel Laguna,et al.  Tabu Search , 1997 .

[35]  Jiachen Chen,et al.  CNS: Content-oriented Notification Service for Managing Disasters , 2016, ICN.

[36]  Dipankar Raychaudhuri,et al.  Achieving Scalable Push Multicast Services Using Global Name Resolution , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[37]  Murat Yuksel,et al.  The Evolving Nature of Disaster Management in the Internet and Social Media Era , 2018, 2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN).

[38]  KarypisGeorge,et al.  Multilevelk-way Partitioning Scheme for Irregular Graphs , 1998 .

[39]  Jiachen Chen,et al.  COPSS: An Efficient Content Oriented Publish/Subscribe System , 2011, 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems.

[40]  Jiachen Chen,et al.  G-COPSS: A Content Centric Communication Infrastructure for Gaming Applications , 2011, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[41]  Murat Yuksel,et al.  Cross-layer failure restoration of IP multicast with applications to IPTV , 2011, Comput. Networks.

[42]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[43]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[44]  Claudio Gutiérrez,et al.  Querying RDF Data from a Graph Database Perspective , 2005, ESWC.

[45]  Xin Liu,et al.  Traffic-based Load Balance for Scalable Network Emulation , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[46]  Alexandros Labrinidis,et al.  PARAGON: Parallel Architecture-Aware Graph Partition Refinement Algorithm , 2016, EDBT.

[47]  Jiachen Chen,et al.  Black ice! Using Information Centric Networks for timely vehicular safety information dissemination , 2017, 2017 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN).

[48]  Mark Handley,et al.  Protocol Independent Multicast - Sparse Mode (PIM-SM): Protocol Specification (Revised) , 2016, RFC.

[49]  K. K. Ramakrishnan,et al.  Name-based push/pull message dissemination for disaster message board , 2016, 2016 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN).

[50]  Sergio Greco,et al.  Querying Graph Databases , 2000, EDBT.

[51]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.