Results 291 to 300 of about 89,894 (342)
Some of the next articles are maybe not open access.
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.
Ajei S. Gopal +2 more
openaire +1 more source
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.
Ajei S. Gopal +2 more
openaire +1 more source
2007 IEEE International Symposium on Information Theory, 2007
This paper is eligible for the student paper award. We formulate a broadcast problem, where based on their quality of observations, outputs at various receivers are represented on a graph (called "degradation graph"). If receiver Z is a physically degraded version of receiver Y, then node Z is a child of node Y in this graph. This generalization of the
Shashi Borade +2 more
openaire +1 more source
This paper is eligible for the student paper award. We formulate a broadcast problem, where based on their quality of observations, outputs at various receivers are represented on a graph (called "degradation graph"). If receiver Z is a physically degraded version of receiver Y, then node Z is a child of node Y in this graph. This generalization of the
Shashi Borade +2 more
openaire +1 more source
Randomized broadcast in networks
Random Structures & Algorithms, 1990AbstractIn this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.
Uriel Feige +3 more
openaire +1 more source
Broadcasting in Heterogeneous Networks
Algorithmica, 2007In 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 +1 more source
On the construction of minimal broadcast networks
Networks, 1989AbstractBroadcast is the task of transmitting a message originated at a node in a network to all the other nodes. In this paper, we consider the problem of constructing minimal broadcast networks, that is, communication networks such that broadcast can be performed, from any node, in minimum time.
GARGANO, Luisa, VACCARO, Ugo
openaire +4 more sources
Comments on an Efficient Secret Broadcast in the Broadcasting Networks
IEEE Communications Letters, 2010To 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.
Shuhua Wu, Yuefei Zhu, Qiong Pu
openaire +1 more source
Broadcast ring sandwich networks
IEEE Transactions on Computers, 1995Summary: We present a constructive design of a new class of cascaded network structures for broadcast applications called ring sandwich networks. These ring sandwich networks are rearrangeable in the sense that a request for a connection between a sender and a receiver can sometimes be realized only by first rearranging other existing connection paths ...
Yuanyuan Yang 0001, Gerald M. Masson
openaire +2 more sources
BROADCASTING IN BUS INTERCONNECTION NETWORKS
Journal of Interconnection Networks, 1994In 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 +2 more
openaire +1 more source
Broadcasting in the Butterfly network
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Scheduling broadcasts in wireless networks
Journal of Scheduling, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bala Kalyanasundaram +2 more
openaire +1 more source

