Small group multicast: a new solution for multicasting on the Internet

Boivie, Rick; Feldman, Nancy; Metz, C.

doi:10.1109/4236.845393

Cited by 56 publications

(29 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A mapping of GCP on point-to-point connections is not acceptable, because it increases the group management and the network load for larger groups. The Small Group Multicast (SGM) protocol [10] might be a solution. It supports small closed multicast groups with asender related multicast.…”

Section: Gcp 1pmentioning

confidence: 99%

GCP

Zuehlke¹,

Koenig²

2002

Smart Networks

View full text Add to dashboard Cite

Video conferences have become a popular application in modem high performance networks. Advanced technologies allow their installation on desktop computers. Currently videoconferences are mainly deployed for large open group conferences in the Internet to transmit lectures, conferences, talks, and discussions. Multiparty video conference tools for c10sed group meetings are less broadly used. On the other hand, most meetings in every-day life are meetings of closed groups with a more or less confidential character. UnJike open group conferences cJosed group meetings require asender related transmission paradigm, i.e. the sender must know the receivers ofthe data streams. This is usuaHy solved by using a centralized group server for the group and the QoS management. The shortages of this approach are server failures and performance problems. The decentralized approach is more flexible, but it requires more sophisticated mechanisms to preserve the consistency ofthe management data at each participant. In the paper we present the signalization protocol GCP to support decentralized c10sed group video conferences. It provides an atomic, ordered, and reliable data delivery service and supports a dynamic join and leave ofparticipants. We present two versions of the protocol: one for A TM networks using overlaid multi cast connections and one for IP-based networks.

show abstract

Section: Gcp 1pmentioning

confidence: 99%

GCP

Zuehlke¹,

Koenig²

2002

Smart Networks

View full text Add to dashboard Cite

show abstract

“…The nodes are represented with a special value in the code. The number of required bytes in the SBM and DBM coding can be calculated as: SBM: (#oftreebranches) +totaLbr + (#ofbranchingnodes) (1) DBM: (#oftreebranches-1) + totaLbr + (#ofrelaynodes) (2) where totaLbr is total brauehing factor of brauehing nodes. In the above example the code sizes are 30B and 34B for SBM and DBM coding respectively.…”

Section: Tree Encodingmentioning

confidence: 99%

Linkcast: Fast and Scalable Multicast Routing Protocol

Bag-Mohammadi

Samadian-Barzoki

Yazdani

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The current multicast routing protocols require state maintenance in the on-tree routers in order to forward multicast packet properly. Therefore, the routers memory may be easily saturated when there are very !arge nurober of low to moderate size multicast groups. In contrast, the explicit multicast protocols offer a stateless design using header space of multicast data packets. In this paper, we introduce new stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols like Xcast. The Linkcast represents the multicast tree by encoding its counterpart links. Simulation results show that Linkcast completely eradicates the required unicast Iookups in explicit multicast protocols with less header size overhead.

show abstract

“…In order to obtain information about MSC's sensitivity to group size and clustering, fifteen different setups (sets of end systems) were defined. These include combinations of five different group sizes (4,8,12, 16 and 20 hosts) and three degrees of spatial locality (clustering). In this paper, we only present the results for a medium (or "weak") clustering.…”

Section: Simulationmentioning

confidence: 99%

“…With many small group applications routing table sizes are increasing massively, which deteriorates the performance of (backbone) routers. Explicit Multicast [3] (Xcast, the successor of Small Group Multicast [4]) is a multicast scheme designed for supporting a very large number of multicast sessions as present in audio/video conferencing, network games or collaborative working. It differs from native multicast in that the sending node keeps track of all session members and explicitly encodes the list of destinations in a special packet header.…”

mentioning

confidence: 99%

Performance Evaluation of Multicast for Small Conferences

Egger

Braun

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Many new Internet applications require data transmission from a sender to multiple receivers. Unfortunately, the IP Multicast technology used today suffers from scalability problems, especially when used for small and sparse groups. Multicast for Small Conferences aims at providing more efficient support for example to audio conferences. In this work, we present a performance study of the concept, based on simulations of real-world scenarios with the ns-2 network simulation software. The results indicate that Multicast for Small Conferences has the potential of replacing IP Multicast for many delay sensitive small group applications, even with very limited support from the network infrastructure. Explicit MulticastIP Multicast does not scale well for (many) small groups such as in audio conferences or multi-player games. Multicast routing entries cannot be aggregated such as unicast routing entries since multicast address selection is arbitrary. Moreover, multicast routing entries do not only consist of destination addresss but may include source addresses. With many small group applications routing table sizes are increasing massively, which deteriorates the performance of (backbone) routers. Explicit Multicast [3] (Xcast, the successor of Small Group Multicast [4]) is a multicast scheme designed for supporting a very large number of multicast sessions as present in audio/video conferencing, network games or collaborative working. It differs from native multicast in that the sending node keeps track of all session members and explicitly encodes the list of destinations in a special packet header. This newly defined header introduces a new protocol between the network (IP) and the transport (UDP/TCP) layer. Xcast capable routers that receive such a packet parse the Xcast header and use the ordinary unicast routing table to determine how to route the packet to each destination, generating a packet copy for every affected outgoing interface. Each address list contains only the addresses that can be reached via that interface. If there is only one destination address for a particular next hop, the packet may be sent as a standard unicast packet. With the Xcast scheme, routers do not have to maintain per session state. This

show abstract

Small group multicast: a new solution for multicasting on the Internet

Cited by 56 publications

References 7 publications

GCP

GCP

Linkcast: Fast and Scalable Multicast Routing Protocol

Performance Evaluation of Multicast for Small Conferences

Contact Info

Product

Resources

About