Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP -complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown

We analyze the optimization framework for rate allocation problem proposed by Kelly and characterize the oscillations in terms of underlying map's period two orbit in the instability regime with arbitrary communication delay. We show the oscillations can be fairly large by computing the bounds

Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University

We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property

The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme

The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols

In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or

the requirements for Internet host software. This RFC covers the communications protocol layers: link layer, IP layer, and transport layer; its companion RFC-1123 covers the application and support protocols.

We show that a greedy algorithm for scheduling unit time jobs on two machines with unit communication delays produces an optimal schedule when the precedence constraints are given by a rooted forest. We also give a min/max relationship for the length of such a schedule. The min/max result (for

processing, baseband processing, diversity, estimation and detection, fade mitigation, maximalratio combining, Rayleigh fading, smart antennas, space block coding, space–time coding, transmit diversity, wireless communications. I.