Showing papers on "Communications protocol published in 2010"

Relay device for transferring information between a sensor system and a fluid delivery system

Abstract: A relay device transfers information between a sensor system, which measures a physiological characteristic level of a user, and a fluid delivery system, which infuses a fluid into a user. The relay device includes a sensor system receiver for receiving communications from the sensor system in a sensor system format. The relay device also includes a processor for processing the communications from the sensor system and converting the communications for transmission in a delivery system format. The relay device further includes a delivery system transmitter for transmitting the converted communications in the delivery system format to the fluid delivery system. The sensor system and delivery system formats may utilize different frequencies and/or different communication protocols for communications transmitted between the sensor system and the fluid delivery system through the relay device.

SNAIL: an IP-based wireless sensor network approach to the internet of things

Abstract: Recent technological progress has been materializing the Internet of Things (IoT), which is breathing new computational and communicational capability into anything in everyday life. An important step toward the IoT would be to facilitate suitable wireless sensor network technologies based on a verified standard protocol, the Internet Protocol, to support the network of things. An increase in research efforts has led to maturity in this field, yet there seem to be gaps to be filled because of the focus on how to adapt the IP to the space of things. This article introduces the Sensor Networks for an All-IP World (SNAIL) approach to the IoT. The proposed architecture includes a complete IP adaptation method. It also includes four significant network protocols: mobility, web enablement, time synchronization, and security. The feasibility and interoperability of the proposed approach is confirmed by the implementation of SNAIL platforms and tests on a testbed built in the Korea Advanced Research Network.

On SCADA control system command and response injection and intrusion detection

Abstract: SCADA systems are widely used in critical infrastructure sectors, including electricity generation and distribution, oil and gas production and distribution, and water treatment and distribution. SCADA process control systems are typically isolated from the internet via firewalls. However, they may still be subject to illicit cyber penetrations and may be subject to cyber threats from disgruntled insiders. We have developed a set of command injection, data injection, and denial of service attacks which leverage the lack of authentication in many common control system communication protocols including MODBUS, DNP3, and EtherNET/IP. We used these exploits to aid in development of a neural network based intrusion detection system which monitors control system physical behavior to detect artifacts of command and response injection attacks. Finally, we present intrusion detection accuracy results for our neural network based IDS which includes input features derived from physical properties of the control system.

Network scanner for global document creation, transmission and management

Abstract: A network scanner, communication protocols, and client and server programs and are provided which provide an improved way to transmit legally binding documents, obviating the need for outmoded, legacy fax transmissions. Using the network scanner, a document may be scanned and transferred directly into any shared folder inbox residing on any computer attached to the Internet. Enhanced server systems and network communications and messaging protocols are provided that are more practical to use than email for sending documents such as executed legal documents or other documents requiring robust integrity and authenticatability. Similarly, the inventive network scanner, server systems and communication protocols provide improved ways to perform large file transfers and to manage bandwidth to minimize problems associated with uploading/downloading large files as attachments to/from email servers and for enabling user control over VoIP quality during file transmission sessions.

Efficient querying and maintenance of network provenance at internet-scale

Abstract: Network accountability, forensic analysis, and failure diagnosis are becoming increasingly important for network management and security. Such capabilities often utilize network provenance - the ability to issue queries over network meta-data. For example, network provenance may be used to trace the path a message traverses on the network as well as to determine how message data were derived and which parties were involved in its derivation. This paper presents the design and implementation of ExSPAN, a generic and extensible framework that achieves efficient network provenance in a distributed environment. We utilize the database notion of data provenance to "explain" the existence of any network state, providing a versatile mechanism for network provenance. To achieve such flexibility at Internet-scale, ExSPAN uses declarative networking in which network protocols can be modeled as continuous queries over distributed streams and specified concisely in a declarative query language. We extend existing data models for provenance developed in database literature to enable distribution at Internet-scale, and investigate numerous optimization techniques to maintain and query distributed network provenance efficiently. The ExSPAN prototype is developed using RapidNet, a declarative networking platform based on the emerging ns-3 toolkit. Experiments over a simulated network and an actual deployment in a testbed environment demonstrate that our system supports a wide range of distributed provenance computations efficiently, resulting in significant reductions in bandwidth costs compared to traditional approaches.

