Results 261 to 270 of about 81,556 (279)

Scheduling broadcasts in wireless networks

Journal of Scheduling, 2000
We consider problems involving how to schedule broadcasts in a pulled-based data-disseminationservice, such as the DirecPC system, where data requested by the clients is delivered via broadcast. In particular, we consider the case where all the data items are of equal size and preemption is not allowed.
Mahendran Velauthapillai, Kirk Pruhs, Bala Kalyanasundaram   +2 more
openaire   +3 more sources

Broadcasting in wireless networks. [PDF]

, 2001
This work examines the problem of providing reliable broadcast delivery of messages with minimal communication overhead in wireless networks. We consider two types of communication for broadcasting: one-to-all (the classical form of broadcasting where each node forwards the message to all its neighbours with one transmission) and one-to-one (each ...
openaire   +2 more sources

BROADCASTING IN BUS INTERCONNECTION NETWORKS

Journal of Interconnection Networks, 1994
In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point interconnection network, usually modeled by a graph where processors are nodes and communication links are edges. Since interprocessor communication frequently constitutes serious bottlenecks, several architectures were proposed that enhance point-to-point ...
Afonso Ferreira, A. Goldman vel Lejbman, Siang Wun Song   +2 more
openaire   +3 more sources

Minimal broadcast networks

Networks, 1979
AbstractBroadcast refers to the process of information dissemination in a communication network whereby a message, originated by one member, is transmitted to all members of the network. A minimal broadcast network is a communication network in which a message can be broadcast in minimum time regardless of originator.
openaire   +2 more sources

Broadcast in fast networks

Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration, 2002
The current trend in network technology is to implement as much of the switching function as possible directly in specialized high-speed hardware. A broadcast algorithm for such a network that is tolerant of failures in the form of message loss is presented. The model used is based on the one introduced by Cidon et al. (see Proc.
Inder Sarat Gopal, Shay Kutten, Ajei Sarat Gopal   +2 more
openaire   +2 more sources

Broadcasting in Heterogeneous Networks

Algorithmica, 2007
In this paper we study a well-known broadcasting heuristic for heterogeneous networks of workstations, called fastest node first. We show that this heuristic produces an optimal solution for minimizing the sum of all completion times and, in addition, produces a 1.5 approximation for the problem of minimizing the maximum completion time.
Samir Khuller, Yoo-Ah Kim
openaire   +2 more sources

Comments on an Efficient Secret Broadcast in the Broadcasting Networks

IEEE Communications Letters, 2010
To broadcast a message secretly and consistently to the receivers in the broadcasting networks, Jeong et al. suggested an efficient secret broadcast scheme using binding encryption quite recently. In this letter, we first show that their scheme just achieves consistency in a relatively weak security model but not in a stronger model.
Yuefei Zhu, Shuhua Wu, Qiong Pu
openaire   +2 more sources

Broadcasting in the Butterfly network

Information Processing Letters, 1991
Abstract Broadcasting is the process of message dissemination in a communication network in which a message originated by one processor is transmitted to all processors of the network. In this note we consider broadcasting in the Butterfly network.
openaire   +2 more sources

Hierarchical broadcast networks

Information Processing Letters, 1998
Abstract This paper studies the hierarchical broadcast networks, which are defined as broadcast networks whose every connected induced subgraph is also a broadcast network. We show that the minimum number of edges of a hierarchical broadcast network of order n is ⌈ n(n − 2) 2 ⌉ for any n ⩾ 4.
openaire   +2 more sources

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   +3 more sources