This paper presents an overview of a real-time network protocol, meant to be used on fully-connected local area networks with a broadcast capability. The intended use of this protocol is an in-home digital network, with support for on-the-fly addition and removal of network nodes, for resource

, an output module, two point-to-point (PTP) modules, and one modified multicast/broadcast (M/B) module(s). We also implement the multicast/broadcast module with WDM technique, which reduces the hardware cost required for multicast and the re-computation cost for a new connection. We show that it has the best

must be capable of unicast, broadcast, and multicast. In this paper we extend Ad-hoc On-Demand Distance Vector Routing (AODV), an algorithm for the operation of such ad-hoc networks, to offer novel multicast capabilities which follow naturally from the way AODV establishes unicast routes. AODV builds

and of processor failures and joins. The contribution of this paper is in providing an aggregate definition of communication and control services over broadcast domains. The main benefit is the efficient implementation of these services using the broadcast capability. In addition, the membership algorithm has a

objects while disconnected and propagate the updates to the server upon reconnection for conflict resolutions. We investigate two algorithms applicable to mobile systems in which invalidation reports/data can be broadcast to mobile hosts periodically. We show that there exists an optimal broadcasting

Large-scale distributed sharedmemory multiprocessors (DSMs) provide a shared address space by physically distributing the memory among different processors. 1 A fundamental DSM communication problem that significantly affects scalability is an increase in remote memory latency as the number of system nodes increases. Remote memory latency, caused by accessing a memory location in a processor other than the one originating the request, includes both communication latency and remote memory access latency over I/O and memory buses. This long latency can degrade overall system performance by as much as 50 percent. 1 Although DSM systems frequently use 0272-1732/05/$20.00 © 2005 IEEE Published by the IEEE computer Society latency-tolerating or latency-hiding techniques to reduce remote latency, these techniques require extra bandwidth and greatly increase memory traffic by fetching more data than needed. 1 Moreover, as Figure 1a shows, the increasing performance gap between processor and off-chip clock rates further deteriorates DSM system performance. As seen in Figure 1a, the CPU bandwidth is computed by multiplying the expected increase in clock rates with the speed of L2 cache data access rate. The projected CPU, serial off-chip, memory and I/O speeds were obtained from the

of examples. MACH is capable of capturing intra-class variability by synthesizing a single Action MACH filter for a given action class. We generalize the traditional MACH filter to video (3D spatiotemporal volume), and vector valued data. By analyzing the response of the filter in the frequency domain, we

to be proposed, in order to make this transition smooth. In this paper we propose a novel DAB platform that embodies FM, AM and Internet broadcasting capabilities, and is moreover designed such that it can include new broadcasting standards in the future.

-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast

. A possible implementation of this operation could use the native multicast capability of the underlying interconnection network if this is supported (e.g. Ethernet and InfiniBand). Contrary to the specified reliable data delivery of MPI_Bcast(), multicast does normally only support unreliable data