Region-Based Location-Service-Management Protocol for VANETs

Abstract: The efficiency by which a node of a vehicular ad hoc network (VANET) can route messages to destinations heavily depends on the VANET's ability to keep track of the locations of its nodes (vehicles). Current location-management schemes lack scalability and, hence, are proven unable to work in large-scale networks. Therefore, location management in VANETs remains a major challenge. In this paper, we propose a new region-based location-service-management protocol (RLSMP) that uses mobility patterns as means to synthesize node movement and, thus, can be used in large VANET applications. The protocol attempts to relax the scalability issue suffered by other protocols by employing message aggregation in location updating and in querying. Furthermore, due to the protocol's intrinsic locality awareness, it achieves minimum control overhead. To evaluate the efficiency of the protocol, we study its performance analytically and by using simulation for a 2-D random-walk model, as well as on real mobility patterns. The performance of the protocol is compared with that of other prominent location-management protocols.

Modbus/DNP3 State-Based Intrusion Detection System

Abstract: The security of Industrial Critical Infrastructures is become a prominent problem with the advent of modern ICT technologies used to improve the performances and the features of the SCADA systems. In this paper we present an innovative approach to the design of Intrusion Detection Systems. The aim is to be able to detect complex attacks to SCADA systems, by monitoring its state evolution. By complex attack, we mean attacks composed of a set of commands that, while licit when considered in isolation on a single-packet basis, can disrupt the correct behavior of the system when executed in particular operating states. The proposed IDS detects these complex attacks thanks to an internal representation of the controlled SCADA system. We also present the corresponding rule language powerful enough to express the system’s critical states. Furthermore, we present a prototype of the proposed IDS, able to monitor systems using the ModBus and DNP3 communication protocols.

Device assisted cdr creation, aggregation, mediation and billing

Abstract: Device assisted CDR creation, aggregation, mediation and billing is provided. In some embodiments, device assisted CDR creation, aggregation, mediation and billing for a wireless network includes collecting device generated service usage information for one or more devices in wireless communication on the wireless network; and providing the device generated service usage information in a syntax (e.g., a device assisted charging data record (CDR)) and a communication protocol (e.g., 3GPP, 3GPP2, or other communication protocols) that can be used by other network devices to augment or replace network generated service usage information for the one or more devices in wireless communication on the wireless network.

Whisker: a client-server high-performance multimedia research control system

Abstract: We describe an original client-server approach to behavioral research control and the Whisker system, a specific implementation of this design. The server process controls several types of hardware, including digital input/output devices, multiple graphical monitors and touchscreens, keyboards, mice, and sound cards. It provides a way to access this hardware for client programs, communicating with them via a simple text-based network protocol based on the standard Internet protocol. Clients to implement behavioral tasks may be written in any network-capable programming language. Applications to date have been in experimental psychology and behavioral and cognitive neuroscience, using rodents, humans, nonhuman primates, dogs, pigs, and birds. This system is flexible and reliable, although there are potential disadvantages in terms of complexity. Its design, features, and performance are described.

Designing Network Protocols for Good Equilibria

Abstract: Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol to optimize the equilibrium behavior of a network with selfish users. We consider network cost-sharing games, where the set of Nash equilibria depends fundamentally on the choice of an edge cost-sharing protocol. Previous research focused on the Shapley protocol, in which the cost of each edge is shared equally among its users. We systematically study the design of optimal cost-sharing protocols for undirected and directed graphs, single-sink and multicommodity networks, and different measures of the inefficiency of equilibria. Our primary technical tool is a precise characterization of the cost-sharing protocols that induce only network games with pure-strategy Nash equilibria. We use this characterization to prove, among other results, that the Shapley protocol is optimal in directed graphs and that simple priority protocols are essentially optimal in undirected graphs.

