This paper develops the theoretical background for the design of deadlock-free adaptive routing algorithms for virtual cut-through and store-and-forward switching. This theory is valid for networks using either central buffers or edge buffers. Some basic definitions and three theorems are proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are ...

A number of key decisions made in tile design of the ARPA Network over a five-year period serve as the context for an analysis of the fundamental properties and requirements of packet-switching networks and formulation of the fundamenta' criteria for evaluating network performance. The decisioas described fall into the thr,ee major areas of network equipment design, store-and-forward subnetwork...

Infrastructure less communication strategies have greatly evolved and found its way to most of our real life applications like sensor networks, terrestrial communications, military communications etc. The communication pattern for all these scenarios being identical i.e. encounter based communication; characteristics of each communication domain are distinct. Hence the protocols applied for eac...

A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to (2n 2) node failures. Compared to the optimal algorithm in a fault-free k-ary n-cube, the proposed algorithm requires at most 3 extra communication steps in the case of cut through packet routing and (n + 1) extra steps in the case of store-and-forward routing. Conditions un...

In Orissa state, India, the DakNet system supports asynchronous Internet communication between an urban hub and rural nodes. DakNet is noteworthy in many respects, not least in how the system leverages existing transport infrastructure. Wi-Fi transceivers mounted on local buses send and receive user data from roadside kiosks, for later transfer to/from the Internet via wireless protocols. This ...

This work addresses the need for high quality, very low bit rate speech compression algorithms that can be utilised in many forthcoming multimedia applications. The speech coding algorithm proposed in this paper is a variable rate system based on the adaptive source-driven frame length scheme. Maximum speech compression is achieved for long-term steady-state speech and nonspeech (silence and un...

The paper presents the concept of the wireless sensor network dedicated to smart home applications. The innovative characteristic of this network is related to its use for information transfer and routing of selected sensors that simultaneously serve as Access Points and network clients. As a result, we obtain an alternative for the popular solutions based on AdHoc idea. Network traffic creates...

This paper presents a framework to design fully-adaptive, deadlock-free wormhole algorithms for a variety of network topologies. The main theoretical contributions are (a) design of new wormhole algorithms using store-and-forward algorithms, (b) a sufficient condition for deadlock free routing by the wormhole algorithms so designed, and (c) a sufficient condition for deadlock free routing by th...

We study the problem of online packet routing in dynamic store-and-forward directed line networks. We present a centralized randomized online algorithm that achieves a throughput that is O(log n)-competitive, where n denotes the number of nodes. Our algorithm is applicable to all values of buffer sizes and communication link capacities. In particular, it holds also for unit buffers. This algori...

This paper takes a critical look at the following three maxims. 1. Parallel architecture is converging on a design based on commodity microprocessor chips. 2. Wormhole routing is decidedly more eecient than store-and-forward routing. 3. The PRAM is an unrealistically ideal model of computation.