An Asymptotically Optimal Push-Pull Method for Multicasting Over a Random Network

We consider all-cast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2013-08, Vol.59 (8), p.5075-5087
Hauptverfasser:	Swamy, Vasuki Narasimha, Bhashyam, Srikrishna, Sundaresan, Rajesh, Viswanath, Pramod
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms All-cast Applied sciences Asymptotic methods broadcast Encoding Erdős-Rényi random graph Exact sciences and technology flows Information theory Information, signal and communications theory matching multicast Multicast communication Network coding Peer-to-peer computing random graph Random variables Relays Steiner tree Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Traffic flow Transmission and modulation (techniques and equipments) tree packing Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!