SwitchBlade: a platform for rapid deployment of network protocols on programmable hardware

Abstract: We present SwitchBlade, a platform for rapidly deploying custom protocols on programmable hardware. SwitchBlade uses a pipeline-based design that allows individual hardware modules to be enabled or disabled on the fly, integrates software exception handling, and provides support for forwarding based on custom header fields. SwitchBlade's ease of programmability and wire-speed performance enables rapid prototyping of custom data-plane functions that can be directly deployed in a production network. SwitchBlade integrates common packet-processing functions as hardware modules, enabling different protocols to use these functions without having to resynthesize hardware. SwitchBlade's customizable forwarding engine supports both longest-prefix matching in the packet header and exact matching on a hash value. SwitchBlade's software exceptions can be invoked based on either packet or flow-based rules and updated quickly at runtime, thus making it easy to integrate more flexible forwarding function into the pipeline. SwitchBlade also allows multiple custom data planes to operate in parallel on the same physical hardware, while providing complete isolation for protocols running in parallel. We implemented SwitchBlade using NetFPGA board, but SwitchBlade can be implemented with any FPGA. To demonstrate SwitchBlade's flexibility, we use SwitchBlade to implement and evaluate a variety of custom network protocols: we present instances of IPv4, IPv6, Path Splicing, and an OpenFlow switch, all running in parallel while forwarding packets at line rate.

Accessory and mobile computing device communication using an application communication protocol

Abstract: Embodiments of the present invention provide various communication techniques for communication between a mobile computing device and an accessory. An accessory protocol that is generic to the mobile computing device can be used for some communication. An application executing at the mobile computing device can communicate with the accessory using an application communication protocol. In some embodiments, the application communication protocol can be different from the accessory communication protocol. In other embodiments the application protocol may only be recognized by the application and the accessory. In some embodiments, messages conforming to an application protocol can be communicated between the application and the accessory by packaging the messages inside a message conforming to the accessory communication protocol.

Generating models of infinite-state communication protocols using regular inference with abstraction

Abstract: In order to facilitate model-based verification and validation, effort is underway to develop techniques for generating models of communication system components from observations of their external behavior. Most previous such work has employed regular inference techniques which generate modest-size finite-state models. They typically suppress parameters of messages, although these have a significant impact on control flow in many communication protocols. We present a framework, which adapts regular inference to include data parameters in messages and states for generating components with large or infinite message alphabets. A main idea is to adapt the framework of predicate abstraction, successfully used in formal verification. Since we are in a black-box setting, the abstraction must be supplied externally, using information about how the component manages data parameters. We have implemented our techniques by connecting the LearnLib tool for regular inference with the protocol simulator ns-2, and generated a model of the SIP component as implemented in ns-2.

The autonomic network architecture (ANA)

Abstract: The objective of autonomic networking is to enable the autonomous formation and parametrization of nodes and networks by letting protocols sense and adapt to the networking environment at run time. Besides its dynamic aspects, a core requirement of autonomic networking is to define a structured framework and execution environment that enables algorithms to operate in a continously changing environment. This paper presents the major design principles of the Autonomic Network Architecture (ANA) and reports on a first implementation. The guiding principle of ANA is to strive for flexibility and genericity at all levels of the architecture. In our approach we explicitly avoid to impose a "one-size-fits-all" architecture (where communication protocols and paradigms are fixed by the architecture). To this end, ANA introduces generic abstractions, for example "information dispatch points" instead of addressable endpoints, as well as communication primitives that support network heterogeneity, adaptability, and evolution. These core abstractions allow for the coexistance of multiple and diverse networking styles and protocols. With the public release of the ANA prototype, we aim at federating autonomics related networking projects, enabling different actors to share, compare, and build upon each other?s work. The ANA runtime can host clean slate network designs as well as legacy Internet technology and serves as a platform for demonstrating autonomic communication principles.

