The teletraffic/transmission performance of regular two-connected multi-hop cell-switching optical networks in uniform traffic under hybrid store-and-forward is presented. Manhattan Street (MS) Network and ShuffleNet (SN) are compared in terms of average queueing delay, queue size, transit delay, throughput, and bit error rate (BER) for intensity modulatioddirect-detection (IM/DD) both analytic...

Complex bufferless networks such as on-chip networks and optical burst switching networks haven’t been paid enough attention in network science. In complex bufferless networks, the store and forward mechanism is not applicable, since the network nodes are not allowed to buffer data packets. In this paper, we study the data transmission process in complex bufferless networks from the perspective...

This paper introduces a novel privacy-aware geographic routing protocol for Human Movement Networks (HumaNets). HumaNets are fully decentralized opportunistic store-and-forward, delay-tolerate networks composed of smartphone devices. Such networks allow participants to exchange messages phone-to-phone and have applications where traditional infrastructure is unavailable (e.g., during a disaster...

This paper presents a framework for examining joint optimal channel-capacity allocation and controller design for networked control systems using store-and-forward networks in a discrete-time linear time-invariant setting. The resultant framework provides a synthesis procedure for designing distributed linear control laws for capacity-constrained networks taking the allocation of the capacity w...

1. EXTENDED ABSTRACT Delay-tolerant Networking (DTN) [3] has moved a long way from its—for many probably somewhat elite—origin of a technology for an Interplanetary Internet in the late 1990s to an established research discipline. One major contributor to this trend was the observation that quite a few terrestrial networks exhibit delay-tolerant properties, albeit of different nature: from spar...

This paper is a study of one-to-all and all-to-all data movement patterns on cycles and multi-dimensional toroidal meshes that use cut-through (e.g., circuit-switched, wormhole) routing with virtual channels. We present new cut-through algorithms for broadcasting, scattering, gossiping, and multi-scattering on cycles and multi-dimensional torus networks. Our algorithms use virtual channels to i...

The current trend favoring real-time services delivery anywhere at anytime has difficulties to cope with the dynamics of mobile networks. Furthermore, the present Internet network architecture is defeated by environments where links are error prone, intermittent, with high delay and when nodes may disappear unexpectedly. Transport services based on store and forward (such as the Delay/Disruptio...

This paper examines several simple algorithms for routing packets on butterfly networks with bounded queues. We show that for any greedy queuing protocol, a routing problem in which each of the N inputs sends a packet to a randomly chosen output requires O(logN) steps, with high probability, provided that the queue size is a sufficiently large, but fixed, constant. We also show that for any det...

We address the problem of mapping divide-and-conquer programs to mesh connected multicomputers with wormhole or store-and-forward routing. We propose the binomial tree as an eecient model of parallel divide-and-conquer and present two mappings of the binomial tree to the 2D mesh. Our mappings exploit regularity in the communication structure of the divide-and-conquer computation and are also se...

Vehicular ad hoc networks (VANETs) are special case of mobile ad hoc networks (MANETs) with predictable mobility constraints. In VANETs, non real-time applications are appreciated as compared to real time applications because of very frequent network partitions caused by high node mobility. The focus of this paper is on Delay tolerant networks (DTNs). DTNs are special type of networks which fol...