✦ LIBER ✦

Minimal path broadcast networks

✍ Scribed by Arthur M. Farley

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 210 KB
Volume: 43
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for constructing minimal c-

An algorithm for constructing minimal c-broadcast networks

✍ Shiwoo Lee; José A. Ventura 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

Scheduling in broadcast networks

✍ Hall, Nicholas G.; Liu, Wei-Ping; Sidney, Jeffrey B. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB

Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the network. Almost all the work to date uses the unit transmission time assumption, that

Fault-tolerant minimum broadcast network

Fault-tolerant minimum broadcast networks

✍ Ahlswede, R.; Gargano, L.; Haroutunian, H. S.; Khachatrian, L. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 978 KB

Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal k-fault-tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line failur

Degree- and time-constrained broadcast n

Degree- and time-constrained broadcast networks

✍ Michael J. Dinneen; Geoffrey Pritchard; Mark C. Wilson 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

## Abstract We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. This paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to appro

Path-isomorphic networks

✍ David Hartvigsen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

## Abstract Two source‐sink (directed) networks are called __path‐isomorphic__ if there exists a bijection π between their arc sets that preserves (simple) source‐sink directed paths. Although path‐isomorphic networks need not be isomorphic (they need not even have the same number of nodes), we sho

Scheduling broadcasts in wireless networ

Scheduling broadcasts in wireless networks

✍ Bala Kalyanasundaram; Kirk R. Pruhs; Mahendran Velauthapillai 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 160 KB

We consider problems involving how to schedule broadcasts in a pulled-based data-dissemination service, 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 all