Selective Jamming Attacks in Wireless Networks

Abstract: We address the problem of selective jamming attacks in wireless networks. In these attacks, the adversary selectively targets specific packets of "high" importance by exploiting his knowledge on the implementation details of network protocols at various layers of the protocol stack. We illustrate the impact of selective jamming on the network performance by illustrating various selective attacks against the TCP protocol. We show that such attacks can be launched by performing real-time packet classification at the physical layer. We examine the combination of cryptographic primitives with physical layer attributes for preventing real- time packet classification and neutralizing the inside knowledge of the attacker.

SenseCode: Network coding for reliable sensor networks

Abstract: Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such implemented protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information into the network, thereby decreasing end-to-end packet error rate in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it reduces end-to-end packet error rate in highly dynamic environments, while consuming a comparable amount of network resources. We have implemented SenseCode as a TinyOS module and evaluate it through extensive TOSSIM simulations.

AutoFuzz: Automated Network Protocol Fuzzing Framework

Abstract: Assessing software security involves steps such as code review, risk analysis, penetration testing and fuzzing. During the fuzzing phase, the tester‟s goal is to find flaws in software by sending unexpected input to the target application and monitoring its behavior. In this paper we introduce the AutoFuzz [1] extendable, open source framework used for testing network protocol implementations. AutoFuzz is a „smart‟, man-in-themiddle, semi-deterministic network protocol fuzzing framework. AutoFuzz learns a protocol implementation by constructing a Finite State Automaton (FSA) which captures the observed communications between a client and a server [5]. In addition, AutoFuzz learns individual message syntax, including fields and probable types, by applying the bioinformatics techniques of [2]. Finally, AutoFuzz can fuzz client or server protocol implementations by intelligently modifying the communication sessions between them using the FSA as a guide. AutoFuzz was applied to a variety of File Transfer Protocol (FTP) server implementations, confirming old and discovering new vulnerabilities.

Trust Management for Encounter-Based Routing in Delay Tolerant Networks

Abstract: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only quality-of-service (QoS) trust properties (connectivity) but also social trust properties (honesty and unselfishness) to evaluate other nodes encountered. Two versions of trust management protocols are considered: an equal-weight QoS and social trust management protocol (called trust-based routing) and a QoS only trust management protocol (called connectivity-based routing). By utilizing a stochastic Petri net model describing a DTN behavior, we analyze the performance characteristics of these two routing protocols in terms of message delivery ratio, latency, and message overhead. We also perform a comparative performance analysis with epidemic routing for a DTN consisting of heterogeneous mobile nodes with vastly different social and networking behaviors. The results indicate that trust-based routing approaches the ideal performance of epidemic routing in delivery ratio, while connectivity-based routing approaches the ideal performance in message delay of epidemic routing, especially as the percentage of selfish and malicious nodes present in the DTN system increases. By properly selecting weights associated with QoS and social trust metrics for trust evaluation, our trust management protocols can approximate the ideal performance obtainable by epidemic routing in delivery ratio and message delay without incurring high message overhead.

A Smart Gateway for Health Care System Using Wireless Sensor Network

Abstract: Using Wireless Sensor Networks (WSNs) in health care system has yielded a tremendous effort in recent years. However, in most of these researches, tasks like sensor data processing, health state decisions making and emergency messages sending are completed by a remote server. Transmitting and handing with a large scale of data from body sensors and home sensors consume a lot of communication resource, bring a burden to the remote server and delay the decision time and notification time. In this paper, we present a prototype of a smart gateway that we have implemented. This gateway is an interconnection and services management platform especially for WSN health care systems at home environment. By building a bridge between a WSN and public communication networks, and being compatible with an on-board data decision system and a lightweight database, our smart gateway system is enabled to make patients' health state decisions in low-power and low-cost embedded system and get faster response time o the emergencies. We have also designed the communication protocols between WSN, gateway and remote servers. Additionally Ethernet, Wi-Fi and GSM/GPRS communication module are integrated into the smart gateway in order to report and notify information to care-givers. We have conducted experiments on the proposed smart gateway by performing it together with a wireless home e-health care sensor network. The results show that the smart gateway design is feasible and has low latency.

