Catálogo de publicaciones - libros

Compartir en
redes sociales

Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

Juraj Hromkovič Ralf Klasing Andrzej Pelc Peter Ružička† Walter Unger

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

Computer Communication Networks; Theory of Computation; Algorithm Analysis and Problem Complexity; Mathematics of Computing; Probability and Statistics in Computer Science

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2005 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-3-540-00846-0

ISBN electrónico

978-3-540-26663-1

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer-Verlag Berlin Heidelberg 2005

Cobertura temática

computacion

Ciencias de la computación e información

Tabla de contenidos

doi: 10.1007/3-540-26663-1_1

Introduction

Pp. 1-4

doi: 10.1007/3-540-26663-1_2

Fundamentals

Part I - The Telegraph and Telephone Modes | Pp. 7-50

doi: 10.1007/3-540-26663-1_3

Broadcasting

Palabras clave: Approximation Algorithm; Span Tree; Primary Node; Short Path Tree; Short Path Tree.

Part I - The Telegraph and Telephone Modes | Pp. 51-91

doi: 10.1007/3-540-26663-1_4

Gossiping

Palabras clave: Complete Graph; Simple Path; Spectral Norm; Global Time; Relative Delay.

Part I - The Telegraph and Telephone Modes | Pp. 93-136

doi: 10.1007/3-540-26663-1_5

Systolic Communication

Palabras clave: Interconnection Network; Compatibility Constraint; Parent Communication; Additional Round; Broadcast Algorithm.

Part I - The Telegraph and Telephone Modes | Pp. 137-181

doi: 10.1007/3-540-26663-1_6

Fault-Tolerance

Palabras clave: Faulty Node; Broadcasting Algorithm; Broadcasting Scheme; Source Message; Faulty Component.

Part I - The Telegraph and Telephone Modes | Pp. 183-225

doi: 10.1007/3-540-26663-1_7

Broadcast on Distributed Networks

Palabras clave: Span Tree; Start Node; Message Complexity; Span Forest; Broadcasting Algorithm.

Part II - Distributed Networks | Pp. 229-266

doi: 10.1007/3-540-26663-1_8

Leader Election in Asynchronous Distributed Networks

Palabras clave: Leader Election; Message Complexity; Round Number; Input Queue; Election Algorithm.

Part II - Distributed Networks | Pp. 267-315

doi: 10.1007/3-540-26663-1_9

Fault-Tolerant Broadcast in Distributed Networks

Palabras clave: Function Choice; Vertex Boundary; Consensus Problem; Dynamic Fault; Broadcasting Scheme.

Part II - Distributed Networks | Pp. 317-339