We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the general instance of many-to-one routing where each node is the source (resp., destination) of ` (resp., k) packets, for arbitrary values of ` and k. All our algorithms run in optimal O (√ `kn ) time and use queues of on...

Given integers n ≥ 7 and a,b,c with 1 ≤ a,b,c ≤ n − 1 such that a,n − a,b,n − b,c,n − c are pairwise distinct, the (undirected) triple-loop network TLn(a,b,c) is the degree-six graph with vertices 0, 1, 2, . . . ,n − 1 such that each vertex x is adjacent to x ± a, x ± b, and x ± c, where the operation is modulo n. It is known that the maximum order of a connected triple-loop network of the form...

Telemedicine is the use of telecommunications technology to provide medical information and services. It may be as simple as two health professionals discussing a case over the telephone, or as sophisticated as using satellite technology to broadcast a consultation between providers at facilities in two countries, using videoconferencing equipment. The first is used daily by most health profess...

The advent of mobile IP communication has opened up several new areas of mission critical communication applications. But the bandwidth and reliability constraints coupled with handover latency are posing some hurdles which need to be overcome before real world mobile IP applications, with low tolerance for data loss, can be deployed. In this paper, we analyze the unreliability of existing info...

This paper introduces the concept of Virtual Access Points (VAPs) for wireless Vehicular Ad-hoc Networks (VANETS). This new technique allows data dissemination among vehicles, thus extending the reach of roadside access points to uncovered road areas. Each vehicle that receives a message from an Access Point (AP) stores this message and rebroadcasts it into non covered areas. This extends the n...

This survey summarizes the state-of-the-art research on network coding, mainly focusing on its applications to computer networking. Network coding generalizes traditional store-and-forward routing techniques by allowing intermediate nodes in networks to encode several received packets into a single coded packet before forwarding. Network coding was proposed in 2000, and since then, it has been ...

We present nearly tight bounds f o r wormhole routing on Butterfly networks which indicate it is fundamentally different from store-and-forward packet routing. For instance, consider the problem of routing N log N (randomly generated) log N length messages from the inputs to the outputs of an N input Butterfly. We show that with high probability that this must take time at least fl(10g3 N/(logl...

We consider the problem of routing broadcast messages in a loosely-coupled . store-and-forward network like the ARPANET. Dalal [2] discussed a solution to this problem that minimizes the cost of a broadcast; in contrast, we are interested in performing broadcast with small delay. Existing algorithms can minimize the delay but seem unsuitable for use in a distributed environment because they inv...

A Frobenius group is a permutation group which is transitive but not regular such that only the identity element can fix two points. It iswell known that such a group is a semidirect productG = KoH , where K is a nilpotent normal subgroup of G. A second-kind GFrobenius graph is a Cayley graph Γ = Cay(K , aH ∪ (a−1)H) for some a ∈ K with order ≠ 2 and ⟨aH⟩ = K , where H is of odd order and xH de...

Store-and-forward had been the predominant technique for transmitting information through a network until its optimality was refuted by network coding theory. Network coding offers a new paradigm for network communications and has generated abundant research interest in information and coding theory, networking, switching, wireless communications, cryptography, computer science, operations rese...