Results 321 to 330 of about 6,185,376 (371)
Some of the next articles are maybe not open access.
Efficient secret broadcast in the broadcasting networks
IEEE Communications Letters, 2009One of the basic problems in the broadcasting networks is a secret broadcast problem. The problem is how to securely send a message to the receivers while guaranteeing consistency. Consistency means that each receiver can assure that all of the receivers have received the same message.
Jeong Ok Kwon +2 more
openaire +2 more sources
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 +3 more sources
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 +3 more sources
Multilevel Broadcast Networks [PDF]
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
Mitchell Trott +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 +3 more sources
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, Gerald M. Masson
openaire +4 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 +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
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
Broadcast Networks of Bounded Degree
SIAM Journal on Discrete Mathematics, 1988Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. Several previous papers have investigated ways to construct sparse graphs (networks) in which this process can be completed in minimum time from any ...
Arthur L. Liestman, Joseph G. Peters
openaire +3 more sources
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 +2 more sources