✦ LIBER ✦

Competitive routing in multicast communications

✍ Scribed by Thomas Boulogne; E. Altman

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 195 KB
Volume: 46
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20071

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-path routing scheme for non-intera

Multi-path routing scheme for non-interactive multicast communications

✍ R. Srinivasan; V. Vaidehi; N. Ranjani; M. Sathya; D. Subramani 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 732 KB

Multicast routing in ATM network

✍ Hisashi Kojima; Takumi Miyoshi; Yoshiaki Tanaka; Hideyoshi Tominaga 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

It is expected that when B-ISDN is implemented, a large portion of the traffic will be occupied by various multicast services, including broadcast. Among the services that are expected to emerge in the future, such as minibroadcasts and specialized broadcasts, each station has few listeners, with th

Core discovery in internet multicast rou

Core discovery in internet multicast routing protocol

✍ A. Gulati; S. Rai 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB

This paper presents modi"cations to the core-based tree (CBT) multicast routing protocol for selecting a set of optimal routers in a domain as core routers for a multicast group (It is optimal because it o!ers minimum average distance between any two members in a multicast group. The core is the roo

Multicast routing method in optical swit

Multicast routing method in optical switching networks

✍ Hiroaki Harai; Masayuki Murata; Hideo Miyahara 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 923 KB

Source-limited inclusive routing: A new

Source-limited inclusive routing: A new paradigm for multicast communication

✍ Gannod, Barbara D.; Esfahanian, Abdol H.; Torng, Eric 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

In this paper, we study a combination of the multicast communication problem and the maximum disjoint paths problem. Specifically, we are given a directed tree T T T rooted at r r r, and we want to send a message from r r r to a subset of nodes in T T T. We accomplish this via a multicast schedule w

Delay-Constrained, Low-Cost Multicast Ro

Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks

✍ Tawfig Alrabiah; Taieb Znati 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Support for multimedia applications is a major objective of future high speed networks. Multimedia applications are usually resource intensive, have stringent quality of service (QoS) requirements, and in many cases involve large multicast groups. Multicasting enables these applications to scale to