scispace - formally typeset
Journal ArticleDOI

Multicast routing in datagram internetworks and extended LANs

TLDR
In this paper, the authors specify extensions to two common internetwork routing algorithms (distancevector routing and link-state routing) to support low-delay datagram multicasting beyond a single LAN, and discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.
Abstract
Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store-and-forward routers, the multicast service is usually not offered across the resulting internetwork. To address this limitation, we specify extensions to two common internetwork routing algorithms—distance-vector routing and link-state routing—to support low-delay datagram multicasting beyond a single LAN. We also describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

XTP Service Classes and Routing Strategy for an Integrated Services Broadband Environment

TL;DR: The main design features of the X T P protocol for network and transport layer implemented at the Technical University Berlin (TUB) for use in the BERKOM broadband environment are discussed.

Realizing Name-based Routing in the Network Layer

Haesung Hwang
TL;DR: The traditional method of storing the IP addresses should be reconsidered and redesigned to suit better for the future usage, and the characteristics of Ternary Content Addressable Memory (TCAM) are explored which is a special type of memory used in routers.
Patent

Methods, systems, and devices supporting data access in a data processing system

TL;DR: In this article, a peer-to-peer network is defined, where a first computer receives a request for a data item from a requesting computer, and the request includes a True Name of the data item.
Proceedings ArticleDOI

Distance education and on-line universities

R. Oppliger, +1 more
TL;DR: It is argued that online universities have to cooperate with commercial service providers to disseminate lectures to a wide audience, and that this cooperation requires new techniques with regard to the registration, validation and certification of the parties involved, such as professors, service providers and students.
Proceedings ArticleDOI

Achieving inter-receiver fairness utilizing layered media multicast control (LMMC)

TL;DR: The framework of the proposed protocol layered media multicast control (LMMC) determines the layer rates and the corresponding partitioning of the receivers maximizing a mathematically well-behaved approximation of the so-called max-min fairness metric.
References
More filters
Book

Dynamic Programming

TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Book

Flows in networks

TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI

Flows in Networks.

TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Book

Data Structures and Algorithms

TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.

Internet Protocol

J. Postel
TL;DR: Along with TCP, IP represents the heart of the Internet protocols and has two primary responsibilities: providing connectionless, best-effort delivery of datagrams through an internetwork; and providing fragmentation and reassembly of data links to support data links with different maximum transmission unit (MTU) sizes.