Results 311 to 320 of about 89,894 (342)
Some of the next articles are maybe not open access.

Nonblocking broadcast switching networks

IEEE Transactions on Computers, 1991
Results are presented for nonblocking multistage broadcast networks wherein a request from an idle input port to be connected to some set of idle output ports can be satisfied without any disturbance of other broadcast connections already existing in the network.
Yuanyuan Yang 0001, Gerald M. Masson
openaire   +1 more source

An efficient heuristic for broadcasting in networks

Journal of Parallel and Distributed Computing, 2006
In this paper, we present a heuristic for broadcasting in arbitrary networks. This heuristic generates optimal broadcast time for ring, tree and grid graphs when the originator is a corner vertex. In practice, the new heuristic outperforms the best known broadcast algorithms for three different network models.
Hovhannes A. Harutyunyan, Bin Shao
openaire   +1 more source

Implementation of eventcounts in a broadcast network

Computer Networks (1976), 1980
Abstract Eventcounts and sequencers are synchronization mechanisms, comparable to semaphores and mutual exclusion respectively. Both are amenable to implementation in computer networks. In this paper their definitions and uses are reviewed, then a robust implementation of both is developed for a local network with reliable broadcast capability.
Kenneth Bullis, William R. Franta
openaire   +1 more source

Optimal assignments in broadcast networks

IEEE Transactions on Computers, 1988
A program whose execution is distributed among several processors in a broadcast system has a total execution cost equal to the sum of processor costs and communication costs, which are functions of the amount of data transmitted and the average transmission delays.
openaire   +1 more source

Concurrent transmissions in broadcast networks

1984
A linear time algorithm for determining the maximal number of collision-free transmissions in an arbitrary series-parallel network is developed. The method operates by a recursive contraction of the network to a single edge; during this contraction process, information is retained concerning each of the subnetworks which has been eliminated.
Charles J. Colbourn   +1 more
openaire   +1 more source

On the number of broadcast schemes in networks

Information Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Asynchronous Broadcast in Radio Networks

2004
We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node. The timing of arrivals of messages is controlled by adversaries. We consider three different adversaries.
Bogdan S. Chlebus, Mariusz A. Rokicki
openaire   +1 more source

Unified broadcast in sensor networks.

2011
Complex sensor network applications include multiple services such as collection, dissemination, time synchronization, and failure detection protocols. Many of these protocols require local state maintenance through periodic broadcasts which leads to high control overhead.
Tranberg Hansen, Morten   +2 more
openaire   +3 more sources

A new broadcast switching network

IEEE Transactions on Communications, 1988
A rearrangeable broadcast switching network is proposed. Under the condition that the number of outlets (customers) is much larger that the number of source inlets (video channels), the network normally has fewer switching nodes than other approaches.
openaire   +2 more sources

Home - About - Disclaimer - Privacy