ScholarLens Back to search
2010•Unpublished venueRequires access

A Mechanism for Constructing the Minimum Cost Multicast Routing Tree

Wenxia You, Wenwu Li, Lianghu Su, Ping Liu

Open publisher page 0 citations

Abstract

In view of the free content distribution in multicast on Internet, a mechanism for constructing the minimum cost multicast routing tree is proposed based on the theory of economic mechanism design. The minimum cost multicast tree can minimize the total transmission cost of the tree, minimize the links connecting the specified multicast group members and save the data transmitting cost and network resources. The model of multicast networks is provided and a routing model based on minimum cost multicast tree is formulate. According to the existing multicast protocols, the design of an algorithm for implementing the routing mechanism is described. The mechanism is evaluated by means of a numerical example. Some prospects on the application of mechanism design theory in multicast research fields are presented.

About this research paper

What this paper is about

In view of the free content distribution in multicast on Internet, a mechanism for constructing the minimum cost multicast routing tree is proposed based on the theory of economic mechanism design. The minimum cost multicast tree can minimize the total transmission cost of the tree, minimize the links connecting the specified multicast group members and save the data transmitting cost and network resources. The model of multicast networks is provided and a routing model based on minimum cost multicast tree is formulate. According to the existing multicast protocols, the design of an algorithm for implementing the routing mechanism is described. The mechanism is evaluated by means of a numerical example. Some prospects on the application of mechanism design theory in multicast research fields are presented.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In view of the free content distribution in multicast on Internet, a mechanism for constructing the minimum cost multicast routing tree is proposed based on the theory of economic mechanism design. The minimum cost multicast tree can minimize the total transmission cost of the tree, minimize the links connecting the specified multicast group members and save the data transmitting cost and network resources. The model of multicast networks is provided and a routing model based on minimum cost multicast tree is formulate. According to the existing multicast protocols, the design of an algorithm for implementing the routing mechanism is described. The mechanism is evaluated by means of a numerical example. Some prospects on the application of mechanism design theory in multicast research fields are presented.

Key concepts: Protocol Independent Multicast, Multicast, Xcast, Distance Vector Multicast Routing Protocol, Source-specific multicast, Pragmatic General Multicast, Computer network, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Mechanism for Constructing the Minimum Cost Multicast Routing Tree — Research Paper | ScholarLens