Results 221 to 230 of about 1,869 (260)

Reliable election in broadcast networks

Journal of Parallel and Distributed Computing, 1989
Abstract Election in a computer network is an operation in which one process is selected from among a group of processes to perform a particular task. An election is characterized by (1) the capacities of the candidates, and (2) the agreement reached by all processes to elect the master.
King, Chung-Ta, Gendreau, Thomas B., Ni, Lionel Ming-Shuan   +2 more
openaire   +2 more sources

Broadcast Protocols in Wireless Networks

2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops, 2015
A group of multiple nodes are cooperating with one another in order to achieve some objectives in distributed applications. In this paper, we would like to discuss how to broadcast messages to every node in a group which are interconnected in wireless networks.
Kazuaki Kouno, Dilawaer Duolikun, Tomoya Enokido, Makoto Takizawa 0001   +3 more
openaire   +1 more source

Data transfers in broadcast networks

IEEE Transactions on Computers, 1992
One of the main methods for designing data link protocols in broadcast networks is based on the allocation of transmission rights to nodes in timeslots guaranteeing collision-free access to the channel. Extensions of certain results on vertex coloring are used to establish bounds on the number of timeslots required for a network to finish transmitting ...
Anindo Bagchi, S. Louis Hakimi
openaire   +1 more source

Secure broadcasting in large networks

Computer Communications, 1998
It is common that users or hosts in a large network are partitioned and organized as a hierarchical tree where children of the same parent form a group. Secure broadcasting intends to provide a secure communication channel from a sending principal to a group of legal receiving principals.
Hung-Min Sun, Shiuh-Pyng Shieh
openaire   +1 more source

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

Performing work in broadcast networks

Distributed Computing, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas   +2 more
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, Andrzej Proskurowski   +1 more
openaire   +1 more source