MaxMAC: a maximally traffic-adaptive MAC protocol for wireless sensor networks

Abstract: Energy efficiency is a major concern in the design of Wireless Sensor Networks (WSNs) and their communication protocols. As the radio transceiver typically accounts for a major portion of a WSN node’s power consumption, researchers have proposed Energy-Efficient Medium Access (E2-MAC) protocols that switch the radio transceiver off for a major part of the time. Such protocols typically trade off energy-efficiency versus classical quality of service parameters (throughput, latency, reliability). Today’s E2-MAC protocols are able to deliver little amounts of data with a low energy footprint, but introduce severe restrictions with respect to throughput and latency. Regrettably, they yet fail to adapt to varying traffic load at run-time. This paper presents MaxMAC, an E2-MAC protocol that targets at achieving maximal adaptivity with respect to throughput and latency. By adaptively tuning essential parameters at run-time, the protocol reaches the throughput and latency of energy-unconstrained CSMA in high-traffic phases, while still exhibiting a high energy-efficiency in periods of sparse traffic. The paper compares the protocol against a selection of today’s E2-MAC protocols and evaluates its advantages and drawbacks.

Castor: Scalable Secure Routing for Ad Hoc Networks

Abstract: Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that addresses simultaneously three aspects: security, scalability and adaptability to changing network conditions. Our communication protocol, Castor, occupies a unique point in the design space: it does not use any control messages except simple packet acknowledgments, and each node makes routing decisions locally and independently without exchanging any routing state with other nodes. Its novel design makes Castor resilient to a wide range of attacks and allows the protocol to scale to large network sizes and to remain efficient under high mobility. We compare Castor against four representative protocols from the literature. Our protocol achieves up to two times higher packet delivery rates, particularly in large and highly volatile networks, while incurring no or only limited additional overhead. At the same time, Castor is able to survive more severe attacks and recovers from them faster.

Cross layer design for mobile Ad-Hoc Unmanned Aerial Vehicle communication networks

Abstract: A Mobile Ad-Hoc Network (MANET) is a popular type of wireless network that is formed by a collection of mobile nodes. Each node in such network has the capability to communicate with its neighbors and non-neighbors through a wireless medium without using any existing network infrastructure. Due to the lack of infrastructure, all nodes in Ad-Hoc network are designed to act as an end system and a router for other nodes. Traditionally, the dominant design methodology for the network protocols is based on an Open Systems Interconnection (OSI) reference model. This methodology divided the stack into seven layers where each layer operates independently. Due to the dynamics of the Unmanned Aerial Vehicle (UAV) Ad-Hoc network, the layered architecture is not flexible enough to achieve certain quality of services (QoS) required by some applications. To overcome the limitations of the layering technique, cross-layering approach is used in this paper so to adjust some key parameters in the first three layers based on the aircraft attitude variations (pitch, roll and yaw), hence we can enhance the performance of such networks. To that respect, directional antenna is going to be used by the UAVs to extend the coverage area and reduce the number of hops. Meanwhile, we designed a new Medium Access Control (MAC) scheme that adapts its parameters based on the channel bit error rate which is indeed affected by the new antenna system and aircraft attitude. we called this scheme Intelligent Medium Access Control Protocol for Unmanned Aerial Vehicle (IMAC UAV). As for the routing protocol, We developed the Optimized Link State Routing Protocol (OLSR) so that the decision for selecting the route will be based on a local profile that holds the gathered information from the first three layers. Our new scheme is called Directional Optimized Link State Routing Protocol (DOLSR). We proved by OPNET simulator that our proposed techniques gave better end-to-end delay than the IEEE802.11 standard.

IP routing processing with graphic processors

Abstract: Throughput and programmability have always been the central, but generally conflicting concerns for modern IP router designs. Current high performance routers depend on proprietary hardware solutions, which make it difficult to adapt to ever-changing network protocols. On the other hand, software routers offer the best flexibility and programmability, but could only achieve a throughput one order of magnitude lower. Modern GPUs are offering significant computing power, and its data-parallel computing model well matches the typical patterns of packet processing on routers. Accordingly, in this research we investigate the potential of CUDA-enabled GPUs for IP routing applications. As a first step toward exploring the architecture of a GPU based software router, we developed GPU solutions for a series of core IP routing applications such as IP routing table lookup and pattern match. For the deep packet inspection application, we implemented both a Bloom-filter based string matching algorithm and a finite automata based regular expression matching algorithm. A GPU based routing table lookup solution is also proposed in this work. Experimental results proved that GPU could accelerate the routing processing by one order of magnitude. Our work suggests that, with proper architectural modifications, GPU based software routers could deliver significant higher throughput than previous CPU based solutions.

Netlog, a rule-based language for distributed programming

Abstract: We propose a rule-based language, Netlog, to express distributed applications such as communication protocols or P2P applications in a declarative manner. The language extends Datalog with communication primitives, as well as aggregation and non-deterministic constructs, standard in network applications. Our contribution is twofold. First we define a sound distributed fixpoint semantics, which takes explicitly into account the in-node behavior as well as the communication between nodes, and solves semantic problems raised in declarative networking. Second, we show that syntactic restrictions over the programs can ensure polynomial bounds on the complexity (time and message) of the distributed execution. The language has been implemented and runs over a virtual machine, Netquest, which relies on a DBMS. Netlog programs are partly compiled into SQL queries, which makes them portable over heterogeneous architecture.

HIMALIS: Heterogeneity Inclusion and Mobility Adaptation through Locator ID Separation in New Generation Network

Abstract: The current Internet is not capable of meeting the future communication requirements of society, i.e., reliable connectivity in a ubiquitous networking environment. The shortcomings of the Internet are due to the lack of support for mobility, multihoming, security and heterogeneous network layer protocols in the original design. Therefore, to provide ubiquitous networking facilities to the society for future innovation, we have to redesign the future Internet, which we call the New Generation Network. In this paper, we present the Heterogeneity Inclusion and Mobility Adaptation through Locator ID Separation (HIMALIS) architecture for the New Generation Network. The HIMALIS architecture includes a new naming scheme for generating host names and IDs. It also includes a logical control network to store and distribute bindings between host names, IDs, locators and other information useful for providing support for network operation and control. The architecture uses such information to manage network dynamism (i.e., mobility, multihoming) and heterogeneity in network layer protocols. We verify the basic functions of the architecture by implementing and testing them using a testbed system.

Reliable multi-hop communication for structural health monitoring

Abstract: Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

Scalable communication protocols for dynamic sparse data exchange

Abstract: Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such programs may involve all (or large numbers) of the participating processes, the actual communication operations are usually sparse in nature. As a result, communication phases are typically expressed explicitly using point-to-point communication operations or collective operations. We define the dynamic sparse data-exchange (DSDE) problem and derive bounds in the well known LogGP model. While current approaches work well with static applications, they run into limitations as modern applications grow in scale, and as the problems that are being solved become increasingly irregular and dynamic.To enable the compact and efficient expression of the communication phase, we develop suitable sparse communication protocols for irregular applications at large scale. We discuss different irregular applications and show the sparsity in the communication for real-world input data. We discuss the time and memory complexity of commonly used protocols for the DSDE problem and develop NBX--a novel fast algorithm with constant memory overhead for solving it. Algorithm NBX improves the runtime of a sparse data-exchange among 8,192 processors on BlueGene/P by a factor of 5.6. In an application study, we show improvements of up to a factor of 28.9 for a parallel breadth first search on 8,192 BlueGene/P processors.